• DocumentCode
    2750528
  • Title

    Partial cached-FFT algorithm for OFDMA communications

  • Author

    Chen, Chao-Ming ; Huang, Yuan-Hao

  • Author_Institution
    Nat. Tsing-Hua Univ. Hsinchu, Hsinchu
  • fYear
    2007
  • fDate
    Oct. 30 2007-Nov. 2 2007
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Orthogonal frequency division multiplexing (OFDM) transmission has become a popular technique for modern wired and wireless communications. Next-generation mobile communication systems also plan to adopt orthogonal frequency division multiple access (OFDMA) technology for multi-user scenario, in which subcarriers can be grouped as resource blocks or subchannels and allocated to different users. Hence, only partial subcarriers in one OFDM symbol may be used by one user end (UE). In this situation, more (a) Partial FFT algorithm (b) Cached-FFT algorithm redundant power consumption is produced by the complete FFT computation for OFDM demodulation in the UE. Among the available FFT architectures, cached-FFT has much regularity and lower power consumption than others. Thus, a partial FFT algorithm can be applied to the cached-FFT architecture for power reduction of OFDMA UE. In this paper, a partial cached-FFT algorithm is proposed to control the operation of the cached-FFT processor for different proposals of OFDMA resource block allocation schemes, thereby reducing the computing power.
  • Keywords
    OFDM modulation; channel allocation; demodulation; mobile communication; radio access networks; telecommunication computing; OFDMA communication; channel allocation; demodulation; orthogonal frequency division multiplexing; partial cached-FFT algorithm; Chaotic communication; Computer architecture; Demodulation; Energy consumption; Frequency conversion; Mobile communication; OFDM; Resource management; WiMAX; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON 2007 - 2007 IEEE Region 10 Conference
  • Conference_Location
    Taipei
  • Print_ISBN
    978-1-4244-1272-3
  • Electronic_ISBN
    978-1-4244-1272-3
  • Type

    conf

  • DOI
    10.1109/TENCON.2007.4428800
  • Filename
    4428800