By Topic

IEEE Communications Letters

Issue 9 • Date Sept. 2004

Filter Results

Displaying Results 1 - 24 of 24
  • Table of contents

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • IEEE Communications Letters publication information

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Reduction in harmonic distortion through use of aperiodic timing in frequency demodulation

    Publication Year: 2004, Page(s):549 - 551
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    It is demonstrated, theoretically and experimentally, that aperiodic timing based on the FM signal, as opposed to periodic timing based on a reference carrier, can lead to a significant reduction in harmonic distortion in an FM demodulator based on an exclusive OR gate and a sample and hold structure. A 20-dB improvement in harmonic distortion can be readily achieved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SER of threshold-based hybrid selection/maximal-ratio combining in equicorrelated Nakagami fading

    Publication Year: 2004, Page(s):552 - 554
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    The average symbol error rate (SER) of threshold-based hybrid selection/maximal-ratio combining (T-HS/MRC) in equicorrelated Nakagami-m fading is obtained for positive integer values of fading parameter, m. The derivation allows different M-ary linear modulation schemes. We illustrate our methodology using M-ary phase-shift keying as an example. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A channel estimation algorithm for MIMO-SCFDE

    Publication Year: 2004, Page(s):555 - 557
    Cited by:  Papers (26)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    This letter proposes a novel method for channel estimation in a single-carrier multiple input-multiple output (MIMO) system with frequency-domain equalization/detection. To this end, we construct novel short MIMO training sequences that have constant envelope in the time domain to preclude the peak-to-average power ratio problem encountered in many systems that utilize the frequency domain for dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-time trellis-coded transmissions with parallel sequences over time-varying channels

    Publication Year: 2004, Page(s):558 - 560
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    In this letter, we investigate the performance of space-time trellis codes in a time-varying channel of a multiple-access wireless system where symbols of a user are transmitted using parallel sequences. Using rank and determinant criteria, it is shown that space-time trellis codes originally designed for quasi-static channels are efficient codes for this system as well. Simulation results demonst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data dissemination over wireless sensor networks

    Publication Year: 2004, Page(s):561 - 563
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    In sensor networks, it is crucial to design and employ energy-efficient communication protocols since nodes are battery-powered, and thus their lifetimes are limited. We propose a data dissemination protocol for periodic data updates in wireless sensor networks, called SAFE (sinks accessing data from environments), which attempts to save energy through data delivery path sharing among multiple sin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the practical performance of VBLAST

    Publication Year: 2004, Page(s):564 - 566
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    In this letter, we will derive a lower bound for the mutual information of VBLAST in a spatially correlated continuously fading channel with imperfect channel state information at the receiver. The effect of error propagation inherent in VBLAST will also be included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative decoding with a hamming threshold for block turbo codes

    Publication Year: 2004, Page(s):567 - 569
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    This work introduces a novel approach to increase the performance of block turbo codes (BTCs). The idea is based on using a Hamming threshold to limit the search for the maximum-likelihood (ML) codeword within only those codewords that lie within this threshold. The proposed iterative decoding approach is shown to offer both significant coding gain and complexity reduction over the standard iterat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic MDS erasure codes based on Vandermonde matrices

    Publication Year: 2004, Page(s):570 - 572
    Cited by:  Papers (37)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB) | HTML iconHTML

    An increasing number of applications in computer communications uses erasure codes to cope with packet losses. Systematic maximum-distance separable (MDS) codes are often the best adapted codes. This letter introduces new systematic MDS erasure codes constructed from two Vandermonde matrices. These codes have lower coding and decoding complexities than the others systematic MDS erasure codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision-directed compensation of phase noise and residual frequency offset in a space-Time OFDM receiver

    Publication Year: 2004, Page(s):573 - 575
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    This letter addresses the simultaneous perturbation of a space-time (ST) OFDM receiver by a PHase Noise (PHN) process plus a fixed but unknown residual frequency offset (RFO), and then proceeds to propose two decision-directed schemes for their joint compensation. Reduced-complexity modifications thereof are also considered, and the corresponding symbol error rate (SER) performance loss is shown t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient DMT/OFDM transmission with insufficient cyclic prefix

    Publication Year: 2004, Page(s):576 - 578
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    In this letter, we describe a new method to eliminate intersymbol interference (ISI) and interchannel interference (ICI) for discrete multitone/orthogonal frequency division multiplexing (DMT/OFDM) systems with insufficient cyclic prefix (CP). The proposed structure prevents ICI with a preprocessing method that utilizes redundancy in the frequency domain at the transmitter and removes ISI with a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative layered space-time receivers for single-carrier transmission over severe time-dispersive channels

    Publication Year: 2004, Page(s):579 - 581
    Cited by:  Papers (76)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB) | HTML iconHTML

    This letter presents an iterative layered space-time (LST) receiver structure for single-carrier (SC)-based transmission in severe time-dispersive channels. The proposed receiver combines LST principles with iterative block decision feedback equalization (IB-DFE) techniques. Our performance results show that the proposed receivers have excellent performance in severe time-dispersive channels, whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A batch processing constant modulus algorithm

    Publication Year: 2004, Page(s):582 - 584
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    We present a batch processing constant modulus algorithm (BP-CMA) derived by a nonlinear optimization approach to minimizing the constant modulus (CM) criterion. BP-CMA is a line search iteration algorithm. The search direction may be taken as deepest descent direction or Newton direction. The exact step size is obtained from the roots of a cubic equation. The initial value is calculated by using ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Captured-frame eligibility and round-robin matching for input-queued packet switches

    Publication Year: 2004, Page(s):585 - 587
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB) | HTML iconHTML

    A variety of matching schemes for input-queued (IQ) switches that deliver high throughput under traffic with uniform distributions has been proposed. However, there is a need of matching schemes that provide high throughput under several admissible traffic patterns, including those with nonuniform distributions, while keeping implementation complexity low. In this letter, first, we introduce the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-state packet marking framework for approximate fair bandwidth allocation

    Publication Year: 2004, Page(s):588 - 590
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Misbehaving, non-congestion-reactive traffic is on the rise in the Internet. One way to control misbehaving traffic is to enforce local fairness among flows. Locally fair policies, such as fair-queueing and other fair AQM schemes, are inadequate to simultaneously control misbehaving traffic and provide high network utilization. We thus need to enforce globally fair bandwidth allocations. However, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A sampling technique for variance estimation of long-range dependent traffic

    Publication Year: 2004, Page(s):591 - 593
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    Due to the long-range dependence of Internet traffic, the sampling distribution of the variance is very hard to obtain and, as a result, confidence intervals cannot be provided. Nevertheless, we show that the r-decimated variance sampling distribution can be approximated by a χ2 distribution. This sampling technique can be used to provide a confidence interval for the variance, with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing spare capacity through traffic splitting

    Publication Year: 2004, Page(s):594 - 596
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    By splitting traffic across an optimal number of disjoint paths, it is shown a capacity saving of up to 11% is possible in randomly generated networks relative to the most capacity efficient mesh-based restoration scheme available to date. An algorithm yielding the optimal number of disjoint paths is developed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-phase coding multichannel MAC protocol with MAI mitigation for mobile ad hoc networks

    Publication Year: 2004, Page(s):597 - 599
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    This letter introduces a novel multichannel medium access control (MAC) protocol for mobile ad hoc networks (MANETs) based on a scalable two-phase coding scheme, which eliminates the hidden terminal problem (HTP) without exchange of neighborhood information. Furthermore, power control is incorporated to mitigate multiple-access interference (MAI). Simulation results show that significant improveme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lost retransmission detection for TCP SACK

    Publication Year: 2004, Page(s):600 - 602
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    There have been a lot of works to avoid retransmission timeout (RTO) of transmission control protocol (TCP) that takes place in an unnecessary situation. However, most current TCP implementations, even if selective acknowledgment (SACK) option is used, do not have a mechanism to detect a lost retransmission and avoid subsequent RTO. In this letter, we propose a simple modification that enables a T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Communications Letters Edics

    Publication Year: 2004, Page(s): 603
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • IEEE Communications Letters Information for authors

    Publication Year: 2004, Page(s): 604
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • IEEE Communications Society Information

    Publication Year: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • IEEE Communications Letters blank page

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (4 KB)
    Freely Available from IEEE

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