English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For K-best multiple-input multiple-output (MIMO) detection using real-valued decomposition (RVD), we need to obtain the K surviving candidates from KM candidates, where M is the modulation order. This paper presents a sorter-free detection algorithm, where the K surviving nodes can be obtained in log2K iterations, which is independent of modulation size. The KM 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 K 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 0.32 &#x03BC;s latency in a 90 nm process for a 256-quadrature amplitude modulation (QAM) 4&#x00D7; 4 MIMO system. In addition, compared to the sorter-based baseline detector, the proposed detector improves the hardware efficiency by 77%.

An Efficient K-Best MIMO Detector for Large Modulation Constellations