2009
DOI: 10.1109/tcsi.2008.2002544
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic Spherical Detection and VLSI Implementation for Multiple-Antenna Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…The MS algorithm [13] is similar to MFS, except that SearchSpace uses the nodes in the kth level as C k . The P-SD algorithm [14] is similar to DFS, except that SearchSpace adjusts the parameter δ to make |C k | constant. The MBF-FD algorithm [15] uses SeachOrder of DFS and MFS, in turn, to take advantage of both algorithms.…”
Section: B Tree Structure and Unified Ts Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The MS algorithm [13] is similar to MFS, except that SearchSpace uses the nodes in the kth level as C k . The P-SD algorithm [14] is similar to DFS, except that SearchSpace adjusts the parameter δ to make |C k | constant. The MBF-FD algorithm [15] uses SeachOrder of DFS and MFS, in turn, to take advantage of both algorithms.…”
Section: B Tree Structure and Unified Ts Algorithmmentioning
confidence: 99%
“…In [13], a multistack (MS) algorithm was proposed to remedy the disadvantages of MFS by considering the level of nodes. In [14], a probabilistic SD (P-SD) algorithm was proposed to remedy the disadvantages of DFS, in which the number of nodes within a sphere is kept constant by adaptively changing the radius. In [15], a modified best-first with fast descent (MBF-FD) algorithm was proposed, in which two strategies, namely, DFS and MFS, are used in turn.…”
mentioning
confidence: 99%
“…The th such vector is denoted by . The vector is mapped to the transmission vector element as follows: where (11) and (12) The function is the modulator which simply outputs the real or imaginary part of the constellation points corresponding to depending on . Thus, the bits transmitted in the th level of the last transmit vector corresponds to the first transition of the encoder, the th level bits of correspond to the next transition of states and so on.…”
Section: Algorithmsmentioning
confidence: 99%
“…These approaches can be effectively expressed as a tree-searching class of algorithms visiting a subset of the tree. Recently, there has been a significant amount of work in related fields, both in the theoretical and algorithmic domain [9]- [11] as well as in the architecture and implementation context [13]- [18].…”
mentioning
confidence: 99%
“…For example, a probabilistic-search algorithm is proposed in [27]. The work in [29] is based on the probabilistic algorithm presented in [27] while providing implementation techniques to reduce complexity. In [28], a novel channel matrix reordering scheme is used to reduce the number of operations required to perform sphere decoding.…”
Section: Introductionmentioning
confidence: 99%