The authors present a fully constrained least squares linear spectral mixture analysis-based compression technique for hyperspectral image analysis, particularly, target detection and classification. Unlike most compr...
详细信息
The authors present a fully constrained least squares linear spectral mixture analysis-based compression technique for hyperspectral image analysis, particularly, target detection and classification. Unlike most compression techniques that directly deal with image gray levels, the proposed compression approach generates the abundance fractional images of potential targets present in an image scene and then encodes these fractional images so as to achieve data compression. Since the vital information used for image analysis is generally preserved and retained in the abundance fractional images, the loss of information may have very little impact on image analysis. In some occasions, it even improves analysis performance. AVIRIS data experiments demonstrate that it can effectively detect and classify targets while achieving very high compression ratios.
We present a novel method for designing polynomial FIR predictors for fixed-point environments. Our method yields filters that perform exact prediction of polynomial signals even with short coefficient word lengths. U...
详细信息
作者：
Reial, AndresWilson, Stephen G.Communications
Control and Signal Processing Laboratory Department of Electrical Engineering University of Virginia CharlottesvilleVA22903 United States
The performance potential of a wireless communications system employing antenna arrays is not fully utilized if equal energy allocation and uncorrelated symbols are used at all transmitters in the multichannel, cross-...
详细信息
With the demand for high capacity (multimedia) services, wideband CDMA (WCDMA) has become an attractive multiple access scheme for 3rd generation wireless systems. Coming with higher data rate, the application of WCDM...
详细信息
The "Bootstrap" algorithm provides an efficient adaptive multi-user detection approach to solve the near-far problem in CDMA communication systems. The weight vectors are controlled by a simple decorrelation...
详细信息
ISBN:
(纸本)0780356535
The "Bootstrap" algorithm provides an efficient adaptive multi-user detection approach to solve the near-far problem in CDMA communication systems. The weight vectors are controlled by a simple decorrelation scheme which minimizes the correlation between their outputs and the hard limited version of the other outputs, respectively. It has been shown that the "Bootstrap" algorithm provides performance similar to that of MMSE with low complexity. In this work, the convergence and stability of the "Bootstrap" algorithm is considered. Sufficient conditions for the code cross-correlation and the step size are provided.
This paper investigates the performance of a new adaptive call admission policy based on a window-measurement estimation of the status of the buffer at the base station where two classes of customers (voice and data) ...
详细信息
This paper presents analytical and Monte Carlo results for a stochastic gradient adaptive scheme which identifies an orthogonal polynomial-type nonlinear system with memory. The analysis includes recursions for the me...
详细信息
Develops approaches for imaging weak-contrast buried objects using data from a ground penetrating radar array. An approximate physical model relating the collected data to the underground objects is developed. This mo...
详细信息
In this paper, we apply the New Chinese Remainder Theorem I (New CRT-I) to design the residue-to-binary converters for all the recently introduced three moduli sets M/sub 1/={22/sup n/+1,2/sup n/+1,2/sup n/-1}, M/sub ...
详细信息
In this paper, we apply the New Chinese Remainder Theorem I (New CRT-I) to design the residue-to-binary converters for all the recently introduced three moduli sets M/sub 1/={22/sup n/+1,2/sup n/+1,2/sup n/-1}, M/sub 2/={2/sup n/,2/sup n/-1,2/sup n-1/-1}. M/sub 3/={2/sup n/,2/sup n/+1,2/sup n/-1}, and M/sub 4/=(2n, 2n+1, 2n-1). For all these moduli sets, the converters based on the New CRT-I are consistently faster and require less hardware, compared to the previous residue-to-binary converters which are designed based on the traditional Chinese Remainder Theorem.
One important problem in residue arithmetic is the choice of modulo sets to represent the binary numbers in a certain range. In recent years, several general three-modulo sets have been introduced, and each of them is...
详细信息
One important problem in residue arithmetic is the choice of modulo sets to represent the binary numbers in a certain range. In recent years, several general three-modulo sets have been introduced, and each of them is claimed to have some advantages. In this paper, we carry out a comprehensive study for all these modulo sets from the point of view of the hardware complexity and the speed of their residue-to-binary converters. Based on a performance evaluation of the VLSI implementation in terms of area and delay, we conclude that to represent 8-bit, 16-bit, 32-bit and 64-bit binary numbers, the set of moduli {2/sup n/-1, 2/sup n/, 2/sup n/+1} has the fastest residue-to-binary converter requiring the smallest area. The converter for this moduli set is designed based on the new Chinese remainder theorem of Y. Wang (1998).
暂无评论