Near-ML MIMO Detection Algorithm With LR-Aided Fixed-Complexity Tree Searching

Kim, Hyunsub; Park, Jangyoung; Lee, Hyukyeon; Kim, Jaeseok

doi:10.1109/lcomm.2014.2364217

Cited by 21 publications

(14 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, compared to the slicing list detection [19], the tree spanning of the proposed detection is also 43.75% fewer than the slicing list detection [19]. Finally, compared to the MIMO detection [7] which is combined with LR-based processing, the proposed AOC-based MIMO detection balances computing efforts and required SNR in frequency-selective fading with an acceptable computational effort.…”

Section: A Algorithm Levelmentioning

confidence: 99%

“…Many studies have focused on decreasing the searching set. For example, the 256-QAM LR-Aided Fixed-Complexity Tree Searching (LRA FCTS) [7] is proposed to make computation cost effectively via fixing tree size of the full expansion in the fixed-complexity sphere decoder (FSD). And the positive diagonal values (PSV) technique [8] was proposed to reduce the nodes visited times in node-pruning processing.…”

Section: Introductionmentioning

confidence: 99%

“…The quotient is used to indicate complex values. After recognizing the quadrant of the allocated constellation, the constellation index ConIdx = IdxNum/4 is employed to map the index to the complex value via Equations(7) and(6). The signs of the real and imaginary parts are indicated by the quadrant information.…”

mentioning

confidence: 99%

See 2 more Smart Citations

A Cost-Effective Adaptive Overlapped Cluster-Based MIMO Detector in a Frequency Domain Reconfigurable Modem

Liao

Hsu

2019

IEEE Access

View full text Add to dashboard Cite

Not only to reduce the candidates but also to maintain detection performance in multiple-input multiple-output (MIMO) detection, an adaptive overlapped cluster (AOC) scheme to balance detection error and computing cost is built for 4 × 4 and 8 × 8 MIMO-OFDM systems with up to 256 quadrature amplitude modulation (QAM). The constellations are partitioned into several clusters. A cluster with size decided by channel status is chosen for signal decoding. Different partition schemes are combined to minimize the numbers of clusters required to cover a candidate symbol as the pre-estimated signal falls at cluster edges, namely overlapped clustering. The simulations of a 4 × 4 MIMO OFDM with 64 QAM and 8 × 8 MIMO OFDM with 256 QAM hint that the AOC-based detection requires an additional 0.57 dB and 1.02 dB compared to maximum likelihood (ML). Compared with K-best sphere decoding (SD), it is reduced the computing complexity to 24.50% ∼ 56.25% in 4 × 4 MIMO OFDM and, 35.00% ∼ 56.25% in 8 × 8 MIMO OFDM. In addition, the proposed scheme is ported to a reconfigurable frequency-domain (FD) modem, which is designed and implemented via TSMC 45-nm technology, with multi-rate clocking and processing elements (PEs) upgrading for supporting the proposed MIMIO detection. The results show that the throughput is 1077.8 Mbps with 4 × 4 64-QAM modulations. INDEX TERMS Low complexity, MIMO detection, multi-rate clock, cluster, reconfigurable modem.

show abstract

Section: A Algorithm Levelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Cost-Effective Adaptive Overlapped Cluster-Based MIMO Detector in a Frequency Domain Reconfigurable Modem

Liao

Hsu

2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Consider an uncoded MIMO system with

N_{t}

transmitted antennas and

N_{r}

received antennas as [12, 13]

r^{c} = H^{c} s^{c} + w^{c}

where

r^{c} \in C^{N_{r}}

is the received complex signal,

H^{c} \in C^{N_{r} \times N_{t}} false(N_{t} \leq N_{r} false)

is the complex channel matrix and

{()}^{c}

means the complex signal. The entries of

H^{c}

are represented as independent and identically distributed complex Gaussian variables which are drawn from

C N ()(, 0, N_{t}^{- 1})

.…”

Section: System Model and Lr‐aided Ldsmentioning

confidence: 99%

LR algorithm based on MED for multi‐input–multi‐output LDs

2017

View full text Add to dashboard Cite

“…The concept of LR-SD for MIMO detections has been mentioned in recent literature, particularly in [50][51][52][53][54]. In [50,51], lattice reduction is considered not being useful for the sphere decoding for MIMO detections, which is a closest lattice vector problem over a (finite) subset of the infinite lattice.…”

Section: Introductionmentioning

confidence: 99%

Performance, efficiency and complexity in multiple access large-scale MIMO Systems.

Mussi¹

View full text Add to dashboard Cite

First, I would like to thank God for giving me health and opportunity to develop this work. I express my gratitude to my advisor, Prof. Taufik Abrão, for his continuous willingness to meet the demands of this work, sharing his knowledge and experience. His guidance in this process has given me professional and personal growth. I would like to thank my family for the love and encouragement always dedicated to me: my parents Jorge and Nair, my girlfriend Marcela and my sister Tatiana. Last but not least, I thank my friends and colleagues at the State University of Londrina for their support throughout this work: Ricardo, Edno, Álvaro, José Carlos and Aislan; besides Jair and Luiz by the partnership.

show abstract

Near-ML MIMO Detection Algorithm With LR-Aided Fixed-Complexity Tree Searching

Cited by 21 publications

References 12 publications

A Cost-Effective Adaptive Overlapped Cluster-Based MIMO Detector in a Frequency Domain Reconfigurable Modem

A Cost-Effective Adaptive Overlapped Cluster-Based MIMO Detector in a Frequency Domain Reconfigurable Modem

LR algorithm based on MED for multi‐input–multi‐output LDs

Performance, efficiency and complexity in multiple access large-scale MIMO Systems.

Contact Info

Product

Resources

About