Search NASASearch

Engineering topics

Wang, C. C.

Publications and source records attributed to Wang, C. C..

At least 19 records

Concept For Generation Of Long Pseudorandom Sequences

Conceptual very-large-scale integrated (VLSI) digital circuit performs exponentiation in finite field. Algorithm that generates unusually long sequences of pseudorandom numbers executed by digital processor that includes such circuits. Concepts particularly advantageous for such applications as spread-spectrum communications, cryptography, and generation of ranging codes, synthetic noise, and test data, where usually desirable to make pseudorandom sequences as long as possible.

Wang, C. C.

Improved Algorithm For Finite-Field Normal-Basis Multipliers

Improved algorithm reduces complexity of calculations that must precede design of Massey-Omura finite-field normal-basis multipliers, used in error-correcting-code equipment and cryptographic devices. Algorithm represents an extension of development reported in "Algorithm To Design Finite-Field Normal-Basis Multipliers" (NPO-17109), NASA Tech Briefs, Vol. 12, No. 5, page 82.

Wang, C. C.

An algorithm to design finite field multipliers using a self-dual normal basis

Finite field multiplication is central in the implementation of some error-correcting coders. Massey and Omura have presented a revolutionary design for multiplication in a finite field. In their design, a normal base is utilized to represent the elements of the field. The concept of using a self-dual normal basis to design the Massey-Omura finite field multiplier is presented. Presented first is an algorithm to locate a self-dual normal basis for GF(2 sup m) for odd m. Then a method to construct the product function for designing the Massey-Omura multiplier is developed. It is shown that the construction of the product function base on a self-dual basis is simpler than that based on an arbitrary normal base.

Wang, C. C.

A generalized algorithm to design finite field normal basis multipliers

Finite field arithmetic logic is central in the implementation of some error-correcting coders and some cryptographic devices. There is a need for good multiplication algorithms which can be easily realized. Massey and Omura recently developed a new multiplication algorithm for finite fields based on a normal basis representation. Using the normal basis representation, the design of the finite field multiplier is simple and regular. The fundamental design of the Massey-Omura multiplier is based on a design of a product function. In this article, a generalized algorithm to locate a normal basis in a field is first presented. Using this normal basis, an algorithm to construct the product function is then developed. This design does not depend on particular characteristics of the generator polynomial of the field.

Wang, C. C.

Multiplier Architecture for Coding Circuits

Multipliers based on new algorithm for Galois-field (GF) arithmetic regular and expandable. Pipeline structures used for computing both multiplications and inverses. Designs suitable for implementation in very-large-scale integrated (VLSI) circuits. This general type of inverter and multiplier architecture especially useful in performing finite-field arithmetic of Reed-Solomon error-correcting codes and of some cryptographic algorithms.

Wang, C. C.

Normal basis of finite field GF(2 super m)

Massey and Omura (1981) recently developed a new multiplication algorithm for Galois fields based on the normal basis representation. This algorithm shows a much simpler way to perform multiplication in finite field than the conventional method. The necessary and sufficient conditions are presented for an element to generate a normal basis in the field GF(2 super m), where m = 2 super k p super n and p super n has two as a primitive root. This result provides a way to find a normal basis in the field.

Pei, D. Y.

Fast VLSI Viterbi Decoder

Fast Viterbi decoder with fully parallel, pipeline architecture implemented on two VLSI NMOS chips. Decoder used with constraint-length-7, rate-1/2, convolutional error-correcting code widely used by NASA for deepspace telemetry data. With this (7,1/2) code, bit stream contains 2 bits per original data bit, and information about 1 data bit distributed over 7 pairs of bits. Design principles of decoder also applicable to Viterbi codes of other lengths and rates.

Wang, C. C.

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.

VLSI architectures for computing multiplications and inverses in GF(2m)

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Wang, C. C.

Measurement of collision-induced shift and broadening of the ultraviolet transitions of OH

Using a CW tunable laser, absorption measurements were made to determine for the first time the shift and broadening of the ultraviolet transitions of OH induced by collisions with molecular nitrogen and oxygen. Similar measurements were also made for collisions with air and inert gases He, Ne, Ar, and Kr. Both the shift and broadening due to these collisions were found to depend linearly upon pressures in the range from 50 Torr up to 1 atm. The homogeneous linewidth for the P2(2) transition of OH in ambient air is determined to be 0.20 + or - 0.005/cm. Results with Ar and Kr show contributions not accounted for by the polarizability of the colliding species.

Shirinzadeh, B.

An optimized bandwidth efficient demand assigned protocol for integrated Mobile Satellite Services

