Reducing complexity with less than minimum delay space-time lattice codes

Roope Vehkalahti*, Camilla Hollanti

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

6 Citations (Scopus)


Recently, several papers have been concentrating on reducing the decoding complexity of high-rate space-time codes. While the research has led to some impressive reductions in decoding complexity, the geometric methods so far used appear to have faced some fundamental limits. In this paper, we study what happens if we let go of the assumption of full diversity and study the possibility of reducing the complexity, while holding on to a high code rate, by reducing the length of codes. We will develop some tools that can be used to measure the changes we will encounter when reducing the code length. We will also study the achievable diversity-multiplexing gain trade-off (DMT) of codes with less than minimum delay (LMD) and discuss some code constructions.

Original languageEnglish
Title of host publication2011 IEEE Information Theory Workshop, ITW 2011
Number of pages5
Publication statusPublished - 2011
MoE publication typeA4 Article in a conference publication
EventIEEE Information Theory Workshop - Paraty, Brazil
Duration: 16 Oct 201120 Oct 2011


WorkshopIEEE Information Theory Workshop
Abbreviated titleITW

Fingerprint Dive into the research topics of 'Reducing complexity with less than minimum delay space-time lattice codes'. Together they form a unique fingerprint.

Cite this