Local adaptive signal processing can be carried out using the short-time discrete cosine transform (DCT) Two fast recursive algorithms for computing the short-time DCT are presented. The algorithms are based on a recu...
详细信息
Local adaptive signal processing can be carried out using the short-time discrete cosine transform (DCT) Two fast recursive algorithms for computing the short-time DCT are presented. The algorithms are based on a recursive relationship between three subsequent local DCT spectra. The computational complexity of the algorithms is compared with that of fast DCT algorithms.
This paper proposes a fastrecursive algorithm for Group-wise Space-Time Block Code (G-STBC), which takes full advantage of the Alamouti structure in the equivalent channel matrix to reduce the computational complexit...
详细信息
This paper proposes a fastrecursive algorithm for Group-wise Space-Time Block Code (G-STBC), which takes full advantage of the Alamouti structure in the equivalent channel matrix to reduce the computational complexity. With respect to the existing efficient algorithms for G-STBC, the proposed algorithm achieves better performance and usually requires less computational complexity.
This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursivealgorithms to compute the DVM-vector product for wideband multi-beam antenna arrays. The...
详细信息
This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) along with fast, exact, radix-2, and recursivealgorithms to compute the DVM-vector product for wideband multi-beam antenna arrays. The proposed algorithms enable low-complexity wideband beamformers in emerging millimeter-wave wireless communication networks by reducing the complexity of N-beam wideband beamforming from O (N-2) to O (N log N), where N = 2(r) (r >= 1). As a result, the algorithms are faster than the brute-force computation of the DVM-vector product and more efficient than the direct realization of true-time-delay-based multi-beam beamformers. The proposed low-complexity algorithms' signal flow graph (SFG) is also presented to highlight their suitability for hardware implementations. The 2-D frequency responses of DVM-based beamformers are explained through an array signal processing example. Simulation results suggest that integrated circuit (IC) implementations of the SFG significantly reduce chip area and power consumption.
The paper describes a fast algorithm to compute local axial moments used in the algorithm of discrete symmetry transform (DST). The basic idea is grounded on fastrecursive implementation of respective linear filters ...
详细信息
The paper describes a fast algorithm to compute local axial moments used in the algorithm of discrete symmetry transform (DST). The basic idea is grounded on fastrecursive implementation of respective linear filters by using the so-called primitive kernel functions since the moment computation can be performed in the framework of Linear filtering. The main result is that the computation of the local axial moments is independent of the kernel size, i.e. of the order O(1) per data point (pixel). This result is of relevance whenever the DST is used to face with real time computer vision problems. The experimental results confirm the time complexity predicted by the theory. (C) 2001 Elsevier Science B.V. All rights reserved.
暂无评论