Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM

arXiv:2611.06576 · eess.SP · Submitted 2026-11-04 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.

Rosa: I'm Rosa.

Dev: And I'm Dev, here with Taro.

Rosa: We're looking at the paper: "Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM".

Dev: Here's the gist of the paper. Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM is a research paper proposing a novel, iteration-free pruning scheme and an index-domain VLSI architecture to achieve sort-free MIMO box decoding at high modulation orders like 1024-QAM while maintaining near K-Best performance The proposed Max-Min-Exchange Candidate Pruning (MMECP) scheme replaces the sequential selection loop of Iterative Candidate Pruning (ICP) with a single max-min exchange without a feedback path and keeps near-K-Best performance Pruning redundant reasoning tokens The paper introduces Max-Min-Exchange Candidate Pruning (MMECP), which replaces the selection loop of ICP with a single max-min exchange without a feedback path and keeps near-K-Best performance This scheme targets the detection performance of BoxSICP without the iterative loop.

Rosa: The core idea is to start from the SCP survivor set G(1)i and change at most one of its K paths by performing a max-min exchange between Wˆ(1)max,i and Wˆ(2)min,i This step targets (1, K), which survives global sorting in fewer than 40% of cases.

Dev: The rule uses only the ordering within each Box cluster from Rule 2 and the PEDs of the rank groups G(1)i and G(2)i How the training signal is built The paper presents an index-domain VLSI architecture that represents each candidate by its integer constellation index, so that candidates and their distances are obtained by bit selection instead of operations on symbol values The detector operates in the index QAM map A˜ where the corresponding quantities carry a tilde, such as a˜, ˜δ, and x˜ Candidate generation is implemented with bit selection instead of additions and subtractions on symbol values The index width grows only by one bit per QAM step, and the selection logic is the same for every modulation order Where the gains come from The optimizations in A˜ shorten the RNG critical path to ∼ 1TCMAC through coefficient pre-computation, replace the interference multiplier with shift–add networks, remove the CES Box Operation and Difference Calculation blocks (leaving only the pruning operations and the Selection Logic after the Q block and before the PED block) These gains bring the post-quantization datapath close to the complexity of MMSE detection In one 64-QAM detection layer, the A˜ datapath reduces the area of candidate expansion and selection by 23% and the power by 44%, and MMECP needs 73% less area and 75% less power than unfolded ICP at the same throughput Performance evaluation The proposed detector is synthesized in TSMC 16 nm CMOS, detecting one vector per cycle at 1 GHz for 64- to 1024-QAM and produces up to 40 Gb/s with its gate count growing by 63% over this range The normalized hardware efficiency is measured at 2.3×, 12× and 14× that of the best compared hard-output detector at 64-, 256- and 1024-QAM Box-SMMECP reaches a tree-wise accuracy of 70 to 80%, compared to 55 to 70% for Box-SCP, and is close to Box-SICP The proposed design exceeds the vector rate in one instance for the Wi-Fi 7 modulations up to 1024-QAM The paper presents an iteration-free pruning scheme and a VLSI architecture for sort-free MIMO Box Decoding in high-order QAM systems The MMECP scheme replaces the sequential selection loop of ICP by a single max-min exchange derived from survival statistics The index-domain datapath keeps the entire post-quantization processing in the index QAM map A˜, so quantization, box expansion and distance extraction become bit-field selection In one 64-QAM detection layer, the A˜ datapath reduces the area of candidate expansion and selection by 23% and the power by 44%, and MMECP needs 73% less area and 75% less power than unfolded ICP at the same throughput Synthesized for a 4×4 detector in 16 nm CMOS, the design detects one vector per cycle at 1 GHz, sustains 24, 32 and 40 Gb/s at 64-, 256- and 1024-QAM with 63% gatecount growth, and reaches 2.3×, 12× and 14× the normalized hardware efficiency of the best compared hard-output detector at 64-, 256- and 1024-QAM REFERENCES

1: F.

Rosa: Rusek, D.

Paper summary: Rosa: So we're wrapping up this look at "Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to one thousand twenty-four QAM."

Dev: Yeah, that paper is trying to solve a problem where you need high speeds, like those from Wi-Fi seven or five g NR, but the detection math gets way too complex at those high modulation orders.

Rosa: Exactly. They're proposing this new pruning method called MMECP and an entire hardware architecture that uses these integer indices instead of dealing with all those complex symbol values during the candidate search.

Dev: What does that mean for a system running in real time? The paper claims this scheme keeps near K best performance while ditching the slow iterative selection loop they call ICP.

Rosa: Right, it means less sequential processing in hardware, which is good because those loops take up a lot of clock cycles and add latency.

