By Topic

Journal of Communications and Networks

Issue 1 • Date March 2004

Filter Results

Displaying Results 1 - 19 of 19
  • Properties and performance of space-time bit-interleaved coded modulation systems in fast Rayleigh fading channels

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

    In this paper, we investigate the properties and performance of space-time bit-interleaved coded modulation (ST-BICM) systems in fast Rayleigh fading channels. We first show that ST-BICM with QPSK signaling in fast fading channels possesses the uniform distance property, which makes performance analysis tractable. We also derive the probability distribution of the squared Euclidean distance betwee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A trellis-based technique for blind channel estimation and equalization

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

    In this paper, we present a trellis-based blind channel estimation and equalization technique coupling two kinds of adaptive Viterbi algorithms. First, the initial blind channel estimation is accomplished by incorporating the list parallel Viterbi algorithm with the least mean square (LMS) updating approach. In this operation, multiple trellis mappings are preserved simultaneously and ranked in te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple finger expansion for blind interference canceller in the presence of subchip-spaced multipath components

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

    A blind interference canceller in the presence of subchip-spaced multipath channels for direct-sequence code division multiple access (DS-CDMA) down-link system is considered. This technique is based on combining the existing blind interference canceller with a technique that involves assigning subchip-tap spacing to the Rake receiver. The proposed receiver minimizes the receiver's output energy s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correlative encoded frequency shift keying (CEFSK) modulation technique

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

    A new power and bandwidth efficient modem technique-Correlative Encoded FSK (CEFSK) is proposed. CEFSK has a spectral efficiency comparable to Gaussian filtered FSK (GFSK), and it achieves 0.7dB Εb/N0 improvement at bit error rate (BER) of 1 × 10−4 over GFSK in an additive white Gaussian noise (AWGN) channel and 3.0dB improvement in a Rayleigh ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple timeout algorithm for point-to-multipoint ABR service

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

    The ABR point-to-multipoint connection is now playing a more important role than before. Many consolidation algorithms have been proposed to solve the consolidation noise problem and the slow transient response problem. But few timeout algorithms are proposed to handle the non-responsive branches for the multicast connections. Chen's algorithm needs exchanging control messages between switches [9]... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topology aggregation schemes for asymmetric link state information

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

    In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast and scalable inter-domain MPLS protection mechanism

    Publication Year: 2004, Page(s):60 - 67
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (557 KB) | HTML iconHTML

    With the fast growth of Internet and a new widespread interest in optical networks, the unparalleled potential of MultiProtocol Label Switching (MPLS) is leading to further research and development efforts. One of those areas of research is Path Protection Mechanism. It is widely accepted that layer three protection and recovery mechanisms are too slow for today's reliability requirements. Failure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS- and revenue aware adaptive scheduling algorithm

    Publication Year: 2004, Page(s):68 - 77
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (881 KB) | HTML iconHTML

    In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer's needs, n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst average queueing delay of multiple leaky-bucket-regulated streams and jumping-window regulated stream

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

    This paper presents deterministic, worst-case analysis of a queueing system whose multiple homogeneous input streams are regulated by the associated leaky buckets and the queueing system that has a single stream regulated by the jumping-window. Queueing delay averaged over all items is used for performance measure, and the worst-case input traffic and the worst-case performance are identified for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-encoded spread spectrum and Turbo coding

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

    Self-encoded multiple access (SEMA) is a unique realization of random spread spectrum. As the term implies, the spreading code is obtained from the random digital information source instead of the traditional pseudo noise (PN) code generators. The time-varying random codes can provide additional security in wireless communications. Multirate transmissions or multi-level grade of services are also ... View full abstract»

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

    Publication Year: 2004, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2004, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2004, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (121 KB)
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2004, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Journal of Communications and Networks Copyright transfer form

    Publication Year: 2004, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • [Front cover]

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • Journal of Communications and Networks (JCN) - back inside cover

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Journal of Communications and Networks (JCN) - back inside cover

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

Aims & Scope

The Journal of Communications and Networks is published six times per year, and is committed to publishing high-quality papers that advance the state-of-the-art and practical applications of communications and information networks.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Anthony Ephremides
University of Maryland