A lower complexity k best algorithm for multiple input multiple output detection
TL;DR: Simulation results showed that the proposed method reduced complexity about 10% for higher (medium to high) signal to noise ratio (SNR) values without degrading the system BER performance.
read more
Abstract: This paper presents Multiple Input Multiple Output (MIMO) detection steps using tree search based method known as the ‘K’ best algorithm. This low complexity algorithm is based on probabilistic approach of sphere decoding with self adjustable capability depending on the levels (root, branch, leaf etc.) of a tree. While the tree was searched to estimate the transmitted symbols level by level, the algorithm took into account the effect of the undetected symbols in the search criteria. Simulation results showed that the proposed method reduced complexity (in terms of the average number of visited nodes) about 10% for higher (medium to high) signal to noise ratio (SNR) values without degrading the system BER performance.
Key words: Multiple input multiple output, sphere decoding, K best algorithm.
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
Model-free control based on reinforcement learning for a wastewater treatment problem
S. Syafiie,Fernando Tadeo,E. Martinez,Teresa Alvarez +3 more
- 01 Jan 2011
TL;DR: The obtained experimental results show that the proposed MFLC-MSA strategy can achieve good performance to guarantee on-specification discharge at maximum degradation rate using readily available measurements such as pH and ORP, inferential measurements of oxidation kinetics and peroxide consumption, respectively.
References
On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas
G. J. Foschini,M. J. Gans +1 more
TL;DR: In this article, the authors examined the performance of using multi-element array (MEA) technology to improve the bit-rate of digital wireless communications and showed that with high probability extraordinary capacity is available.
V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel
P.W. Wolniansky,Gerard J. Foschini,G.D. Golden,Reinaldo A. Valenzuela +3 more
- 29 Sep 1998
TL;DR: This paper describes a wireless communication architecture known as vertical BLAST (Bell Laboratories Layered Space-Time) or V-BLAST, which has been implemented in real-time in the laboratory and demonstrated spectral efficiencies of 20-40 bps/Hz in an indoor propagation environment at realistic SNRs and error rates.
4K
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
A universal lattice code decoder for fading channels
TL;DR: By judicious choice of the decoding radius, it is shown that this maximum-likelihood decoding algorithm can be practically used to decode lattice codes of dimension up to 32 in a fading environment.
1.8K
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.