Dev: But how does that index-domain thing actually help with the speed requirements? I'm looking at the hardware efficiency numbers they gave us.

Rosa: They show that using this index domain datapath cuts down the area for candidate expansion and selection by twenty-three percent and power by forty-four percent for a sixty four QAM layer.

Dev: That’s a solid number, but what about the ultimate goal? The paper's title suggests sort-free decoding, which is pretty big in MIMO detection.

Rosa: It means they're aiming for something that doesn't depend on how many layers you have or how complex the modulation order gets; it keeps the cost fixed as the number of antennas grows.

Dev: If this works as claimed, it could mean we can finally deploy reliable, low-cost MIMO detectors capable of handling those multi-gigabit peak rates without needing massive amounts of specialized silicon.

Rosa: That's what I'm interested in. It suggests that the complexity of the algorithm can be managed by smart architecture rather than just bigger, slower processors or more power hungry chips.

Dev: It definitely shifts the focus from just making a detection work to making it make sense when you’re trying to build something fast and efficient for a real-world wireless system.

Rosa: So, we'll keep digging into how this index domain works and what kind of real-world failure modes the authors tested this on next.

Conclusion: Rosa: So we're wrapping up this look at "Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to one thousand twenty-four QAM."

Dev: Yeah, that paper is trying to solve a problem where you need high speeds, like those from Wi-Fi seven or five g NR, but the detection math gets way too complex at those high modulation orders.

Rosa: Exactly. They're proposing this new pruning method called MMECP and an entire hardware architecture that uses these integer indices instead of dealing with all those complex symbol values during the candidate search.

Dev: What does that mean for a system running in real time? The paper claims this scheme keeps near K best performance while ditching the slow iterative selection loop they call ICP.

Rosa: Right, it means less sequential processing in hardware, which is good because those loops take up a lot of clock cycles and add latency.

Dev: But how does that index-domain thing actually help with the speed requirements? I'm looking at the hardware efficiency numbers they gave us.

Rosa: They show that using this index domain datapath cuts down the area for candidate expansion and selection by twenty-three percent and power by forty-four percent for a sixty four QAM layer.

Dev: That’s a solid number, but what about the ultimate goal? The paper's title suggests sort-free decoding, which is pretty big in MIMO detection.

Rosa: It means they're aiming for something that doesn't depend on how many layers you have or how complex the modulation order gets; it keeps the cost fixed as the number of antennas grows.

Dev: If this works as claimed, it could mean we can finally deploy reliable, low-cost MIMO detectors capable of handling those multi-gigabit peak rates without needing massive amounts of specialized silicon.

Rosa: That's what I'm interested in. It suggests that the complexity of the algorithm can be managed by smart architecture rather than just bigger, slower processors or more power hungry chips.

Dev: It definitely shifts the focus from just making a detection work to making it make sense when you’re trying to build something fast and efficient for a real-world wireless system.

Rosa: So, we'll keep digging into how this index domain works and what kind of real-world failure modes the authors tested this on next.

Shengchun Yang, Amit Sravan Bora, Emil Matus, Gerhard Fettweis

Vodafone Chair Mobile Communications Systems at Technische Universitat Dresden · G. S. Sanyal School of Telecommunications at Indian Institute of Technology Kharagpur

eess.SP

Submitted: 2026-11-04

Updated: 2026-11-04

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 100/100

The gist: Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM is a research paper proposing a novel…

Key concepts

Max-Min-Exchange Candidate Pruning (MMECP)
This is a new pruning scheme that replaces the iterative selection loop of ICP with a single max-min exchange without needing feedback. It targets the detection performance of BoxSICP by performing this exchange between specific candidate sets, aiming to survive global sorting in fewer than 40% of cases.
Index-Domain VLSI Architecture
This is a hardware design approach where each candidate is represented by its integer constellation index instead of using the actual symbol values. This allows candidates and their distances to be determined through simple bit selection, which simplifies the logic significantly compared to operations on complex symbol values.
Near-K-Best Performance
This refers to achieving detection accuracy very close to the optimal K-Best detection method, but with much lower complexity. The MMECP scheme is designed specifically to retain this high level of performance while eliminating the sequential selection loop that typically causes high complexity in iterative methods.
Index QAM Map (A~)
This is a specific map used in the VLSI architecture where quantities carry a tilde (e.g., ˜δ, ˜x). Using this map allows candidate generation to be implemented via bit selection instead of computationally intensive additions and subtractions on the actual symbol values, keeping the index width manageable.

Terminology

