bluuebunny/crossref_metadata_2025_split huggingface dataset:
DWDM
Ring Networks
Authors: Stoll Detlef , Xie Jimin , Heiles Juergen 
Published: November 2003

Abstract
This article describes DWDM ring networks from three viewpoints. The first viewpoint is the network architecture level. Here, the architecture of two–fiber–rings and of four–fiber rings, protection schemes, and the layer network structure of all–optical transport networks are discussed. In the second viewpoint, the network element level that comprises of the optical add/drop multiplexers (OADM) and their characteristic features (i.e., add/drop capacity, static and dynamic configuration, wavelength routing capability, transparent and opaque applications) is discussed. The third viewpoint is the component level. Tunable filters, switching fabrics, WDM multiplexers and demultiplexers, and interleaver filters are the areas discussed under this viewpoint.
Image Sampling and Reconstruction
Authors: Trussell H. J. 
Published: November 2003

AbstractThe chapter reviews sampling in both two‐dimensional spatial and one‐dimensional wavelength dimensions. It is assumed the reader has previously reviewed one‐dimensional sampling for time domain signals at the level of undergraduate courses. Examples are included that show the effects of undersampling in theory and practice. The reconstruction of images is presented for both reproduction of an original image and the enlargement of images that is required so often in windows‐based image analysis.
Feedback Shift Register Sequences
Authors: Song Hong‐Yeop 
Published: November 2003

AbstractFeedback Shift Register (FSR) sequences have been successfully implemented in many communication systems for their randomness properties and ease of implementation. These include ranging and navigation systems, spread spectrum communication systems, CDMA mobile communication systems, and crypto systems such as streamciphers.This article gives a brief overview of FSR sequences, both linear and non‐linear. Two conditions on the connection logic of FSRs for better output sequences are described, which are the branchless condition and the balanced logic condition. We use mostly the state transition diagram of an FSR to describe the property of its output sequences. For linear FSR sequences, we describe the relation between the connection polynomials and the structure of the cycle decomposition in the state diagram, and hence the periodicity of the output sequences.Various randomness properties of the maximal length linear FSR sequences, known as m‐sequences, are described: balance, run‐distribution, span, ideal autocorrelation, constant‐on‐the‐coset, and cycle‐and‐add properties. Two properties, the ideal autocorrelation function and the smallest linear complexity, of m‐sequences are described in detail. Finally, a complete analysis of 4‐stage FSRs is provided.
Computer Communications Protocols
Authors: Varvarigos Emmanouel , Varvarigou Theodora 
Published: November 2003

Abstract
In order for computers to communicate with each other over a communication network, a common set of rules has to be agreed on, that specifies the format of the information exchange and the way data exchanged is to be handled by the communicating parts. We refer to this set of rules as a communication protocol. In this article we provide an introduction to communication protocols, starting with a description why correct communication protocols are sometimes difficult to design. We describe in some detail the OSI reference model, the ATM protocol and the very successful TCP/IP protocol suite. We also give particular examples of protocols designed to handle issues related to data link control, flow and congestion control, internetworking, and connection establishment in conventional and in high‐speed networks.
Virtual Private Networks
Authors: Steinemann Marc‐Alain , Braun Torsten , Danzeisen Marc , Günter Manuel 
Published: November 2003

AbstractThe tremendous growth and decreasing costs of Internet technology forced many companies to substitute expensive leased lines by connections based on Internet Protocols. This allows enterprises to establish Intranets and to offer remote employees to securely access such an Intranet. In addition, networks of different business partner can be interconnected forming Extranets. A key technology is the IP Security (IPSec) protocol suite that enhances the Internet Protocol (IP). IPSec introduces security comparable to leased lines but is much less costly due to the fact that Internet resources can be shared among different users. Such networks that are constructed using secure methods to transfer information are called Virtual Private Networks. They represent a further step towards a more secure, less costly and universal communications platform.
Carrier‐Sense Multiple Access (
CSMA
) Protocols
Authors: Georgiadis Leonidas 
Published: November 2003

