By Topic

IEEE Communications Letters

Issue 7 • Date July 1998

Filter Results

Displaying Results 1 - 9 of 9
  • Probability of miss analysis for packet CDMA acquisition on Rician-fading channels

    Publication Year: 1998, Page(s):177 - 179
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (101 KB)

    We analyze the probability of miss in the acquisition of direct sequence spread-spectrum packets transmitted on Rician-fading channels. The results are useful to compute the probability of a random-access packet success, and the expected number of packet transmissions needed to achieve success, on LEO satellite code-division multiple-access channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diversity combining in antenna array base station receiver for DS/CDMA system

    Publication Year: 1998, Page(s):180 - 182
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (133 KB)

    We evaluate using simulation studies the performance of several schemes for combining base station antenna array signals in wireless direct sequence code-division multiple access (DS/CDMA). The results indicate that under certain assumptions, on multiple access interference statistics, the probability of error of modified rank test (MRT) is lower than that of equal gain combining (EGG), if a few h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple taboo-based soft-decision decoding algorithm for expander codes

    Publication Year: 1998, Page(s):183 - 185
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (67 KB)

    We present a simple soft-decision decoding algorithm that modifies Sipser and Spielman's (see IEEE Trans, Inform. Theory, vol.42, p.1710-22, Nov. 1996) hard-decision sequential "bit-flipping" algorithm for decoding expander codes. The algorithm incorporates symbol reliability information and a simple "taboo" function that avoids repeated flipping of the same bit. The two algorithms have comparable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subjective effects of cell losses in voice over ATM

    Publication Year: 1998, Page(s):186 - 188
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    We present the results of formal subjective listening tests of voice transported via asynchronous transfer mode (ATM), with emphasis on cell losses. The μ-law voice samples are divided into pairs of ATM cells, one containing most significant bits (MSB) cells and the other containing least significant bits (LSB) cells. Based on isopreference testing, we conclude that: (1) isolated blocks of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tandem-crosspoint ATM switch with input and output buffers

    Publication Year: 1998, Page(s):189 - 191
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    This letter proposes a high-speed input and output buffering asynchronous transfer mode (ATM) switch, named the tandem-crosspoint (TDXP) switch, The TDXP switch consists of multiple crossbar switch planes, which are connected in tandem at every crosspoint. The TDXP switch does not increase the internal line speed in eliminating head-of-line (HOL) blocking. In addition, since the TDXP switch employ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum buffer size for overflow avoidance in ATM CBR/VBR connection multiplexing

    Publication Year: 1998, Page(s):192 - 194
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (106 KB)

    Connection admission control (CAC) functions in asynchronous transfer mode (ATM) networks require that a traffic descriptor (TD) be specified at connection setup. Existing standards define rule based traffic parameters, from which worst-case proof bounds for cell arrivals of a compliant connection can be derived. The purpose of this letter is to establish the minimum amount of buffer space actuall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic channel reservation scheme for mobile pico/microcellular networks

    Publication Year: 1998, Page(s):195 - 196
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (26 KB)

    Channel reservation based on the handoff probability of a call arriving in an adjacent cell is proposed as a more flexible and dynamic means of providing handoff priority in mobile pico/microcellular networks in which frequent handoff events are to be expected. A basic probabilistic channel reservation scheme is described and shown to yield improvements in performance, especially in terms of chann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic control scheme for the IEEE 802.14 draft MAC protocol over CATV/HFC networks

    Publication Year: 1998, Page(s):197 - 199
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    We first describe the draft multiple/random access protocol for IEEE 802.14 over the cable TV/hybrid fiber coaxial (CATV/HFC) networks. To best fit this draft protocol into the target network, we propose a dynamic control scheme to adequately adjust the parameters. Simulations of the draft protocol are then presented to depict the effectiveness of the proposed scheme and further highlight the dire... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An ARQ scheme with packet combining

    Publication Year: 1998, Page(s):200 - 202
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    In an automatic repeat request (ARQ) scheme, a packet is retransmitted if it gets corrupted due to transmission errors caused by the channel. Here we describe a ready-to-implement ARQ scheme with packet combining. An analytical description of the scheme in random error channel shows excellent agreement with simulation results. An upper bound for type-II schemes is defined. For smaller packet sizes... 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