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 46 for “"Reed Solomon"”.
-
High -Throughput and Universal Architectures for Reed -Solomon Decoders
… field arithmetic operations and universal Reed-Solomon decoders are investigated. A new method for embedding field elements in universal architectures is proposed so as to easily adapt the high-throughput architectures for field arithmetic operations to universal architectures. The …
-
Algorithms and Architectures for Soft -Decoding Reed -Solomon Codes
Finally, the applicability of soft-decoding for disk-drive applications is studied. Based on performance improvements and complexity requirements, generalized minimum distance decoding with maximum a priori soft-detection is selected, and the corresponding architecture is developed. The generalized …
-
Subspace polynomials and list decoding of Reed-Solomon codes
… 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 …
-
Optimizing a Reed-Solomon decoder for the Texas Instruments TMS320C62x DSP
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science; and, Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
-
Complete VLSI implementation of improved low complexity chase Reed-Solomon decoders
… improved low complexity chase (LCC) decoders for Reed-Solomon (RS) codes. This is the first attempt in published research that implements LCC decoders at the circuit level. Based on the joint algorithm research with University of Hawaii, we propose several new techniques for complexity reduction …
-
On Decoding Reed -Solomon Codes Up to and Beyond the Packing Radii
The (24, 12, 8) binary Golay code is proved to be a subfield subcode of a code constructed on the Klein quartic over GF(2 3).
-
Multiple layered Reed-Solomon codes in audio disks with a feedback system
… study the performance of powerful multilayered Reed-Solomon error-correcting coding applied to audio disks to protect data from errors. A detailed analysis of the performance of four layers of Reed-Solomon coding is addressed in presence of burst errors. The application of Reed-Solomon coding in …
-
High-level synthesis and its application in the design of Reed-Solomon decoders
… study for such a design is versatile time-domain Reed-Solomon RS(n,k) decoders. The structure of the time-domain RS decoder is simple and modular which makes it fit for VLSI implementation. The first part of the thesis studies HLS and introduces a Computer-Aided-Design (CAD) tool which can be used …
-
Performance analysis of the Link-16/JTIDS waveform with concatenated coding, soft decision Reed Solomon decoding and noise-normalization
… spread spectrum system that employs a (31, 15) Reed-Solomon (RS) code for forward error correction coding. In this thesis, an alternative error correction coding scheme that uses concatenated coding with a (31, k) RS inner code and a rate 4/5 convolutional outer code is considered. In addition, …
-
The application of forward error correction techniques in wireless ATM
… were considered : 1. A stand alone fixed rate Reed-Solomon encoder/decoder with automatic repeat request. 2. A concatenated Reed-Solomon, convolution encoder/decoder with automatic request and convolution interleaving for the convolution codec. 3. A dynamic rate encoder/decoder using either a …
-
Error and erasure decoding for a CDPD system
… shift keying (GMSK) as a modulation scheme and a Reed-Solomon code for error control to transmit high-quality data in the mobile and wireless environment. Most current CDPD receivers use errors only decoding of the Reed-Solomon code, although an improved errors and erasures decoding technique …
-
New error correcting codes from lifting
… Historically, low-degree polynomials (the Reed-Muller code) have been the locally testable code of choice. Recently, "affine-invariant" codes have come under focus as providing potential for new and improved codes. In this thesis, we exploit a natural algebraic operation known as "lifting" …
-
Coding performance on satellite channels using AX.25 protocol
… of the (7,4) Hamming code, (23,12) Golay code, Reed-Solomon, RS , codes over the Galois fields of 16, GF(16), and 256, GF(256), elements, and common rate convolutional codes of various constraint lengths. The codes are evaluated on three primary criteria, which include: throughput vs. input bit …
-
Coding performance on the AX.25 radio packet
… of various BCH codes, the (23,12) Golay code, Reed-Solomon codes, and different rate convolutional codes with varying constraint lengths when used in conjunction with the go-back-N ARQ. Code combining and concatenation are also studied. The performance of these codes is based on throughput …
-
Improved error control techniques for data transmission
… Soft-decision maximum-likelihood decoding of Reed-Solomon codes can be obtained by using the Viterbi algorithm over a suitable trellis. Two-stage decoding of Reed-Solomon codes is presented. It is an algorithm by which near-optimum performance may be achieved with a complexity lower than the …
-
Practical considerations in the design of cellular digital packet data (CDPD) equipment
… Shift Keying (GMSK), and a detailed analysis of Reed-Solomon error correction codes.
-
Virtual matched filtering : a new hybrid CDMA code acquisition technique under Doppler and higher loads
… namely, concatenated short signature coding, Reed Solomon adaptive error/erasure decoding, and pipelining to provide the minimum possible acquisition time in severe overload CDMA and carrier offsets conditions. The overall implementation is equivalent to a very long physical matched filter but …
-
Repairing Cartesian Codes with Linear Exact Repair Schemes
… research has studied theexact repair problem for Reed-Solomon codes. We focus on Cartesian codes, and show wecan enact the recovery using a linear exact repair scheme framework, similar to the oneoutlined by Guruswami and Wooters in 2017.
Page 1 of 3