Search NASA⌕ Search

SEARCH · Search NASA

Results for “convolutional”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

Fast polynomial transform and its implementation by computer

A fast polynomial transform (FPT) algorithm for computing two-dimensional cyclic convolutions on a general-purpose computer is demonstrated and compared with the FFT approach. An FPT program for two-dimensional convolutions written in FORTRAN is shown to be 20% faster than the conventional FFT algorithm. This higher speed advantage makes the FPT algorithm a candidate for many two-dimensional digital image filtering applications.

Reed, I. S.↗
NASA NTRS1981

Alternative methods to smooth the Earth's gravity field

Convolutions on the sphere with corresponding convolution theorems are developed for one and two dimensional functions. Some of these results are used in a study of isotropic smoothing operators or filters. Well known filters in Fourier spectral analysis, such as the rectangular, Gaussian, and Hanning filters, are adapted for data on a sphere. The low-pass filter most often used on gravity data is the rectangular (or Pellinen) filter. However, its spectrum has relatively large sidelobes; and therefore, this filter passes a considerable part of the upper end of the gravity spectrum. The spherical adaptations of the Gaussian and Hanning filters are more efficient in suppressing the high-frequency components of the gravity field since their frequency response functions are strongly field since their frequency response functions are strongly tapered at the high frequencies with no, or small, sidelobes. Formulas are given for practical implementation of these new filters.

Jekeli, C.↗
NASA NTRS1982

A parallel VLSI architecture for a digital filter of arbitrary length using Fermat number transforms

A parallel architecture for computation of the linear convolution of two sequences of arbitrary lengths using the Fermat number transform (FNT) is described. In particular a pipeline structure is designed to compute a 128-point FNT. In this FNT, only additions and bit rotations are required. A standard barrel shifter circuit is modified so that it performs the required bit rotation operation. The overlap-save method is generalized for the FNT to compute a linear convolution of arbitrary length. A parallel architecture is developed to realize this type of overlap-save method using one FNT and several inverse FNTs of 128 points. The generalized overlap save method alleviates the usual dynamic range limitation in FNTs of long transform lengths. Its architecture is regular, simple, and expandable, and therefore naturally suitable for VLSI implementation.

Truong, T. K.↗
NASA NTRS1981

Capacity, cutoff rate, and coding for a direct-detection optical channel

It is shown that when Pierce's pulse-position modulation scheme with 2 to the L power positions (where L is some positive integer) is used on a self-noise-limited direct-detection optical communication channel, there results a (2 to the L power)-ary erasure channel that is equivalent to the parallel combination of L completely correlated binary erasure channels. The capacity of the full channel is the sum of the capacities of the component channels, but the cutoff rate of the full channel is shown to be much smaller than the sum of the cutoff rates. An interpretation of the cutoff rate is given that suggests a complexity advantage in coding separately on the component channels. It is shown that if short-constraint length convolutional codes with Viterbi decoders are used on the component channels, then the performance and complexity compare favorably with the Reed-Solomon coding system proposed by McEliece (1979) for the full channel. The reasons for this unexpectedly fine performance by the convolutional code system are explored in detail, as are various facets of the channel structure.

Massey, J. L.↗
NASA NTRS1980

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

In connection with attempts to achieve very low error probabilities, Odenwalder (1970) proposed a concatenated coding system using the Viterbi-decoded convolutional codes as the inner code and Reed-Solomon (RS) codes as the outer code. Analytical and experimental results are presented concerning the effects of the receiver tracking phase error on the performance of the concatenated RS/Viterbi channel coding system. On the basis of these results it is concluded that certain problems regarding communication operations on deep-space missions can be alleviated by employing the RS/Viterbi coding system. In one-way communication, an employment of RS/Viterbi coding will also provide greater data protection than the Viterbi-decoded convolutional-only coding system.

Liu, K. Y.↗
NASA NTRS1982

Viterbi decoder node synchronization losses in the Reed-Solomon/Veterbi concatenated channel

