# IEEE Transactions on Communications

## Filter Results

Displaying Results 1 - 25 of 25
• ### Uncoded and coded performance of MFSK and DPSK in Nakagami fading channels

Publication Year: 1992, Page(s):487 - 493
Cited by:  Papers (63)
| |PDF (508 KB)

The author presents uncoded and coded performance results for noncoherent M-ary frequency-shift keying (MFSK) and differentially coherent binary phase-shift keying (DPSK) in a slow nonselective Nakagami-m (1960) fading channel. He gives simple expressions for the asymptotic slopes of probability of bit error for large signal-to-noise ratio and shows that the effective order of di... View full abstract»

• ### Stability analysis of interconnected single-hop random-access networks

Publication Year: 1992, Page(s):556 - 567
Cited by:  Papers (4)
| |PDF (1068 KB)

The interconnection of two single-hop random-access networks is considered. In each network a station, called the bridge node, receives internetwork packets from the local users and forwards them to the bridge node of the other network via a point-to-point link, for subsequent broadcasting to the users of that network. In each network, the bridge node shares the available broadcast channel with th... View full abstract»

• ### Nonblocking property of reverse banyan networks

Publication Year: 1992, Page(s):472 - 476
Cited by:  Papers (38)  |  Patents (2)
| |PDF (308 KB)

The authors present a new nonblocking property of the reverse banyan network under a particular input packet pattern at the input ports. The reverse banyan network is the mirror image of the banyan network. If the input packets of the N×N reverse banyan network have consecutive output address as modulo N, then the reverse banyan network is nonblocking. The routing ... View full abstract»

• ### A VLSI design for a trace-back Viterbi decoder

Publication Year: 1992, Page(s):616 - 624
Cited by:  Papers (49)  |  Patents (6)
| |PDF (756 KB)

A systolic Viterbi decoder for convolutional codes is developed which uses the trace-back method to reduce the amount of data needed to be stored in registers. It is shown that this new algorithm requires a smaller chip size and achieves a faster decoding time than other existing methods View full abstract»

• ### Multidimensional signal sets through the shell construction for parallel channels

Publication Year: 1992, Page(s):500 - 512
Cited by:  Papers (19)  |  Patents (4)
| |PDF (1088 KB)

The authors derive a procedure to send r bits on M parallel channels. A decomposition of the best constellation in ZM+(1/2, . . ., 1/2) is given in terms of the cross-products of lower dimensional shells of points. The proposed scheme can be used with good known coset codes to provide an alternate method of coded modulation. The results indicate that one can ... View full abstract»

• ### Relation between transmission and throughput of slotted ALOHA local packet radio networks

Publication Year: 1992, Page(s):577 - 583
Cited by:  Papers (29)
| |PDF (588 KB)

A new method for the exact calculation of the throughput of a centralized slotted ALOHA packet radio network over slow Rayleigh-fading channels is presented and the results are compared with the computer simulations. Also, upper and lower bounds on the performance are provided. The effects of capture on the throughput of the system are related to the modulation and coding technique, signal to nois... View full abstract»

• ### New performance bounds of a class off self-routing networks

Publication Year: 1992, Page(s):636 - 641
Cited by:  Papers (1)
| |PDF (444 KB)

Conventional bounds for the maximum throughput of an unbuffered banyan network and its topology equivalents are based on the parallel path setup (PPS) assumption, i.e. paths are set up simultaneously. But the bounds derived under the PPS assumption can be surpassed with a slight variation on the path setup scheme. The authors study the maximum throughputs of an unbuffered banyan network and its to... View full abstract»

• ### A simple formula for calculation of power loss in digital transmission lines

Publication Year: 1992, Page(s):484 - 486
Cited by:  Papers (1)
| |PDF (164 KB)

Presented is a two-parameter model of line loss in which the frequency dependence of loss is determined by way of the loss at the selected frequency and the conductor diameter. The model quite faithfully represents the actual loss of the line, and is much better than the often used √f model View full abstract»

• ### Multiple-access algorithms for a system with mixed traffic: high and low priority

Publication Year: 1992, Page(s):541 - 555
Cited by:  Papers (16)  |  Patents (3)
| |PDF (1120 KB)

