Enhancing echo cancellation via estimation of delay

The advent of packetized audio transmission, such as voice over IP (VoIP), has resulted in challenging requirements for echo cancellation technology. One key aspect of this technology is the need to characterize, quickly and accurately, the echo paths in the transmission media. Echo paths consist of a constant time delay with no echo signal and active regions in which the echo signal is present. When an adaptive filter echo cancellation algorithm is used, its performance can be greatly increased, and its complexity can be reduced if it is only applied to the active regions. This requires an algorithm to estimate the constant delay and locate the active regions. Traditionally, delay estimation has been based on direct application of cross-correlation. This method has poor performance because the input signals are highly correlated and has a high implementation cost because many cross-correlation lags have to be computed for longer time delays. The delay estimation addressed in this paper has two major advantages over the traditional methods. The first is that it has improved performance because the input signals are processed to have less correlation. The second is that the implementation cost is significantly reduced because fewer cross-correlation lags are computed, and an efficient method to estimate lags is created.     

Equal gain combining over Nakagami-n (rice) and Nakagami-q (Hoyt) generalized fading channels

Motivated by the importance of Nakagami-n (Rice) and Nakagami-q (Hoyt) statistical models to describe channel fading in land, mobile, terrestrial, and satellite telecommunications, we present an alternative moments-based approach to the performance analysis of equal-gain combining (EGC) receivers over independent, not necessarily identically distributed Rice- and Hoyt-fading channels. Exact closed-form expressions for the moments of the signal-to-noise ratio (SNR) at the output of the combiner are derived and significant performance criteria such as, the average output SNR, the amount of fading and the spectral efficiency at the low power regime, are studied. Moreover, using Pade rational approximation to the moment-generating function of the output SNR, the average symbol error probability and the outage probability are evaluated. We also study the suitability of modeling a Hoyt-fading environment by a properly chosen Nakagami-m model, as far as the error performance of the EGC is concerned.     

Towards real-time business intelligence

Analysing data to predict market trends of products and services and to improve performances of enterprise business systems has always been part of running a competitive business. But it is becoming essential nowadays that not only is the analysis done on real-time data, but also actions in response to analysis results can be performed in real time and instantaneously change parameters of business processes. This paper discusses issues and problems of current business intelligence systems, and then outlines our vision of future real-time business intelligence. We present a list of emerging technologies which could contribute to the realisation of real-time business intelligence and some examples of applying them to improve BT’s systems and services.     

Mutual information-based analysis of JPEG2000 contexts.

Context-based arithmetic coding has been widely adopted in image and video compression and is a key component of the new JPEG2000 image compression standard. In this paper, the contexts used in JPEG2000 are analyzed using the mutual information, which is closely related to the compression performance. We first show that, when combining the contexts, the mutual information between the contexts and the encoded data will decrease unless the conditional probability distributions of the combined contexts are the same. Given I, the initial number of contexts, and F, the final desired number of contexts, there are S(I, F) possible context classification schemes where S(I, F) is called the Stirling number of the second kind. The optimal classification scheme is the one that gives the maximum mutual information. Instead of using an exhaustive search, the optimal classification scheme can be obtained through a modified generalized Lloyd algorithm with the relative entropy as the distortion metric. For binary arithmetic coding, the search complexity can be reduced by using dynamic programming. Our experimental results show that the JPEG2000 contexts capture the correlations among the wavelet coefficients very well. At the same time, the number of contexts used as part of the standard can be reduced without loss in the coding performance.     

Definition of efficient PAPR in OFDM

A high PAPR is a main drawback of OFDM. There are many methods for reducing the PAPR with an ultimate goal of reducing the PAPR as much as possible. It is shown that if, among other factors, the power efficiency-PAPR relationship of the power amplifier is also taken into account, then there exists a PAPR level for which the BER reaches a minimal value. This PAPR may be used as a definition of an efficient PAPR. The efficient PAPR is not necessary the lowest possible value of PAPR.     

Study of specific absorption rate (SAR) induced in two child head models and in adult heads using mobile phones

This paper gives a first comparison of specific absorption rate (SAR) induced in a child-sized (CS) head and an adult head using a dual-band mobile phone. In the second study, the visible human head is considered and comparison of SAR induced in a CS or child-like (CL) head and an adult head using a dual-band mobile phone is given. All the peaks of average SAR over a mass of 10 and 1 g in the head and the power budget are determined in the two comparisons using the finite-difference time-domain method. The differences between the results for adult and CS or CL heads are given at 900 and 1800 MHz. No important differences are noted for the peak SAR averaged over 10 g (SAR10 g), between the two adult head models, as well as between the two child head models. The peak SAR10 g in the brain of the CS or CL head is slightly more significant than that for the adult one.     

Design and practical implementation of multifrequency RF front ends using direct RF sampling

The use of direct RF sampling has been explored as a means of designing multifrequency RF front ends. Such front ends will be useful to multifrequency RF applications such as global navigation satellite system receivers that use global positioning system (GPS) L1, L2, and L5 signals and Galileo signals. The design of a practical multifrequency direct RF sampling front end is dependent on having an analog-to-digital converter whose input bandwidth accommodates the highest carrier frequency and whose maximum sampling frequency is more than twice the cumulative bandwidth about the multiple carrier signals. The principle of direct RF sampling is used to alias all frequency bands of interest onto portions of the Nyquist bandwidth that do not overlap. This paper presents a new algorithm that finds the minimum sampling frequency that avoids overlap. This design approach requires a multifrequency bandpass filter for the frequency bands of interest. A prototype front end has been designed, built, and tested. It receives a GPS coarse/acquisition code at the L1 frequency and GPS antispoofing precision code at both L1 and L2. Dual-frequency signals with received carrier-to-noise ratios in excess of 52 dB-Hz have been acquired and tracked using this system.     

Highly monomode W1 waveguide square lattice photonic crystal lasers

Lasing of W1 square lattice-based photonic crystal lasers on the substrate approach is analyzed. A second-order distributed feedback highly monomode behavior is observed. A comprehensive two-dimensional and three-dimensional finite-difference time-domain computation analysis shows that this characteristic arises from the lattice geometry. Single-mode lasers can be obtained using this geometry, opening the way to the realization of monomode laser arrays.     

Distributed self-stabilizing placement of replicated resources in emerging networks

Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionality, or configuration to enact or optimize communication tasks. The placement of these replicated resources can significantly impact performance. We present a novel self-stabilizing, fully distributed, asynchronous, scalable protocol that can be used to place replicated resources such that each node is "close" to some copy of any object. We describe our protocol in the context of a graph with colored nodes, where a node's color indicates the replica/task that it is assigned. Our combination of theoretical results and simulation prove stabilization of the protocol, and evaluate its performance in the context of convergence time, message transmissions, and color distance. Our results show that the protocol generates colorings that are close to the optimal under a set of metrics, making such a protocol ideal for emerging networking systems.     

Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design

In this letter, we propose a generalization of the progressive edge-growth (PEG) algorithm with the aim of designing LDPC code graphs with substantially improved approximated cycle extrinsic message degree (ACE) properties. The proposed realization of generalized PEG algorithm outperforms original PEG algorithm and its subsequent modification proposed by Xiao and Banihashemi.