Serially concatenated space-time codes with iterative decoding and performance limits of block-fading channels

This work considers space-time channel coding for systems with multiple-transmit and a single-receive antenna, over space uncorrelated block-fading (quasi-static) channels. Analysis of the outage probability over such channels reveals the existence of a threshold phenomenon. The outage probability can be made arbitrary small by increasing the number of transmit antennas, only if the E/sub b//N/sub 0/ is above a threshold which depends on the coding rate. Furthermore, it is shown that when the number of transmit antennas is increased, the /spl epsi/-capacity of a block-fading Rayleigh channel tends to the Shannon capacity of an additive white Gaussian noise channel. This paper also presents space-time codes constructed as a serial concatenation of component convolutional codes separated by an interleaver. These schemes provide full transmit diversity and are suitable for iterative decoding. The rate of these schemes is less than 1 bit/s/Hz, but can be made arbitrary close to 1 bit/s/Hz by the use of Wyner-Ash codes as outer components. Comparison of these schemes with structures from literature shows that performance gains can be obtained at the expense of a small decrease in rate. Computer simulation results over block-fading Rayleigh channels show that the frame-error rate of several of these schemes is within 2-3 dB from the theoretical outage probability.     

A CMOS multichannel 10-Gb/s transceiver

We describe a CMOS multichannel transceiver that transmits and receives 10 Gb/s per channel over balanced copper media. The transceiver consists of two identical 10-Gb/s modules. Each module operates off a single 1.2-V supply and has a single 5-GHz phase-locked loop to supply a reference clock to two transmitter (Tx) channels and two receiver (Rx) channels. To track the input-signal phase, the Rx channel has a clock recovery unit (CRU), which uses a phase-interpolator-based timing generator and digital loop filter. The CRU can adjust the recovered clock phase with a resolution of 1.56 ps. Two sets of two-channel transceiver units were fabricated in 0.11-/spl mu/m CMOS on a single test chip. The transceiver unit size was 1.6 mm /spl times/ 2.6 mm. The Rx sensitivity was 120-mVp-p differential with a 70-ps phase margin for a common-mode voltage ranging from 0.6 to 1.0 V. The evaluated jitter tolerance curve met the OC-192 specification.     

Information outage probability of distributed STBCs over Nakagami fading channels

Space-time block codes (STBCs) allow utilising the diversity provided by multiple-input-multiple-output (MIMO) communication channels, thereby decreasing the outage probability for a given communication rate. The contribution of this letter is the derivation of a closed-form expression of the outage probability of distributed STBCs deployed over Nakagami flat fading channels with different channel gains and fading parameters.     

Analysis of feedback for higher order polarization-mode dispersion mitigation of NRZ 40-Gb/s optical transmission

First-order polarization-mode dispersion (PMD) compensation by means of a polarization controller and a differential delay line is not sufficient to guarantee error-free transmission for 40-Gb/s channels when higher order effects severely increase signal distortion. Higher order mitigation is possible by cascading more than one first-order block. However, only two-stage or three-stage devices remain simple enough to be actually controlled. The performance of such higher order PMD compensators is evaluated by means of numerical simulations. Two different feedback signals have been used, demonstrating that first-order and higher order PMD distortion of nonreturn-to-zero (NRZ) pulses at 40 Gb/s can be strongly mitigated for instantaneous values of the differential group delay (DGD) up to the bit slot, when the compensator is properly controlled.     

Modeling aviation baggage screening security systems: a case study

Aviation security protects vital national interests, as well as passengers and aircraft. Key components of an aviation security system include baggage and passenger screening devices and operations. Determining how and where to assign (deploy) such devices can be quite challenging. Moreover, even after such systems are in place, it can be difficult to measure their effectiveness. This paper describes how discrete optimization models can be used to address these questions, based on three performance measures that quantify the effectiveness of airport baggage screening security device systems. These models are used to solve for optimal airport baggage screening security device deployments considering the number of passengers on a set of flights who have not been cleared using a security risk assessment system in use by the Federal Aviation Administration (i.e., passengers whose baggage is subjected to screening), the number of flights in this set, and the size of the aircraft for such flights. Several examples are provided to illustrate these results, including an example that uses data available from the Official Airline Guide.     

Search for high-performance probe-fed stacked patches using optimization

High-performance circular probe-fed stacked patch antenna designs are explored through the use of numerical optimization. New trends are sought to aid understanding and to suggest novel solutions. We describe the optimization technique, present a new design trend relating efficiency and bandwidth to the choice of substrate dielectric, and propose and demonstrate a novel, optimized antenna achieving 33% bandwidth whilst maintaining greater than 80% surface wave efficiency.     

End-to-end congestion control schemes: utility functions, random losses and ECN marks

We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience noncongestion-related losses. We first show that there exists an additive-increase-multiplicative-decrease scheme using only end-to-end measurable losses such that a socially optimal solution can be reached. We incorporate round-trip delay in this model, and show that one can generalize observations regarding TCP-type congestion avoidance to more general window flow control schemes. We then consider explicit congestion notification (ECN) as an alternate mechanism (instead of losses) for signaling congestion and show that ECN marking levels can be designed to nearly eliminate losses in the network by choosing the marking level independently for each node in the network. While the ECN marking level at each node may depend on the number of flows through the node, the appropriate marking level can be estimated using only aggregate flow measurements, i.e., per-flow measurements are not required.     

Miniaturized coplanar waveguide stop band filters based on multiple tuned split ring resonators

A novel compact stop band filter consisting of a 50 /spl Omega/ coplanar waveguide (CPW) with split ring resonators (SRRs) etched in the back side of the substrate is presented. By aligning SRRs with the slots, a high inductive coupling between line and rings is achieved, with the result of a sharp and narrow rejection band in the vicinity of the resonant frequency of the rings. In order to widen the stop band of the filter, several ring pairs tuned at equally spaced frequencies within the desired gap are cascaded. The frequency response measured in the fabricated prototype device exhibits pronounced slopes at either side of the stop band and near 0 dBs insertion loss outside that band. Since SRR dimensions are much smaller than signal wavelength, the proposed filters are extremely compact and can be used to reject frequency parasitics in CPW structures by simply patterning properly tuned SRRs in the back side metal. Additional advantages are easy fabrication and compatibility with MMIC or PCB technology.     

On the capacities of bipartite Hamiltonians and unitary gates

We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.