Abstract
Carrier‐Sense Multiple Access protocols have found wide application in the deployment of Local Area Networks. In this article we present the basic principles or operation of these protocols. We start by examining the ALOHA system, the precursor of CSMA protocols. We proceed with the presentation of the variants, CSMA, CSMA/CD, that are used for wired communication, and CSMA/CA used for wireless communication.
Transform Coding
Authors: Goyal Vivek 
Published: November 2003

Abstract
Transform coding is source coding with a modular structure of a linear transform followed by scalar quantization and entropy coding. Ideally, the transform produces transform coefficients that are statistically independent. Then, though the encoding complexity is greatly reduced, little compression efficiency is lost by using scalar quantization and scalar entropy coding. Optimization of the transform also favors orthogonal transforms; this result and the optimal allocation of bits among the transform coefficients are developed.
Turbo Codes
Authors: Berrou Claude , Glavieux Alain 
Published: November 2003

AbstractTurbo codes are multidimensional convolutional error‐correcting codes, the decoding of which relies on an iterative process, with an exchange of probabilistic information between the decoders associated with each dimension. The basic component code is a small Recursive Systematic Convolutional (RSC) code and the construction of the multidimensional code, by way of so‐called parallel concatenation, aims to mimic a very long equivalent RSC code. In practice, a bidimensional scheme is sufficient, provided that the permutation function which is used to decorrelate the two dimensions is properly designed. Under certain conditions, turbo codes are able to achieve error correction very close to the theoretical limits calculated by Shannon, by means of random coding. Turbo coding has been adopted in several essential standards (IMT‐2000, DVB, …) and is being considered as a serious candidate for channel coding in many future communication systems. The “turbo” principle, which expresses the probabilistic message passing method, has been extended to other types of processing in receivers, such as demodulation, detection and multi‐detection, and equalization.
Polyphase Sequences
Authors: Park So Ryoung , Song Iickho 
Published: November 2003

AbstractIn this article, we review some polyphase sequences and investigate their correlation properties and corresponding applications to cellular direct sequence code division multiple access (DS/CDMA) systems. We first consider several polyphase sequences which have perfect even autocorrelation properties and thus can be used as the long spreading sequences in intercell synchronous cellular DS/CDMA systems. We then consider some polyphase sequences possessing (near) optimum even correlation functions. These (near) optimum sequences are appropriate as the long spreading sequences in intercell asynchronous cellular DS/CDMA systems. Description of the polyphase sequences are given next which have perfect even crosscorrelation properties and thus are useful as the short signature (channelization) sequences in cellular DS/CDMA systems, followed by a brief consideration of other polyphase sequences.
Turbo Product Codes for OpticalCDMASystems
Authors: McLaughlin Steven W. , Argon Cenk 
Published: November 2003

AbstractThe application of turbo product codes (TPC) in intensity modulated, direct detection (incoherent) optical code division multiple access (CDMA) systems with on‐off keying (OOK) or binary pulse position modulation (PPM) is presented in this chapter. Optical multiple access interference caused by other users is the main source of noise that degrades system performance and limits the total number of active users in an optical CDMA system. Furthermore, very long optical orthogonal code (OOC) sequences are required, which results in large bandwidth expansion. The implementation of turbo product codes in an optical CDMA system promises significant improvement of the probability of bit error, permitting a higher number of active users and a system with a reduced bandwidth expansion factor. Furthermore, this level of improvement in performance is not obtainable by conventional forward error correction (FEC) codes such as Reed‐Solomon and BCH codes.
Optical Switches
Authors: Eddie Law K. L. 
Published: November 2003

