72 research outputs found
Performance Analysis of Linear-Equality-Constrained Least-Squares Estimation
We analyze the performance of a linear-equality-constrained least-squares
(CLS) algorithm and its relaxed version, called rCLS, that is obtained via the
method of weighting. The rCLS algorithm solves an unconstrained least-squares
problem that is augmented by incorporating a weighted form of the linear
constraints. As a result, unlike the CLS algorithm, the rCLS algorithm is
amenable to our approach to performance analysis presented here, which is akin
to the energy-conservation-based methodology. Therefore, we initially inspect
the convergence properties and evaluate the precision of estimation as well as
satisfaction of the constraints for the rCLS algorithm in both mean and
mean-square senses. Afterwards, we examine the performance of the CLS algorithm
by evaluating the limiting performance of the rCLS algorithm as the relaxation
parameter (weight) approaches infinity. Numerical examples verify the accuracy
of the theoretical findings
Mathematical optimization and game theoretic techniques for multicell beamforming
The main challenge in mobile wireless communications is the incompatibility between limited wireless resources and increasing demand on wireless services. The employment of frequency reuse technique has effectively increased the capacity of the network and improved the efficiency of frequency utilization. However, with the emergence of smart phones and even more data hungry applications such as interactive multimedia, higher data rate is demanded by mobile users. On the other hand, the interference induced by
spectrum sharing arrangement has severely degraded the quality of service for users and restricted further reduction of cell size and enhancement of frequency reuse factor.
Beamforming technique has great potential to improve the network performance. With the employment of multiple antennas, a base station is capable of directionally transmitting signals to desired users through narrow beams rather than omnidirectional waves. This will result users suffer less interference from the signals transmitted to other co-channel users. In addition, with the combination of beamforming technique and appropriate power control schemes, the resources of the wireless networks can be used more efficiently.
In this thesis, mathematical optimization and game theoretic techniques have been exploited for beamforming designs within the context of multicell
wireless networks. Both the coordinated beamforming and the coalitional game theoretic based beamforming techniques have been proposed. Initially, coordinated multicell beamforming algorithms for mixed design criteria have been developed, in which some users are allowed to achieve target signal-to-interference-
plus-noise ratios (SINRs) while the SINRs of rest of the users in all cells will be balanced to a maximum achievable SINR. An SINR balancing based coordinated multicell beamforming algorithm has then been proposed which is capable of balancing users in different cells to different SINR levels. Finally, a coalitional game based multicell beamforming has been considered, in which the proposed coalition formation algorithm can reach to stable coalition structures. The performances of all the proposed algorithms have been demonstrated using MATLAB based simulations
Space/time/frequency methods in adaptive radar
Radar systems may be processed with various space, time and frequency techniques. Advanced radar systems are required to detect targets in the presence of jamming and clutter. This work studies the application of two types of radar systems.
It is well known that targets moving along-track within a Synthetic Aperture Radar field of view are imaged as defocused objects. The SAR stripmap mode is tuned to stationary ground targets and the mismatch between the SAR processing parameters and the target motion parameters causes the energy to spill over to adjacent image pixels, thus hindering target feature extraction and reducing the probability of detection. The problem can be remedied by generating the image using a filter matched to the actual target motion parameters, effectively focusing the SAR image on the target. For a fixed rate of motion the target velocity can be estimated from the slope of the Doppler frequency characteristic. The problem is similar to the classical problem of estimating the instantaneous frequency of a linear FM signal (chirp). The Wigner-Ville distribution, the Gabor expansion, the Short-Time Fourier transform and the Continuous Wavelet Transform are compared with respect to their performance in noisy SAR data to estimate the instantaneous Doppler frequency of range compressed SAR data. It is shown that these methods exhibit sharp signal-to-noise threshold effects.
The space-time radar problem is well suited to the application of techniques that take advantage of the low-rank property of the space-time covariance matrix. It is shown that reduced-rank methods outperform full-rank space-time adaptive processing when the space-time covariance matrix is estimated from a dataset with limited support. The utility of reduced-rank methods is demonstrated by theoretical analysis, simulations and analysis of real data. It is shown that reduced-rank processing has two effects on the performance: increased statistical stability which tends to improve performance, and introduction of a bias which lowers the signal-to-noise ratio. A method for evaluating the theoretical conditioned SNR for fixed reduced-rank transforms is also presented
- …