An Adaptive Patterned-Subcarrier Allocation Algorithm for Low-Complexity Multiuser OFDM System

Citations

SCOPUS

0

초록

In this paper, an adaptive patterned-subcarrier allocation algorithm is proposed for the enhancement of system capacity and low-complexity implementation of subcarrier identification and selection (SIS) process of multiuser OFDM systems. Although an adaptive multiuser subcarrier allocation algorithm can increase the overall system capacity, there is computational inefficiency in the SIS process of conventional receiver because a N-point FFT (N-FFT) is used even for a user who uses only K subcarriers, whereK < N. By providing patterns in the adaptive subcarrier allocation algorithm, however, the computationally efficient implementation of SIS process is achieved by a selectedsubcarrier FFT (SSFFT) method that decomposes the sub-matrix consisting of the allocated subcarriers into the multiplication of smaller-point FFTs and the linear transition matrixes. Therefore, high system capacity and low-complexity implementation of SIS can be achieved simultaneously by the proposed algorithm. Simulation results demonstrate that the overall system capacity of the proposed algorithm is much larger than that of a fixed subcarrier allocation algorithm and closes to that of adaptive subcarrier allocation algorithm. © 2005 IEEE.

키워드

Computational efficiency; Fast Fourier transforms; Orthogonal frequency division multiplexing
제목
An Adaptive Patterned-Subcarrier Allocation Algorithm for Low-Complexity Multiuser OFDM System
저자
Kim, Youngok; Nam, Hae woon; Chi, Sanghyun; Womack B.F.
DOI
10.1109/VETECF.2005.1558096
발행일
2005-09
저널명
IEEE Vehicular Technology Conference (VTC)
권
2
페이지
1098 ~ 1102