• Publications
  • Influence
Fast algorithms for the discrete W transform and for the discrete Fourier transform
A systematic method of sparse matrix factorization is developed for all four versions of the discrete W transform, the discrete cosine transform, and the discrete sine transform as well as for the discrete Fourier transform, which makes new algorithms more efficient than conventional algorithms.
Pruning the fast discrete cosine transform
The matrix representation of the simple structured algorithm for the discrete cosine transform (DCT), which was first introduced by Y. Morikawa et al. (1985) based on the successive order reduction
An improved residue-to-binary converter
An efficient algorithm, which converts residue numbers, module (2/sup n/+1, 2/sup n/, 2/sup n/-1), into an equivalent binary number, is proposed; the algorithm improves on a previously published
A New Design Technique for Column Compression Multipliers
It is shown that architectures obtained from this new design technique are more area efficient, and have shorter interconnections than the classical Dadda CC multiplier, and that the technique is also suitable for the design of twos complement multipliers.
On computing the discrete Fourier and cosine transforms
  • Zhongde Wang
  • Computer Science
    IEEE Trans. Acoust. Speech Signal Process.
  • 1 October 1985
An efficient algorithm based on real matrix decomposition is developed for computing a class of sinusoidal transforms, that include the discrete Fourier and cosine transform.
Recursive algorithms for the forward and inverse discrete cosine transform with arbitrary length
The authors first demonstrate that the forward and inverse discrete cosine transform (DCT, IDCT) can be represented by Chebyshev polynomials of the third and second kind, respectively. Then, they
A prime factor fast W transform algorithm
  • Zhongde Wang
  • Computer Science
    IEEE Trans. Signal Process.
  • 1 September 1992
A method for converting any nesting DFT algorithm to the type-I discrete W transform (DWT-I) is introduced and is more efficient that either WFTA or PFA for large N, and it is more flexible for the choice of transform length.
An algorithm for multiplication modulo (2/spl and/N-1)
Comparing the Wallace tree multiplier architecture with published designs demonstrates advantages of the multiplier architecture in both speed and hardware.
Fast adders using enhanced multiple-output domino logic
Using an enhanced multiple output domino logic (EMODL) implementation of a carry lookahead adder (CLA), sums of several consecutive bits can be built in one nFET tree with a single carry-in. Based on
The discrete cosine transform-A new version
The performance of this new version of the DCT for digital filtering and transform coding is compared to the old version of DCT with various criteria; i.e., variance distribution, residual correlation, Wiener filtering, and maximum-reducible-bits.