Showing papers in "IEEE Transactions on Communications in 1980"

An Algorithm for Vector Quantizer Design

Abstract: An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data. The basic properties of the algorithm are discussed and demonstrated by examples. Quite general distortion measures and long blocklengths are allowed, as exemplified by the design of parameter vector quantizers of ten-dimensional vectors arising in Linear Predictive Coded (LPC) speech compression with a complicated distortion measure arising in LPC analysis that does not depend only on the error vector.

Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication Systems

Abstract: Conventional equalization and carrier recovery algorithms for minimizing mean-square error in digital communication systems generally require an initial training period during which a known data sequence is transmitted and properly synchronized at the receiver. This paper solves the general problem of adaptive channel equalization without resorting to a known training sequence or to conditions of limited distortion. The criterion for equalizer adaptation is the minimization of a new class of nonconvex cost functions which are shown to characterize intersymbol interference independently of carrier phase and of the data symbol constellation used in the transmission system. Equalizer convergence does not require carrier recovery, so that carrier phase tracking can be carried out at the equalizer output in a decision-directed mode. The convergence properties of the self-recovering algorithms are analyzed mathematically and confirmed by computer simulation.

OSI Reference Model--The ISO Model of Architecture for Open Systems Interconnection

Abstract: Considering the urgency of the need for standards which would allow constitution of heterogeneous computer networks, ISO created a new subcommittee for "Open Systems Interconnection" (ISO/ TC97/SC 16) in 1977. The first priority of subcommittee 16 was to develop an architecture for open systems interconnection which could serve as a framework for the definition of standard protocols. As a result of 18 months of studies and discussions, SC16 adopted a layered architecture comprising seven layers (Physical, Data Link, Network, Transport, Session, Presentation, and Application). In July 1979 the specifications of this architecture, established by SC16, were passed under the name of "OSI Reference Model" to Technical Committee 97 "Data Processing" along with recommendations to start officially, on this basis, a set of protocols standardization projects to cover the most urgent needs. These recommendations were adopted by T.C97 at the end of 1979 as the basis for the following development of standards for Open Systems Interconnectlon within ISO. The OSI Reference Model was also recognized by CCITT Rapporteur's Group on "Layered Model for Public Data Network Services." This paper presents the model of architecture for Open Systems Interconnection developed by SC16. Some indications are also given on the initial set of protocols which will-likely be developed in this OSI Reference Model.

Charge-Pump Phase-Lock Loops

Abstract: Phase/frequency detectors deliver output in the form of three-state, digital logic. Charge pumps are utilized to convert the timed logic levels into analog quantities for controlling the locked oscillators. This paper analyzes typical charge-pump circuits, identifies salient features, and provides equations and graphs for the design engineer.

The New Routing Algorithm for the ARPANET

Abstract: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations. In the new procedure, each node in the network maintains a database describing the complete network topology and the delays on all lines, and uses the database describing the network to generate a tree representing the minimum delay paths from a given root node to every other network node. Because the traffic in the network can be quite variable, each node periodically measures the delays along its outgoing lines and forwards this information to all other nodes. The delay information propagates quickly through the network so that all nodes can update their databases and continue to route traffic in a consistent and efficient manner. An extensive series of tests were conducted on the ARPANET, showing that line overhead and CPU overhead are both less than two percent, most nodes learn of an update within 100 ms, and the algorithm detects congestion and routes packets around congested areas.

Prediction of Attenuation by Rain

Abstract: A new model is presented for the prediction of attenuation by rain on either terrestrial or slant earth-to-space propagation paths. The model was developed using geophysical observations of the statistics of point rain rate, of the horizontal structure of rainfall, and of the vertical temperature structure of the atmosphere. The model was tested by comparison with attenuation distribution observations. The results show excellent agreement; the observations differ from model predictions by less than the rms deviations predicted by the model.

Flow Control: A Comparative Survey

Abstract: Packet switching offers attractive advantages over the more eonventional circuit-switched scheme, namely, flexibility in setting up user connections and more efficient use of resources after the connection is established. However, if user demands are allowed to exceed the system capacity, unpleasant congestion effects occur which rapidly neutralize the delay and efficiency advantages. Congestion can be eliminated by using an appropriate set of traffic monitoring and control procedures called flow control procedures. Flow control can be exercised at various levels in a packet network. The following levels are identified and discussed in this paper: hop level, entry-to-exit level, network access level, and transport level. For each level, the most representative techniques are surveyed and compared. Furthermore, the interaction between the different levels is discussed.

