On the complexity of ML lattice decoders for decoding linear full rate space-time codes

Ghaya Rekaya; Jean Claude Belfiore

doi:10.1109/isit.2003.1228220

On the complexity of ML lattice decoders for decoding linear full rate space-time codes

Ghaya Rekaya
, Jean Claude Belfiore

Telecom Paris

Research output: Contribution to journal › Conference article › peer-review

Abstract

We present a study and a comparison in terms of complexity of two ML-lattice decoders, the Sphere-Decoder (SD) and the Schnorr-Euchner decoder (SE), when used to decode multi-antenna transmission schemes, using full rate space-time codes, over a Rayleigh fading channel.

Original language	English
Pages (from-to)	206
Number of pages	1
Journal	IEEE International Symposium on Information Theory-Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228220
Publication status	Published - 1 Jan 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: 29 Jun 2003 → 4 Jul 2003

Access to Document

10.1109/isit.2003.1228220

Cite this

@article{41c0ca8158ae4ec9bd3ad2d659674eca,

title = "On the complexity of ML lattice decoders for decoding linear full rate space-time codes",

abstract = "We present a study and a comparison in terms of complexity of two ML-lattice decoders, the Sphere-Decoder (SD) and the Schnorr-Euchner decoder (SE), when used to decode multi-antenna transmission schemes, using full rate space-time codes, over a Rayleigh fading channel.",

author = "Ghaya Rekaya and Belfiore, \{Jean Claude\}",

year = "2003",

month = jan,

day = "1",

doi = "10.1109/isit.2003.1228220",

language = "English",

pages = "206",

journal = "IEEE International Symposium on Information Theory-Proceedings",

issn = "2157-8095",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - On the complexity of ML lattice decoders for decoding linear full rate space-time codes

AU - Rekaya, Ghaya

AU - Belfiore, Jean Claude

PY - 2003/1/1

Y1 - 2003/1/1

N2 - We present a study and a comparison in terms of complexity of two ML-lattice decoders, the Sphere-Decoder (SD) and the Schnorr-Euchner decoder (SE), when used to decode multi-antenna transmission schemes, using full rate space-time codes, over a Rayleigh fading channel.

AB - We present a study and a comparison in terms of complexity of two ML-lattice decoders, the Sphere-Decoder (SD) and the Schnorr-Euchner decoder (SE), when used to decode multi-antenna transmission schemes, using full rate space-time codes, over a Rayleigh fading channel.

UR - https://www.scopus.com/pages/publications/0142008338

U2 - 10.1109/isit.2003.1228220

DO - 10.1109/isit.2003.1228220

M3 - Conference article

AN - SCOPUS:0142008338

SN - 2157-8095

SP - 206

JO - IEEE International Symposium on Information Theory-Proceedings

JF - IEEE International Symposium on Information Theory-Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

On the complexity of ML lattice decoders for decoding linear full rate space-time codes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this