Search NASA⌕ Search

SEARCH · Search NASA

Results for “bit”

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 469 records · Page 26

Shuttle orbiter Ku-band radar/communications system design evaluation. Ku band bent-pipe channel performance evaluation

Because of difficulties with the bit detector of the SPA mode 1 channel 3 input port, a new bit synchronizer was required. The two prime candidate designs are described and analyzed. The selected design is a modification of one which utilizes a phase frequency detector to track the received data clock frequency and a mid-bit transition point sample detector to generate a bit timing error (phase error) signal to control the relative phase between the local clock and the local data stream. The model used to calculate the effects of cable attenuation and rise time degradation is discussed.

Holmes, J. K.↗

The Jet Propulsion Laboratory/California Institute of Technology block 2 VLBI processor

A multistation, multichannel cross correlation processor using the 250 k bit to 4 M bit recording format is discussed. The design is modular, using bit sliced microprocessors to perform the routine calculations for phase and delay on a per station basis, as well as for fractional bit shift correction and Fourier transformation of the correlation coefficients on a per baseline basis.

Rogtad, D. H.↗

Minimizing pattern effects in semiconductor lasers at high rate pulse modulation

This paper deals with analytical and experimental work related to modulation of a semiconductor laser used in high bit rate communication. The approach is based upon minimizing the charge storage effect by a proper choice of the area of the modulating pulses and the bias current. The concept of using additional current pulses to probe for variations in electron density between pulses is investigated. The primary limitation on bit rate is found to be the ability to generate laser drive pulses free of ringing or similar transients. This and the 300 ps pulsewidth, an experimental constraint, limit the bit rate to about 1 Gbit/s. However, by using this approach it appears that bit rates considerably higher than 2 Gbits/s could be reached with sufficiently accurate control of drive pulse shape. It is found that the laser bias and the current pulse area had to be controlled within 1 percent and 10 percent, respectively.

Torphammar, P.↗

A generalized formulation of minimum shift keying modulation

The modulator structure consisting of a single-input two-output sequential transducer whose output sequences control the modulated signal in the manner s(t) = x(i)p(t) + y(i)q(t) is considered. Here, iT is less than or equal to t, which is less than iT + T, where T is the modulation bit duration and where x(i) and y(i) take values in /+1, -1, 0/. The behavior of a sequential transducer is characterized by means of a 'trellis'. It is shown that, provided only that the 'carriers' p(t) and q(t) have the same energy in every bit interval, the optimum demodulator for the additive white Gaussian noise channel need process the received signal over only two bit intervals in making each data bit decision. It is demonstrated that particular choices of the sequential transducer yield differential minimum shift keying and differential staggered quadriphase shift keying. Possible generalizations of this approach are discussed.

Massey, J. L.↗

Video framerate, resolution and grayscale tradeoffs for undersea telemanipulator

The product of Frame Rate (F) in frames per second, Resolution (R) in total pixels and grayscale in bits (G) equals the transmission band rate in bits per second. Thus for a fixed channel capacity there are tradeoffs between F, R and G in the actual sampling of the picture for a particular manual control task in the present case remote undersea manipulation. A manipulator was used in the MASTER/SLAVE mode to study these tradeoffs. Images were systematically degraded from 28 frames per second, 128 x 128 pixels and 16 levels (4 bits) grayscale, with various FRG combinations constructed from a real-time digitized (charge-injection) video camera. It was found that frame rate, resolution and grayscale could be independently reduced without preventing the operator from accomplishing his/her task. Threshold points were found beyond which degradation would prevent any successful performance. A general conclusion is that a well trained operator can perform familiar remote manipulator tasks with a considerably degrade picture, down to 50 K bits/ sec.

Ranadive, V.↗

Performance of quadrature overlapped raised-cosine modulation over nonlinear satellite channels

This paper considers the performance evaluation of Staggered Quadrature Overlapped Raised Cosine (SQORC) signal transmission through wideband nonlinear satellite channels in the presence of uplink and downlink additive Gaussian noise. Expressions for the bit error rate are derived for a general transponder model with AM-AM and AM-PM conversion. It is shown that the bit error rate of SQORC is one-half of the sum of the bit error rate of MSK at 2/3 of the uplink signal-to-noise ratio and the bit error rate of Quadriphase Phase-Shift Keying QPSK at 4/3 of the uplink signal-to-noise ratio, whereas the spectrum of SQROC is the product of MSK and QPSK spectra. Numerical results are presented for a transponder which is modelled as a hard limiter.