Multiaccess Protocols in Packet Communication Systems

Abstract: The need for multiaccess protocols arises whenever a resource is shared by many independent contending users. Two major factors contribute to such a situation: the need to share expensive resources in order to achieve their efficient utilization, or the need to provide a high degree of connectivity for communication among independent subscribers (or both). In data transmission systems, the communication bandwidth is often the prime resource, and it is with respect to this resource that we view multiaccess protocols here. We give in this paper a unified presentation of the various multiaccess techniques which we group into five categories: 1) fixed assignment techniques, 2) random access techniques, 3) centrally controlled demand assignment techniques, 4) demand assignment techniques with distributed control, and 5) mixed strategies. We discuss their applicability to different enivironments, namely, satellite channels, local area communication networks and multihop store-and-forward broadcast networks, and their applicability to different types of data traffic, namely stream traffic and bursty traffic. We also present the performance of many of the multiaccess protocols in terms of bandwidth utilization and message delay.

Carrier and Bit Synchronization in Data Communication--A Tutorial Review

Abstract: This paper examines the problems of carrier phase estimation and symbol timing estimation for carrier-type synchronous digital data signals, with tutorial objectives foremost. Carrier phase recovery for suppressed-carrier versions of double sideband (DSB), vestigial sideband (VSB), and quadrature amplitude modulation (QAM) signal formats is considered first. Then the problem of symbol timing recovery for a baseband pulse-amplitude modulation (PAM) signal is examined. Timing recovery circuits based on elementary statistical properties are discussed as well as timing recovery based on maximum-likelihood estimation theory. A relatively simple approach to evaluation of timing recovery circuit performance in terms of rms jitter of the timing parameters is presented.

Routing Techniques Used in Computer Communication Networks

Abstract: An overview is provided in this paper of the routing procedures used in a number of operating networks, as well as in two commercial network architectures. The networks include TYMNET, ARPANET, and TRANSPAC. The network architectures discussed are the IBM SNA and the DEC DNA. The routing algorithms all tend to fall in the shortest path class. In the introductory sections, routing procedures in general are discussed, with specialization to shortest path algorithms. Two shortest path algorithms, one appropriate for centralized computation, the other for distributed computation, are described. These algorithms, in somewhat modified form, provide the basis for the algorithms actually used in the networks discussed.

Towards Analyzing and Synthesizing Protocols

Abstract: The production of error-free protocols or complex process interactions is essential to reliable communications. This paper presents techniques for both the detection of errors in protocols and for prevention of errors in their design. The methods have been used successfully to detect and correct errors in existing protocols. A technique based on a reachability analysis is described which detects errors m a design. This "perturbation technique" has been implemented and has successfully detected inconsistencies or errors in existing protocol designs including both X.21 and X.25. The types of errors handled are state deadlocks, unspecified receptions, nonexecutable interactions, and state smbiguities. These errors are discussed and their effects considered. An interactive design technique is then described that prevents design errors. The technique is based on a set of production rules which guarantee that complete reception capability is provided in the interacting processes. These rules have been implemented in the form of a tracking algorithm that prevents a designer from creating unspecified receptions and nonexecutable interactions and monitors for the presence of state deadlocks and ambiguities.

Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions

Abstract: Nodal storage limitations in a store and forward computer network lead to blocking; this results in degradation of network performance due to the loss or retransmission of blocked messages. In this paper, we consider several schemes for sharing a pool of buffers among a set of communication channels emanating from a given node in a network environment so as to make effective use of storage in a variety of applications. Five sharing schemes are examined, analyzed, and displayed in a fashion which permits one to establish the tradeoffs among blocking probability, utilization, throughput, and delay. The key to the analysis lies in the observation that the equilibrium joint probability distribution of the buffer occupancy obeys the well-known product form solution for networks of queues. The study indicates advantages and pitfalls of each of the sharing schemes. We observe, in general, that sharing with appropriate restrictions on the contention for space is very much desirable.

Formal Methods in Communication Protocol Design

