The K-best detector is considered as a promising technique in the MIMO-OFDM detection because of its good performance and low complexity.In this paper, a new K-best VLSI architecture is presented.In the proposed archi...The K-best detector is considered as a promising technique in the MIMO-OFDM detection because of its good performance and low complexity.In this paper, a new K-best VLSI architecture is presented.In the proposed architecture, the metric computation units（MCUs） expand each surviving path only to its partial branches, based on the novel expansion scheme, which can predetermine the branches＇ ascending order by their local distances.Then a distributed sorter sorts out the new K surviving paths from the expanded branches in pipelines.Compared to the conventional K-best scheme, the proposed architecture can approximately reduce fundamental operations by 50% and 75% for the 16-QAM and the 64-QAM cases, respectively, and, consequently, lower the demand on the hardware resource significantly.Simulation results prove that the proposed architecture can achieve a performance very similar to conventional K-best detectors.Hence, it is an efficient solution to the K-best detector＇s VLSI implementation for high-throughput MIMO-OFDM systems.展开更多
A 4×4 64-QAM multiple-input multiple-output （MIMO） detector is presented for the application of an IEEE 802.1 In wireless local area network. The detector is the implementation of a novel adaptive tree search ...A 4×4 64-QAM multiple-input multiple-output （MIMO） detector is presented for the application of an IEEE 802.1 In wireless local area network. The detector is the implementation of a novel adaptive tree search （ATS） algorithm, and multiple ATS cores need to be instantiated to achieve the wideband requirement in the 802.11 n standard. Both the ATS algorithm and the architectural considerations are explained. The latency of the detector is 0.75 μs, and the detector has a gate count of 848 k with a total of 19 parallel ATS cores. Each ATS core runs at 67 MHz. Measurement results show that compared with the floating-point ATS algorithm, the fixed-point imple- mentation achieves a loss of 0.9 dB at a BER of 10^-3.展开更多
文摘The K-best detector is considered as a promising technique in the MIMO-OFDM detection because of its good performance and low complexity.In this paper, a new K-best VLSI architecture is presented.In the proposed architecture, the metric computation units（MCUs） expand each surviving path only to its partial branches, based on the novel expansion scheme, which can predetermine the branches＇ ascending order by their local distances.Then a distributed sorter sorts out the new K surviving paths from the expanded branches in pipelines.Compared to the conventional K-best scheme, the proposed architecture can approximately reduce fundamental operations by 50% and 75% for the 16-QAM and the 64-QAM cases, respectively, and, consequently, lower the demand on the hardware resource significantly.Simulation results prove that the proposed architecture can achieve a performance very similar to conventional K-best detectors.Hence, it is an efficient solution to the K-best detector＇s VLSI implementation for high-throughput MIMO-OFDM systems.
文摘A 4×4 64-QAM multiple-input multiple-output （MIMO） detector is presented for the application of an IEEE 802.1 In wireless local area network. The detector is the implementation of a novel adaptive tree search （ATS） algorithm, and multiple ATS cores need to be instantiated to achieve the wideband requirement in the 802.11 n standard. Both the ATS algorithm and the architectural considerations are explained. The latency of the detector is 0.75 μs, and the detector has a gate count of 848 k with a total of 19 parallel ATS cores. Each ATS core runs at 67 MHz. Measurement results show that compared with the floating-point ATS algorithm, the fixed-point imple- mentation achieves a loss of 0.9 dB at a BER of 10^-3.
