Deep Space Network turbo decoder implementation
Explore the source record for details and available documents.
turbo decoder turbo code↗
SEARCH · Search NASA
Results for “Decoding”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Herative Decoding of Serially Concatenated Codes with Interleavers and Comparison with Turbo Codes
A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codewords bits, and an inner encoder whose input words are the permuted outer codewords.
low-complexity iterative decoding simulation compa↗
Continuous MAP Algorithms and Their Applications to Decode Parallel and Serial Code Concatenations
Concatenated coding schemes with interleavers consist of the combination of two simple constituent encoders and an interleaver. The parallel concatenation known as.
algorithms decoding parallel code concatenations s↗
Enhanced Decoding for the Galileo Low-Gain Antenna Mission
Explore the source record for details and available documents.
coding system Reed-Solomon outer code Viterbi deco↗
Turbo Codes and Turbo Decoders for Deep Space Communication
Explore the source record for details and available documents.
coding turbo codes deep space iterative decoders↗
Self-Concatenated Trellis Coded Modulation With Self-Iterative Decoding
Self-concatenated trellis coded modulation with b(q-1) interleavers is a concatenated coded scheme based on only one rate bq/n convolutional code.
Self-Concatenated trellis coded iterative decoding↗
Trellis Decoding Complexity of Linear Block Codes
We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity. The domain of optimization may be different permutations of the same code, or different codes with the same parameters. Constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code, are used to derive bounds on complexity. We define a partial ordering on trellises: if a trellis is optimum with respect to this partial ordering, it has the desirable property that it simultaneously minimizes all of the complexity measures examined. We examine properties of such optimal trellises and give examples of optimal permutations of codes, most notably the (48,24,12) quadratic residue code.
trellis decoding↗
Deep Space Network turbo decoder implementation
Explore the source record for details and available documents.
Turbo codes↗
Deep Space Network turbo decoder implementation
Explore the source record for details and available documents.
turbo code↗
Deep Space Network turbo decoder implementation
Explore the source record for details and available documents.
turbo decoders↗
Serial Concatenation of Interleaved Codes: Performance Analysis, Design and Iterative Decoding
A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer code words bits, and an inner encoder whose input words are the permuted outer code words.
concatenated↗
Decoder Synchronization for Deep Space Missions
The Consultative committee for Space Data STandards (CCSDS) recommends that space communication links employ a concatenated error-correcting channel-coding system in which the inner code is a convolutional (7, 2/2) code and the outer code is a (255,223) Reed-Solomon code.
Decoder↗
Decoding Optical Data with Machine Learning
Explore the source record for details and available documents.
Jie Fang↗
A SHANNON-RACK DECODER FOR A DIGITAL SERVOMECHANISM
Explore the source record for details and available documents.
Mergler, H. W.↗
Digital decoder for phase-delay coded data
Coded or modulated digital data converts to nonreturn to zero /NRZ/ data. Technique includes logic implementation and pertinent timing diagrams. Demodulation to NRZ facilitates digital logic operations on incoming data. Phase-delay modulation has advantage of inherent self-timing not present in NRZ modulation.
Lewin, J.↗
A parametric study of the complexity of sequential decoders, volume 2
Plots are presented of complexity versus required signal energy per bit/single-sided noise spectral density to obtain an output probability of error per bit of 0.0001 for an ideal coherent PSK demodulation. Transfer function of convolutional codes and techniques of branch and reference phase synchronization are considered.
Huth, G. K.↗