Abstract
Extensive research has been focused on constructing the next‐generation all‐optical broadband IP networks. The design goal is to avoid having any optical‐electrical‐optical conversions in a signal path. Therefore, the optical switches are to be the core part of all‐optical networks. An optical switch may cover optical cross connects and optical add‐drop multiplexers. In this article, we focus on the design of large‐scale optical cross connects (OXCs). There are passive and active OXCs. The path settings in networks are pre‐configured if passive OXCs, made with arrayed waveguide gratings (AWGs), are used. Active OXCs enable networks to set up paths dynamically. There are several new and promising technologies developed for the active OXCs. This article is focused on micro‐electromechanical systems (MEMS), liquid crystals and thermo‐bubble‐based switches. Their future deployments will definitely have a considerable impact on all‐optical IP networks.
Acoustic Telemetry
Authors: Blackmon Fletcher A. 
Published: November 2003

AbstractThis article presents a comprehensive overview of the field of underwater acoustic telemetry. A brief acoustic telemetry background is provided to illustrate the difficulties involved in underwater acoustic telemetry. Example transmitter and receiver architectures required for robust performance are discussed. Current commercially available acoustic telemetry systems, i.e. modems and their capabilities are briefly mentioned. The history, development, and applications in the relatively new field of acoustic telemetry technology are discussed. The current Navy range based, telemetry modem system is discussed in some detail. A number of specific United States Naval applications related to Navy range use are presented and discussed. Areas for current and future work in the field of underwater acoustic telemetry are presented.
Shallow‐Water Acoustic Networks*
Authors: Proakis John G. , Rice Joseph A. , Sozer Ethem M. , Stojanovic Milica 
Published: November 2003

AbstractUnderwater acoustic networks are generally formed by acoustically connected ocean bottom sensor nodes, autonomous underwater vehicles (AUVs), and surface stations that serve as gateways and provide radio communication links to on‐shore stations. The QoS of such networks is limited by the low bandwidth of acoustic transmission channels, high latency resulting from the slow propagation of sound, and elevated noise levels in some environments. The long‐term goal in the design of underwater acoustic networks is to provide for a self‐configuring network of distributed nodes with network links that automatically adapt to the environment through selection of the optimum system parameters. This paper considers several aspects in the design of shallow water acoustic networks that maximize throughput and reliability while minimizing power consumption.
Nonlinear Effects in Optical Fibers
Authors: Chraplyvy Andrew R. 
Published: November 2003

Abstract
Advanced lightwave communications systems relying on optical amplification and wavelength‐division multiplexing can carry dozens of wavelengths over thousands of kilometers of optical fibers between optoelectronic regeneration points. Large optical powers confined to the small core of optical fibers over enormous distances exacerbate the effects of optical nonlinearities that can degrade signal quality. Optical nonlinearities in optical fibers include stimulated Raman scattering, stimulated Brillouin scattering, self‐phase modulation, cross‐phase modulation, and four‐photon mixing. These nonlinearities can degrade lightwave communication systems in many different ways including distortion of pulse shapes, spectral broadening, generation of new unwanted frequencies, optical crosstalk, and signal depletion. Various techniques have been developed to mitigate the effects of optical nonlinearities in fibers.
Signal Processing for Magnetic‐Recording Channels
Authors: Eleftheriou Evangelos 
Published: November 2003

AbstractIn the past decade, several advanced digital signal‐processing and coding techniques have been introduced into hard‐disk drives to improve the error‐rate performance at ever increasing normalized linear densities as well as to reduce manufacturing and servicing costs. The state of the art in signal processing and constrained coding for hard‐disk drives is reviewed, with emphasis on the techniques that have been used in commercial systems.
Mobile Radio Communications
Authors: Ziemer Rodger E. , Tranter William H. , Buehrer R. Michael , Rappaport Theodore S. 
Published: November 2003

