Sökning: "CODES"

Visar resultat 1 - 5 av 668 avhandlingar innehållade ordet CODES.

1. 1. Sparse Codes on Graphs with Convolutional Code Constraints

   Författare :Muhammad Umar Farooq; Kommunikationsteknologi; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Braided codes; Density evolution; Serially concatenated codes; Spatially coupled codes; Generalized LDPC codes; threshold saturation; Turbo codes;

   Sammanfattning : Modern coding theory is based on the foundation of the sparse codes on graphs, such as the low-density parity-check (LDPC) codes, and the turbo-like codes (TCs) with component convolutional codes. The success of the LDPC codes and the TCs lies in their ability to perform low-complexity iterative message passing decoding procedures. LÄS MER

3. 2. Codes on Graphs and More

   Författare :Florian Hug; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convolutional codes; woven graph codes; Low-density parity-check LDPC codes; tailbiting codes; bit error probability; MacWilliams Identity;

   Sammanfattning : Modern communication systems strive to achieve reliable and efficient information transmission and storage with affordable complexity. Hence, efficient low-complexity channel codes providing low probabilities for erroneous receptions are needed. LÄS MER

4. 3. 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

5. 4. On the Design of Turbo Codes

   Författare :Johan Hokfelt; Institutionen för elektro- och informationsteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Channel coding; concatenated codes; convolutional codes; iterative decoding; interleaver design; trellis termination; Electronics; Turbo codes; Elektronik;

   Sammanfattning : This thesis is about Turbo codes - codes constructed via parallel concatenation of two recursive convolutional encoders linked by an interleaver. The focus of the work is on the understanding and design of Turbo codes. LÄS MER

7. 5. Designing Space-Time Codes Using Orthogonal Designs

   Författare :Girish Ganesan; Thomas Marzetta; Uppsala universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Space-time codes; Orthogonal designs; Amicable orthogonal designs; Differential detection; Trellis codes; Turbo codes; Signal processing; Signalbehandling; Signalbehandling; Signal Processing;

   Sammanfattning : This thesis deals with coding schemes for systems with multiple transmit antennas. The problem of finding optimal transmission schemes for the case when the transmitter knows the channel and the case when the transmitter does not know the channel are considered. LÄS MER