Summary

Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM is a research paper proposing a novel, iteration-free pruning scheme and an index-domain VLSI architecture to achieve sort-free MIMO box decoding at high modulation orders like 1024-QAM while maintaining near K-Best performance The proposed Max-Min-Exchange Candidate Pruning (MMECP) scheme replaces the sequential selection loop of Iterative Candidate Pruning (ICP) with a single max-min exchange without a feedback path and keeps near-K-Best performance

Pruning redundant reasoning tokens

The paper introduces Max-Min-Exchange Candidate Pruning (MMECP), which replaces the selection loop of ICP with a single max-min exchange without a feedback path and keeps near-K-Best performance This scheme targets the detection performance of BoxSICP without the iterative loop. The core idea is to start from the SCP survivor set G(1)i and change at most one of its K paths by performing a max-min exchange between Wˆ(1)max,i and Wˆ(2)min,i This step targets (1, K), which survives global sorting in fewer than 40% of cases. p. 3 The rule uses only the ordering within each Box cluster from Rule 2 and the PEDs of the rank groups G(1)i and G(2)i

How the training signal is built

The paper presents an index-domain VLSI architecture that represents each candidate by its integer constellation index, so that candidates and their distances are obtained by bit selection instead of operations on symbol values The detector operates in the index QAM map A˜ where the corresponding quantities carry a tilde, such as a˜, ˜δ, and x˜ Candidate generation is implemented with bit selection instead of additions and subtractions on symbol values The index width grows only by one bit per QAM step, and the selection logic is the same for every modulation order

Where the gains come from

The optimizations in A˜ shorten the RNG critical path to ∼ 1TCMAC through coefficient pre-computation, replace the interference multiplier with shift–add networks, remove the CES Box Operation and Difference Calculation blocks (leaving only the pruning operations and the Selection Logic after the Q block and before the PED block) These gains bring the post-quantization datapath close to the complexity of MMSE detection In one 64-QAM detection layer, the A˜ datapath reduces the area of candidate expansion and selection by 23% and the power by 44%, and MMECP needs 73% less area and 75% less power than unfolded ICP at the same throughput

Performance evaluation

The proposed detector is synthesized in TSMC 16 nm CMOS, detecting one vector per cycle at 1 GHz for 64- to 1024-QAM and produces up to 40 Gb/s with its gate count growing by 63% over this range The normalized hardware efficiency is measured at 2.3×, 12× and 14× that of the best compared hard-output detector at 64-, 256- and 1024-QAM Box-SMMECP reaches a tree-wise accuracy of 70 to 80%, compared to 55 to 70% for Box-SCP, and is close to Box-SICP The proposed design exceeds the vector rate in one instance for the Wi-Fi 7 modulations up to 1024-QAM

Conclusion

The paper presents an iteration-free pruning scheme and a VLSI architecture for sort-free MIMO Box Decoding in high-order QAM systems The MMECP scheme replaces the sequential selection loop of ICP by a single max-min exchange derived from survival statistics The index-domain datapath keeps the entire post-quantization processing in the index QAM map A˜, so quantization, box expansion and distance extraction become bit-field selection In one 64-QAM detection layer, the A˜ datapath reduces the area of candidate expansion and selection by 23% and the power by 44%, and MMECP needs 73% less area and 75% less power than unfolded ICP at the same throughput Synthesized for a 4×4 detector in 16 nm CMOS, the design detects one vector per cycle at 1 GHz, sustains 24, 32 and 40 Gb/s at 64-, 256- and 1024-QAM with 63% gatecount growth, and reaches 2.3×, 12× and 14× the normalized hardware efficiency of the best compared hard-output detector at 64-, 256- and 1024-QAM

REFERENCES

[1] F. Rusek, D. Persson, B. K. Lau, E. G. Larsson, T. L. Marzetta, O. Edfors, and F. Tufvesson, “Scaling up mimo: Opportunities and challenges with very large arrays,” IEEE Signal Processing Magazine, vol 30 no 1 pp 40–60 2013

[2] IEEE, “IEEE Standard for Information Technology–Telecommunications and Information Exchange between Systems Local and Metropolitan Area Networks–Specific Requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment 8: Enhancements for Extremely High Throughput (EHT),” IEEE Std 802.11be-2024, 2024

[3] 3GPP, “NR; Physical Layer Procedures for Data,” 3GPP TS 38.214, Release 17, 2022

[4] ITU-R, “Minimum Requirements Related to Technical Performance for IMT-2020 Radio Interface(s),” Report ITU-R M.2410-0, 2017

[5] S. Yang and L. p. 0 Hanzo, “Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs,” IEEE Communications Surveys & Tutorials, vol 17 no 4 pp 1941–1988 2015