The author considers a system where a single channel is shared by both high- and low-priority data. He assumes packet transmissions from both data categories and slotted channel. In addition, he assumes binary (collision versus noncollision) feedback per slot, and limited feedback sensing capabilities for all users in the system. He assumes that the high-priority data are generated by a well-defin... View full abstract»

• ### Optimization of signal distribution networks using simulated annealing

Publication Year: 1992, Page(s):465 - 471
Cited by:  Papers (3)
| |PDF (588 KB)

The author discusses the use of simulated annealing for optimizing signal distribution networks consisting of multiplexers, switches, buses and end-devices or users. A linear algebraic approach is developed for application of simulated annealing to problems of this kind. The author shows how such an approach allows for the optimization of general capacity-constrained signal distribution networks c... View full abstract»

• ### Real-time combining of residual carrier array signals using ML weight estimates

Publication Year: 1992, Page(s):604 - 615
Cited by:  Papers (12)
| |PDF (936 KB)

A real-time digital signal combining system for use with array feeds is proposed. The combining system attempts to compensate for signal-to-noise ratio (SNR) loss resulting from antenna deformations induced by gravitational and atmospheric effects. The combining weights are obtained directly from the observed residual carrier samples in each channel using a sliding-window' implementation of a max... View full abstract»

• ### Computing the probability of undetected error for shortened cyclic codes

Publication Year: 1992, Page(s):494 - 499
Cited by:  Papers (10)
| |PDF (488 KB)

The authors present a general technique for computing P e for all possible shortened versions of cyclic codes generated by any given polynomial. The technique is recursive, i.e. computes Pe for a given code block length n from that of the code block length n-1. The proposed computation technique for determining Pe does n... View full abstract»

• ### Traffic processing algorithms for the SIGnet metropolitan area network

Publication Year: 1992, Page(s):568 - 576
Cited by:  Papers (6)
| |PDF (824 KB)

Traffic processing algorithms are introduced for SIGnet (slotted interconnected-grid network), which is intended for local and metropolitan area backbone communication networks using multichannel optical transmission media. The design is motivated by the development of inexpensive multichannel capabilities based on dense wavelength division multiplexing (WDM) and future coherent optical systems. I... View full abstract»

• ### Simple finite-state fault detectors for communication networks

Publication Year: 1992, Page(s):477 - 479
Cited by:  Papers (30)
| |PDF (252 KB)

This work provides a framework for approaching the problem of fault detection in communication processes. Communication processes are modeled as finite state machines (FSMs), and the authors' model consists of two FSMs, one observing part of the behavior of the other. The authors prove that specific classes of faults are detectable, and give a procedure for constructing detectors, but the design o... View full abstract»

• ### Call scheduling algorithms in a multicast switch

Publication Year: 1992, Page(s):625 - 635
Cited by:  Papers (23)  |  Patents (4)
| |PDF (800 KB)

Multicast switching is emerging as a new switching technology that can provide efficient transport in a broadband network for video and other multipoint communication services. The authors develop and analyze call scheduling algorithms for a multicast switch. In particular, they examine two general classes of scheduling algorithms: call packing algorithms and call splitting algorithms. The perform... View full abstract»

• ### A modified trellis coding technique for partial response channels

Publication Year: 1992, Page(s):513 - 520
Cited by:  Papers (5)  |  Patents (4)
| |PDF (632 KB)

The problem of trellis coding for multilevel baseband transmission over partial response channels with transfer polynomials of the form (1±DN) is addressed. The novel method presented here accounts for the channel memory by using multidimensional signal sets and partitioning the signal set present at the noiseless channel output. It is shown that this coding technique ca... View full abstract»

• ### Time compression multiplex transmission system using a 1.3 μm semiconductor laser as a transmitter and a receiver

Publication Year: 1992, Page(s):584 - 590
Cited by:  Papers (14)
| |PDF (512 KB)

A bidirectional system using 1.3 μm lasers as a transmitter and a receiver are investigated. The lasers considered are commercially available Fabry-Perot and distributed-feedback lasers. It is found that the poor performance of a laser receiver, compared to a PIN receiver, stems from three factors: low responsivity, high capacitance, and polarization dependence of responsivity, high capacitance... View full abstract»

• ### Efficient ARQ schemes with multiple copy decoding

Publication Year: 1992, Page(s):642 - 650
Cited by:  Papers (30)  |  Patents (1)
| |PDF (584 KB)

