Showing papers by "K.M.M. Prabhu published in 1999"
TL;DR: An efficient algorithm for computing the real-valued FFT using radix-2 decimation-in-frequency (DIF) approach has been introduced and a C++ program that implements this algorithm has been included.
Abstract: An efficient algorithm for computing the real-valued FFT (of length N) using radix-2 decimation-in-frequency (DIF) approach has been introduced. The fact that the odd coefficients are the DFT values of an N/2-length linear phase sequence introduces a redundancy in the form of the symmetry X(2k+1)=X/sup */(N-2k-1), which can be exploited to reduce the arithmetic complexity and memory requirements. The arithmetic complexity and, memory requirements of the algorithm presented are exactly the same as the most efficient decimation-in-time (DIT) algorithm for the real-valued FFT that exists to date. A C++ program that implements this algorithm has been included.
31 citations
TL;DR: Fast computation of the discrete Hartley transform of length N=q, where q is an odd integer, is proposed, giving rise to a substantial reduction in computational complexity when compared to other algorithms.
Abstract: Of late, the discrete Hartley transform (DHT) has become an important real-valued transform Many fast algorithms for computing the DHT of sequence length N=2/sup m/ have been reported Fast computation of the DHT of length N=q2/sup m/, where q is an odd integer, is proposed The key feature of the algorithm is its flexibility in the choice of sequence length N, where N need not necessarily be a power of 2, while giving rise to a substantial reduction in computational complexity when compared to other algorithms
9 citations
TL;DR: A pipelined array for efficient generation of Gaussian random numbers since the direct conversion method is used instead of the central limit theorem method, which requires only one pair of uniformly distributed sequence as its input.
8 citations
TL;DR: Closed-form expressions for the correlation between errors of different stages have been derived and verified by comparing the predicted values using these expressions with the simulation values given by Ma.
Abstract: The expressions derived by Ma (see ibid., vol.45, p.1641, 1997) for error variance and average power expectation using the model that has been proposed are not accurate. In this paper, all the possible correlations have not been considered. The expressions have been modified to make them exact. Closed-form expressions for the correlation between errors of different stages have been derived. The expressions have been verified by comparing the predicted values using these expressions with the simulation values given by Ma.
3 citations
TL;DR: In this article, the problem of radar detection of a target echo embedded in Weibull clutter is addressed using modified sample matrix inversion (MSMI) and generalised likelihood ratio (GLR) techniques with the salient features of adaptive filtering and CFAR control.
Abstract: The problem of radar detection of a target echo embedded in Weibull clutter is addressed using modified sample matrix inversion (MSMI) and generalised likelihood ratio (GLR) techniques with the salient features of adaptive filtering and CFAR control. Although the GLR algorithm is robust for non-Gaussian interference, the MSMI algorithm is quite sensitive and gives rise to false alarms. To deal with non-Gaussian interference such as Weibull clutter, the 'Gaussianing-whitening approach' is adopted since the MSMI and GLR algorithms were developed to operate in Gaussian interference environment.
2 citations
1 citations
TL;DR: A generalized systolic array architecture has been proposed for prime length DFT and DHT using the angle recoding CORDIC (ARC) computation technique for vector rotation, which satisfies the fundamental requirement for the VLSI implementation of syStolic architectures.