On-demand learning for a wireless campus

The current Internet and wireless networks are harsh environments for transporting high-bandwidth multimedia data. We examine the technical issues involved, and describe an end-to-end solution to support a Web-based learn-on-demand system that operates in a wireless campus environment.     

Practical OSPF traffic engineering

Open Shortest Path First (OSPF) traffic engineering (TE) is intended to bring long-awaited traffic management capabilities into IP networks, which still rely on today's prevailing routing protocols: OSPF or IS-IS. In OSPF, traffic is forwarded along, and split equally between, equal cost shortest paths. In this letter, we formulate the basic requirements placed on a practical TE architecture built on top of OSPF and present a theoretical framework meeting these requirements of practicality. The main contribution of our work comes from the recognition that coupled with an instance of the maximum throughput problem there exists a related inverse shortest-path problem yielding optimal OSPF link weights.     

Radiometric sensor for temperature control of food processing

This paper describes a novel planar antenna sensor created for the purpose of noninvasive temperature measurements using microwave radiometry. In order to improve radiometric measurements in industrial applications, a new generation of sensors is introduced, composed of a metallic sheet. Simulations based upon the method of moments is used both to design and to determine their electromagnetic performances. This paper also describes a radiometric device using these sensors to measure and control the temperature of food products during deep freezing processes. The results and discussions are presented.     

Finite element analysis of advanced multilayer capacitors

We establish a systematic methodology to design and analyse electromagnetic components such as advanced multilayer ceramic capacitors (MLCCs) using the finite element (FE) method. We employ a coupled formulation to compute the interaction between the electric and magnetic fields. Unlike a linear distribution of current assumed in the circuit model, an accurate electrostatic solution to model the entire advanced MLCCs (4 × 4 × 27 = 432 cells) is presented. The FE solution is used to compute the lumped parameters for a range of frequencies. These lumped parameters are then used to compute the parasitic elements of the MLCCs. We introduce two algorithms to efficiently analyse the behaviour of a capacitor with changing frequency. The lower frequency (much below the self‐resonant frequency of the capacitor) algorithm separates the effect of the electric and magnetic fields and reduces the computational effort required to solve the FE problem, whereas, the high‐frequency algorithm couples the effect between the electric and the magnetic fields. We use these algorithms in conjunction with a new multiple scale technique to effectively determine the small values of R, L and C in MLCCs. The formulation, the implementation, and the numerical results demonstrate the efficacy of the present FE formulation and establish a systematic methodology to design and analyse advanced electromagnetic components. Copyright © 2003 John Wiley & Sons, Ltd.     

Asymptotic performance of single parity-check product codes

This article investigates the asymptotic performance of single parity-check (SPC) product codes (PCs) from a decoding point of view. Specifically, the probability of bit error is bounded before and after the decoding of each dimension, similar to the analysis of "iterated codes" by Elias (1954). It is shown that the asymptotic probability of bit error can be driven to zero as the number of dimensions, and hence the block length, increases at signal-to-noise ratios (SNRs) within 2 dB of capacity over the additive white Gaussian noise (AWGN) channel.     

Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.     

Sequential Spectrum Analysis of the Sideband Components of Digital Amplitude-Modulated Signals

It is shown that, for the spectrum analysis of digital quasi-periodic signals, one must use a procedure based on approximating the sequence of data readouts by a first-order trigonometric polynomial with a varying frequency of its harmonic functions.