Divsalar, D.↗

Massively parallel processor computer

An apparatus for processing multidimensional data with strong spatial characteristics, such as raw image data, characterized by a large number of parallel data streams in an ordered array is described. It comprises a large number (e.g., 16,384 in a 128 x 128 array) of parallel processing elements operating simultaneously and independently on single bit slices of a corresponding array of incoming data streams under control of a single set of instructions. Each of the processing elements comprises a bidirectional data bus in communication with a register for storing single bit slices together with a random access memory unit and associated circuitry, including a binary counter/shift register device, for performing logical and arithmetical computations on the bit slices, and an I/O unit for interfacing the bidirectional data bus with the data stream source. The massively parallel processor architecture enables very high speed processing of large amounts of ordered parallel data, including spatial translation by shifting or sliding of bits vertically or horizontally to neighboring processing elements.

Fung, L. W.↗

Digital Ratiometer

Small, low-cost comparator with 24-bit-precision yields ratio signal from pair of analog or digital input signals. Arithmetic logic chips (bit-slice) sample two 24-bit analog-to-digital converters approximately once every millisecond and accumulate them in two 24-bit registers. Approach readily modified to arbitrary precision.

Beer, R.↗

Navier-Stokes Simulation of Homogeneous Turbulence on the CYBER 205

A computer code which solves the Navier-Stokes equations for three dimensional, time-dependent, homogenous turbulence has been written for the CYBER 205. The code has options for both 64-bit and 32-bit arithmetic. With 32-bit computation, mesh sizes up to 64 (3) are contained within core of a 2 million 64-bit word memory. Computer speed timing runs were made for various vector lengths up to 6144. With this code, speeds a little over 100 Mflops have been achieved on a 2-pipe CYBER 205. Several problems encountered in the coding are discussed.

Wu, C. T.↗

Postprocessing for the UCLA climate model

Postprocessing programs written to analyze the results of a general circulation model are described. The model history data is interpolated to pressure surfaces, converted from 64-bit Cyber words to 32 bit IBM words, and transferred to tape for further analysis. The time average program reads the interpolation output tape and produces 15-day time averages. The model outputs a very detailed record for selected grid points. This data is sent to a tape in Cyber full words. The conversion program changes the format of the tape from 64 bit Cyber words to 32 bit IBM words, processing a month of data at a time. The grid-point history sorting program inputs the converted grid point history tape and sorts it by time. The end product is a tape with a time history of each field for every point. After the PBP data has been stored, it can be plotted. The plotting package is flexible, and allows the choice of fields and grid points. The one-dimensional fields are plotted as functions of time, and a daily summary is also produced. For the two-dimensional fields, time-height cross sections and daily summaries are produced. The model plotting package produces plots for all fields on the time average and pressure tapes. These plots include world maps, polar projections, zonal means, vectors, streamlines, and latitude-height plots.

Abeles, J.↗

Optimum Cyclic Redundancy Codes for Noisy Channels

