Search NASASearch

SEARCH · Search NASA

Results for “convolutional interleaver”

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.

At least 55 records · Page 3

The Composite Analytic and Simulation Package or RFI (CASPR) on a coded channel

CASPR is an analysis package which determines the performance of a coded signal in the presence of Radio Frequency Interference (RFI) and Additive White Gaussian Noise (AWGN). It can analyze a system with convolutional coding, Reed-Solomon (RS) coding, or a concatenation of the two. The signals can either be interleaved or non-interleaved. The model measures the system performance in terms of either the E(sub b)/N(sub 0) required to achieve a given Bit Error Rate (BER) or the BER needed for a constant E(sub b)/N(sub 0).

Freedman, Jeff

A LANDSAT digital image rectification system

DIRS is a digital image rectification system for the geometric correction of LANDSAT multispectral scanner digital image data. DIRS removes spatial distortions from the data and brings it into conformance with the Universal Transverse Mercator (UTM) map projection. Scene data in the form of landmarks are used to drive the geometric correction algorithms. Two dimensional least squares polynominal and spacecraft attitude modeling techniques for geometric mapping are provided. Entire scenes or selected quadrilaterals may be rectified. Resampling through nearest neighbor or cubic convolution at user designated intervals is available. The output products are in the form of digital tape in band interleaved, single band or CCT format in a rotated UTM projection. The system was designed and implemented on large scale IBM 360 computers.

Vanwie, P.

A Landsat Digital Image Rectification System

DIRS is a Digital Image Rectification System for the geometric correction of Landsat Multispectral Scanner digital image data. DIRS removes spatial distortions from the data and brings it into conformance with the Universal Transverse Mercator (UTM) map projection. Scene data in the form of landmarks or Ground Control Points (GCPs) are used to drive the geometric correction algorithms. The system offers extensive capabilities for 'shade printing' to aid in the determination of GCPs. Affine, two dimensional least squares polynominal and spacecraft attitude modeling techniques for geometric mapping are provided. Entire scenes or selected quadralaterals may be rectified. Resampling through nearest neighbor or cubic convolution at user designated intervals is available. The output products are in the form of digital tape in band interleaved, single band or CCT format in a rotated UTM projection. The system was designed and implemented on large scale IBM 360 computers with at least 300-500K bytes of memory for user application programs and five nine track tapes plus direct access storage.

Van Wie, P.

The effects of receiver tracking phase error on the performance of the concatenated Reed-Solomon/Viterbi channel coding system

Analytical and experimental results are presented of the effects of receiver tracking phase error, caused by weak signal conditions on either the uplink or the downlink or both, on the performance of the concatenated Reed-Solomon (RS) Viterbi channel coding system. The test results were obtained under an emulated S band uplink and X band downlink, two way space communication channel in the telecommunication development laboratory of JPL with data rates ranging from 4 kHz to 20 kHz. It is shown that, with ideal interleaving, the concatenated RS/Viterbi coding system is capable of yielding large coding gains at very low bit error probabilities over the Viterbi decoded convolutional only coding system. Results on the effects of receiver tracking phase errors on the performance of the concatenated coding system with antenna array combining are included.

Liu, K. Y.

Interleaver design for trellis-coded differential 8-PSK modulation with non-coherent detection

The effect of finite interleaver size on bit error rate (BER) performance of coded 8-DPSK is determined by means of computer simulations. The losses evaluated in this way include the SNR degradation due to the timing and frequency errors of the symbol synchronizer and the automatic frequency control (AFC) of the receiver. BER measurements are presented using a conventional 2/3 rate convolutional 8-state trellis-code for typical Rayleigh and Rician fading channels. It is shown that for a Rician channel with a Rician parameter of 7 dB, a Doppler spread of 100 Hz and a data rate of 2400 bps, an interleaver with size 16 x 16 symbols performs nearly as well as a very large interleaver. It is also shown that for very fast Rayleigh channels, the BER-curves flatten out at large SNR.

Edbauer, Franz

Interleaved block codes for the photon channel

It is shown that interleavel binary block codes combined with pulse position modulation give the best practical coded systems yet devised for optical communication with photon detection. Linear block codes rather than convolutional codes are considered.

Mceliece, R. J.

Performance of DPSK with convolutional encoding on time-varying fading channels