[6] E. Larsson, “MIMO Detection Methods: How They Work [Lecture Notes],” IEEE Signal Proc. p. 0 Magazine, vol 26 no 3 pp 91–95 2009

[7] I. A Bello, B. Halak, M. El-Hajjar, and M. Zwolinski, “A survey of vlsi implementations of tree search algorithms for mimo detection,” Circuits Syst Signal Process. p. 0, vol 35 no 10 p 3644–3674 Oct 2016

[8] K. Higuchi, H. Kawai, N. Maeda, and M. Sawahashi, “Adaptive Selection of Surviving Symbol Replica Candidates Based on Maximum Reliability in QRM-MLD for OFCDM MIMO Multiplexing,” in IEEE Global Telecommunications Conference (GLOBECOM), 2004 pp 2480–2484

[9] Y. Tian, W. Bian, J. Zheng, W. Zhou, Y. Huang, and C. Zhang, “BreadthFirst Search Detection With Permutation Channel for Massive MIMO,” IEEE Wireless Comm Letters 2025

[10] J. Zheng, Y. Sun, H. Zhou, W. Zhou, Y. Huang, X. You, and C. Zhang, “Low-Complexity Breadth-First Search Detection for LargeScale MIMO Syst. p. 0” IEEE Trans on Comm. p. 0, vol 73 no 8 2025

[11] E. Viterbo and J. Boutros, “A Universal Lattice Code Decoder for Fading Channels,” IEEE Trans on Information Theory, vol 45 no 5 1999

[12] Y.-M. Chen, Y.-X. Dai, S.-J. Jhang, and Y.-L. Ueng, “An Efficient SoftOutput Fixed-Complexity Sphere Decoder for Large QAM Constellations,” IEEE Transactions on Vehicular Technology, vol 74 no 12 2025

[13] A. Ivanov, A. Osinsky, D. Lakontsev, and D. Yarotsky, “High Performance Interference Suppression in Multi-User Massive MIMO Detector,” in IEEE 91st Vehicular Technology Conference (VTC2020-Spring), 2020 pp 1–5

[14] M. Kim, “A Design of Fixed-Complexity Sphere Decoder Combined With Interference Mitigation Algorithm for Downlink MU-MIMO Systems,” IEEE Access, vol 10 pp 107 888–107 899, 2022

[15] K. Yao, F. Xue, C. Zhang, and K. Tian, “Advanced Receiver for 3GPP 5G-A Intra-Cell Inter-User Interference Mitigation,” IEEE Access, vol 13 2025

[16] Z. Guo and P. Nilsson, “Algorithm and Implementation of the K-Best Sphere Decoding for MIMO Detection,” IEEE Journal on Selected Areas in Communications, vol 24 no 3 pp 491–503 2006

[17] M. Shabany and P. G. Gulak, “A 675 mbps, 4 × 4 64-qam k-best mimo detector in 0. p. 013 µm cmos,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol 20 no 1 pp 135–147, 2012

[18] M.-T. Shiue, S.-S. Long, C.-K. Jao, and S.-K. Lin, “Design and Implementation of Power-Efficient K-Best MIMO Detector for Configurable Antennas,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol 22 no 11 pp 2418–2422, 2014

[19] C.-H. Liao, T.-P. Wang, and T.-D. Chiueh, “A 74.8 mW Soft-Output Detector IC for 8×8 Spatial-Multiplexing MIMO Communications,” IEEE Journal of Solid-State Circuits, vol 45 no 2 pp 411–421, 2010

[20] M. Shabany, K. Su, and P. Glenn Gulak, “A Pipelined Scalable HighThroughput Implementation of a Near-ML K-Best Complex Lattice Decoder,” in 2008 IEEE International Conference on Acoustics, Speech and Signal Processing (ICAS), 2008 pp 3173–3176

[21] S. Mondal, K. N. Salama, and W. H. Ali, “A Novel Approach for KBest MIMO Detection and its VLSI Implementation,” in 2008 IEEE International Symposium on Circuits and Systems (ISCAS), 2008 pp 936–939

[22] M. Shabany and P. G. Gulak, “The Application of Lattice-Reduction to the K-Best Algorithm for Near-Optimal MIMO Detection,” in 2008 IEEE International Symposium on Circuits and Systems (ISCAS), 2008 pp 316–319

[23] C.-A. Shen and A. M. Eltawil, “A Radius Adaptive K-Best Decoder With Early Termination: Algorithm and VLSI Architecture,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol 57 no 9 pp 2476–2486, 2010

[24] M.-Y. Huang and P.-Y. Tsai, “Toward Multi-Gigabit Wireless: Design of High-Throughput MIMO Detectors With Hardware-Efficient Architecture,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol 61 no 2 pp 613–624, 2014

