By Topic

IEEE Communications Letters

Issue 5 • Date Sept. 1997

Filter Results

Displaying Results 1 - 11 of 11
  • Performance of the limiter-discriminator-integrator detector in frequency-hop spread-spectrum multiple-access networks

    Publication Year: 1997, Page(s):121 - 123
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (106 KB)

    This paper evaluates the performance of the limiter-discriminator-integrator detector (LDID) in asynchronous frequency-hop spread-spectrum multiple-access (AFHSS-MA) networks using binary frequency shift-keying (BFSK) modulation via Monte Carlo simulations. Both additive white Gaussian noise (AWGN) and Rayleigh-fading channels are considered and we find that the LDID offers a performance that is s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of ADSL over ISDN on German subscriber lines

    Publication Year: 1997, Page(s):124 - 126
    Cited by:  Papers (3)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (34 KB)

    The shortcomings of the existing asymmetric digital subscriber line (ADSL) standard ANSI T1.413 for application with the integrated services digital network (ISDN) are explained. An ADSL system modified by increasing the high-pass cutoff frequency of the splitter to about 140 kHz and, therefore, moving also the pilots, has been simulated under noise conditions and the ISDN requirements of the Germ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of correlated errors on the performance of TCP

    Publication Year: 1997, Page(s):127 - 129
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (34 KB)

    Wireless channels are known to introduce correlated bursts of errors at the physical layer. Although these errors affect the performance at all layers of a protocol stack, their precise impact, especially at the higher layers, is not completely understood. We study the effect of error correlations on the throughput of a single transport control protocol (TCP) Tahoe connection. We find that TCP Tah... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaching Shannon's capacity limit by 0.2 dB using simple Hamming codes

    Publication Year: 1997, Page(s):130 - 132
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    The authors show that the Shannon capacity limit for the additive white Gaussian noise (AWGN) channel can be approached within 0.27 dB at a bit error rate (BER) of 10/sup -5/ by applying long but simple Hamming codes as component codes to an iterative turbo-decoding scheme. In general, the complexity of soft-in/soft-out decoding of binary block codes is rather high. However, the application of a n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-by-bit soft-decision decoding of trellis-coded M-DPSK modulation

    Publication Year: 1997, Page(s):133 - 135
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    We present a simple soft-decision decoding method for use with trellis-coded M-ary differential phase-shift keying (M-DPSK). The demodulator assigns a separate confidence level to each bit associated with an M-ary symbol, and these confidence levels are based only on the phase of the received symbol. Decoding is performed by the standard soft-decision Viterbi decoder that is normally used for bina... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selective serial concatenation of turbo codes

    Publication Year: 1997, Page(s):136 - 139
    Cited by:  Papers (19)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (110 KB)

    A serial concatenation scheme consisting of a Bose-Chaudhuri-Hocquenghem (BCH) outer code and a turbo inner code is proposed. We first establish that only a small number of bit positions at the turbo decoder output are likely to be in error at high signal-to-noise ratios. A double-error correcting BCH outer code is used to protect these particular error prone bits. Simulation results for an additi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rejection of multiple tone interference in DS spread-spectrum systems employing minimum redundant transversal filters

    Publication Year: 1997, Page(s):140 - 142
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (151 KB)

    A direct-sequence spread-spectrum (DSSS) receiver using a new transversal filter structure called minimum redundant transversal filter (MRTF), for combating narrow-band interference is proposed. The signal-to-noise (SNR) ratio improvement factors are derived under the conditions of multiple tone interference. The effectiveness of the new suppression filter is examined and the results obtained reve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analytical model on network blocking probability

    Publication Year: 1997, Page(s):143 - 145
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    We present a new analytical model on the blocking probability of the three-stage Clos (1953) network. Due to the effect of approximations, a common problem with previously proposed analytical models is that they may not be very accurate in some cases. In particular, the blocking probability in these models contradicts the well-known deterministic nonblocking condition for the Clos network. The mos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-pushout cell discarding

    Publication Year: 1997, Page(s):146 - 148
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (54 KB)

    In asynchronous transfer mode (ATM) switching networks, buffers are required to accommodate traffic fluctuations due to statistical multiplexing. However, cell discarding takes place when the buffer space of a network node is used up during a traffic surge. Though pushout cell discarding was found to achieve fair buffer utilization and good cell loss performance, it is difficult to implement becau... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Bernoulli process approximation with buffer size adjustment for the analysis of an ATM multiplexer

    Publication Year: 1997, Page(s):149 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (83 KB)

    The heterogeneity and the burstiness of input source traffic together with large size of the shared buffer make it difficult to analyze the performance of an asynchronous transfer mode (ATM) multiplexer. Based on the asymptotic decay rate of queue length distribution at the shared buffer, we propose a Bernoulli process approximation for the individual on-off input source with buffer size adjustmen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm for minimum end-to-end delay paths

    Publication Year: 1997, Page(s):152 - 154
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (123 KB)

    We consider the transmission of a message of size r from a source to a destination with the minimum end-to-end delay over a computer network where bandwidth can be reserved and guaranteed on the links. Different paths will be required for different intervals of values for r. We propose a polynomial-time algorithm that computes a table that maps all intervals for r to the corresponding paths that m... View full abstract»

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

Aims & Scope

IEEE Communications Letters publishes letters on the frontiers of research within the field of interest of the IEEE Communications Society in a timely manner.

 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Octavia Dobre
Memorial University, Canada