Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
Search sequence determination for tree search based detection algorithms

Search sequence determination for tree search based detection algorithms,10.1109/SARNOF.2009.4850294,B. Mennenga,G. Fettweis

Edit
Search sequence determination for tree search based detection algorithms   (Citations: 7)
BibTex | RIS | RefWorks Download
Tree search based detection algorithms provide a promising approach to solve the detection problems in MIMO systems. Depth-first, Breadth-first or Metric-first search strategies provide near max-log detection at reduced but still significant complexity. In this paper we show how the incurred complexity can be reduced substantially. In order to reduce the number of metric calculations to a minimum, we propose a novel relative determination of search sequences for QAM constellations, usable inexpensively independent of the underlying constellation size and search strategy and moreover also usable for soft-in soft-out detection. Based on its application to a sphere detector, we will demonstrate the impact on complexity and performance of the detection as well as on the detector structure. Building on the results, we propose refinements of the resulting detector providing a very good performance at minimized complexity, making the resulting detector particularly favorable for implementation.
Conference: Sarnoff Symposium, IEEE - SARNOF , 2009
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
More »
    • ...In order to demonstrate the impact of this idea on performance and complexity of SISO detectors, we selected exemplarily the TS algorithm [11] together with complexity reduction techniques of sequential Search Sequence Determination (Seq-SSD) and Metric Estimation (ME) presented in [12]–[14]...
    • ...To overcome these problems we use the geometrical approach of Search Sequence Determination (SSD) [12] to determine the sequence of favorable child nodes...
    • ...As a basis for iterative detection we use the Seq-SSD [12]...
    • ...reasons the details of both SSD and ME approaches are not provided in this paper and can be found in the corresponding references [12], [13], [19]...

    Mohammad Ali Shah, et al. Complexity Reduction in Iterative Soft-In Soft-Out Sphere Detection

    • ...Then, the SE enumeration is simple by utilizing the geometrical properties of constellation points [11], [12]...

    Dan Zhang, et al. Tree Search Space Reduction for Soft-Input Soft-Output Sphere Decoding...

    • ...The Tuple Search (TS) algorithm [11] together with the application of Search Sequence Determination (SSD) [12] and Metric Estimation (ME) [13] provides detection performance close to maxLogAPP at low detection complexity...
    • ...This work is based on the algorithm proposed in [11] together with the complexity reduction techniques of SSD and ME presented in [12] and [13] respectively...
    • ...[12] describes a geometrical approach to determine the sequence of favorable child nodes for TS algorithm...
    • ...Therefore, [12] uses predefined sequences for further node enumeration without additional case differentiations...

    Mohammad Ali Shah, et al. Iterative Soft-In Soft-Out Sphere Detection for 3GPP LTE

    • ...Efficient VLSI implementations have been proposed for softoutput-only STS SDs [6], [7] exploiting geometric properties of quadrature amplitude modulation (QAM) constellations...
    • ...We define an examined node (as used in [6] and [7]) as a node sj that has been checked against at least one pruning criterion, leading to the complexity measure number of examined nodes per detected symbol vector Nen...
    • ...For the soft-output-only case, the geometric properties of the QAM constellation can be exploited to avoid full sorting and thus save most of the computations, as proposed in [6], [7], and [11]...

    Ernst Martin Witte, et al. A Scalable VLSI Architecture for Soft-Input Soft-Output Single Tree-Se...

    • ...Such, approximations based on geometrical considerations were first proposed in [10] and [11]...

    Markus Wenk, et al. Area and throughput-optimized VLSI architecture of sphere decoding

Sort by:

Citations (7)

Share this on