Traveling-wave analysis of a bifilar scanning helical antenna

The bifilar scanning helical antenna is analyzed by considering the structure to carry a single traveling wave. It is shown that the relative phase velocity (v/c) must equal unity to yield the scanning features shown by numerical experiment. This is at complete odds with monofilament helices (Kraus), which display a slow wave structure     

Impact of growth rate on the quality of ZNS-MQW InGaAsP/InP laser structures grown by LP-MOVPE

We investigated the influence of the growth rate on the quality of zero-net-strained InGaAsP/InGaAsP/InP multiquantum well structures for 1.55 μm emission grown by low pressure metalorganic vapor phase epitaxy. The samples consisted of fixed compressive strained wells (ɛ=+1%) and tensile strained barriers (ɛ=−0.5%) grown with different quaternary bandgap wavelengths (λ_B=1.1–1.4 μm). Using higher growth rates, we obtained for the first time high quality zero net strained multi quantum well structures, regardless having constant group V composition in the well and barriers. The samples were analyzed by x-ray diffraction, photoluminescence and atomic force microscopy techniques. The amplitude of surface modulation roughness along [011] direction decreased from 20 nm to 0.53 nm with increasing growth rate and/or quaternary compositions grown outside the miscibility gap. A new deep PL broad emission band strongly correlated with the onset of wavy layer growth is also reported. Broad area and ridge waveguide lasers with 10 wells exhibited low losses (34 cm⁻¹) and low threshold current densities at infinite cavity length (1020 A·cm⁻² and 1190 A·cm⁻², respectively).     

Quality of service for voice over IP in networks with congestion avoidance

This paper assesses the impact of active queue management schemes on the quality of service of voice over Internet protocol applications. A new analytical method based on a fixed point approach to estimate the end-user satisfaction is proposed. The results obtained were validated using discrete event simulation techniques. In all the studied cases, it was observed a great deal of agreement between the analytical results and the results obtained through simulation. The theoretical predictions, as well as the presented empirical evidences confirm, as demonstrated in previous works, that the use of active queue management offers better quality of service than the traditional queue control mechanisms used in Internet. From these results, we may reasonably conclude that the presented method can be used for network design in the presence of voice traffic.     

Multiuser Detection for Out-of-Cell Cochannel Interference Mitigation in the IS–95 Downlink

This paper considers the application of multiuser detection techniques to improve the quality of downlink reception in a multi-cell IS–95 digital cellular communication system. In order to understand the relative performance of suboptimum multiuser detectors including the matched filter detector, optimum multiuser detection in the context of the IS–95 downlink is first considered. A reduced complexity optimum detector that takes advantage of the structural properties of the IS–95 downlink and exhibits exponentially lower complexity than the brute-force optimum detector is developed. The Group Parallel Interference Cancellation (GPIC) detector, a suboptimum, low-complexity multiuser detector that also exploits the structure of the IS–95 downlink is then developed. Simulation evidence is presented that suggests that the performance of the GPIC detector may be near-optimum in several cases. The GPIC detector is also tested on a snapshot of on-air data measured with an omnidirectional antenna in an active IS–95 system and is shown to be effective for extracting weak downlink transmissions from strong out-of-cell cochannel interference. The results of this paper suggest that the GPIC detector offers the most performance gain in scenarios where weak downlink signals are corrupted by strong out-of-cell cochannel interference.     

A 16-Bit by 16-Bit MAC Design Using Fast 5:3 Compressor Cells

3:2 counters and 4:2 compressors have been widely used for multiplier implementations. In this paper, a fast 5:3 compressor is derived for high-speed multiplier implementations. The fast 5:3 compression is obtained by applying two rows of fast 2-bit adder cells to five rows in a partial product matrix. As a design example, a 16-bit by 16-bit MAC (Multiply and Accumulate) design is investigated both in a purely logical gate implementation and in a highly customized design. For the partial product reduction, the use of the new 5:3 compression leads to 14.3% speed improvement in terms of XOR gate delay. In a dynamic CMOS circuit implementation using 0.225 m bulk CMOS technology, 11.7% speed improvement is observed with 8.1% less power consumption for the reduction tree.     

Testing the Interactivity Principle: Effects of Mediation, Propinquity, and Verbal and Nonverbal Modalities in Interpersonal Interaction

