Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 52 for “"Decoding Algorithm"”.
-
Analysis, improvement and extensions of a Lee metric list decoding algorithm for alternant codes
… Lee metric codes based on the Guruswami-Sudan decoding and Ido Tal algorithms are studied in this thesis. An algorithm is developped over a Galois ring, some improvements in special cases are given as for large alphabet codes and codes over GF(2). Tools are developped to study Lee metric codes …
-
Evaluation of Soft Output Decoding for Turbo Codes
Evaluation of soft output decoding for turbo codes is presented. Coding theory related to this research is studied, including convolutional encoding and Viterbi decoding. Recursive systematic convolutional (RSC) codes and nonuniform interleavers commonly used in turbo code encoder design are …
-
Detection and Coding Techniques for Fourth Generation Air-Interfaces based on Multicarrier Modulation
… is prohibitively complex. A novel near-ML MUD algorithm based on the Chase algorithm has been proposed in this thesis. The proposed algorithm offers significant improvement to the performance of MC-CDMA using much less complexity compared to ML-MUD. A gain of 1dB to 4dB over the non-MUD …
-
Compressive sensing based imaging via belief propagation
… accuracy using an iterative message passing decoding algorithm commonly known as Belief Propagation (BP). The CS technique can accurately recover any compressible or sparse signal from a lesser number of non-adaptive, randomized linear projection samples than that specified by the Nyquist …
-
Error -Correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs
… In the first technique, which is based on decoding with a layered graph known as a trellis, we examine generalization of heuristically good codes called lexicodes. We propose and analyze a method for designing generalized lexicodes that minimize or constrain various trellis decoding …
-
Iterative Detection and Decoding for Wireless Communications
… interleaving, and an associated iterative decoding algorithm. Although the iterative decoding algorithm has been primarily used for the decoding of turbo codes, it represents a solution to a more general class of estimation problems that can be described as follows: a data set directly or …
-
VLSI Architectures for Iterative Channel Decoders
… optimizations are performed at the code-design, decoding algorithm, decoder architecture, and physical layout levels. The methodology proposes: (1) The concept of architecture-aware LDPC code design that solves the interconnect bottleneck, (2) a faster and memory-efficient turbo-decoding …
-
GMD Decoding of Euclidean -Space Codes and Iterative Decoding of Turbo Codes
… and leads to a better understanding of the turbo decoding algorithm. Specifically, a simplified stopping criterion based on the characteristics of the phase trajectories is provided.
-
An Improvement to Generalized - Minimum - Distance Decoding
The generalized-minimum-distance decoding algorithm developed by Forney combined an efficient method of finding candidate codewords with an acceptance criterion. If a codeword meets the acceptance criterion, then it is known to have smaller generalized distance than any other element of the code. …
-
Learning noisy characters, multiplication codes, and cryptographic hardcore predicates
… in cryptography, coding theory and sublinear algorithms. In cryptography, we introduce a unifying framework for proving that a Boolean predicate is hardcore for a one-way function and apply it to a broad family of functions and predicates, showing new hardcore predicates for well known one-way …
-
A System-on-Programmable-Chip Approach for MIMO Lattice Decoder
… of Schnorr- Euchner strategy based decoding algorithm applied on Altera system-on-chip (Stratix EP1S10F780C6) with Nios embedded processor. The lattice decoder is developed on FPGA using VHDL. The preprocessing part of algorithm is targeted for Nios embedded processor using C …
-
A new generic maximum-likelihood metric expression for space-time block codes with applications to decoding
… a simple low-complexity maximum-likelihood (ML) decoding algorithm. However, OSTBCs are limited in their error performance. This has led to the development of more general linear space-time block codes, such as quasi-orthogonal space-time block codes (QOSTBCs). QOSTBCs offer better error …
-
Error-correcting codes on low néron-severi rank surfaces
… ”good” codes too. We also present an efficient decoding algorithm for such codes. It is based on the realization of the code as an LDPC code, and it was inpired by the Luby-Mitzenmacher algorithm.
-
Iterative Algebraic Decoding of Codes Defined on Graphs
… subgroups. A localized algebraic iterative decoding algorithm is used to decode across subgroups to correct large errors. Very little correction capability is sacrificed to achieve fast error correction and lower communication overhead. This scheme improves data access for all the data nodes …
-
Comparison of high level design methodologies for algorithmic IPs : Bluespec and C-based synthesis
… hardware design of Digital Signal Processing algorithms is an important design problem for decreasing design time and allowing more algorithmic exploration. Bluespec is a Hardware Design Language (HDL) that allows designers to express intended microarchitecture through high-level constructs. …
-
Coding Techniques for Linear Block Codes With Applications to Fault Identification
… information is available, soft-decision decoding becomes attractive for many applications, since maximum-likelihood (ML) soft-decision decoding offers (roughly) 3 dB additional gain over algebraic decoding. Since ML soft-decision decoding is an NP-hard problem, we concentrate our efforts …
-
Subspace polynomials and list decoding of Reed-Solomon codes
… show combinatorial limitations on efficient list decoding of Reed-Solomon codes beyond the Johnson and Guruswami-Sudan bounds [Joh62, Joh63, GS99]. In particular, we show that for any ... , there exist arbitrarily large fields ... * Existence: there exists a received word ... that agrees with a …
-
Local list decoding of homomorphisms
… by Goldreich and Levin with the seminal work on decoding the Hadamard code. Many of the recent abstractions of their initial algorithm focus on Locally Decodable Codes (LDC's) over finite fields. We derive our algorithmic approach from the list decoding of the Reed-Muller code over finite fields …
-
Graph-based and algebraic codes for error-correction and erasure recovery
… codes are sparse graph-based codes with good decoding algorithms. We present a linear-time decoding algorithm for (C,D, alpha, gamma) expander codes based on graphs with any expansion factor given that the minimum distances of the inner codes are bounded below. We also design graph-based codes …
-
Design and Implementation of a Practical FLEX Paging Decoder
… decoder is discussed in detail. It proposes a decoding solution that includes a radio frequency (RF) receiver and a decoder board. The RF receiver will be briefly discussed. The decoder design is the main focus of this thesis as it transforms the RF frequency modulated (FM) data from the …
Page 1 of 3