Abstract: While early protocol design efforts had to rely largely on seat-of-the-pants methods, a variety of more rigorous techniques have been developed recently. This paper surveys the formal methods being applied to the problems of protocol specification, verification, and implementation. In the specification area, both the service that a protocol layer provides to its users and the internal operations of the entities that compose the layer must be defined. Verification then consists of a demonstration that the layer will meet its service specification and that each of the components is correctly implemented. Formal methods for accomplishing these tasks are discussed, including state transition models, program verification, symbolic execution, and design rules.

A Modified Monte-Carlo Simulation Technique for the Evaluation of Error Rate in Digital Communication Systems

Abstract: Digital communication systems are frequently operated over nonlinear channels with memory. The analysis of the performance of these systems is difficult and no complete analytical treatment of the problem has been obtained before. Several recent efforts have been directed toward the computation of error probabilities via Monte-Carlo simulation using a complete system model. These simulations require excessively large sample sizes and are not practical for estimating very low values of error probabilities. This paper presents a modified Monte-Carlo simulation technique for estimating error probabilities in digital communication systems operating over nonlinear channels. An importance-sampling technique is used to modify the probability density function of the noise process in a way to make simulation possible. Theoretical results as well as realistic examples are presented, showing that the number of samples needed for simulation is reduced considerably.

Frame Synchronization Techniques

Abstract: A basic theory of frame synchronization for a singlechannel digital communication system is presented, along with extensive references to the literature. The design of frame markers is discussed and comparisons are drawn with more exotic techniques such as comma-free coding.

Pup: An Internetwork Architecture

Abstract: Pup is the name of an internet packet format (PARC Universal Packet), a hierarchy of protocols, and a style of internetwork communication. The fundamental abstraction is an end-to-end media-in dependent internetwork datagram. Higher levels of functionality are achieved by end-to-end protocols that are strictly a matter of agreement among the communicating end processes. This report explores important design issues, sets forth principles that have guided the Pup design, discusses the present implementation in moderate detail, and summarizes experience with an operational internetwork. This work serves as the basis for a functioning internetwork system that provides service to about 1000 computers, on 25 networks of 5 different types, using 20 internetwork gateways.

An Analysis of Automatic Equalizers for Orthogonally Multiplexed QAM Systems

Abstract: A simple structure of a per-channel automatic equalizer for an orthogonally multiplexed QAM system is proposed and the performance is analyzed. It is shown that a dual automatic equalizer with T/2 -long tapped delay lines, where T is a period of individual baseband baud, can equalize not only the transmission channel distortions, but the timing deviations and demodulating carrier phase deviations. Despite its high efficiency, the orthogonally multiplexed QAM system has been regarded as overly costly. However, by using the dual automatic equalizer with fairly simple structure, the system is competitive with conventional single channel data transmission systems.

Performance of Slotted ALOHA Random Access with Delay Capture and Randomized Time of Arrival

Abstract: The application of the slotted ALOHA random access technique to a system using a spread spectrum waveform is described and analyzed. The technique takes advantage of the delay capture properties of spread spectrum waveforms and is shown to achieve excellent delay and throughput performance. System stability is maintained even in the face of severe fluctuations in user population or traffic loading such as may occur in a large population of mobile users.

Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward Deadlock

Abstract: Store-and-forward deadlock in store-and-forward networks may be avoided by forwarding messages from buffer to buffer in accordance with a loop-free directed buffer graph which accommodates all the desired message routes. Schemes for designing such buffer graphs are presented, together with methods for using them to forward the messages in an efficient and deadlock-free manner. These methods can be implemented by a set of counters at each node. Such an implementation increases the efficiency of buffer use, and simplifies jumping between normal lowoverhead operation when deadlock is far and more careful operation when deadlock is near. The proposed deadlock avoidance mechanism works for any network topology and any finite routing algorithm.

Embedded DPCM for Variable Bit Rate Transmission

