2005
DOI: 10.1109/twc.2005.853830
|View full text |Cite
|
Sign up to set email alerts
|

Space-time Chase decoding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(25 citation statements)
references
References 12 publications
0
25
0
Order By: Relevance
“…It follows from (5) and (9) that the list error probability can be fully described in terms of the properties of the Gram matrix Γ. For binary codes, this matrix determines the so-called minimum Hamming list distance of the code [27], d HLmin , which plays the same role for list decoding as the minimum distance for maximumlikelihood decoding.…”
Section: A List Decodingmentioning
confidence: 99%
See 1 more Smart Citation
“…It follows from (5) and (9) that the list error probability can be fully described in terms of the properties of the Gram matrix Γ. For binary codes, this matrix determines the so-called minimum Hamming list distance of the code [27], d HLmin , which plays the same role for list decoding as the minimum distance for maximumlikelihood decoding.…”
Section: A List Decodingmentioning
confidence: 99%
“…More generally, the turbo receiver principle is applicable to many communication systems that can be represented as concatenated coding schemes, where the inner code is, for example, realized by a modulator followed by the intersymbol interference (ISI) channel, or by a spacetime code for multiple-antenna transmission. List-based inner SISO detectors that form the symbol reliability estimates from a list of signal vectors were proposed, e.g., in [9] for MIMO transmission and in [10] for ISI equalization.…”
Section: Introductionmentioning
confidence: 99%
“…The first observation in the development of the proposed demodulator is that the expression in (8) suggests that for the purposes of soft demodulation, one could consider generating a sequence of bit vectors with properties similar to those generated by the formal randomization process by making the approximation that each element ofx is independent, and generating each element ofx via a scalar (antipodal) Bernoulli trial. This approach avoids the cost of computing V T u in each instance of the formal randomization procedure.…”
Section: Iterative Quasi-map Demodulatormentioning
confidence: 99%
“…It consists of an SDR demodulator (which is invoked only in the first iteration), and a randomized soft demodulator. The randomized soft demodulator takes two inputs: (i) a vector L containing the mean values in (8) …”
Section: Iterative Quasi-map Demodulatormentioning
confidence: 99%
See 1 more Smart Citation