The bit error probability performance of a differentially-coherent phase-shift keyed (DPSK) modem with convolutional encoding and Viterbi decoding on time-varying fading channels is examined. Both the Rician and the lognormal channels are considered. Bit error probability upper bounds on fully-interleaved (zero-memory) fading channels are derived and substantiated by computer simulation. It is shown that the resulting coded system performance is a relatively insensitive function of the choice of channel model provided that the channel parameters are related according to the correspondence developed as part of this paper. Finally, a comparison of DPSK with a number of other modulation strategies is provided.

Mui, S. Y.

Error control techniques for satellite and space communications

The performance anlaysis of NASA's telecommand systems was summarized. It is assumed that the decoded frames are scrambled prior to decoding by the outer code. The average decoded bit error rate are examined which allows the possibility of evaluating many different frame coding options. The capacity and cutoff rate of the outer channel formed by the combination of the actual physical channel and the inner encoder and decoder in a concatenated coding system were analyzed. The best combination of inner and outer codes to use in a concatenated coding system were determined. It was established that in general: (1) it is better not to interleave between the inner and outer codes; and (2) for a fixed overall code rate, it is better to use higher rate inner codes and lower rate outer codes. Inner convolutional codes are considered. The analysis is more difficult in this case because the inner decoder error events do not appear in blocks of fixed length but can be of many different lengths.

Costello, D. J., Jr.

A VLSI single chip (255,223) Reed-Solomon encoder with interleaver

A single-chip implementation of a Reed-Solomon encoder with interleaving capability is described. The code used was adapted by the CCSDS (Consulative Committee on Space Data Systems). It forms the outer code of the NASA standard concatenated coding system which includes a convolutional inner code of rate 1/2 and constraint length 7. The architecture, leading to this single VLSI chip design, makes use of a bit-serial finite field multiplication algorithm due to E.R. Berlekamp.

Hsu, I. S.

Performance of concatenated codes using 8-bit and 10-bit Reed-Solomon codes

The performance improvement of concatenated coding systems using 10-bit instead of 8-bit Reed-Solomon codes is measured by simulation. Three inner convolutional codes are considered: (7,1/2), (15,1/4), and (15,1/6). It is shown that approximately 0.2 dB can be gained at a bit error rate of 10(-6). The loss due to nonideal interleaving is also evaluated. Performance comparisons at very low bit error rates may be relevant for systems using data compression.

Pollara, F.

Separable concatenated codes with iterative map decoding for Rician fading channels

Very efficient signalling in radio channels requires the design of very powerful codes having special structure suitable for practical decoding schemes. In this paper, powerful codes are obtained by combining comparatively simple convolutional codes to form multi-tiered 'separable' convolutional codes. The decoding of these codes, using separable symbol-by-symbol maximum a posteriori (MAP) 'filters', is described. It is known that this approach yields impressive results in non-fading additive white Gaussian noise channels. Interleaving is an inherent part of the code construction, and consequently, these codes are well suited for fading channel communications. Here, simulation results for communications over Rician fading channels are presented to support this claim.

Lodge, J. H.

Improving the performance of soft decision Viterbi decoding in a non-Gaussian environment through non-linear quantization

The performance of Viterbi decoding in a non-Gaussian environment is investigated using a nonlinear quantization strategy. The channel model consists of a convolutionally encoded BPSK signal transmitted to a satellite where it is corrupted with additive white Gaussian noise and pulsed radio frequency interference (RFI). The resultant signal is then passed through a satellite nonlinearity and transmitted to a ground station where it is coherently detected. Interleaving is assumed in order to make the channel memoryless. The presence of RFI makes the channel statistics non-Gaussian, leading to a nonlinear log-likelihood function. A near optimum quantization scheme is found by maximizing a channel parameter, or by matching the quantizer to the log-likelihood function in a mean square error sense. Bit error rate performance improvement is achieved by using such nonlinear quantization.

Mcgregor, D. N.

The use of interleaving for reducing noisy reference loss in trellis-coded modulation systems

The use of interleaving/deinterleaving in trellis-coded modulation systems to reduce the SNR loss due to imperfect carrier demodulation references is demonstrated. Both the discrete carrier (phase-locked loop) and the suppressed carrier (Costas loop) cases are considered, and the differences between the two are clearly demonstrated by numerical results. The special case of convolutional codes is also treated and illustrated with an example of practical interest.

Divsalar, Dariush

Convolutional code performance in planetary entry channels

