Sciweavers

36 search results - page 4 / 8
» Complex Lattice Reduction Algorithm for Low-Complexity MIMO ...
Sort
View
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
GLOBECOM
2007
IEEE
14 years 2 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
ICASSP
2008
IEEE
14 years 2 months ago
Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
Joakim Jalden, Dominik Seethaler, Gerald Matz
VTC
2010
IEEE
138views Communications» more  VTC 2010»
13 years 6 months ago
Impact of User Selection Criteria on Performance of MIMO Detectors in Multiuser Systems
—In this paper, we consider user selection criteria for various multiple input multiple output (MIMO) detectors to exploit the multiuser diversity. It is shown that the user sele...
Jinho Choi, Fumiyuki Adachi
TCOM
2010
112views more  TCOM 2010»
13 years 6 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang