Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Communications

Issue 3 • Mar 1990

Filter Results

Displaying Results 1 - 19 of 19
  • A new metric for dynamic routing algorithms

    Publication Year: 1990, Page(s):360 - 367
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    A dynamic routing algorithm that has as its goal the control of congestion in a packet switching network is presented. The algorithm is based in part on the ARPANET SPF algorithm. However, instead of employing a delay metric, the authors make use of a combination of link and buffer utilizations. A detailed simulation model of the ARPANET was constructed to compare the performance of the congestion... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed routing with on-line marginal delay estimation

    Publication Year: 1990, Page(s):348 - 359
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    A procedure is presented for estimating online marginal packet delays through links with respect to link flows without making the standard assumptions (exponentially distributed packet lengths, Poisson arrival processes). This procedure is based on a technique known as perturbation analysis. No knowledge of network parameters (arrival rates, link capacities) is required. This is used in the contex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-dimensional encoding by finite-state encoders

    Publication Year: 1990, Page(s):341 - 347
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Distortion-free compressibility of individual pictures by finite-state encoders is investigated. In a recent paper (see IEEE Trans. Inform. Theory, vol.32, no.1, p.1-8, 1986) the compressibility of a given picture I was defined and shown to be the asymptotically attainable lower bound on the compression ratio that can be achieved for I by any finite-state encoder. Here, a differe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of a twisted-wire pair: Gaussian model

    Publication Year: 1990, Page(s):379 - 383
    Cited by:  Papers (56)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    The performance of a twisted-pair channel is assumed to be dominated by near-end crosstalk (NEXT) from other pairs in the same cable. Both intrabuilding local and central office loop channels can be modeled as NEXT-dominated channels. The capacity of this type of channel is found, using a Gaussian model. It is shown that the capacity is independent of the transmitted power spectral density. The re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of DC input response for a class of one-bit feedback encoders

    Publication Year: 1990, Page(s):337 - 340
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    A class of one-bit feedback encoders that includes sigma-delta modulation encoders, data modulation encoders, and some DPCM encoders is defined. For any encoder from the class, it is shown that the encoder output sequence in response to a DC input sequence is a typical sequence for a certain strict-sense stationary, ergodic process whose power spectral density is determined. The result is applied ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable rate speech coding for asynchronous transfer mode

    Publication Year: 1990, Page(s):277 - 284
    Cited by:  Papers (10)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    A new speech coding and multiplexing scheme matched to the asynchronous transfer mode is described. A block coding technique that is based on a variable-rate coding algorithm that makes the most of the burstiness of voice information is employed. The main feature of the scheme is considerable bit reduction, which is attained by a fairly simple algorithm. It is demonstrated that the proposed algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semaphore queues: modeling multilayered window flow control mechanisms

    Publication Year: 1990, Page(s):309 - 317
    Cited by:  Papers (23)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    An open queuing network for analyzing multilayered window flow control mechanisms consisting of different subnetworks is presented. The number of customers in each subnetwork is controlled by a semaphore queue. The queuing network is analyzed approximately using decomposition and aggregation. The approximation was validated against exact numerical and simulation data, and it was found to have an a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple derivation of the power spectrum of full-response CPM and some of its properties

    Publication Year: 1990, Page(s):267 - 269
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    Using a new representation for continuous-phase modulated (CPM) signals, it is shown how a closed-form expression for the power spectral density of full-response M-ary CPM with modulation index J /M can be obtained by straightforward computations. This result is used to provide an explanation of the fact that this power spectral density depends only on J and not... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of a twisted-wire pair: peak-power constraint

    Publication Year: 1990, Page(s):368 - 378
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The capacity of a twisted-pair channel (TPC) with a peak-power constraint imposed on the transmitted signal is considered. Bounds on the capacity are evaluated for two models of the near-end crosstalk (NEXT). The NEXT is modeled either by a peak-limited signal governed by the same probability law characterizing the transmitted signal, or by a Gaussian process possessing the same power spectral den... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evaluation of error performance estimation schemes for DS1 transmission systems carrying live traffic

    Publication Year: 1990, Page(s):384 - 391
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Under the memoryless binary symmetric channel assumption, the author evaluates performance estimation schemes for DS1 transmission systems carrying live traffic. Bipolar violations, framing bit errors, and code-detected errors are commonly used to estimate bit error ratios and the respective numbers of errored seconds and severely errored seconds that are fundamental parameters in characterizing t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A burst-error-correcting Viterbi algorithm

    Publication Year: 1990, Page(s):285 - 291
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    A dual-mode burst-error-correcting algorithm that combines maximum-likelihood decoding with a burst detection scheme is presented. The decoder nominally operates as a Viterbi decoder and switches to time diversity error recovery whenever an uncorrectable error pattern is identified. It is demonstrated that the new scheme outperforms interleaving strategies under the constraint of a fixed overall d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate performance analysis and simulation study for variable-channel-per-burst SS-TDMA

    Publication Year: 1990, Page(s):318 - 326
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    An analysis is presented of the traffic performance of a variable-channel-per-burst (VCPB) satellite-switched time-division multiple access (SS-TDMA) that dynamically reconfigures traffic bursts. An SS-TDMA system with an onboard baseband switch is used as the VCPB application system. Bursts are assigned to each earth station one-by-one. Idle channels of other bursts are transferred to a burst hav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationship between the saddlepoint approximation and the modified Chernoff bound [optical communication]

    Publication Year: 1990, Page(s):270 - 272
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    A comparison is made of two methods for the computation of the probability that the sum of a Gaussian and a nonGaussian random variable exceeds a certain threshold value. The two methods, the saddlepoint approximation (SAP) and the modified Chernoff bound, are closely related to one another. For the computation of error probabilities in digital optical communications where both methods can be appl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking loop for fading dispersive channels

    Publication Year: 1990, Page(s):292 - 299
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    An optimum closed-loop symbol synchronizer operating over fading dispersive channels is developed. It is shown that the optimum tracking synchronizer is a multiplier that forms the product of the received signal and a filtered version of it, the filter impulse response is the first derivative with respect to time (or frequency) of the autocorrelation function of the signal part of the received wav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal block cosine transform image coding for noisy channels

    Publication Year: 1990, Page(s):327 - 336
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB)

    A method is presented for the joint source-channel coding optimization of a scheme based on the two-dimensional block cosine transform when the output of the encoder is to be transmitted via a memoryless binary symmetric channel. The authors' approach involves an iterative algorithm for the design of the quantizers (in the presence of channel errors) used for encoding the transform coefficients. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Markovian access protocols in satellite channels

    Publication Year: 1990, Page(s):273 - 276
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    The theory developed by J.-T. Lim and S.M. Meerkov (see ibid., vol.COM-35, p.1278-88, Dec. 1987) is extended to channels with long propagation delays. The performance characteristics of Markovian access control protocols in satellite channels are evaluated. It is shown that the channel propagation delay may lead to improvements in systems behavior, i.e. to elimination of the saturation effects and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Golomb-Posner codes and a remark of W.W. Wu about secret-sharing systems

    Publication Year: 1990, Page(s):261 - 262
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    In a recent book (Elements of Digital Satellite Communication, vol.II, 1985), W.W. Wu has shown that all the secret-sharing systems known at the time his book was written can be described in terms of Reed-Solomon codes. He has also remarked that all are connected with latin squares and has illustrated this remark by means of examples. However, his examples construct secret-sharing systems in which... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-symbol differential detection of MPSK

    Publication Year: 1990, Page(s):300 - 308
    Cited by:  Papers (476)  |  Patents (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    A differential detection technique for MPSK (multiple-phase shift keying), which uses a multiple-symbol observation interval, is presented, and its performance is analyzed and simulated. The technique makes use of maximum-likelihood sequence estimation of the transmitted phases rather than symbol-by-symbol detection as in the conventional differential detection. Thus, the performance of this multi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified majority-logic decoders for use in convolutionally encoded hybrid-ARQ systems

    Publication Year: 1990, Page(s):263 - 266
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A method is demonstrated for modifying majority-logic convolutional decoders fur use in type-1 hybrid-ARQ protocols. Majority-logic decoders generate reliability information in the form of orthogonal sets of parity check sums. The modified decoder uses this information to identify received packets whose decoded data may be unreliable and to request their retransmission 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