Essays about: "error-correcting codes"
Showing result 16 - 20 of 22 essays containing the words error-correcting codes.
-
16. Investigation of LDPC code in DVB-S2
University essay from Datorteknik; Tekniska högskolanAbstract : As one of the most powerful error-correcting codes, Low-density parity check codes are widely used in digital communications. Because of the performance of LDPC codes are capable to close the shannon limited extraordinarily, LDPC codes are to be used in the new Digital Video Broadcast-Satellite-Second Generation(DVB-S2) and it is the first time that LDPC codes are included in the broadcast standard in 2003. READ MORE
-
17. A High Throughput Low Power Soft-Output Viterbi Decoder
University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)Abstract : A high-throughput low-power Soft-Output Viterbi decoder designed for the convolutional codes used in the ECMA-368 UWB standard is presented in this thesis. The ultra wide band (UWB) wireless communication technology is supposed to be used in physical layer of the wireless personal area network (WPAN) and next generation Blue Tooth. READ MORE
-
18. Root LDPC Codes for Non Ergodic Transmission Channels
University essay from Blekinge Tekniska Högskola/Sektionen för ingenjörsvetenskapAbstract : 4 ABSTRACT Tremendous amount of research has been conducted in modern coding theory in the past few years and much of the work has been done in developing new coding techniques. Low density parity check (LDPC) codes are class of linear block error correcting codes which provide capacity performance on a large collection of data transmission and storage channels while Root LDPC codes in this thesis work are admitting implementable decoders with manageable complexity. READ MORE
-
19. Turbo Decoding With Early State Decisions
University essay from Institutionen för systemteknikAbstract : Turbo codes was first presented in 1993 by C. Berrou, A. Glavieux and P. Thitimajshima. READ MORE
-
20. Geometries of Binary Constant Weight Codes
University essay from Institutionen för ingenjörsvetenskap, fysik och matematikAbstract : This thesis shows how certain classes of binary constant weight codes can be represented geometrically using linear structures in Euclidean space. The geometric treatment is concerned mostly with codes with minimum distance 2(w - 1), that is, where any two codewords coincide in at most one entry; an algebraic generalization of parts of the theory also applies to some codes without this property. READ MORE