Engineering PapersSearch

Engineering topics

Omura, J. K.

Publications and source records attributed to Omura, J. K..

At least 19 records

A survey of the state-of-the-art and focused research in range systems, task 1

This final report presents the latest research activity in voice compression. We have designed a non-real time simulation system that is implemented around the IBM-PC where the IBM-PC is used as a speech work station for data acquisition and analysis of voice samples. A real-time implementation is also proposed. This real-time Voice Compression Board (VCB) is built around the Texas Instruments TMS-3220. The voice compression algorithm investigated here was described in an earlier report titled, Low Cost Voice Compression for Mobile Digital Radios, by the author. We will assume the reader is familiar with the voice compression algorithm discussed in this report. The VCB compresses speech waveforms at data rates ranging from 4.8 K bps to 16 K bps. This board interfaces to the IBM-PC 8-bit bus, and plugs into a single expansion slot on the mother board.

Omura, J. K.

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.

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.

Low cost voice compression for mobile digital radios

A new technique for low cost rubust voice compression at 4800 bits per second was studied. The approach was based on using a cascade of digital biquad adaptive filters with simplified multipulse excitation followed by simple bit sequence compression.

Omura, J. K.

Spread spectrum communications. Volume 1, 2 & 3

The design and operation of spread-spectrum (SS) communication systems are examined in an introductory text intended for graduate engineering students and practicing engineers. Chapters are devoted to an overview of SS systems, the historical origins of SS, basic concepts and system models, antijam communication systems, pseudonoise generators, coherent direct-sequence systems, noncoherent frequency-hopped systems, coherent and differentially coherent modulation techniques, pseudonoise acquisition and tracking in direct-sequence receivers, time and frequency synchronization of frequency-hopped receivers, low-probability-of-intercept communication, and multiple-access communication. Graphs, diagrams, and photographs are provided.

Simon, M. K.

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.

Modulation/demodulation techniques for satellite communications. Part 3: Advanced techniques. The nonlinear channel

A theory for deducing and predicting the performance of transmitter/receivers for bandwidth efficient modulations suitable for use on the nonlinear satellite channel is presented. The underlying principle used throughout is the development of receiver structures based on the maximum likelihood decision rule and aproximations to it. The bit error probability transfer function bounds developed in great detail in Part 4 is applied to these modulation/demodulation techniques. The effects of the various degrees of receiver mismatch are considered both theoretically and by numerous illustrative examples.

Omura, J. K.

Coded error probability evaluation for antijam communication systems

We present a general union-Chernoff bound on the bit error probability for coded communication systems and apply it to examples of antijam systems. The key feature of this bound is the decoupling of the coding aspects of the system from the remaining part of the communication system which includes jamming, suboptimum detectors, and arbitrary decoding metrics which may or may not use jammer state knowledge

Omura, J. K.

Modulation/demodulation techniques for satellite communications. Part 2: Advanced techniques. The linear channel

A theory is presented for deducing and predicting the performance of transmitter/receivers for bandwidth efficient modulations suitable for use on the linear satellite channel. The underlying principle used is the development of receiver structures based on the maximum-likelihood decision rule. The application of the performance prediction tools, e.g., channel cutoff rate and bit error probability transfer function bounds to these modulation/demodulation techniques.

Omura, J. K.

Performance of staggered quadrature modulations over nonlinear satellite channels with uplink noise and intersymbol interference

In this paper, the performance of staggered quadrature modulations over nonlinear satellite channels is analyzed. The effects of uplink noise and intersymbol interference caused by transmitter filtering are included. The approach taken employs computational techniques based on moments of the interference. The expressions for the system bit error rate are derived for a general transponder model characterized by AM-AM and AM-PM conversion characteristics. Specific numerical results are presented for a hard-limited satellite repeater using staggered quadrature overlapped raised cosine (SQORC) and minimum-shift-keying (MSK) modulations.

Simon, M. K.

Modulation/demodulation techniques for satellite communications. Part 1: Background

Basic characteristics of digital data transmission systems described include the physical communication links, the notion of bandwidth, FCC regulations, and performance measurements such as bit rates, bit error probabilities, throughputs, and delays. The error probability performance and spectral characteristics of various modulation/demodulation techniques commonly used or proposed for use in radio and satellite communication links are summarized. Forward error correction with block or convolutional codes is also discussed along with the important coding parameter, channel cutoff rate.

Omura, J. K.

Modulation/demodulation techniques for satellite communications. Part 4: Appendices

