The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Symmetric convolution and the discrete sine and cosine transforms
Abstract
This paper discusses the use of symmetric convolution and the discrete sine and cosine transforms (DSTs and DCTs) for general digital signal processing. The operation of symmetric convolution is a formalized approach to convolving symmetrically extended sequences. The result is the same as that obtained by taking an inverse discrete trigonometric transform (DTT) of the product of the forward DTTs of those two sequences. There are 16 members in the family of DTTs. Each provides a representation for a corresponding distinct type of symmetric-periodic sequence. The author defines symmetric convolution, relates the DSTs and DCTs to symmetric-periodic sequences, and then use these principles to develop simple but powerful convolution-multiplication properties for the entire family of DSTs and DCTs. Symmetric convolution can be used for discrete linear filtering when the filter is symmetric or antisymmetric. The filtering will be efficient because fast algorithms exist for all versions of the DTTs. Conventional linear convolution is possible if one first zero-pad the input data. Symmetric convolution and its fast implementation using DTTs are now an alternative to circular convolution and the DFT.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Fundamentals of digital image processing
Jain, A. K. (1988) · Cited by 7,111
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
Fundamentals of digital image processing
(1989) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(89)90041-8 · Cited by 4,677
The JPEG still picture compression standard
Wallace, G. K. (1991) · Communications of the ACM · doi:10.1145/103085.103089 · Cited by 3,784
MPEG: a video compression standard for multimedia applications
Le Gall, D. (1991) · Communications of the ACM · doi:10.1145/103085.103090 · Cited by 2,013
Discrete Cosine Transform: Algorithms, Advantages, Applications
Rao, K. R., Yip, P. C. Y., & Britaňák, V. (1990) · Cited by 1,862
Signal processing with lapped transforms
Malvar, H. S. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,025
A new algorithm to compute the discrete cosine Transform
Lee, B. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164443 · Cited by 604
Fast algorithms for the discrete W transform and for the discrete Fourier transform
Wang, Z. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164399 · Cited by 597
A fast recursive algorithm for computing the discrete cosine transform
Hou, H. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165060 · Cited by 405
A fast cosine transform in one and two dimensions
Makhoul, J. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163351 · Cited by 341
Simple FFT and DCT algorithms with reduced number of operations
Vetterli, M., Eurasip, M., & Nussbaumer, H. J. (1984) · Signal Processing · doi:10.1016/0165-1684(84)90059-8 · Cited by 334
On the Computation of the Discrete Cosine Transform
Narasimha, M., & Peterson, A. (1978) · IEEE Transactions on Communications · doi:10.1109/tcom.1978.1094144 · Cited by 319
A Sinusoidal Family of Unitary Transforms
Jain, A. K. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766944 · Cited by 287
Wang, Z., & Hunt, B. R. (1985) · Applied Mathematics and Computation · doi:10.1016/0096-3003(85)90008-6 · Cited by 125
On computing the discrete Fourier and cosine transforms
Wang, Z. (1985) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1985.1164710 · Cited by 91
Discrete cosine transform filtering
Chitprasert, B., & Rao, K. R. (1990) · Signal Processing · doi:10.1016/0165-1684(90)90115-f · Cited by 90
Direct methods for computing discrete sinusoidal transforms
Chan, S. C., & Ho, K. L. (1990) · IEE Proceedings F Radar and Signal Processing · doi:10.1049/ip-f-2.1990.0063 · Cited by 83
Comparative performance of various trigonometric unitary transforms for transform image coding
Kekre, H. B., & Solanki, J. (1978) · International Journal of Electronics · doi:10.1080/00207217808900821 · Cited by 70
Fast algorithms for computing the discrete cosine transform
Chan, S. C., & Ho, K. L. (1992) · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · doi:10.1109/82.127302 · Cited by 58
Kitajima (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675570 · Cited by 45
The discrete cosine transform--A new version
Wang, Z., & Hunt, B. R. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1983.1171989 · Cited by 22
Cited by
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
Strang, G. (1999) · SIAM Review · doi:10.1137/s0036144598336745 · Cited by 788
A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
Ng, M. K., Chan, R. H., & Tang, W.-C. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598341384 · Cited by 452
Manipulation and compositing of MC-DCT compressed video
Chang, S.-F., & Messerschmitt, D. G. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.363151 · Cited by 331
Metadata
- Authors
- Martucci, S. A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1994-05
- Volume
- 42
- Issue
- 5
- Pages
- 1038-1051
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2138692623
- Cited by
- 371
- References
- 22
- FWCI
- 6.18
- 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
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.