Digital signal Processors (DSPs) have become key components for the implementation of digital signalprocessing systems. With DSPs moving into new application domains and the increasing complexity of modern DSP archit...
详细信息
ISBN:
(纸本)0818679204
Digital signal Processors (DSPs) have become key components for the implementation of digital signalprocessing systems. With DSPs moving into new application domains and the increasing complexity of modern DSP architectures, efficient programming support receives major interest. Therefore, an optimizing compiler becomes a must for future DSP-architectures. Todays DSP compilers result in significant overheads both in memory consumption and program execution time compared to hand-written assembly code. This is mainly due to an inefficient compiler support of the DSP specific architectural features, such as the modulo-addressing capability which is an enabling feature for a large class of DSP algorithms. Within this paper we analyze why existing compilers fail short in supporting the module-addressing mode and present a compiler concept that allows the efficient utilization of this feature. We describe how an advanced compiler optimization strategy allows a near optimum support of the module-addressing mode, and point out why this concept is favorable to DSP-specific language extensions.
The proceedings contain 45 papers. The topics discussed include: recent advances in nonstationary signal analysis: time-varying higher-order spectra and multilinear time-frequency signal analysis;real-time radar signa...
The proceedings contain 45 papers. The topics discussed include: recent advances in nonstationary signal analysis: time-varying higher-order spectra and multilinear time-frequency signal analysis;real-time radar signalprocessing for autonomous aircraft landing;radon transform-based velocity estimation of vehicles with linear arrays;coherent signal-subspace processing for near-field broad-band source localization;performance analysis of the subspace-based DOA estimator in the presence of unknown noise;numerical integration of PDEs by discrete passive modeling of physical systems;time-recursive computation and real-time parallel architectures, with application on the modulated lapped transform;and discrete frequency estimation using parametric filtering and the contraction mapping method.
Implementing Jacobi algorithms in parallel VLSI processor arrays is a non-trivial task, in particular when the algorithms are parametrized with respect to size and the architectures are parametrized with respect to sp...
详细信息
ISBN:
(纸本)0819412767
Implementing Jacobi algorithms in parallel VLSI processor arrays is a non-trivial task, in particular when the algorithms are parametrized with respect to size and the architectures are parametrized with respect to space-time trade-offs. The paper is concerned with an approach to implement several time-adaptive Jacobi-type algorithms on a parallel processor array, using only Cordic arithmetic and asynchronous communications, such that any degree of parallelism, ranging from single-processor up to full-size array implementation, is supported by a `universal' processing unit. This result is attributed to a gracious interplay between algorithmic and architectural engineering.
The fast recursive least squares (RLS) algorithms have wide applications in signalprocessing and control. They are computationally efficient. Thus their stability is of major concern. In this paper, we investigate th...
详细信息
ISBN:
(纸本)0819412767
The fast recursive least squares (RLS) algorithms have wide applications in signalprocessing and control. They are computationally efficient. Thus their stability is of major concern. In this paper, we investigate the error propagation and stability of some typical fast RLS algorithms. Through a random example, we show that a typical conventional fast RLS algorithm is weakly unstable in computing both the residuals and the gain vectors and a QR based algorithm is expected to be weakly stable in computing the residuals but weakly unstable in computing the gain vectors. We propose an error correction scheme for computing the gain vectors.
An on-chip VLSI architecture for computation of Fourier transforms is presented. It performs the arithmetic operations in a digit-level pipeline fashion. For this purpose, the implementation of arithmetic operators is...
详细信息
ISBN:
(纸本)0819412767
An on-chip VLSI architecture for computation of Fourier transforms is presented. It performs the arithmetic operations in a digit-level pipeline fashion. For this purpose, the implementation of arithmetic operators is based on on-line (i.e., digit-serial and most significant digit first) arithmetic, and the transforms are performed by a parallel-pipeline version of the Cooley- Tukey fast Fourier transform (FFT) algorithm.
The detection of small floating targets in an ocean environment is discussed in this paper. Because of the time-varying nature of the growler's radar returns, classical detection schemes do not work well. It is sh...
详细信息
ISBN:
(纸本)0819412767
The detection of small floating targets in an ocean environment is discussed in this paper. Because of the time-varying nature of the growler's radar returns, classical detection schemes do not work well. It is shown that these problems can be overcome if the detection is performed in the joint time-frequency plane. The effectiveness of the detection scheme is demonstrated by looking at two specific aspects of the problem: (1) detection of the target when the radar is scanning a certain sector, and (2) when the radar is dwelling in a certain azimuthal direction for a longer period of time.
A new approach for signal extrapolation based on wavelet representation known as scale-time limited extrapolation and a denoising process is investigated in this research. We first examine a new signal modeling techni...
详细信息
ISBN:
(纸本)0819412767
A new approach for signal extrapolation based on wavelet representation known as scale-time limited extrapolation and a denoising process is investigated in this research. We first examine a new signal modeling technique using wavelets and the corresponding scale-time limited signal extrapolation algorithm. Then, the sensitivity of the algorithm to noise is discussed, and a denoising algorithm based on the time-localization property of the wavelet transform is proposed. By integrating the denoising process and the iterative scale-time limited extrapolation algorithm, we obtain a very robust signal extrapolation algorithm for noisy data. A simulation result of signal extrapolation from noisy observed data is presented to illustrate the performance of the proposed robust signal extrapolation algorithm.
This paper demonstrates that order-recursive least squares (ORLS) algorithms based on orthogonal transformations and hyperbolic transformations can be systematically constructed in two steps. The first step is to dete...
详细信息
ISBN:
(纸本)0819412767
This paper demonstrates that order-recursive least squares (ORLS) algorithms based on orthogonal transformations and hyperbolic transformations can be systematically constructed in two steps. The first step is to determine the structure of the ORLS algorithm according to the property of the data vector in the LS estimation and the requirements to the output. The second step is to determine the proper implementation of building blocks of the ORLS structure using orthogonal or hyperbolic transformations. The canonical ORLS structure and some possible orthogonal/hyperbolic implementations of their building blocks are presented. It is also shown that some of the orthogonal transformations are only applicable to certain types of ORLS structures and not to others.
The sequence of Givens rotations used to update the upper triangular matrix R in a recursive QR decomposition may also be used to update the inverse transpose matrix R-H. Alternative forms of square-root-free Givens r...
详细信息
ISBN:
(纸本)0819412767
The sequence of Givens rotations used to update the upper triangular matrix R in a recursive QR decomposition may also be used to update the inverse transpose matrix R-H. Alternative forms of square-root-free Givens rotation for updating the inverse transpose matrix are derived by representing and storing it in a different factorized form from that used before. The modified Givens rotations do not involve explicit division by the exponential forget factor and lead to an update algorithm equivalent to the one derived by Sakai using Recursive Modified Gram Schmidt orthogonalization.
This paper addresses the problem of mobile radio propagation channel modeling and underlines the need for further research in this domain. The paper first describes three characteristics of the mobile radio propagatio...
详细信息
ISBN:
(纸本)0819412767
This paper addresses the problem of mobile radio propagation channel modeling and underlines the need for further research in this domain. The paper first describes three characteristics of the mobile radio propagation channel which are the propagation-path loss, the time-varying aspect, and the multipath characteristics. It then describes the properties and limitations of the present methods used for channel modeling. The main limitation concerns the non-stationary aspect of the mobile radio propagation channel. Two signalprocessing approaches are proposed to remedy the problem. Finally, the paper addresses the definition of validation criteria in order to evaluate and quantify the accuracy of each proposed model.
暂无评论