The use of the Viterbi algorithm in a general context is examined. The generalized transfer function bounds are given which permit the following applications to be carried out: maximum likelihood demodulation of such bandwidth modulations as minimum-shift-keying and continuous phase frequency-shift-keying, demodulation of intersymbol interference and partial response signals, estimation and smoothing, and simultaneous phase synchronization, and data detection. Sufficient conditions are reviewed for tightening Chernoff and Rhattacharyya bounds.

Omura, J. K.

Analysis of coherent satellite communication systems in the presence of interference and noise

The general analysis presented can be used to evaluate the performance of M-ary phase shift keying (MPSK) used over a nonlinear satellite channel in the presence of interference (CW tone and ISI) and channel noise. The numerical evaluation is based on the classical moment technique for approximating the probability distribution from moments of a random variable. The mathematical formulation of error probabilities of MPSK signals transmitted over nonlinear satellite repeaters is presented to include the effect of CW tone interference as well as the intersymbol interference. The approach is general and can be extended to include the effect of the synchronization.

Huang, T.-C.

A general analysis of anti-jam communication systems

A general error bound is derived for a general anti-jam communication system which will serve as the basis for evaluating the performance of all such complex communication systems. The two most common spread spectrum techniques, coherent DS/BPSK and noncoherent FH/MFSK, are analyzed. Pulse jamming represents the worst type of jammer for DS/BPSK systems, and several receiver structures against such a jammer are examined. It is found that for low values of chip energy-to-noise ratios of O dB or less there is little difference between having or not having jammer state knowledge with a hard decision receiver. Soft decision receivers are shown to be useless against very narrow pulses without jammer state knowledge. Partial band jammers are close to the worst case jammer for FH/MFSK systems. The conclusions found for these systems are similar to those for the DS/BPSK systems.

Omura, J. K.

Coding tradeoffs for improved performance of FH/MFSK systems in partial band noise

Partial band noise jamming can severely degrade the performance of frequency-hopped, M-ary frequency-shift keyed communciation systems. This paper illustrates the tradeoffs between channel coding, diversity, and block orthogonal (MFSK) modulation as a means of overcoming the advantage of worst case, non-adaptive (as opposed to repeat-back) partial band jamming. For ease of computation, the analysis relies on exponentially tight error bounds, and is based on a noncoherent detection metric that requires jamming state information for each hop. A more robust, less complex receiver structure which eliminates the jamming knowledge requirement is shown to degrade performance less than 2-1/2 dB. The coding tradeoffs discussed in this report are exemplified in the design of a hypothetical 32 kb/s military frequency-hopped communication link.

Levitt, B. K.

Coding for spread spectrum packet radios

Packet radios are often expected to operate in a radio communication network environment where there tends to be man made interference signals. To combat such interference, spread spectrum waveforms are being considered for some applications. The use of convolutional coding with Viterbi decoding to further improve the performance of spread spectrum packet radios is examined. At 0.00001 bit error rates, improvements in performance of 4 db to 5 db can easily be achieved with such coding without any change in data rate nor spread spectrum bandwidth. This coding gain is more dramatic in an interference environment.

Omura, J. K.

Satellite communication performance evaluation: Computational techniques based on moments

Computational techniques that efficiently compute bit error probabilities when only moments of the various interference random variables are available are presented. The approach taken is a generalization of the well known Gauss-Quadrature rules used for numerically evaluating single or multiple integrals. In what follows, basic algorithms are developed. Some of its properties and generalizations are shown and its many potential applications are described. Some typical interference scenarios for which the results are particularly applicable include: intentional jamming, adjacent and cochannel interferences; radar pulses (RFI); multipath; and intersymbol interference. While the examples presented stress evaluation of bit error probilities in uncoded digital communication systems, the moment techniques can also be applied to the evaluation of other parameters, such as computational cutoff rate under both normal and mismatched receiver cases in coded systems. Another important application is the determination of the probability distributions of the output of a discrete time dynamical system. This type of model occurs widely in control systems, queueing systems, and synchronization systems (e.g., discrete phase locked loops).

Omura, J. K.

Performance of mismatched Viterbi receiver on satellite channels

This paper presents an analysis of a satellite communication system using a Viterbi receiver. Here we have a bandlimited nonlinear channel where both uplink and downlink are taken into account as well as the effect of Intersymbol Interference, phase and time synchronization errors. In order that ISI can be combatted effectively, we use a Viterbi demodulator which is designed for the satellite channel when there is no uplink noise. The Viterbi demodulator for the channels with large memory is too complex to be implemented. To reduce the complexity, a Viterbi demodulator with memory shorter than the true channel memory is used. The objective of this paper is to analyze the performance degradation of this 'Mismatched Viterbi Receiver' due to the uplink noise and memory truncation, and to understand how the time and phase synchronization errors influence the performance.

Divsalar, D.