[25] X. Mao, Y. Cheng, and H. Xiang, “Partial Noise Value Aided Reduced K-Best Sphere Decoding,” in 2013 IEEE 78th Vehicular Technology Conference (VTC Fall), 2013 pp 1–5

[26] K. E. Batcher, “Sorting Networks and Their Applications,” in Proceedings of the AFIPS Spring Joint Computer Conference, 1968 pp 307–314

[27] Y.-X. Liu, S.-J. Jhang, and Y.-L. Ueng, “An Efficient K-Best MIMO Detector for Large Modulation Constellations,” IEEE Open Journal of Circuits and Syst. p. 0, vol 5 pp 2–16 2024

[28] S. Mondal, A. Eltawil, C.-A. Shen, and K. N. Salama, “Design and Implementation of a Sort-Free K-Best Sphere Decoder,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol 18 no 10 pp 1497–1501 2010

[29] B. Y. Kong and I.-C. Park, “Improved Sorting Architecture for K-Best MIMO Detection,” IEEE Trans on Circuits and Syst II: Express Briefs, vol 64 no 9 2017

[30] Y.-R. Chen, C.-C. Ho, W.-T. Chen, and P.-Y. Chen, “A Low-Cost Pipelined Architecture Based on a Hybrid Sorting Algorithm,” IEEE Trans on Circuits and Syst I: Regular Papers, vol 71 no 2 2024

[31] D.-L. Lee and K. Batcher, “A Multiway Merge Sorting Network,” IEEE Trans on Parallel and Distributed Systems, vol 6 no 2 pp 211–215, 1995

[32] A. Farmahini-Farahani, H. J. Duwe III, M. p. 1 J. Schulte, and K. Compton, “Modular Design of High-Throughput, Low-Latency Sorting Units,” IEEE Transactions on Computers, vol 62 no 7 pp 1389–1402 2013

[33] M. Li, B. Bougard, E. Lopez-Estraviz, A. Bourdoux, D. Novo, L. Van der Perre, and F. Catthoor, “Selective Spanning with Fast Enumeration: A Near Maximum-Likelihood MIMO Detector Designed for Parallel Programmable Baseband Architectures,” in IEEE International Conference on Communications (ICC), 2008 pp 737–741

[34] S. Granlund, L. Liu, C. Zhang, and V. Owall, “Implementation of a Highly-Parallel Soft-Output MIMO Detector with Fast Node Enumeration,” in NORCHIP, 2013

[35] S. F. Qureshi, S. A. Damjancevic, E. Matus, D. Utyansky, P. Van Der Wolf, and G. P. Fettweis, “Box Decoding: A Low-Complexity Algorithm for MIMO Detection,” in 2024 IEEE Workshop on Signal Processing Systems (SiPS), 2024 pp 25–30

[36] H. Zhang, S. F. Qureshi, E. Matu´s, D. Utyansky, P. van der Wolf, and ˇ G. P. Fettweis, “A low-complexity k-box detector in high-dimensional mimo systems,” in 2025 IEEE 102nd Vehicular Technology Conference (VTC2025-Fall), 2025 pp 1–7

[37] A. S. Bora, S. Yang, E. Matus, and G. p. 0 p. 0 Fettweis, “Box Decoding With Probabilistic Tree Pruning for Scalable Sort-Free MIMO Detection,” IEEE Wireless Communications Letters, vol 15 2026

[38] S. Yang, A. S. Bora, E. Matus, and G. Fettweis, “Deterministic Sort-Free Candidate Pruning for Scalable MIMO Box Decoding,” in European Signal Processing Conference (EUSIPCO), 2026 accepted

[39] A. Goldsmith, Wireless Communications. p. 0 Cambridge, U.K.: Cambridge Univ.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Iteration-free candidate pruning using Max-Min-Exchange Candidate Pruning (MMECP) replaces the sequential selection loop of ICP by a single max-min exchange derived from survival statistics, keeping K paths per layer with 2K - 1 comparators and no feedback, which matches KBest performance.

  2. The index-domain datapath represents each candidate by its integer constellation index so that candidates and their distances are obtained by bit selection instead of operations on symbol values, making the selection logic a minimized Boolean function of six and eight bits that drives a multiplexer network in place of a compare-and-swap network.

  3. The proposed architecture achieves fixed throughput by ensuring that the critical path is one real MAC, which is achieved through coefficient pre-computation, replacing interference multipliers with shift-add networks, and removing the candidate expansion and selection blocks after the Q block and before the PED block.

Related papers