This paper describes the design of a demand assigned protocol based on bandwidth efficiency for integrated services of a Mobile Satellite System (MSS). An MSS provides data (closed-ended) and voice (open-ended) communications services for a large number of mobile users dispersed over a wide geographical area. Each mobile requests its desired service through a designated set of channels to a network management center. Either pure or slotted ALOHA random access scheme can be used to make connection requests, while data and voice communications are demand assigned. All channels have equal bandwidth and can be adaptively used for reservation requests, data connections or voice connections to maximize the bandwidth utilization. In this paper, perfect communications channels are assumed. It has been shown that, for the case considered, using the slotted ALOHA scheme for making connection requests can save about 30 percent on the total number of channels over using the pure ALHOA scheme.

Yan, T.-Y.

Bit synchronization of differentially detected MSK and GMSK

The filter-square bit synchronizer has been previously proposed and shown to give near optimum performance for coherent PSK systems. In this paper, the same bit synchronization scheme is analyzed for a differentially detected GMSK system. It is shown that the filter-square bit synchronizer can successfully work in a differential phase detection receiver. By making linear approximations appropriate for high loop signal-to-noise ratio operation (the usual case of interest in tracking), it is demonstrated that the mean-square bit sync jitter of differentially detected GMSK system reveals striking similarities both qualitatively and quantitatively in comparison with that of a coherent PSK system.

Simon, M. K.

Shot noise limited detection of OH using the technique of laser-induced fluorescence

Nearly shot-noise limited detection of OH using the technique of laser-induced fluorescence is reported. A LIDAR configuration is used to excite fluoresence in a large volume and a narrow-bandwidth interference filter provides spectral discrimination. This arrangement alleviates the effect of ozone interference and facilitates image processing at relatively close distances. The detection limit is determined mainly by the short-noise of the solar background. Ground-based measurements in Dearborn indicate a detection limit of better than 1 x 10 to the 6th power OH/cubic cm over a forty-minute acquisition period. Under favorable conditions, a comparable detection limit was also observed for airborne measurements.

Bakalyar, D. M.

Differential detection of Gaussian MSK in a mobile radio environment

Minimum shift keying with Gaussian shaped transmit pulses is a strong candidate for a modulation technique that satisfies the stringent out-of-band radiated power requirements of the mobil radio application. Numerous studies and field experiments have been conducted by the Japanese on urban and suburban mobile radio channels with systems employing Gaussian minimum-shift keying (GMSK) transmission and differentially coherent reception. A comprehensive analytical treatment is presented of the performance of such systems emphasizing the important trade-offs among the various system design parameters such as transmit and receiver filter bandwidths and detection threshold level. It is shown that two-bit differential detection of GMSK is capable of offering far superior performance to the more conventional one-bit detection method both in the presence of an additive Gaussian noise background and Rician fading.

Simon, M. K.

Mathematical models for cochannel interference in FH/MFSK multiple-access systems

FH/MFSK has been proposed for a multiuser spread spectrum digital communication system to combat both self-jamming and intentional jamming. An independence assumption at the energy detector outputs is used to evaluate such a system for a digitized voice mobile radio system (Yue, 1981). This paper presents a correlated model and compares its performance to an independence model under the symbol error probability criterion. A Gaussian process model is also developed for comparison. It is found that the conventional Gaussian approximation is inadequate in predicting the number of users that can be accommodated by an FH/MFSK system using the conventional receiver. Furthermore, for the cases evaluated, the independence model provides an excellent approximation to the correlated model. Additionally, a conditional Chernoff bound is presented for the more general case of frequency-hopping systems with multiple hops per symbol.

Yan, T.-Y.

Shot noise limited detection of OH using the technique of laser induced fluorescence

Nearly shot-noise limited detection of OH using the technique of laser-induced fluorescence is reported. A LIDAR configuration is used to excite fluorescence in a large volume and a narrow-bandwidth interference filter provides spectral discrimination. This arrangement alleviates the effect of ozone interference and facilitates image processing at relatively close distances. The detection limit is determined mainly by the shot-noise of the solar background. Ground-based measurements in Dearborn indicate a detection limit of better than 1 x 10 to the 6th power OH/cubic cm over a forty-minute acquisition period. Under favorable conditions, a comparable detection limit was also observed for airborne measurements.

Bakalyar, D. M.

VLSI architectures for computing multiplications and inverses in GF(2-m)

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that are easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). With the simple squaring property of the normal-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2m). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Wang, C. C.

Differential versus limiter-discriminator detection of narrow-band FM

The error probability performance of differential detection of narrow-band FM is determined and compared with the analogous results for limiter-discriminator detection of the same modulation. It is shown that over a large class of benign and hostile environments, e.g., Gaussian IF filter, AWGN, partial-band noise jamming, the differential detector offers no theoretical performance advantage over the limiter-discriminator receiver with integrate-and-dump postdetection filtering.

Simon, M. K.