Sciweavers

11 search results - page 1 / 3
» A fast algorithm for the computation of 2-D forward and inve...
Sort
View
SIGPRO
2008
130views more  SIGPRO 2008»
13 years 4 months ago
A fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT an...
J. S. Wu, Huazhong Shu, Lotfi Senhadji, Limin Luo
SIAMSC
2011
140views more  SIAMSC 2011»
12 years 7 months ago
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calcu
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
Lin Lin, Chao Yang, Jianfeng Lu, Lexing Ying, Wein...
ARITH
2005
IEEE
13 years 6 months ago
Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
Khan Wahid, Vassil S. Dimitrov, Graham A. Jullien
ISBI
2008
IEEE
14 years 5 months ago
A spline-based forward model for Optical Diffuse Tomography
Reconstruction algorithms for Optical Diffuse Tomography (ODT) rely heavily on fast and accurate forward models. Arbitrary geometries and boundary conditions need to be handled ri...
Jean-Charles Baritaux, S. Chandra Sekhar, Michael ...
TSP
2010
12 years 11 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji