TY - GEN
T1 - Thread computing for Miller's algorithm of pairing
AU - Takeuchi, Shoichi
AU - Sakemi, Yumi
AU - Nogami, Yasuyuki
AU - Morikawa, Yoshitaka
PY - 2009/10/27
Y1 - 2009/10/27
N2 - This paper shows an improvement of Miller's algorithm so as to be effcient for thread programming by using divisor theorem. Then, this paper implements a thread program of the improved Miller's algorithm by which it is shown that the proposed technique is more ef.cient than ordinary Miller's algorithm.
AB - This paper shows an improvement of Miller's algorithm so as to be effcient for thread programming by using divisor theorem. Then, this paper implements a thread program of the improved Miller's algorithm by which it is shown that the proposed technique is more ef.cient than ordinary Miller's algorithm.
UR - http://www.scopus.com/inward/record.url?scp=70350221023&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350221023&partnerID=8YFLogxK
U2 - 10.1109/ISCE.2009.5156956
DO - 10.1109/ISCE.2009.5156956
M3 - Conference contribution
AN - SCOPUS:70350221023
SN - 9781424429769
T3 - Digest of Technical Papers - IEEE International Conference on Consumer Electronics
SP - 182
EP - 186
BT - 2009 IEEE 13th International Symposium on Consumer Electronics, ISCE 2009
T2 - 2009 IEEE 13th International Symposium on Consumer Electronics, ISCE 2009
Y2 - 25 May 2009 through 28 May 2009
ER -