By Topic

IEEE Transactions on Communications

Issue 12 • Dec. 1991

Filter Results

Displaying Results 1 - 23 of 23
  • 1991 Technical reviewers

    Publication Year: 1991, Page(s):1900 - 1904
    Request permission for commercial reuse | PDF file iconPDF (481 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1991, Page(s):I1 - I7
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (1501 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 1991, Page(s):I7 - I21
    Request permission for commercial reuse | PDF file iconPDF (3005 KB)
    Freely Available from IEEE
  • Signal-to-interference calculations for corner-excited cellular communications systems

    Publication Year: 1991, Page(s):1886 - 1896
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    Signal-to-inference ratio calculations for corner-excited cellular communications systems are presented. Specifically, the ratio of median signal power to the sum of median interference powers is considered. The interference model includes cochannel interference, and immediately adjacent as well as nonimmediately adjacent channel interference. Related system parameters are cluster size, receiver, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congestion-free communication in high-speed packet networks

    Publication Year: 1991, Page(s):1802 - 1812
    Cited by:  Papers (107)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The process of packet clustering in a network with well-regulated input traffic is studied and a strategy for congestion-free communication in packet networks is proposed. The strategy provides guaranteed services per connection with no packet loss and an end-to-end delay which is a constant plus a small bounded jitter term. It is composed of an admission policy imposed per connection at the sourc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multipoint communication service for interactive applications

    Publication Year: 1991, Page(s):1875 - 1885
    Cited by:  Papers (9)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    The multipoint communication layer (MCL) is a generic multipoint communication service designed to support highly interactive multimedia conferencing applications. It supports full-duplex multipoint communication between an arbitrary number of connected locations over a variety of networks. MCL design was driven by the demanding real-time multipoint communication requirements of MICA (multimedia i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource allocation in a dynamically partitionable bus network using a graph coloring algorithm

    Publication Year: 1991, Page(s):1794 - 1801
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    An efficient dynamic graph traversal algorithm is used to identify nonconflicting requests and to allocate network resources in a dynamically partitionable bus network (DPBN). In centralized network control a special processor receives from the control computer of a partitionable bus network an adjacency matrix which indicates conflicts among requests. It applies the dynamic graph traversal algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal probability-of-error thresholds and performance for two versions of the sign detector

    Publication Year: 1991, Page(s):1726 - 1728
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Expressions are obtained for specifying the optimal error probability (minimum Pe) thresholds λ01 and λ02 for the traditional and modified sign detectors, respectively. These thresholds are shown to depend on the parameters p, P1, and M where: M is the number of observations z... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The FODA-TDMA satellite access scheme: presentation, study of the system, and results

    Publication Year: 1991, Page(s):1823 - 1831
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    A description is given of FODA-TDMA (FIFO ordered demand assignment-TDMA), a satellite access scheme designed for mixed traffic (patent N. 9373A/89). The study of the system is presented and the choice of some parameters is justified. A simplified analytic solution is found, describing the steady-state behavior of the system. Some results of the simulation tests for an already existing hardware en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voice packet loss: destination versus internodal links

    Publication Year: 1991, Page(s):1733 - 1736
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Voice packet loss behavior at both the destination and internodal links in a packet-switched network is investigated. The fractional loss and blocking time periods for both are derived using a bivariate Markov model. The numerical results show that blocking due to the delay constraint at the destination can result in long periods of consecutive packet loss, which seriously degrade voice quality. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance analysis of a concatenated ARQ scheme using parity retransmissions

    Publication Year: 1991, Page(s):1869 - 1874
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    The authors analyze an ARQ (automatic repeat request) scheme using parity retransmissions. By dividing each transmission block into subblocks, the combination of a transmission block and its retransmission block has the structure of a concatenated code. They derive formulae for calculating an upper bound on the probability of undetected errors and a lower bound on the throughput for such an ARQ sc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of cellular networks

    Publication Year: 1991, Page(s):1787 - 1793
    Cited by:  Papers (77)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Dynamic channel allocation can reduce the probability of blocking in cellular telephone networks. However, more is needed to achieve optimal performance. The author aims at estimating the minimal blocking probability for some simple cellular networks. Some dynamic channel allocation strategies are analyzed, the optimal performance (obtained by dynamic allocation and flow control) of some very simp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Closed solution of Berlekamp's algorithm for fast decoding of BCH codes

    Publication Year: 1991, Page(s):1721 - 1725
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    A decision tree solution is presented for the most complicated step in decoding binary BCH codes, namely, the computation of an error location polynomial over GF(2m) from the syndrome vector of received data. The author runs S. Lin's (1970) iterative version of the Berlekamp-Massey algorithm symbolically, keeping the results at each level in the form of branches of a binary dec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of automatic network management controls

    Publication Year: 1991, Page(s):1776 - 1786
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    The performance response of circuit-switched networks with stored program control exchanges is analyzed under nonstationary traffic conditions. Models of real time traffic measurements and dynamic flows in such networks are developed. A framework for analysis and design of state-dependent routing and flow control algorithms is provided based on concepts of various traffic measurements and differen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Input buffer limiting: behavior analysis of a node throughout the range of blocking probabilities

    Publication Year: 1991, Page(s):1813 - 1822
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    A numerical method is suggested for estimating the performance parameters of a node with input buffer limiting, throughout the range of blocking probabilities. Congestion is attributed to the sudden increase in the effective service time when the input rate increases. This sudden increase, resulting in the thrashing of the throughput rate, can be related to changes in the shape of the potential fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimum number of interrupts in time-slot assignments for time-division multiple-access systems

    Publication Year: 1991, Page(s):1729 - 1732
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    The authors study the minimum number of interrupts in an optimal time-slot assignment of a time-division multiple-access (TDMA) system. If the number of channels c in the TDMA systems equals 2, then there always exists an optimal assignment with, at most, one interrupt. If c⩾3, then there exist TDMA systems for which each optimal assignment requires at least (c-1)(c-2) interrupts View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PN code-aided ranging for optical satellite communication systems

    Publication Year: 1991, Page(s):1832 - 1844
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    A model for the pseudonoise (PN) code-aided estimation of the transmission path delay and ranging for direct-detection on-off-keying (OOK) optical intersatellite channels is suggested in which the intensity of the optical field is modulated by a PN code and random binary data symbols. A closed-loop code-tracking loop model, motivated by the maximum-likelihood (ML) estimation of the phase differenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general class of rearrangeable interconnection networks

    Publication Year: 1991, Page(s):1737 - 1739
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    A class of rearrangeable interconnection networks which includes the Benes network as a special case is identified. An instance of this class consists of a set of parallel planes each consisting of a Delta network with a suitable number of additional stages. A formal definition is given and a rearrangeability condition is proven which gives a tradeoff between the number of planes and additional st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image sequence coding by split and merge

    Publication Year: 1991, Page(s):1845 - 1855
    Cited by:  Papers (39)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    A method is described for reducing the information contained in an image sequence, while retaining the information necessary for the interpretation of the sequence by a human observer. The method consists of first locating the redundant information, reducing the degree of redundancy, and coding the result. The sequence is treated as a single 3D data volume, the voxels of which are grouped into sev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The evaluation of error probabilities for intersymbol and cochannel interference

    Publication Year: 1991, Page(s):1740 - 1749
    Cited by:  Papers (151)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    An efficient series that can be used to calculate the probability of error in a binary symmetric channel with intersymbol interference and additive noise is derived. The series is derived by representing the noise complementary probability distribution function by an exact or approximate Fourier series. Bounds on the accuracy of the estimate are derived for Gaussian noise. Examples show that only ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new segmentation algorithm for videophone applications based on stereo image pairs

    Publication Year: 1991, Page(s):1856 - 1868
    Cited by:  Papers (11)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The stereo image pair of a speaking person in front of a stationary background taken by two CCD-cameras is used as an input scene for a new segmentation algorithm. The algorithm is based on the phase correlation technique which provides a disparity vector field. A brightness adjustment procedure is performed to provide stereo image pairs suited for the segmentation procedure. Then, a coarse segmen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error bounds for trellis-coded MPSK on a fading mobile satellite channel

    Publication Year: 1991, Page(s):1750 - 1761
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    Analytical performance bounds are presented for trellis-coded MPSK, transmitted over a satellite-based land mobile channel. Upper bounds are evaluated using the well-known transfer function bounding technique, and lower bounds are achieved through knowledge of exact pairwise error probabilities. In order to analyze practical trellis-codes (four or more states), the uniform properties displayed by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connection management for the transport layer: service specification and protocol verification

    Publication Year: 1991, Page(s):1762 - 1775
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1268 KB)

    A symmetric connection management service between two service access points is specified, using a state transition system and safety and progress requirements. At each access point. the user can request connection establishment, request connection termination, and signal whether or not they are willing to accept connection requests from the remote user. The protocol can indicate connection establi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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