Capabilities and limitations of cyclic redundancy codes (CRC's) for detecting transmission errors in data sent over relatively noisy channels (e.g., voice-grade telephone lines or very-high-density storage media) discussed in 16-page report. Due to prevalent use of bytes in multiples of 8 bits data transmission, report primarily concerned with cases in which both block length and number of redundant bits (check bits for use in error detection) included in each block are multiples of 8 bits.

Posner, E. C.↗

The undetected error probability for shortened hamming codes

Hamming or shortened Hamming codes are widely used for error detection in data communications. For example, the CCITT (International Telegraph and Telephone Consultative Committee) recommendation X.25 for packet-switched data networks adopts a distance-4 cyclic Hamming code with 16 parity-check bits for error detection. The natural length of this code is n = 2(15)-1 = 32,767. In practice the length of a data packet is no more than a few thousand bits which is much shorter than the natural length of the code. Consequently, a shortened version of thecode is used. Often the length of a data packet varies, say from a few hundred bits to a few thousand bits, hence the code must be shortened by various degrees. Shortening affects the performance of the code. The error-detection performance of shortened Hamming codes, particularly the codes obtained from the distance-4 Hamming codes adopted by CCITT recommendation X.25, is investigated. A method for computing the probability of an undetected error is presented.

Costello, D. J., Jr.↗

A high-speed digital signal processor for atmospheric radar, part 7.3A

The Model SP-320 device is a monolithic realization of a complex general purpose signal processor, incorporating such features as a 32-bit ALU, a 16-bit x 16-bit combinatorial multiplier, and a 16-bit barrel shifter. The SP-320 is designed to operate as a slave processor to a host general purpose computer in applications such as coherent integration of a radar return signal in multiple ranges, or dedicated FFT processing. Presently available is an I/O module conforming to the Intel Multichannel interface standard; other I/O modules will be designed to meet specific user requirements. The main processor board includes input and output FIFO (First In First Out) memories, both with depths of 4096 W, to permit asynchronous operation between the source of data and the host computer. This design permits burst data rates in excess of 5 MW/s.

Brosnahan, J. W.↗

In search of a 2-dB coding gain

A recent code search found a (15,1/5), a (14,1/6), and a (15,1/6) convolutional code which, when concatenated with a 10-bit (1023,959) Reed-Solomon (RS) code, achieves a bit-error rate (BER) of 0.000001 at a bit signal-to-noise ratio (SNR) of 0.50 dB, 0.47 dB and 0.42 B, respectively. All of these three codes outperform the Voyager communication system, our baseline, which achieves a BER of 10.000001 at bit SNR of 2.53 db, by more than 2 dB. The 2 dB coding improvement goal was exceeded.

Yuen, J. H.↗

A new VLSI architecture for a single-chip-type Reed-Solomon decoder

A new very large scale integration (VLSI) architecture for implementing Reed-Solomon (RS) decoders that can correct both errors and erasures is described. This new architecture implements a Reed-Solomon decoder by using replication of a single VLSI chip. It is anticipated that this single chip type RS decoder approach will save substantial development and production costs. It is estimated that reduction in cost by a factor of four is possible with this new architecture. Furthermore, this Reed-Solomon decoder is programmable between 8 bit and 10 bit symbol sizes. Therefore, both an 8 bit Consultative Committee for Space Data Systems (CCSDS) RS decoder and a 10 bit decoder are obtained at the same time, and when concatenated with a (15,1/6) Viterbi decoder, provide an additional 2.1-dB coding gain.

Hsu, I. S.↗

Synchronization Technique For Reception Of Coded Data

Shortest sequence of bits likely to be filled with error bursts examined. Algorithm improves synchronization of frames of noisy binary-coded data signals after Viterbi decoding (recovery from "inner" convolutional code used in transmission channel) and before Reed-Solomon or other decoding (recovery from "outer" error-correcting block code). Based on comparisons of sequences of correct and erroneous Viterbi-decoded received bits with known marker sequence denoting beginning of frame of data. Does not require count of number of bits in received sequence disagreeing with corresponding bits in marker sequence.

Shahshahani, Mehrdad M.↗

Frame synchronization methods based on channel symbol measurements

The current DSN frame synchronization procedure is based on monitoring the decoded bit stream for the appearance of a sync marker sequence that is transmitted once every data frame. The possibility of obtaining frame synchronization by processing the raw received channel symbols rather than the decoded bits is explored. Performance results are derived for three channel symbol sync methods, and these are compared with results for decoded bit sync methods reported elsewhere. It is shown that each class of methods has advantages or disadvantages under different assumptions on the frame length, the global acquisition strategy, and the desired measure of acquisition timeliness. It is shown that the sync statistics based on decoded bits are superior to the statistics based on channel symbols, if the desired operating region utilizes a probability of miss many orders of magnitude higher than the probability of false alarm. This operating point is applicable for very large frame lengths and minimal frame-to-frame verification strategy. On the other hand, the statistics based on channel symbols are superior if the desired operating point has a miss probability only a few orders of magnitude greater than the false alarm probability. This happens for small frames or when frame-to-frame verifications are required.

Dolinar, S.↗

Floating point arithmetic in future supercomputers

Considerations in the floating-point design of a supercomputer are discussed. Particular attention is given to word size, hardware support for extended precision, format, and accuracy characteristics. These issues are discussed from the perspective of the Numerical Aerodynamic Simulation Systems Division at NASA Ames. The features believed to be most important for a future supercomputer floating-point design include: (1) a 64-bit IEEE floating-point format with 11 exponent bits, 52 mantissa bits, and one sign bit and (2) hardware support for reasonably fast double-precision arithmetic.

Bailey, David H.↗