Distributed DFT-Spread OFDM

In this paper, we develop a signal model for the transmission of discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-SOFDM) in a frequency selective channel. Although maximum likelihood (ML) estimation of the transmitted signal in the DFT-SOFDM system gives the optimum bit-error rate (BER) performance, it incurs exponential complexity due to its exhaustive search implementation. However, our signal model allows the use of sphere decoding algorithm (SDA) which significantly reduces the complexity of ML estimation. Computer simulation of an DFT-SOFDM system at signal-to-noise ratio (SNR) of 5 dB demonstrates that the SDA searches 39 points compared to 216 in the original ML implementation

[1]  Peter Adam Hoeher,et al.  A statistical discrete-time model for the WSSUS multipath channel , 1992 .

[2]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[3]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[4]  John B. Anderson,et al.  Computationally Optimal Metric-First Code Tree Search Algorithms , 1984, IEEE Trans. Commun..

[5]  A new lattice decoder for multiple antenna systems , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

[6]  Maryam Sabbaghian,et al.  A multiple access scheme for the uplink of broadband wireless systems , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[7]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[8]  Lajos Hanzo,et al.  An Optimized-Hierarchy-Aided Maximum Likelihood Detector for MIMO-OFDM , 2006, 2006 IEEE 63rd Vehicular Technology Conference.