Abstract: Within the bit stream of an embedded digital code is a stream that can be decoded to produce a reasonable replica of the analog source signal. Unlike pulse code modulation (PCM), differential PCM (DPCM), is not an embedded code. If C bits/sample are delected from the bit stream of a DPCM encoder with E bits/sample, the decoded analog signal is substantially noisier than the output of a DPCM codec with D = E - C bits/sample. The penalty is 4-10 dB in signal-to-noise ratio (snr). However, with minor modifications to the encoder and decoder, DPCM becomes an embedded code. Embedded DPCM with E bits/ sample at the encoder and D bits/sample transmitted produces exactly the same output as embedded DPCM with D bits/sample encoding and perfect transmission. The snr of embedded DPCM is slightly lower than the Snr of DPCM. The penalty is 0.5-0.8 dB if the minimum transmitted bit rate is 2 bits/sample. It is less than 0.3 dB if D is at least 3 bits/sample. Combined with an appropriate adaptive quantizer the embedded DPCM codec produces embedded ADPCM (adaptive DPCM) for variable rate transmission ranging from 2 bits/sample up to any desired maximum. Applications exist in speech interpolation, packet switching, and hardware architecture.

A Technique for Adaptive Voice Flow Control in Integrated Packet Networks

Abstract: Integrated packet-switched networks have potential for providing improved performance by dynamically sharing transmission bandwidths between various users and user types, but new flow control methods are needed to deal with packetized voice traffic. This paper describes a packet voice flow control concept based on embedded speech coding. Results are presented from a computer simulation study of the technique in the context of a multilink wideband packet speech network. Several control methodologies are described, leading to an end-to end feedback approach that achieves stable operation and efficient utilization of network resources by adaptively matching transmitted voice bit rates to prevailing network conditions. Issues in the design of embedded speech coding algorithms are reviewed and a candidate structure based on channel vocoding principles is presented, along with the subjective results of some preliminary listening tests

Packet Switching in Radio Channels: New Conflict-Free Multiple Access Schemes

Abstract: We study new access schemes for a population of geographically distributed data users who communicate with each other and/or with a central station over a multiple-access broadcast ground radio packet-switching channel. We introduce and analyze alternating priorities (AP), round robin (RR), and random order (RO) as new conflict-free methods for multiplexing buffered users without control from a central station. These methods are effective when the number of users is not too large; as the number grows, a large overhead leads to a performance degradation. To reduce this degradation, we consider a natural extension of AP, called minislotted alternating priorities (MSAP) which reduces the overhead and is superior to fixed assignment, polling, and known random access schemes under heavy traffic conditions. At light input loads, only random access schemes outperform MSAP when we have a large population of users. In addition, and of major importance, is the fact that MSAP does not require control from a central station.

Laser Mode Partition Noise Evaluation for Optical Fiber Transmission

Abstract: An evaluation of the influence of mode partition noise on error rate performance in a high bit rate optical fiber transmission system is presented. First, it is experimentally clarified that the intensity in each longitudinal mode of a laser diode fluctuates, although the intensity for the total mode is constant. It is also established that this fluctuation causes degradation of the error rate performance after transmission through a long optical fiber. The fluctuation is named "mode partition noise." Next a simple model for the fluctuation is proposed. The characteristics of the fluctuation are discussed on the basis of this model. Optical waveform fluctuation is found to be introduced by mode partition noise in the course of transmission through a long despersive transmission medium. This optical waveform fluctuation and its frequency spectrum are calculated. Finally, the error rate performance is evaluated and specifications required for a laser spectrum to attain a given repeater spacing are clarified.

Data Traffic Performance of Integrated Circuit- and Packet-Switched Multiplex Structure

Abstract: Results are developed for data traffic performance in an integrated multiplex structure which includes circuit-switching for voice and packet-switching for data. The results are obtained both through simulation and analysis, and show that excessive data queues and delays will build up under heavy loading conditions. These large data delays occur during periods of time when the voice traffic load through the multiplexer exceeds its statistical average. A variety of flow control mechanisms to reduce data packet delays are investigated. These mechanisms include control of voice bit rate, limitation of the data buffer, and combinations of voice rate and data buffer control. Simulations indicate that these flow control mechanisms provide substantial improvements in system performance.

Analysis of a Two-Hop Centralized Packet Radio Network--Part I: Slotted ALOHA