Several modifications of an efficient automatic repeat request (ARQ) scheme proposed by Weldon (see IEEE Trans. Commun., vol.COM-30, p.480, 1982) are studied. Unlike Weldon's scheme, in which all erroneous data packets are discarded, the present schemes make use of copies of the data packet which may contain errors. A number of channel models are considered, namely, a binary symmetric channel, a n... View full abstract»

• ### Lock detection in Costas loops

Publication Year: 1992, Page(s):480 - 483
Cited by:  Papers (9)  |  Patents (1)
| |PDF (212 KB)

Previous analyses of lock detector algorithms for Costas loops have ignored the effects of the inherent correlation between samples of the phase error process. In this work, analysis and simulations are used to quantify the effects of phase correlation on lock detection for the square law' and absolute value' type detectors. Results which depict the lock detection probability as a function of lo... View full abstract»

• ### Further results in the unified analysis of digital communication systems

Publication Year: 1992, Page(s):521 - 532
Cited by:  Papers (13)
| |PDF (856 KB)

Stein's (1964) method can be extended to the analysis of the bit error probability (BEP) of quadrature phase shift keying (QPSK), staggered QPSK, and minimum shift keying (MSK) communication systems. The resultant noisy reference BEP waterfall curves are presented. The numerical advantages of this technique and some practical results are discussed. In a parallel manner, the BEP for quadrature ampl... View full abstract»

• ### Bit error rate of binary and quaternary DPSK signals with multiple differential feedback detection

Publication Year: 1992, Page(s):457 - 460
Cited by:  Papers (112)  |  Patents (1)
| |PDF (224 KB)

A differentially coherent detection scheme with improved bit error rate (BER) performance is presented for differentially encoded binary and quaternary phase shift keying (PSK) modulation. The improvement is based on using L symbol detectors with delays of 1, 2, . . ., L symbol periods and on feeding back detected PSK symbols. Exact formulas for the bit error probability are deri... View full abstract»

• ### Delay upper bounds for a finite user random-access system with bursty arrivals

Publication Year: 1992, Page(s):591 - 596
Cited by:  Papers (3)
| |PDF (484 KB)

The authors study the effect of burstiness of packet arrivals on the performance of a buffered finite-user random-access system. Primarily, they formulate and analyze a protocol that exploits the burstiness of arrivals and the presence of buffers. In addition, it is shown that the boundary of the region in which infinite user models best approximate a finite-user system is dependent on the burstin... View full abstract»

• ### A discrete-time approach to the modeling of carrier-sense multiple-access on the bus topology

Publication Year: 1992, Page(s):533 - 540
Cited by:  Papers (3)
| |PDF (696 KB)

This work carries out an exact analysis of carrier sense multiaccess (CSMA) on the bus topology using fine-grain synchronization; that is, synchronization on the order of the distance between adjacent stations. The author models a system with a finite number of users transmitting on a bus using CSMA without collision detection. The model can accommodate any arbitrary station distribution. He evalu... View full abstract»

• ### A simple, accurate method to calculate spread-spectrum multiple-access error probabilities

Publication Year: 1992, Page(s):461 - 464
Cited by:  Papers (304)  |  Patents (22)
| |PDF (228 KB)

The exact calculation of error probabilities for direct-sequence spread-spectrum multiple-access (DS/SSMA) systems has been addressed in the literature. The exact calculation is computationally difficult, so emphasis has been on approximations and bounds. One particularly attractive approximation is to just use a signal-to-noise ratio in a Gaussian approximation, the standard approximation'. Unfo... View full abstract»

• ### SS/TDMA scheduling for satellite clusters

Publication Year: 1992, Page(s):597 - 603
Cited by:  Papers (19)
| |PDF (588 KB)

The authors present a novel approach to the optimal time-slot assignment problem for a general satellite-switched time-division multiple-access (SS/TDMA) satellite cluster with intersatellite links (ISLs) interconnection. The proposed allocation algorithm accounts for the following: systems with any number of satellites; each satellite covers an arbitrary number of zones; no onboard buffering at t... View full abstract»

## Aims & Scope

IEEE Transactions on Communications focuses on all telecommunications including telephone, telegraphy, facsimile, and point-to-point television by electromagnetic propagation.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Naofal Al-Dhahir
University of Texas at Dallas