An Efficient K-Best MIMO Detector for Large Modulation Constellations
For K-best multiple-input multiple-output (MIMO) detection using real-valued decomposition (RVD), we need to obtain the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> surviving candidates from <inline-formula> <tex-math notatio...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Open Journal of Circuits and Systems |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10375268/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832592862350409728 |
|---|---|
| author | Yu-Xin Liu Shih-Jie Jihang Yeong-Luh Ueng |
| author_facet | Yu-Xin Liu Shih-Jie Jihang Yeong-Luh Ueng |
| author_sort | Yu-Xin Liu |
| collection | DOAJ |
| description | For K-best multiple-input multiple-output (MIMO) detection using real-valued decomposition (RVD), we need to obtain the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> surviving candidates from <inline-formula> <tex-math notation="LaTeX">$K \sqrt {M}$ </tex-math></inline-formula> candidates, where <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> is the modulation order. This paper presents a sorter-free detection algorithm, where the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> surviving nodes can be obtained in <inline-formula> <tex-math notation="LaTeX">${\mathrm {log_{2}}} {K}$ </tex-math></inline-formula> iterations, which is independent of modulation size. The <inline-formula> <tex-math notation="LaTeX">$K \sqrt {M}$ </tex-math></inline-formula> candidates are arranged into a multiple-layer table using the proposed path metric discretization. A bisection-based search algorithm is used to obtain the locations of the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> surviving candidates. A low-complexity fully-pipelined architecture is devised in order to implement the proposed MIMO detection without the need to use any dividers. In addition, an efficient method for storing information from child nodes is proposed, which requires significantly less storage space compared to the conventional Schnorr Euchner (SE) enumeration approach. Implementation results show that the proposed K-best MIMO detector supports a 6.4Gb/s throughput that has a <inline-formula> <tex-math notation="LaTeX">$0.32~\boldsymbol{\mu }\text{s}$ </tex-math></inline-formula> latency in a 90 nm process for a 256-quadrature amplitude modulation (QAM) 4<inline-formula> <tex-math notation="LaTeX">$\times $ </tex-math></inline-formula>4 MIMO system. In addition, compared to the sorter-based baseline detector, the proposed detector improves the hardware efficiency by 77%. |
| format | Article |
| id | doaj-art-62711e84ef064b3d961914bb0614bcab |
| institution | Kabale University |
| issn | 2644-1225 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Open Journal of Circuits and Systems |
| spelling | doaj-art-62711e84ef064b3d961914bb0614bcab2025-01-21T00:02:50ZengIEEEIEEE Open Journal of Circuits and Systems2644-12252024-01-01521610.1109/OJCAS.2023.334754410375268An Efficient K-Best MIMO Detector for Large Modulation ConstellationsYu-Xin Liu0https://orcid.org/0009-0009-9526-6613Shih-Jie Jihang1Yeong-Luh Ueng2https://orcid.org/0000-0002-3438-0385Institute of Communications Engineering, National Tsing Hua University, Hsinchu, TaiwanDepartment of Electrical Engineering, National Tsing Hua University, Hsinchu, TaiwanInstitute of Communications Engineering, National Tsing Hua University, Hsinchu, TaiwanFor K-best multiple-input multiple-output (MIMO) detection using real-valued decomposition (RVD), we need to obtain the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> surviving candidates from <inline-formula> <tex-math notation="LaTeX">$K \sqrt {M}$ </tex-math></inline-formula> candidates, where <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> is the modulation order. This paper presents a sorter-free detection algorithm, where the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> surviving nodes can be obtained in <inline-formula> <tex-math notation="LaTeX">${\mathrm {log_{2}}} {K}$ </tex-math></inline-formula> iterations, which is independent of modulation size. The <inline-formula> <tex-math notation="LaTeX">$K \sqrt {M}$ </tex-math></inline-formula> candidates are arranged into a multiple-layer table using the proposed path metric discretization. A bisection-based search algorithm is used to obtain the locations of the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> surviving candidates. A low-complexity fully-pipelined architecture is devised in order to implement the proposed MIMO detection without the need to use any dividers. In addition, an efficient method for storing information from child nodes is proposed, which requires significantly less storage space compared to the conventional Schnorr Euchner (SE) enumeration approach. Implementation results show that the proposed K-best MIMO detector supports a 6.4Gb/s throughput that has a <inline-formula> <tex-math notation="LaTeX">$0.32~\boldsymbol{\mu }\text{s}$ </tex-math></inline-formula> latency in a 90 nm process for a 256-quadrature amplitude modulation (QAM) 4<inline-formula> <tex-math notation="LaTeX">$\times $ </tex-math></inline-formula>4 MIMO system. In addition, compared to the sorter-based baseline detector, the proposed detector improves the hardware efficiency by 77%.https://ieeexplore.ieee.org/document/10375268/K-best detectionmultiple-input multiple-output (MIMO)very large-scale integration |
| spellingShingle | Yu-Xin Liu Shih-Jie Jihang Yeong-Luh Ueng An Efficient K-Best MIMO Detector for Large Modulation Constellations IEEE Open Journal of Circuits and Systems K-best detection multiple-input multiple-output (MIMO) very large-scale integration |
| title | An Efficient K-Best MIMO Detector for Large Modulation Constellations |
| title_full | An Efficient K-Best MIMO Detector for Large Modulation Constellations |
| title_fullStr | An Efficient K-Best MIMO Detector for Large Modulation Constellations |
| title_full_unstemmed | An Efficient K-Best MIMO Detector for Large Modulation Constellations |
| title_short | An Efficient K-Best MIMO Detector for Large Modulation Constellations |
| title_sort | efficient k best mimo detector for large modulation constellations |
| topic | K-best detection multiple-input multiple-output (MIMO) very large-scale integration |
| url | https://ieeexplore.ieee.org/document/10375268/ |
| work_keys_str_mv | AT yuxinliu anefficientkbestmimodetectorforlargemodulationconstellations AT shihjiejihang anefficientkbestmimodetectorforlargemodulationconstellations AT yeongluhueng anefficientkbestmimodetectorforlargemodulationconstellations AT yuxinliu efficientkbestmimodetectorforlargemodulationconstellations AT shihjiejihang efficientkbestmimodetectorforlargemodulationconstellations AT yeongluhueng efficientkbestmimodetectorforlargemodulationconstellations |