scispace - formally typeset
Journal ArticleDOI

High Efficiency Multiple Access Communications Through a Signal Processing Repeater

R. Sommer
- 01 Apr 1968 - 
- Vol. 16, Iss: 2, pp 222-232
Reads0
Chats0
TLDR
The use of RADA techniques with efficient encodingdecoding and a processing repeater can provide a multiple access capability which efficiently uses bandwidth and downlink power.
Abstract
This paper describes a signal processing repeater which enhances the performance that can be obtained with random access discrete address (RADA) digital transmission links which operate in a multiple access mode. In general, RADA modulation techniques employ groups of pulses to transmit information. The pulses within a group normally have different carrier frequencies and are separated from each other by one or more time slots. The communication performance capability of a system which uses these techniques is a function of interference between the pulse groups of different users and background noise. A number of RADA techniques were proposed for the U. S. Army to provide communications within field army and divisions. For army application these had the advantages of rapid synchronization and ease of implementation, accompanied by the disadvantage of requiring large amounts of bandwidth. Significant bandwidth reductions can be obtained through the use of efficient data encoding-decoding techniques. Also, the downlink power requirements can be minimized through the use of an antipodal downlink signal. The processing repeater discussed in this paper can convert any number of randomly phased uplink signals to a single antipodal downlink signal which is amenable to phase coherent detection. The required downlink power is thereby minimized. Thus, the use of RADA techniques with efficient encodingdecoding and a processing repeater can provide a multiple access capability which efficiently uses bandwidth and downlink power.

read more

Citations
More filters
Journal ArticleDOI

A perspective on multiaccess channels

TL;DR: The information theoretic approach and the collision resolution approach to multiaccess channels are reviewed in terms of the underlying communication problems that both are modeling.

A perspective on multiaccess channels

TL;DR: In this paper, the information theoretic approach and the collision resolution approach to multiaccess channels are reviewed in terms of the underlying communication problems that both are modeling, and some perspective on the strengths and weakness of these approaches is given, and the need of a more combined approach focused on coding and decoding techniques is argued.
Journal ArticleDOI

A New Coding Technique for Asynchronous Multiple Access Communication

TL;DR: A new approach to asynchronous multiple access communications, employing orthogonal convolutional coding and Viterbi decoding, is presented and results indicate that the technique is quite efficient in terms of the number of users supportable at a specified bit error rate in a given system bandwidth.
Journal ArticleDOI

A block code for noiseless asynchronous multiple-access OR channel (Corresp.)

TL;DR: A Mock code for the noiseless multiple access OR channel is introduced and an exponential error bound is proven if the sum of the equal code rates of the asynchronous T users is less than \ln 2 .
Journal ArticleDOI

Bounds on the Cross-Correlation Functions of State m-Sequences

TL;DR: The performance of the periodic Hamming correlation function of the sequences of states of m -sequence simple linear feedback shift register generators is evaluated, and it is shown that the worst-case shift of the cross-correlation for relatively short sequences is of burst nature.
References
More filters
Journal ArticleDOI

The Philosophy of PCM

TL;DR: This paper shows in a general way some of the advantages of PCM, and distinguishes between what can be achieved with PCM and with other broadband systems, such as large-index FM.
Journal ArticleDOI

Sequential decoding for discrete input memoryless channels

TL;DR: A scheme is described which sequentially encodes the output of a discrete letter source into the input symbols of a continuous channel, with adjacent channel symbols mutually constrained over a length, n, which permits desired channel input symbol probabilities to be approximated closely.
Journal ArticleDOI

Theoretical Aspects of Asynchronous Multiplexing

W.D. White
TL;DR: An examination of the case where isolated transmitters share a common channel without synchronization is examined, and general observations on the efficiency of asynchronous multiplex systems are presented.
Related Papers (5)