Low Density Lattice Codes: from Theory to Practice

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00233394" target="_blank" >RIV/68407700:21230/15:00233394 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Low Density Lattice Codes: from Theory to Practice

Popis výsledku v původním jazyce

Recently, lattice theory has been considered as useful tool for information theory. It has been also shown that lattice codes can be a strong competitor to traditional capacity achieving coding schemes such as LDPC or Turbo codes. Lattice codes are alsoattractive due to the fact that code space and signal space are equal, instead of traditional codes, where these spaces are different. However, all results were proved under too ideal constraint ? infinite codeword dimensionality. Therefore, some practical concepts viable in real world are needed. The family of Low Density Lattice Codes (LDLC) seems to be a suitable candidate to achieve desired results. Although original LDLC decoding procedure has linear complexity, this algorithm is still memory-consuming and difficult to implement. This paper describes LDLC code design including practical algorithms with linear complexity for encoding and decoding with effort to save memory as possible. This paper also introduces design of check matr

Název v anglickém jazyce

Low Density Lattice Codes: from Theory to Practice

Popis výsledku anglicky

Recently, lattice theory has been considered as useful tool for information theory. It has been also shown that lattice codes can be a strong competitor to traditional capacity achieving coding schemes such as LDPC or Turbo codes. Lattice codes are alsoattractive due to the fact that code space and signal space are equal, instead of traditional codes, where these spaces are different. However, all results were proved under too ideal constraint ? infinite codeword dimensionality. Therefore, some practical concepts viable in real world are needed. The family of Low Density Lattice Codes (LDLC) seems to be a suitable candidate to achieve desired results. Although original LDLC decoding procedure has linear complexity, this algorithm is still memory-consuming and difficult to implement. This paper describes LDLC code design including practical algorithms with linear complexity for encoding and decoding with effort to save memory as possible. This paper also introduces design of check matr

Druh

D - Stať ve sborníku

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

<a href="/cs/project/LD12062" target="_blank" >LD12062: Bezdrátové síťové kódování a zpracování signálu v kooperativních a distribuovaných multi-terminálových a multi-uzlových komunikačních systémech</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 19th International Scientific Student Conferenece POSTER 2015

ISBN

978-80-01-05499-4

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

1-6

Název nakladatele

Czech Technical University in Prague

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

14. 5. 2015

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—