The Viterbi decoders currently used by the Deep Space Network (DSN) employ an algorithm for maintaining node synchronization that significantly degrades at bit signal-to-noise ratios (SNRs) of below 2.0 dB. In a recent report by the authors, it was shown that the telemetry receiving system, which uses a convolutionally encoded downlink, will suffer losses of 0.85 dB and 1.25 dB respectively at Voyager 2 Uranus and Neptune encounters. This report extends the results of that study to a concatenated (255,223) Reed-Solomon/(7, 1/2) convolutionally coded channel, by developing a new radio loss model for the concatenated channel. It is shown here that losses due to improper node synchronization of 0.57 dB at Uranus and 1.0 dB at Neptune can be expected if concatenated coding is used along with an array of one 64-meter and three 34-meter antennas.

Deutsch, L. J.↗
NASA NTRS1985

Parallel VLSI Architecture

Fermat number transformation convolutes two digital data sequences. Very-large-scale integration (VLSI) applications, such as image and radar signal processing, X-ray reconstruction, and spectrum shaping, linear convolution of two digital data sequences of arbitrary lenghts accomplished using Fermat number transform (ENT).

Truong, T. K.↗
NASA NTRS1983

LANDSAT-4 thematic mapper Modulation Transfer Function (MTF) evaluation

A power spectrum (PS) analysis technique was used to compare thematic mapper (TM) A and P-tape data for a Washington, DC scene in two orthogonal directions, along scan and along track. The resulting effective modulation transfer functions (MTF) between the A and P data are repeatable from area to area and consistent with theoretical expectations. The average x-direction (along scan) MTF calculated with the PS technique is compared to the MTF of the cubic convolution resampling function used to create P data from A data. The two curves are nearly identical, indicating that the major factor affecting the image quality of P data relative to A data is the cubic convolution resampling.

Schowengerdt, R.↗
NASA NTRS1983

Relationship of strength of turbulence to received power

Because of contributions due to reflection, the determination of the turbulence refractive index structure constant may be affected. For pure scattering from turbulence in the inertial subrange, the radar echo power can be used to calculate the refractive index structure constant. The radar power is determined by a convolution integral. If the antenna beam is swung to sufficiently large off-zenith angles ( 12.5 deg) so that a quasi-isotropic response from the tail ends of the Gaussian angular distribution can be anticipated, the evaluation of the convolution integral depends only on the known antenna pattern of the radar. This procedure, swinging the radar beam to attenuate the reflected component, may be called angular or direction filtering. The tilted antenna also may be pick up reflected components from near the zenith through the sidelobes. This can be tested by the evaluation of the correlation function. This method applies a time domain filtering of the intensity time series but needs a very careful selection of the high pass filters.

Rottger, J.↗
NASA NTRS1984

Analysis of a Coded, M-ary Orthogonal Input Optical Channel with Random-gain Photomultiplier Detection

