The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Fast multiplierless approximations of the DCT with the lifting scheme
Abstract
We present the design, implementation, and application of several families of fast multiplierless approximations of the discrete cosine transform (DCT) with the lifting scheme called the binDCT. These binDCT families are derived from Chen's (1977) and Loeffler's (1989) plane rotation-based factorizations of the DCT matrix, respectively, and the design approach can also be applied to a DCT of arbitrary size. Two design approaches are presented. In the first method, an optimization program is defined, and the multiplierless transform is obtained by approximating its solution with dyadic values. In the second method, a general lifting-based scaled DCT structure is obtained, and the analytical values of all lifting parameters are derived, enabling dyadic approximations with different accuracies. Therefore, the binDCT can be tuned to cover the gap between the Walsh-Hadamard transform and the DCT. The corresponding two-dimensional (2-D) binDCT allows a 16-bit implementation, enables lossless compression, and maintains satisfactory compatibility with the floating-point DCT. The performance of the binDCT in JPEG, H.263+, and lossless compression is also demonstrated.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multirate Systems and Filter Banks
Vaidyanathan, P. P. (1992) · CaltechAUTHORS (California Institute of Technology) · Cited by 5,457
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
Said, A., & Pearlman, W. A. (1996) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.499834 · Cited by 5,353
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
Strang, G., & Nguyen, T. Q. (1996) · Cited by 4,180
JPEG: Still Image Data Compression Standard
Pennebaker, W. B., & Mitchell, J. L. (1992) · Medical Entomology and Zoology · Cited by 2,390
The Lifting Scheme: A Custom-Design Construction of Biorthogonal Wavelets
Sweldens, W. (1996) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.1996.0015 · Cited by 2,213
Factoring wavelet transforms into lifting steps
Daubechies, I., & Sweldens, W. (2005) · Lecture Notes in Earth Sciences · doi:10.1007/bfb0011095 · Cited by 2,015
Discrete Cosine Transform: Algorithms, Advantages, Applications
Rao, K. R., Yip, P. C. Y., & Britaňák, V. (1990) · Cited by 1,862
Factoring wavelet transforms into lifting steps
Daubechies, I., & Sweldens, W. (1998) · The Journal of Fourier Analysis and Applications · doi:10.1007/bf02476026 · Cited by 1,858
JPEG: Still image data compression standard
Sebestyen, I. (1993) · Computer Standards & Interfaces · doi:10.1016/0920-5489(93)90038-s · Cited by 1,768
Cited by
Seven Challenges in Image Quality Assessment: Past, Present, and Future Research
Chandler, D. M. (2013) · ISRN Signal Processing · doi:10.1155/2013/905685 · Cited by 427
Metadata
- Authors
- Liang, J., & Tran, T. D.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2001
- Volume
- 49
- Issue
- 12
- Pages
- 3032-3044
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2157020287
- Cited by
- 292
- References
- 35
- FWCI
- 21.09
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast multiplierless approximations of the DCT with the lifting scheme. https://app.cochat.ai/papers/10.1109/78.969511
- The paper
- Liang, J., & Tran, T. D. (2001). Fast multiplierless approximations of the DCT with the lifting scheme. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.969511
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.