We present an analysis and computational results relating to the regularized restoration of subpixel information from undersampled data. The method makes use of a small set of images in various stages of defocus. An i...
详细信息
ISBN:
(纸本)0819406945
We present an analysis and computational results relating to the regularized restoration of subpixel information from undersampled data. The method makes use of a small set of images in various stages of defocus. An iterative implementation permits the incorporation of a non- negativity constraint. The problem we consider is fundamentally under-determined, but useful results can be obtained in reasonably low noise conditions.
An architecture is presented for front-end processing in a wideband array system which samples real signals. Such a system may be encountered in cellular telephony, radar, or low SNR digital communications receivers. ...
详细信息
An architecture is presented for front-end processing in a wideband array system which samples real signals. Such a system may be encountered in cellular telephony, radar, or low SNR digital communications receivers. The subbanding of data enables system data rate reduction, and creates a narrowband condition for adaptive processing within the subbands. The front-end performs passband filtering, equalization, subband decomposition and adaptive beamforming. The subbanding operation is efficiently implemented using a prototype lowpass finite impulse response (FIR) filter, decomposed into polyphase form, combined with a Fast Fourier Transform (FFT) block and a bank of modulating postmultipliers. If the system acquires real inputs, a single FFT may be used to operate on two channels, but a channel separation network is then required for recovery of individual channel data. A sequence of steps is described based on data transformation techniques that enables a maximally efficient implementation of the processing stages and eliminates the need for channel separation. Operation count is reduced, and several layers of processing are eliminated.
In this paper, we propose a new algorithm for computing a singular value decomposition of a matrix product. We show that our algorithm is numerically desirable in that all relevant residual elements will be numericall...
详细信息
In this paper, we propose a new algorithm for computing a singular value decomposition of a matrix product. We show that our algorithm is numerically desirable in that all relevant residual elements will be numerically small. Our algorithm can be extended to a product of a larger number of upper triangular matrices.
An iterative solution is given for solving deblurring problems having nonnegativity constraints through the use of methods motivated by tomographic imaging. After briefly reviewing three versions of tomographic-imagin...
详细信息
An iterative solution is given for solving deblurring problems having nonnegativity constraints through the use of methods motivated by tomographic imaging. After briefly reviewing three versions of tomographic-imaging problems, the paper indicates how methods that have proven to be powerful for the third version, weighted-integral tomography, can be applied to the more general deblurring problem when nonnegativity constraints are present.
We use time-frequency distributions to define local stationarity of a random process. We argue that local stationarity is achieved when the Wigner spectrum is approximately factorable. We show that when that is the ca...
详细信息
ISBN:
(纸本)0819463922
We use time-frequency distributions to define local stationarity of a random process. We argue that local stationarity is achieved when the Wigner spectrum is approximately factorable. We show that when that is the case the autocorrelation function is the one considered by Silverman in 1957. Other time-frequency represenations are also considered.
In this paper we consider cyclostationary signalprocessing techniques implemented via acousto-optics (AO). Cyclic processing methods are reviewed and motivated, including the cyclic correlation and the cyclic spectru...
详细信息
ISBN:
(纸本)0819416207
In this paper we consider cyclostationary signalprocessing techniques implemented via acousto-optics (AO). Cyclic processing methods are reviewed and motivated, including the cyclic correlation and the cyclic spectrum. We show how a 1D AO spectrum analyzer can be used to detect the presence, and estimate the value, of cycle frequencies. The cyclic correlation can then be computed at cycle frequencies of interest using a 1D time-integrating correlator. Next we consider the problem of computing the (2D) cyclic correlation for all cycle frequencies and lags simultaneously. This is accomplished via an AO triple-product processor, configured in a manner similar to that used for ambiguity function generation. The cyclic spectrum can be obtained in a post-processing step by Fourier transforming the cyclic correlation in one dimension. We then consider higher order extensions of the cyclic correlation and show how a 2D slice of the 3D cyclic triple-correlation can be computed using an AO four-product processor.
This paper addresses the problem of designing signals for general group representations subject to constraints which are formulated as convex sets in the Hubert space of the group states. In particular, the paper cons...
详细信息
We develop an algorithm for adaptively estimating the noise subspace of a data matrix, as is required in signalprocessing applications employing the 'signal subspace' approach. The noise subspace is estimated...
详细信息
advanced error control coding and signalprocessing techniques find wide applications in various communication systems, such as magnetic recording channels, fiber optical channels, wireline and wireless communication ...
advanced error control coding and signalprocessing techniques find wide applications in various communication systems, such as magnetic recording channels, fiber optical channels, wireline and wireless communication systems. Low-density parity-check (LDPC) codes and multiple-multiple-output (MIMO) technology have been receiving a lot of attention, since they greatly increase the capacity and improve the performance of future communication systems. In this dissertation, we focus on designing algorithms that enable efficient hardware implementations of LDPC codes and MIMO detection systems. Quasi-cyclic (QC) LDPC codes are of great interest since their regular code structure leads to efficient hardware implementations. We propose and implement in FPGA two partly parallel decoder architectures for QC LDPC codes to improve the decoding throughput and memory requirement of existing decoders. Our over-lapped message passing (OMP) decoder achieves the maximum throughput gain and hardware utilization efficiency (HUE) due to overlapping, hence has higher throughput and HUE than previously proposed OMP decoders while maintaining the same hardware requirements and the same error performance. We also show that the maximum throughput gain and HUE achieved by our OMP decoder are ultimately determined by the given code. Thus, we propose a coset-based construction method, which results in QC LDPC codes that allow our optimal OMP decoder to achieve higher throughput and HUE. To further reduce the memory requirement of our OMP decoder, we propose the parallel turbo-sum-product (PTSP) decoder architecture. Implementation results show that our PTSP decoder achieves better error performance, faster convergence and hence higher throughput than the OMP decoder with reduced memory requirement. Hardware implementations of tree search based MIMO detection often have limited performance due to large memory requirement or high computational complexity of sophisticated MIMO detection algorithm
Adaptive array systems require the periodic solution of the well-known w = (R) over tilde (-1)v equation in order to compute optimum adaptive array weights. The covariance matrix (R) over tilde is estimated by forming...
详细信息
ISBN:
(纸本)0819441880
Adaptive array systems require the periodic solution of the well-known w = (R) over tilde (-1)v equation in order to compute optimum adaptive array weights. The covariance matrix (R) over tilde is estimated by forming a product of noise sample matrices X : (R) over tilde = (XX)-X-H. The operations-count cost of performing the required matrix inversion in real time can be prohibitively high for a high bandwidth system with a large number of sensors. Specialized hardware may be required to execute the requisite computations in real time. The choice of algorithm to perform these computations must be considered in conjunction with the hardware technology used to implement the computation engine. A systolic architecture implementation of the Givens rotation method for matrix inversion was selected to perform adaptive weight computation. The bit-level systolic approach enables a simple ASIC design and a very low power implementation. The bit-level systolic architecture must be implemented with fixed-point arithmetic to simplify the propagation of data through the computation cells. The Givens rotation approach has a highly parallel implementation and is ideally suited for a systolic implementation. Additionally, the adaptive weights are computed directly from the sample matrix X in the voltage domain, thus reducing the required dynamic range needed in carrying out the computations. An analysis was performed to determine the required fixed-point precision needed to compute the weights for an adaptive array system operating in the presence of interference. Based on the analysis results. it was determined that the precision of a floating-point computation can be well approximated with a 13-bit to 19-bit word length fixed point computation for typical system jammer-to-noise levels. This property has produced an order-of-magnitude reduction in required hardware complexity. A synthesis-based ASIC design process was used to generate preliminary layouts. These layouts were used t
暂无评论