Joint data detection and channel estimation for OFDM systems

We develop new blind and semi-blind data detectors and channel estimators for orthogonal frequency-division multiplexing (OFDM) systems. Our data detectors require minimizing a complex, integer quadratic form in the data vector. The semi-blind detector uses both channel correlation and noise variance. The quadratic for the blind detector suffers from rank deficiency; for this, we give a low-complexity solution. Avoiding a computationally prohibitive exhaustive search, we solve our data detectors using sphere decoding (SD) and V-BLAST and provide simple adaptations of the SD algorithm. We consider how the blind detector performs under mismatch, generalize the basic data detectors to nonunitary constellations, and extend them to systems with pilots and virtual carriers. Simulations show that our data detectors perform well

Reduced Complexity Sphere Decoding

In Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can achieve performance equivalent to full search Maximum Likelihood (ML) decoding, with reduced complexity. Several researchers reported techniques that reduce the complexity of SD further. In this paper, a new technique is introduced which decreases the computational complexity of SD substantially, without sacrificing performance. The reduction is accomplished by deconstructing the decoding metric to decrease the number of computations and exploiting the structure of a lattice representation. Furthermore, an application of SD, employing a proposed smart implementation with very low computational complexity is introduced. This application calculates the soft bit metrics of a bit-interleaved convolutional-coded MIMO system in an efficient manner. Based on the reduced complexity SD, the proposed smart implementation employs the initial radius acquired by Zero-Forcing Decision Feedback Equalization (ZF-DFE) which ensures no empty spheres. Other than that, a technique of a particular data structure is also incorporated to efficiently reduce the number of executions carried out by SD. Simulation results show that these approaches achieve substantial gains in terms of the computational complexity for both uncoded and coded MIMO systems.Comment: accepted to Journal. arXiv admin note: substantial text overlap with arXiv:1009.351

Hardware/Software Co-Design Architecture and Implementations of MIMO Decoders on FPGA

During the last years, multiple-input multiple-output (MIMO) technology has attracted great attentions in the area of wireless communications. The hardware implementation of MIMO decoders becomes a challenging task as the complexity of the MIMO system increases. This thesis presents hardware/software co-design architecture and implementations of two typical lattice decoding algorithms, including Agrell and Vardy (AV) algorithm and Viterbo and Boutros (VB) algorithm. Three levels of parallelisms are analyzed for an efficient implementation with the preprocessing part on embedded MicroBlaze soft processor and the decoding part on customized hardware. The decoders for a 4 by 4 MIMO system with 16-QAM modulation scheme are prototyped on a Xilinx XC2VP30 FPGA device. The hardware implementations of the AV and VB decoders show that they support up to 81 Mbps and 37 Mbps data rate respectively. The performances in terms of resource utilizations and BER are also compared between these two decoders