The planetary entry channel is modeled for communication purposes representing turbulent atmospheric scattering effects. The performance of short and long constraint length convolutional codes is investigated in conjunction with coherent BPSK modulation and Viterbi maximum likelihood decoding. Algorithms for sequential decoding are studied in terms of computation and/or storage requirements as a function of the fading channel parameters. The performance of the coded coherent BPSK system is compared with the coded incoherent MFSK system. Results indicate that: some degree of interleaving is required to combat time correlated fading of channel; only modest amounts of interleaving are required to approach performance of memoryless channel; additional propagational results are required on the phase perturbation process; and the incoherent MFSK system is superior when phase tracking errors are considered.

Modestino, J. W.

Field-Programmable Gate Array Implementation of a Single Photon-Counting Receive Modem

We present a field-programmable gate array (FPGA) implementation of a single photon-counting receive modem for a pulse position modulated signal. The modem is compliant with the Consultative Committee for Space Data Systems (CCSDS) High Photon Efficiency (HPE) Optical Communications Coding and Synchronization standard and is capable of a maximum data rate of 267 Mbps. The system is designed on a commercial off-the-shelf FPGA platform and utilizes superconducting nanowire single photon counting detectors, analog to digital converters (ADC s) to sample the detectors, and two FPGAs. Symbol timing recovery, photon counting, convolutional deinterleaving, and codeword synchronization areis performed in the first FPGA. The second FPGA performs iterative decoding on each codeword of the serially concatenated pulse position modulated (SCPPM) signal. A digital filter is included to compensate for timing jitter of the detector, and the decoder throughput can be modified adjusted through reconfigurable parallelization. The decoder also implements a resource-efficient, algorithmic polynomial interleaver and deinterleaver. Both FPGAs can be reconfigured to switch between pulse position modulation (PPM)-16 and PPM-32 with code rates 1/3, 1/2, and 2/3. In this paper, we describe the receiver architecture and FPGA implementation of the timing recovery loop and SCPPM decoder, FPGA utilization for the different modes, and receive modem characterization test results.

Field-programmable Gate Array

Investigation of Near Shannon Limit Coding Schemes

Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simulations. There are three sections in this report. First section is the introduction. The fundamental knowledge about coding, block coding and convolutional coding is discussed. In the second section, the basic concepts of convolutional turbo codes are introduced and the performance of turbo codes, especially high rate turbo codes, is provided from the simulation results. After introducing all the parameters that help turbo codes achieve such a good performance, it is concluded that output weight distribution should be the main consideration in designing turbo codes. Based on the output weight distribution, the performance bounds for turbo codes are given. Then, the relationships between the output weight distribution and the factors like generator polynomial, interleaver and puncturing pattern are examined. The criterion for the best selection of system components is provided. The puncturing pattern algorithm is discussed in detail. Different puncturing patterns are compared for each high rate. For most of the high rate codes, the puncturing pattern does not show any significant effect on the code performance if pseudo - random interleaver is used in the system. For some special rate codes with poor performance, an alternative puncturing algorithm is designed which restores their performance close to the Shannon limit. Finally, in section three, for iterative decoding of block codes, the method of building trellis for block codes, the structure of the iterative decoding system and the calculation of extrinsic values are discussed.

Kwatra, S. C.

Convolutional code performance in the Rician fading channel

The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of E sub b/N sub 0 parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.

Modestino, J. W.

Optimizations of a Hardware Decoder for Deep-Space Optical Communications

The National Aeronautics and Space Administration has developed a capacity approaching modulation and coding scheme that comprises a serial concatenation of an inner accumulate pulse-position modulation (PPM) and an outer convolutional code [or serially concatenated PPM (SCPPM)] for deep-space optical communications. Decoding of this code uses the turbo principle. However, due to the nonbinary property of SCPPM, a straightforward application of classical turbo decoding is very inefficient. Here, we present various optimizations applicable in hardware implementation of the SCPPM decoder. More specifically, we feature a Super Gamma computation to efficiently handle parallel trellis edges, a pipeline-friendly 'maxstar top-2' circuit that reduces the max-only approximation penalty, a low-latency cyclic redundancy check circuit for window-based decoders, and a high-speed algorithmic polynomial interleaver that leads to memory savings. Using the featured optimizations, we implement a 6.72 megabits-per-second (Mbps) SCPPM decoder on a single field-programmable gate array (FPGA). Compared to the current data rate of 256 kilobits per second from Mars, the SCPPM coded scheme represents a throughput increase of more than twenty-six fold. Extension to a 50-Mbps decoder on a board with multiple FPGAs follows naturally. We show through hardware simulations that the SCPPM coded system can operate within 1 dB of the Shannon capacity at nominal operating conditions.

quadratic polynomial interleaver