DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jung, Yunho | - |
dc.contributor.author | Tak, Yonji | - |
dc.contributor.author | Kim, Jaeseok | - |
dc.contributor.author | Park, Junhyun | - |
dc.contributor.author | Kim, Dongkyu | - |
dc.contributor.author | Park, Hyuncheol | - |
dc.date.accessioned | 2013-03-16T13:57:26Z | - |
dc.date.available | 2013-03-16T13:57:26Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2001-08-19 | - |
dc.identifier.citation | IEEE Region 10 International Conference on Electrical and Electronic Technology (TENCON 2001), v., no., pp.676 - 678 | - |
dc.identifier.uri | http://hdl.handle.net/10203/131916 | - |
dc.description.abstract | In the paper, we propose an efficient FFT (Fast Fourier Transform) algorithm for OFDM (Orthogonal Frequency Division Multiplexing) modulation, named by "radix-4/2". This algorithm based on radix-4 butterfly operator reduces the number of non-trivial multiplications as like radix-2^3 FFT algorithm, and it ha^ twice processing rate as radix-z3 FFT algorithm. With 64-point and pipeline architecture, proposed radix-4/2 algorithm reduces the number of non-trivial multiplications to the ratio of 3 to 2 compared with radix-4 algorithm, and it has twice procesSing rate as radix-2^3 algorithm. | - |
dc.language | ENG | - |
dc.publisher | IEEE | - |
dc.title | Efficient FFT Algorithm for OFDM Modulation | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 676 | - |
dc.citation.endingpage | 678 | - |
dc.citation.publicationname | IEEE Region 10 International Conference on Electrical and Electronic Technology (TENCON 2001) | - |
dc.identifier.conferencecountry | Singapore | - |
dc.contributor.localauthor | Park, Hyuncheol | - |
dc.contributor.nonIdAuthor | Jung, Yunho | - |
dc.contributor.nonIdAuthor | Tak, Yonji | - |
dc.contributor.nonIdAuthor | Kim, Jaeseok | - |
dc.contributor.nonIdAuthor | Park, Junhyun | - |
dc.contributor.nonIdAuthor | Kim, Dongkyu | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.