Channel estimation method with improved performance for the UMTS-TDD mode

Channel estimation is an essential building block for UTRA-TDD high performance receivers. Once the performance of the channel estimator algorithm proposed by 3GPP is highly dependent on the time spreading between consecutive multi-path components, a Successive Multi-path channel Estimation Technique (SMET) that improves the time resolution is proposed in this paper. A SMET based maximum likelihood approach for vectorial channel estimation, to include the estimation of the direction-of-arrival, is also proposed. This algorithm solves efficiently the complex problem of DOA estimation of multiple users in a multi path propagation environment even when the number of required DOA's exceeds the number of antenna array elements. Another property of the proposed algorithm is its ability to resolve signals from different users arriving from the same direction. This is due to processing in both time and space dimensions. The performance of these algorithms is assessed by resorting to simulations in multi-path environments using the UMTS-TDD specifications, and also by comparing the rms estimation errors against the Crámer-Rao Bound. The effect of imperfect channel estimation on the performance of RAKE and Hard-Decision Parallel Interference Canceller receivers is also analysed. The results show that a good performance can be achieved with SMET, from low to high values of Eb/n0

Optimal placement and selection of camera network nodes for target localization

Abstract. The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The cameras are assumed to be aimed horizontally around a room. To conserve both computation and communication energy, each camera reduces its image to a binary “scan-line ” by performing simple background subtraction followed by vertical summing and thresholding, and communicates only the center of the detected foreground object. Assuming noisy camera measurements and an object prior, the minimum mean squared error of the best linear estimate of the object location in 2-D is used as a metric for placement and selection. The placement problem is shown to be equivalent to a classical inverse kinematics robotics problem, which can be solved efficiently using gradient descent techniques. The selection problem on the other hand is a combinatorial optimization problem and finding the optimal solution can be too costly to implement in an energy-constrained wireless camera network. A semi-definite programming approximation for the problem is shown to achieve close to optimal solutions with much lower computational burden. Simulation and experimental results are presented.