Abstract: The design of packet radio systems involves a large number of design variables that interact in a very complex fashion. As this design problem in its general form is quite complex, a viable approach is to analyze some simple but typical configurations in an attempt to understand the behavior of these systems. In this paper, a two-hop centralized configuration is considered in which traffic originates at terminals, is destined to a central station, and requires for its transport the relaying of packets by store-and-forward repeaters. The through-put-delay performance is derived, and its dependence on such key system variables as the network topology, the transmission protocol, and the repeaters' storage capacities, is given. In this part, devices are assumed to be utilizing the slotted ALOHA access mode. Carrier sense multiple access is treated in Part II of this series [1].

An Effective Error Control Scheme for Satellite Communications

Abstract: The conventional go-back- N ARQ is inadequate for error control on satellite channels due to the large round-trip delay and high bit rate. The throughput efficiency of this system drops rapidly as the channel error rate increases. In this paper, a variation of the go-back- N ARQ is described. This variation reduces the effect of the round-trip delay, and hence increases the system throughput efficiency. Therefore, it may find applications m satellite communication systems or other systems where round-trip delay is large.

An Analysis of a Real-Time Transform Domain Filtering Digital Communication System--Part I: Narrow-Band Interference Rejection

Abstract: This paper provides a detailed analysis of the performance of systems recently proposed by various authors in which the received signal is Fourier transformed in real time (usually with a surface acoustic wave device) and then filtered by a multiplication of the transformed signal by an appropriate transfer function. We shall refer to this operation as transform domain filtering. General expressions for the output waveforms of the system will be derived, and a specific example illustrating the performance of the system when operating in the presence of a narrow-band interferer plus additive white Gaussian noise will be presented. It will be shown that certain filtering techniques not feasible in conventional systems, such as filtering with ideal bandpass filters, become straightforward using transform domain filtering. Finally, a receiver will be described which will eliminate that intersymbol interference between adjacent data symbols due to filtering at the receiver.

Protocol Representation with Finite-State Models

Abstract: A three-layer model of a computer network is used to introduce the concept of interface and of end-to-end protocols. Using a simple interface protocol as example, finite state automaton and Petri nets are introduced. The idea of an interface machine is rejected and the problems related to the transmission medium are approached. End-to end protocols request a global model which includes two local models and a transmission medium model. However, the local model has to be generalized. This eventually leads to the association of the state of the automaton with a context. Petri nets have also to be expanded. Models presented here have been successfully used for modeling transport protocols.

Joint Carrier Phase and Symbol Timing Recovery for PAM Systems

Abstract: The detection of pulse amplitude modulation (PAM) carrier signals requires accurate symbol timing and carrier phase references. In most cases, it is desired to estimate these parameters directly from measurements on the received data signal. This paper adds to and unifies the theory of maximum likelihood [ML] estimation as applied to PAM timing and phase recovery. Several different estimation strategies are considered. Data-aided [DA] estimators are found which assume the transmitted data symbols are known at the receiver. Nondata-aided [NDA] estimators are found which require only knowledge of the statistics of the transmitted data symbols. Structures for estimation of symbol timing, carrier phase, and joint estimation of timing and phase are presented. The estimators are evaluated on the basis of their error variances. Relatively simple approximate expressions for these error variances are presented. These expressions allow the comparison of the effects of excess bandwidth, different modulation schemes, DA versus NDA recovery, and joint estimation versus estimation of only one parameter. A practical implementation of the ML estimator, termed a pseudo-maximum likelihood (PML) estimator, is proposed and analyzed. The performance of the PML estimator is shown to include a noise-independent, data-dependent jitter which dominates in many cases of practical interest.

A General Transition Model for Protocols and Communication Services

Abstract: Different approaches have been used for the formal specification and verification of communication protocols. This paper explains the approach of nsing a general transition model which combines aspects of finite state transition diagrams and programming languages. Different ways of structuring a protocol into separate modules or functions are also discussed. The main part of the paper describes a method for exactly specifying the communication service provided by a protocol. Two aspects of a service specification are distinguished: 1) the local properties which characterize the interface through which the service may be accessed, and 2) the global properties which describe the "end-to-end" communication characteristics of the service. It is shown how the specification method is related to the general transition model for protocol specification. Verification is discussed briefly with emphasis on the use of invariant assertions in the context of finite state as well as programming language protocol descriptions. The discussed topics are demonstrated with examples based on the HDLC classes of procedures and the X.25 Virtual Circuit data transmission service.