Early channel reliance research compared different modes of communication to assess relationships among nonverbal and verbal cues. Emerging communication technologies represent a new venue for gaining insights into the same relationships. In this article, the authors advance a principle of interactivity as a framework for decomposing some of those relationships and report an experiment in which physical proximity—whether actors are in the same place ("co-located") or interacting at a distance ("distributed")—and the availability of other nonverbal environmental, auditory, and visual information in distributed modes is varied. Results indicate that both proximity and availability of nonverbal cues affect communication processes, social judgments participants make about each other, and task performance. The authors discuss implications about gains and losses due to presence of nonverbal features.     

Visible photoluminescence from Ge nanoclusters implanted in nanoporous aluminum oxide films

Nanoporous aluminum oxide (Al₂O₃) films with uniform porous size of 45 nm prepared by the electrochemical process in inorganic acid medium were implanted at room temperature (RT) with 120 keV Ge⁺ ions with a fluence of 1.2×10¹⁶ cm⁻². The nucleation and growths of Ge nanoparticles, were obtained by thermal annealing of the implanted samples at the temperature range of 200-600 °C. The size and distribution of the nanoparticles were characterized by photoluminescence (PL) measurements. The photoluminescence measurements as a function of the annealing temperature shows that at low annealing temperature (200 °C), the sample presents a low intensity and broad emission band centered at 5456 Å consistent with emission band characteristics of nanocluster of Ge with diameter in the range of 4-8 nm, as the annealing temperature increases to 400 °C the PL intensity increases by a factor of almost 20 and the emission band suffers a small red shift. The intensity increases can be related to the increase of the number of Ge nanocluster. At the annealing temperature of 600 °C, the emission band is considerably red shifted by almost 172 Å and the emission intensity decreases significantly, strongly suggesting that nanocrystalline Ge having a character of direct optical transitions exhibits the visible photoluminescence.     

Collaborative Knowledge Building by Smart Sensors

In this paper we explore decentralised approaches for gathering knowledge from sensing devices. We contrast these with centralised processes like data mining, which assume that sensors, devices, or even people contributing information to a pool, do not have a sense of the 'whole picture' or the goal of the data collection. Thus it is necessary for a centralised mining process to create value by sorting, coordinating, and distilling the raw information. We consider instead a situation in which the contributors are given a goal, and are given the ability to co-ordinate among themselves in such a way that each can maximise its contribution to the pool. We discuss advantages of this new approach such as scalability and communication efficiency, and explore how it may change the design of devices, communication infrastructures, and algorithms, using several projects from the Media Laboratory as illustrations.     

Terrain elevation mapping results from airborne spotlight-mode coherent cross-track SAR stereo

Coherent cross-track synthetic aperture radar (SAR) stereo is shown to produce high-resolution three-dimensional maps of the Earth surface. This mode utilizes image pairs with common synthetic apertures but different squint angles allowing automated stereo correspondence and disparity estimation using complex correlation calculations. This paper presents two Ku-band, coherent cross-track stereo collects over rolling and rugged terrain. The first collect generates a digital elevation map (DEM) with 1-m posts over rolling terrain using complex SAR imagery with spatial resolution of 0.125 m and a stereo convergence angle of 13.8/spl deg/. The second collect produces multiple DEMs with 3-m posts over rugged terrain utilizing complex SAR imagery with spatial resolutions better than 0.5 m and stereo convergence angles greater than 40/spl deg/. The resulting DEMs are compared to ground-truth DEMs and relative height root-mean-square, linear error 90-percent confidence, and maximum height error are reported.     

Codes on graphs: normal realizations

A generalized state realization of the Wiberg (1996) type is called normal if symbol variables have degree 1 and state variables have degree 2. A natural graphical model of such a realization has leaf edges representing symbols, ordinary edges representing states, and vertices representing local constraints. Such a graph can be decoded by any version of the sum-product algorithm. Any state realization of a code can be put into normal form without essential change in the corresponding graph or in its decoding complexity. Group or linear codes are generated by group or linear state realizations. On a cycle-free graph, there exists a well-defined minimal canonical realization, and the sum-product algorithm is exact. However, the cut-set bound shows that graphs with cycles may have a superior performance-complexity tradeoff, although the sum-product algorithm is then inexact and iterative, and minimal realizations are not well-defined. Efficient cyclic and cycle-free realizations of Reed-Muller (RM) codes are given as examples. The dual of a normal group realization, appropriately defined, generates the dual group code. The dual realization has the same graph topology as the primal realization, replaces symbol and state variables by their character groups, and replaces primal local constraints by their duals. This fundamental result has many applications, including to dual state spaces, dual minimal trellises, duals to Tanner (1981) graphs, dual input/output (I/O) systems, and dual kernel and image representations. Finally a group code may be decoded using the dual graph, with appropriate Fourier transforms of the inputs and outputs; this can simplify decoding of high-rate codes