Journal Article10.1007/S11265-011-0602-1
Parallel High Throughput Soft-Output Sphere Decoding Algorithm
Q. Qi,Chaitali Chakrabarti +1 more
- 01 Aug 2012
- Vol. 68, Iss: 2, pp 217-231
TL;DR: It is demonstrated that the PFSD algorithm can increase the throughput and reduce bit error rate of a soft-output solution in a 4 × 4 16-QAM system, and has superior performance compared to other soft decoders with comparable throughput and computation complexity.
read more
Abstract: Multiple-Input-Multiple-Output communication systems demand fast sphere decoding with high performance To speed up the computation, we propose a scheme with multiple fixed complexity sphere decoders to construct a parallel soft-output fixed complexity sphere decoder (PFSD) The proposed decoder is highly parallel and has performance comparable to soft-output list fixed complexity sphere decoder (LFSD) and K-best sphere decoder In addition, we propose a parallel QR decomposition algorithm to lower the preprocessing overhead, and a low complexity LLR algorithm to allow parallel update of LLR values We demonstrate that the PFSD algorithm can increase the throughput and reduce bit error rate of a soft-output solution in a 4?×?4 16-QAM system, and has superior performance compared to other soft decoders with comparable throughput and computation complexity The PFSD algorithm has been mapped onto Xilinx XC4VLX160 FPGA The resulting PFSD decoder can achieve up to 75 Mbps throughput for 4?×?4 64-QAM configuration at 100MHz with low control overhead
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Fully Parallel GPU Implementation of a Fixed-Complexity Soft-Output MIMO Detector
TL;DR: A fully parallel fixed-complexity soft-output detector is proposed, suitable for GPU implementation and allows a considerable decrease in the computational time required for the data detection stage in multiple-input-multiple-output (MIMO) systems.
47
Parallel sphere detector algorithm providing optimal MIMO detection on massively parallel architectures
TL;DR: A new parallel sphere detector (PSD) algorithm is proposed, which implements a novel hybrid tree search method, where the algorithm parallelism is assured by the efficient combination of depth‐ first search and breadth‐first search algorithms.
4
Design and Implementation of Efficient Algorithms for Wireless MIMO Communication Systems
Sandra Roger Varea
- 16 Jul 2012
TL;DR: In this article, the authors present a descripcion detallada de two tecnicas de preprocesado ampliamente utilizadas: el metodo de Lenstra, Lenstra and Lovasz (LLL) for lattice reduction (LR) and el algorimo VBLAST ZF-DFE.
Design and Implementation of Efficient Algorithms for Wireless MIMO Communication Systems
Sandra Roger Varea
- 16 Jul 2012
2
Soft MIMO Detection Using Marginal Posterior Probability Statistics
04 Dec 2022
TL;DR: In this article , a soft MIMO detection algorithm based on marginal posterior probability statistics (MPPS) is proposed, which transforms the posteriori probability distribution of each layer into a Gaussian distribution and restores the full sampling paths from the first-and second-order moment statistics of the transformed distribution.
References
Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas
TL;DR: This paper addresses digital communication in a Rayleigh fading environment when the channel characteristic is unknown at the transmitter but is known (tracked) at the receiver with the aim of leveraging the already highly developed 1-D codec technology.
7.2K
Achieving near-capacity on a multiple-antenna channel
TL;DR: This work provides a simple method to iteratively detect and decode any linear space-time mapping combined with any channel code that can be decoded using so-called "soft" inputs and outputs and shows that excellent performance at very high data rates can be attained with either.
2.3K
Bit-interleaved coded modulation
Giuseppe Caire,Giorgio Taricco,Ezio Biglieri +2 more
- 29 Jun 1997
TL;DR: The paper presents in a comprehensive fashion the theory underlying bit-interleaved coded modulation, provides tools for evaluating its performance, and gives guidelines for its design.
Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
U. Fincke,Michael Pohst +1 more
TL;DR: In this paper, the authors show that searching through an ellipsoid is in many cases much more efficient than enumerating all vectors of Z'.. in a suitable box.
On the sphere-decoding algorithm I. Expected complexity
Babak Hassibi,Haris Vikalo +1 more
TL;DR: For the "sphere decoding" algorithm of Fincke and Pohst, a closed-form expression is found for the expected complexity, both for the infinite and finite lattice, which suggests that maximum-likelihood decoding, which was hitherto thought to be computationally intractable, can be implemented in real time.