scispace - formally typeset
Proceedings ArticleDOI

FPGA implementation of MMSE metric based efficient near-ML detection

TLDR
An unbiased MMSE metric is introduced that can be applied to existing MIMO detectors in order to improve their performance and the resulting real-time detector has been compared to state-of-the-art detectors previously implemented, in terms of complexity, error performance and throughput.
Abstract
We consider the problem of detecting a vector signal transmitted over a multiple input-multiple output (MIMO) channel. A number of suboptimal detectors have been proposed to solve that problem, given that maximum likelihood (ML) detection is NP-hard. After reviewing the main concepts of the ML and the minimum mean square error (MMSE) metrics, we introduce an unbiased MMSE metric that can be applied to existing MIMO detectors in order to improve their performance. Applying the biased and unbiased MMSE metrics together with a real-valued representation of the system, the performance and complexity of a number suboptimal MIMO detectors is compared in this paper, showing how the QR decomposition-M (QRD-M) can be used to approximate ML performance with low complexity. In order to further validate those results, the QRD-M algorithm has been implemented on a field-programmable gate array (FPGA) platform, showing an excellent fixed-point performance under real-time conditions. Finally, the resulting real-time detector has been compared to state-of-the-art detectors previously implemented, in terms of complexity, error performance and throughput.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

On 3G LTE Terminal Implementation - Standard, Algorithms, Complexities and Challenges

TL;DR: It is shown that the inner receiver can nicely and straightforwardly be parallelized due to frequency domain processing, and one of the challenges is an efficient implementation considering necessary flexibility for different MIMO modes, power consumption and silicon area.

Joint Detection and Channel Estimation Algorithms for QS-CDMA Signals Over Time-Varying Channels

TL;DR: An overview of the design alternatives for turbo equalization given system parameters such as the channel response or the signal-to-noise ratio is provided and it is shown that the proposed sub-optimum algorithm achieves near-MLD performance with significantly lower decoding complexity.
Journal ArticleDOI

Lattice Reduction for MIMO Detection: From Theoretical Analysis to Hardware Realization

TL;DR: Hardware realization results on a Xilinx XC4VLX80-12 FPGA demonstrate that the CLLL processor has a throughput of over 3.5 M channel matrices per second, outperforming previously disclosed hardware realizations.
Proceedings ArticleDOI

A Simplified Unbiased MMSE Metric Based QRDM Decoder for MIMO Systems

TL;DR: The proposed S-QRDM detector has been implemented on a state-of-the-art Xilinx FPGA device and the results indicate that the proposed approach is more efficient in either logic or computational FPGa resources compared to the original algorithm.
Proceedings ArticleDOI

Flexible hardware architecture of SEFDM transmitters with real-time non-orthogonal adjustment

TL;DR: This work presents an FPGA implementation of a method of generating non-orthogonal Frequency Division Multiplexed signals, where the spacing between sub-carriers can be controlled externally without the need for re-synthesis.
References
More filters
Book

Multiuser Detection

Sergio Verdu
TL;DR: This self-contained and comprehensive book sets out the basic details of multiuser detection, starting with simple examples and progressing to state-of-the-art applications.
Journal ArticleDOI

Factoring Polynomials with Rational Coefficients

TL;DR: This paper presents a polynomial-time algorithm to solve the following problem: given a non-zeroPolynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q (X).

Factoring polynomials with rational coeficients

TL;DR: In this paper, a polynomial-time algorithm was proposed to decompose a primitive polynomials into irreducible factors in Z(X) if the greatest common divisor of its coefficients is 1.
Journal ArticleDOI

High-rate codes that are linear in space and time

TL;DR: This work proposes a high-rate coding scheme that can handle any configuration of transmit and receive antennas and that subsumes both V-BLAST and many proposed space-time block codes as special cases and shows that their performance is generally superior to earlier proposed methods over a wide range of rates and signal-to-noise ratios (SNRs).
Journal ArticleDOI

On maximum-likelihood detection and the search for the closest lattice point

TL;DR: A novel algorithm is developed that is inspired by the Pohst enumeration strategy and is shown to offer a significant reduction in complexity compared to the Viterbo-Boutros sphere decoder and is supported by intuitive arguments and simulation results in many relevant scenarios.
Related Papers (5)