Performance of two coding systems is analyzed for a noisy optical channel with M(=2(L)-ary orthogonal signaling and random gain photomultiplier detection. The considered coding systems are the Reed Solomon (RS) coding with error only correction decoding and the interleaved binary convolutional system with soft decision Viterbi decoding. The required average number of received signal photons per information bit, N sub b, for a desired bit error of 0.000001 is found for a set of commonly used parameters and with a high background noise level. We find that the interleaved binary convolutional coding system is preferable to the RS coding system in performance complexity tradeoffs.

Lee, P. J.↗
NASA NTRS1985

Review of image processing fundamentals

Image processing through convolution, transform coding, spatial frequency alterations, sampling, and interpolation are considered. It is postulated that convolution in one domain (real or frequency) is equivalent to multiplication in the other (frequency or real), and that the relative amplitudes of the Fourier components must be retained to reproduce any waveshape. It is suggested that all digital systems may be considered equivalent, with a frequency content approximately at the Nyquist limit, and with a Gaussian frequency response. An optimized cubic version of the interpolation continuum image is derived as a set of cubic spines. Pixel replication has been employed to enlarge the visable area of digital samples, however, suitable elimination of the extraneous high frequencies involved in the visable edges, by defocusing, is necessary to allow the underlying object represented by the data values to be seen.

Billingsley, F. C.↗
NASA NTRS1985

Texture classification by local rank correlation

A new approach to texture classification based on local rank correlation is proposed here. Its performance is compared with Laws' method which uses local convolution with feature masks. In the experiments, texture samples are classified based on their distribution of local statistics, either rank correlations or convolutions. The new method achieves generally optimal classification rates. It appears to be more robust because local order statistics are unaffected by local sample differences due to monotonic shifts of texture gray values and are less sensitive to noise.

Harwood, D.↗
NASA NTRS1987

Maximum-Likelihood Decoder on a Hypercube Multiprocessor

Efficient parallel processing used to implement complex decoders. Hypercube multiprocessor connection scheme practical to decode long convolutional codes with efficient use of hardware. Hypercube design reduces both communication time among processors and space needed for interconnection. Decoding concept applicable to concurrent processing of digital signals using convolutional codes for error correction.

Pollara, F.↗
NASA NTRS1987

Nonlinear filter design

A technique for identifying nonlinear systems was introduced, beginning with a single input-single output system. Assuming the system is initially at rest, the first kernel (first convolution integral in the continuous case or first convolution sum in the discrete case) was calculated. A controllable and observable linear realization was then obtained in a particular canonical form. The actual nonlinear system was probed with an appropriate input (or inputs) and the output (or outputs) determined. For the linear system, the input was computed that produces the same output. In the difference between the inputs to the nonlinear and linear systems, basic information was found about the nonlinear system. There is an interesting class of nonlinear systems for which this type of identification scheme should prove to be accurate.

Hunt, L. R.↗
NASA NTRS1986

Combined coding and delay-throughput analysis for fading channels of mobile satellite communications

This paper presents the analysis of using the punctured convolutional code with Viterbi decoding to improve communications reliability. The punctured code rate is optimized so that the average delay is minimized. The coding gain in terms of the message delay is also defined. Since using punctured convolutional code with interleaving is still inadequate to combat the severe fading for short packets, the use of multiple copies of assignment and acknowledgment packets is suggested. The performance on the average end-to-end delay of this protocol is analyzed. It is shown that a replication of three copies for both assignment packets and acknowledgment packets is optimum for the cases considered.

Wang, C. C.↗
NASA NTRS1988

Development of a coded 16-ary CPFSK coherent demodulator

Theory and hardware are described for a proof-of-concept 16-ary continuous phase frequency shift keying (16-CPFSK) digital modem. The 16 frequencies are spaced every 1/16th baud rate for 2 bits/sec/Hz operation. Overall rate 3/4 convolutional coding is incorporated. The demodulator differs significantly from typical quadrature phase detector approaches in that phase is coherently measured by processing the baseband output of a frequency discriminator. Baud rate phase samples from the baseband processor are decoded to yield the original data stream. The method of encoding onto the 16-ary phase nodes, together with convolutional coding gain, results in near quad PSK (QPSK) performance. The modulated signal is of constant envelope; thus the power amplifier can be saturated for peak performance. The spectrum is inherently bandlimited and requires no RF filter.

Clarke, Ken↗
NASA NTRS1987

New coding advances for deep space communications

Advances made in error-correction coding for deep space communications are described. The code believed to be the best is a (15, 1/6) convolutional code, with maximum likelihood decoding; when it is concatenated with a 10-bit Reed-Solomon code, it achieves a bit error rate of 10 to the -6th, at a bit SNR of 0.42 dB. This code outperforms the Voyager code by 2.11 dB. The use of source statics in decoding convolutionally encoded Voyager images from the Uranus encounter is investigated, and it is found that a 2 dB decoding gain can be achieved.

Yuen, Joseph H.↗
NASA NTRS1988

Node synchronization of viterbi decoders using state metrics

The concept of node synchronization using state metrics is investigated. The branch metrics are integrated over a fixed time interval and the results are compared to the detection threshold. If the threshold is exceeded, the out-of-sync hypothesis is accepted; otherwise, the in-sync hypothesis is accepted. It is shown that the detection threshold can be chosen independent of any particular convolutional code with fixed code rate and constant length if the code has reasonably good bit error rate performance. Three node synchronization schemes are compared: (1) a scheme using the syndrome; (2) a scheme using the frame-sync patterns; and (3) a scheme using the state metrics. At very low signal to noise ratios (SNR), scheme 2 can be faster than scheme 1. For Voyager's rate 1/2 and constraint length 7 convolutional code, this happens for SNRs of less than 0.7 dB. This result is obtained by assuming that the code frame-sync pattern has good aperiodic autocorrelation properties. For a fixed false alarm probability, the sequential detection scheme based on the syndrome is faster than scheme 3 with fixed integration time. A sequential detection technique is needed to improve the speed of scheme 3.

Cheng, U.↗