TY - GEN
T1 - ICI mitigation for OFDMA uplink systems
AU - Hsu, Chao Yuan
AU - Wu, Wen-Rong
PY - 2008
Y1 - 2008
N2 - Orthogonal frequency-division multiplexing multiple access (OFDMA) has been considered as a promising multiple access technique in OFDM-based communication systems. In an ideal OFDMA system, no intercarrier interference (ICI) occurs. However, in high-speed mobile environments, the channel may be time-variant during one OFDMA symbol period. In such a condition, the mobility-induced ICI will degrade the system performance seriously. To remove the ICI effect, the zero-forcing (ZF) method is one of the simple techniques. Unfortunately, the direct ZF method needs to invert an N × N ICI matrix, requiring a prohibitively high complexity when N is large. In this paper, we first derive a structured OFDMA uplink signal model consisting of FFTs/IFFTs. Exploring this structure and using Newton's iteration for matrix inversion, we develop a low-complexity ZF method. With our formulation, fast Fourier transforms (FFTs) can be used to reduce the complexity. Thus, the proposed method can reduce the complexity from O(N3) to O(Nlog2N). Simulations show that the proposed method can have the similar performance to the direct ZF method while requires much lower complexity.
AB - Orthogonal frequency-division multiplexing multiple access (OFDMA) has been considered as a promising multiple access technique in OFDM-based communication systems. In an ideal OFDMA system, no intercarrier interference (ICI) occurs. However, in high-speed mobile environments, the channel may be time-variant during one OFDMA symbol period. In such a condition, the mobility-induced ICI will degrade the system performance seriously. To remove the ICI effect, the zero-forcing (ZF) method is one of the simple techniques. Unfortunately, the direct ZF method needs to invert an N × N ICI matrix, requiring a prohibitively high complexity when N is large. In this paper, we first derive a structured OFDMA uplink signal model consisting of FFTs/IFFTs. Exploring this structure and using Newton's iteration for matrix inversion, we develop a low-complexity ZF method. With our formulation, fast Fourier transforms (FFTs) can be used to reduce the complexity. Thus, the proposed method can reduce the complexity from O(N3) to O(Nlog2N). Simulations show that the proposed method can have the similar performance to the direct ZF method while requires much lower complexity.
UR - http://www.scopus.com/inward/record.url?scp=69949121617&partnerID=8YFLogxK
U2 - 10.1109/PIMRC.2008.4699469
DO - 10.1109/PIMRC.2008.4699469
M3 - Conference contribution
AN - SCOPUS:69949121617
SN - 9781424426447
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
BT - 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008
T2 - 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008
Y2 - 15 September 2008 through 18 September 2008
ER -