IEEE Information Theory Workshop, 2005. 2005
DOI: 10.1109/itw.2005.1531875
|View full text |Cite
|
Sign up to set email alerts
|

A unified framework for tree search decoding: rediscovering sequential decoding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2010
2010

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…To decode this system with ML criterion is equivalent to the problem of Closest Lattice Point Search (CLPS) [6][7] [8].…”
Section: System Description: Single-carrier Modelmentioning
confidence: 99%
“…To decode this system with ML criterion is equivalent to the problem of Closest Lattice Point Search (CLPS) [6][7] [8].…”
Section: System Description: Single-carrier Modelmentioning
confidence: 99%