Sökning: "low-density parity-check code"

Visar resultat 1 - 5 av 18 avhandlingar innehållade orden low-density parity-check code.

1. 1. Low-density parity-check codes : unequal error protection and reduction of clipping effects

   Författare :Sara Sandberg; David Declercq; Luleå tekniska universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Signalbehandling; Signal Processing;

   Sammanfattning : The invention of low-density parity-check (LDPC) codes made reliable communication possible at transmission rates very close to the theoretical limit predicted by Shannon. However, communication close to the Shannon limit requires very long codes and results in long delay and high encoder and decoder complexity. LÄS MER

3. 2. Towards a Theory of Codes for Iterative Decoding

   Författare :Michael Lentmaier; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; bit error probability; low-density parity-check convolutional code; low-density parity-check code; turbo code; convolutional code; channel coding; iterative decoding; Informatics; systems theory; Informatik; systemteori;

   Sammanfattning : Channel codes in combination with iterative decoding techniques are a both powerful and efficient method to protect data against disturbances in digital communication systems. This thesis deals with various code constructions for block-wise and continuous transmission that have the potential to achieve low bit error rates with iterative decoding, even when operating close to the Shannon limit. LÄS MER

4. 3. Low Complexity Techniques for Low Density Parity Check Code Decoders and Parallel Sigma-Delta ADC Structures

   Författare :Anton Blad; Oscar Gustafsson; Zhongfeng Wang; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electronics; Elektronik;

   Sammanfattning : Since their rediscovery in 1995, low-density parity-check (LDPC) codes have received wide-spread attention as practical capacity-approaching code candidates. It has been shown that the class of codes can perform arbitrarily close to the channel capacity, and LDPC codes are also used or suggested for a number of important current and future communication standards. LÄS MER

5. 4. Iteratively Decodable Convolutional Codes: Analysis and Implementation Aspects

   Författare :Alberto Jimenez Feltström; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; systems theory; Informatics; Intersymbol Interference; BPSK; Product Codes; Braided Codes; Low-Density Parity-Check Codes; Convolutional Codes; Iterative Decoding; Informatik; systemteori; Systems engineering; computer technology; Data- och systemvetenskap;

   Sammanfattning : This thesis addresses the theory and implementation aspects of iteratively decodable codes. Iteratively decodable codes include, in particular, Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, turbo codes due to Berrou et. al. and expander codes. LÄS MER

7. 5. On the Construction and Analysis of Iteratively Decodable Codes

   Författare :Dmitri Truhachev; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Computer science; minimum distance; cycles; asymptotic performance; turbo codes; iterative decoding; low-density parity-check codes; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll;

   Sammanfattning : Iterative decoding methods allow efficient decoding of long codes that are composed of smaller component codes. As a result reliable communication can be achieved with low decoding complexity even for rates close to Shannon capacity. This makes iteratively decodable codes a very attractive object of study in modern coding theory. LÄS MER