Abstract
Mobile communications has been of interest since the earliest days of wireless communications. First applications involved ship‐to‐shore and ship‐to‐ship telegraphy as well as telegraphy to moving trains. The development of AM radio, and later FM radio, resulted in mobile voice communication systems. The development of the cellular radio concept gave to rise to mobile telephones that were both practical and inexpensive. The growth of the cellular telephone industry exceeded all expectations and, in many environments, the bulk of telephone traffic is now handled by wireless cellular systems. This article details this history and describes the essential features of mobile radio systems, including the cellular concept, mobile radio channels, and multiple access techniques. First, second and third generation commercial cellular systems are discussed and their capabilities are compared.
Tailbiting Convolutional Codes
Authors: Handlery Marc , Johannesson Rolf , Ståhl Per 
Published: November 2003

Abstract
Tailbiting convolutional codes are error correcting block codes obtained from convolutional codes. Tailbiting convolutional codes have the same code rates as the underlying convolutional codes. Many properties, such as distance properties and the error correcting capability, of tailbiting convolutional codes are closely related to the corresponding properties of convolutional codes. Several good block codes can be considered as tailbiting convolutional codes. This contribution focuses on the encoding and decoding of tailbiting convolutional codes.
BISDN(Broadband Integrated Services Digital Network)
Authors: Ayanoglu Ender , Akar Nail 
Published: November 2003

AbstractThe subject of B‐ISDN came into being in the late 1980s, together with the concept of Asynchronous Transfer Mode (ATM). ATM is closely tied to high‐speed packet switching by means of specialized switches implemented in hardware. Due to its high speed and packet structure, ATM technology was considered attractive to unify voice, data, and video services. A unification of these services over the telephone infrastructure was attempted earlier by a standards offering known as Integrated Services Digital Network (ISDN). Consequently, this new service unification was termed Broadband ISDN (B‐ISDN). Although due to its origins, B‐ISDN is sometimes closely tied to ATM technology, the term independently represents the vision of packet‐based high‐speed integration of voice, data, and video services. It is important that in this process, guarantees to satisfy different Quality‐of‐Service (QoS) needs (in terms of delay, loss, etc) required by voice, data, and video services are provided. In this vision, what is important is the unification, or integration of services; and the underlying technology is of secondary importance. As of the early 2000s, the technology to be employed in realizing this vision seems to have shifted from its origins of ATM. In this article, our emphasis is on B‐ISDN as a service integration vision. Nevertheless, we will describe its original emphasis as the service offering of ATM as well as the path the industry seems to be taking in implementing this vision.
Magnetic Storage Systems
Authors: Thapar Hemant K. 
Published: November 2003

AbstractMany similarities exist between digital storage and baseband data transmission. Instead of delivering data “from here to there”, the digital storage channel delivers data “from now to then”. This chapter provides an overview of digital magnetic storage, including the recording process underlying the generation of signal, noise, distortion, and interference, the unique characteristics and constraints of the magnetic recording channel, and the signal processing and coding methods which are deployed ubiquitously in today's magnetic disk drives.
Ternary Sequences
Authors: Helleseth Tor 
Published: November 2003

AbstractMethods for constructing ternary sequences with good auto‐ and crosscorrelation properties are described. Focus is on designing families of sequences with good parameters for Code‐Division‐Multiple‐Access(CDMA) applications. Techniques for constructing good ternary sequence designs are presented using basic ideas from Galois fields, the trace function and properties of the auto‐ and crosscorrelation ofm‐sequences. Bounds on the possible parameters of the best families of sequences are presented as well as several constructions of asymptotically optimal ternary sequences. These sequence families have better parameters than possible for comparable binary designs.
Radio Resource Management in Future Wireless Networks
Authors: Zander Jens 
Published: November 2003

