TY - GEN
T1 - Anovel algorithm of inter-subchannel interference cancellation for OFDM systems
AU - Chang, Ming-Xian
PY - 2006/12/1
Y1 - 2006/12/1
N2 - Orthogonal frequency-division multiplexing (OFDM) transmission has inter-subchannel interference (ICI) in fast fading environment. Several algorithms have been proposed to reduce the ICI effects. Among these algorithms, the ICI self-cancellation schemes [3, 4] needs not to estimate the multipath responses, and its performance doesn't depend on the signal-to-noise ratio (SNR). In [4], the pre-processor in the transmitter extends the original symbol interval to obtain diversity that can be used by the post-processor of the receiver to make ICI self-cancelled. When the original symbol interval is doubled and the multipath channels vary linearly with time within the extended symbol interval, this algorithm can completely the ICI. However, the complexity of the post-processor in [4] is not low. It needs N +1 parallel fast-Fourier transforms (FFT). Moreover, there is no performance comparison between [3] and [4]. In this paper, we continue our work in [4] and propose an equivalent low-complexity post-processor that needs only one FFT. We also give analyze the variance of the residual ICI and derive an bit-error probability (BEP) upper bound. Furthermore, we compare the performance of our algorithm with Zhao's algorithm and give some related discussion.
AB - Orthogonal frequency-division multiplexing (OFDM) transmission has inter-subchannel interference (ICI) in fast fading environment. Several algorithms have been proposed to reduce the ICI effects. Among these algorithms, the ICI self-cancellation schemes [3, 4] needs not to estimate the multipath responses, and its performance doesn't depend on the signal-to-noise ratio (SNR). In [4], the pre-processor in the transmitter extends the original symbol interval to obtain diversity that can be used by the post-processor of the receiver to make ICI self-cancelled. When the original symbol interval is doubled and the multipath channels vary linearly with time within the extended symbol interval, this algorithm can completely the ICI. However, the complexity of the post-processor in [4] is not low. It needs N +1 parallel fast-Fourier transforms (FFT). Moreover, there is no performance comparison between [3] and [4]. In this paper, we continue our work in [4] and propose an equivalent low-complexity post-processor that needs only one FFT. We also give analyze the variance of the residual ICI and derive an bit-error probability (BEP) upper bound. Furthermore, we compare the performance of our algorithm with Zhao's algorithm and give some related discussion.
UR - http://www.scopus.com/inward/record.url?scp=84900584801&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84900584801&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84900584801
SN - 1402044356
SN - 9781402044359
T3 - Multi-Carrier Spread-Spectrum - Proceedings from the 5th International Workshop
SP - 75
EP - 82
BT - Multi-Carrier Spread-Spectrum - Proceedings from the 5th International Workshop
T2 - 5th International Workshop on Multi-Carrier Spread-Spectrum, MC-SS 2005
Y2 - 14 September 2005 through 16 September 2005
ER -