AbstractWireless wideband multimedia services have been a “hot” topic the last few year with the advent of the so called 3rd Generation mobile communication system. Just by looking at the existing spectrum allocations for these types of systems, clearly shows that spectrum resource management remains an important topic in the near and distant future if these service are to reach a mass marked. In this paper, we start out by briefly reviewing the classical formulation of the radio resource management problem as found in 2G mobile telephony systems and some of the current approaches in the literature. We identify the three key allocation decisions we are concerned with: the waveforms(“channels”), the access ports (or base stations) and, finally, the transmitter powers. The principle ofrandom channel allocationschemes, as found in frequency hopping or direct sequence CDMA systems, are compared with deterministic dynamic channel allocation schemes. The classical problem is then extended to a multi‐service setting were multiple quality‐of‐service requirements have to be met simultaneously. The paper closes by giving a more general outlook over some of the key problems in resource management in future wireless multimedia systems.
Powerline Communications
Authors: Hrasnica Halid , Haidine Abdelfatteh , Lehnert Ralf 
Published: November 2003

AbstractThe usage of electrical power supply networks for voice and data transmission, called Powerline Communications (PLC), allows realization of telecommunication systems without laying new transmission cables and therefore, saving costs and time. The PLC technology becomes nowadays more and more attractive, particularly in so‐called “last mile” networks. The main reasons for that are the deregulation of the telecommunications market and the fact that the access networks are still property of incumbent network providers. However, the powerline grids are not designed for data transmission which causes some specific performance problems in PLC networks; unfavorable noise behavior, powerful attenuation, changing impedance, electro‐magnetic compatibility with wireless services, etc. PLC networks have to operate with a limited signal power, which reduces data rates and network distances, and increases their sensitivity to disturbances. Therefore, efficient modulation and MAC layer as well as capable error handling have to be designed for PLC systems.
Permutation Codes
Authors: Viterbo Emanuele 
Published: November 2003

Abstract

Permutation codes are special spherical codes designed for the bandlimited Gaussian channel. A Variant I permutation code is the set of codewords obtained by taking all permutations of an initial vector in the
n
‐dimensional Euclidean space. A Variant II permutation code is the set of codewords obtained by taking all permutations and sign changes of the components of an initial vector in the
n
‐dimensional Euclidean space. These codes may be attractive because of their simple maximum likelihood decoding algorithm.
Shell Mapping
Authors: Kwok Henry K. , Jones Douglas L. 
Published: November 2003

Abstract
Shell mapping is an efficient technique for constellation shaping to reduce the average power of high‐rate digital communications. Constellation shaping allows in theory up to a 1.53 dB reduction in transmission power beyond unshaped modulations without increasing the bit‐error rate; current systems using shell mapping obtain up to about 1 dB power reduction. Shell mapping groups constellation points of roughly equal energy from a quadrature (QAM) constellation into concentric rings, or shells, and efficiently identifies and indexes the lowest‐energy sets of shells in a block of several successive QAM symbols using a technique based on combinatorics, generating functions, and finite‐field algebra. By providing an efficient means of mapping a large number of data bits to a multi‐dimensional shaped constellation, shell mapping allows shaping techniques to be used in practical communication systems such as the V.34 analog telephone modem standard.
Soft Output Decoding Algorithms
Authors: Pérez Lance C. 
Published: November 2003

AbstractThe success of turbo codes and iterative decoding in the field of channel coding for the additive white Gaussian noise (AWGN) and other channels has led to the investigation of iterative techniques in a wide range of disciplines. The essential element of all iterative processing techniques is some form of a soft‐input, soft‐output (SISO) module. A detailed description is given of the most common SISO modules, namely the soft‐output Viterbi algorithm (SOVA) and several versions of the Bahl, Cocke, Jelinek and Raviv (BCJR) or maximum a posteriori (MAP) algorithm. These algorithms are described in the context of their application to the decoding of binary convolutional codes.
Network Flow Control
Authors: Low Steven H. 
Published: November 2003

AbstractFlow control schemes are distributed and asynchronous algorithms to share network resources among competing users. The goal is to share these resources fairly and efficiently, and to provide good QoS, in a stable and scalable manner. In this article, we explain these objectives and implementation constraints. We provide an introduction to mathematical models for understanding and designing such flow control schemes, and illustrate these models using TCP Vages.