{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T13:38:46Z","timestamp":1774877926370,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1016\/s0165-1684(99)00088-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:56:40Z","timestamp":1027645000000},"page":"135-150","source":"Crossref","is-referenced-by-count":37,"title":["The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation"],"prefix":"10.1016","volume":"79","author":[{"given":"Vladimir","family":"Britanak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.R.","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0165-1684(99)00088-2_BIB1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0165-1684(97)00234-X","article-title":"Fast generalized DFT and DHT algorithms","volume":"65","author":"Bi","year":"1998","journal-title":"Signal Processing"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TASSP.1976.1162764","article-title":"One-dimensional and two-dimensional generalized discrete Fourier transform","volume":"ASSP-24","author":"Bongiovanni","year":"1976","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB3","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/PROC.1976.10139","article-title":"Odd-time odd-frequency discrete Fourier transform for symmetric real-valued series","volume":"64","author":"Bonnerot","year":"1976","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB4","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1364\/JOSA.73.001832","article-title":"Discrete Hartley transform","volume":"73","author":"Bracewell","year":"1983","journal-title":"Journal of Opt. Soc. Amer."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB5","unstructured":"R.N. Bracewell, The Hartley Transform, Oxford University Press, New York, 1986."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0165-1684(95)00010-B","article-title":"A unified discrete cosine and discrete sine transform computation","volume":"43","author":"Britanak","year":"1995","journal-title":"Signal Processing"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB7","first-page":"583","article-title":"A unified approach to the fast computation of discrete sinusoidal transforms I: DCT and DST transforms","volume":"17","author":"Britanak","year":"1998","journal-title":"Computers and Artificial Intelligence"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB8","first-page":"19","article-title":"A unified approach to the fast computation of discrete sinusoidal transforms II: DFT and DWT transforms","volume":"18","author":"Britanak","year":"1999","journal-title":"Computers and Artificial Intelligence"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB9","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1109\/TC.1979.1675262","article-title":"Properties of the multidimensional generalized discrete Fourier transform","volume":"C-28","author":"Corsini","year":"1979","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1049\/el:19840012","article-title":"Split-radix FFT algorithm","volume":"20","author":"Duhamel","year":"1984","journal-title":"Electronics Letters"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/TASSP.1986.1164811","article-title":"Implementation of split-radix FFT algorithms for complex, real and real-symmetric data","volume":"ASSP-34","author":"Duhamel","year":"1986","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB12","unstructured":"D.F. Elliott, K.R. Rao, Fast Transforms: Algorithms, Analyses, Applications, Academic Press, New York, 1982."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB13","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/5.272147","article-title":"A comparative review of real and complex Fourier-related transforms","volume":"82","author":"Ersoy","year":"1994","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB14","doi-asserted-by":"crossref","unstructured":"O.K. Ersoy, N.C. Hu, A unified approach to the fast computation of all discrete trigonometric transforms, in: Proc. IEEE ICASSP, Dallas, TX, April 1987, pp. 1843\u20131846.","DOI":"10.1109\/ICASSP.1987.1169502"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB15","doi-asserted-by":"crossref","unstructured":"R. Gluth, Regular FFT-related transform kernels for DCT\/DST-based polyphase filter banks, in: Proc. IEEE ICASSP, Toronto, 1991, pp. 2205\u20132208.","DOI":"10.1109\/ICASSP.1991.150852"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB16","doi-asserted-by":"crossref","first-page":"2931","DOI":"10.1109\/78.175737","article-title":"Generalized discrete Hartley transforms","volume":"40","author":"Hu","year":"1992","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB17","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1109\/TASSP.1984.1164310","article-title":"Discrete Fourier transform algorithms for real-valued sequences","volume":"ASSP-32","author":"Martens","year":"1984","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB18","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/78.295213","article-title":"Symmetric convolution and the discrete sine and cosine transforms","volume":"42","author":"Martucci","year":"1994","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1117\/1.600882","article-title":"Digital filtering of images using the discrete sine or cosine transform","volume":"35","author":"Martucci","year":"1996","journal-title":"Optical Engineering"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB20","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1109\/31.55000","article-title":"On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences","volume":"37","author":"Murthy","year":"1990","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB21","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/78.382409","article-title":"On the on-line computation of DCT-IV and DST-IV transforms","volume":"43","author":"Murthy","year":"1995","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB22","doi-asserted-by":"crossref","unstructured":"H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, Springer, Berlin, 1981.","DOI":"10.1007\/978-3-662-00551-4"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0165-1684(96)00103-X","article-title":"Split-radix generalized fast Fourier transform","volume":"54","author":"Pei","year":"1996","journal-title":"Signal Processing"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB24","doi-asserted-by":"crossref","unstructured":"K.R. Rao, P. Yip, Discrete Cosine Transform: Algorithms, Advantages and Applications, Academic Press, Boston, 1990.","DOI":"10.1016\/B978-0-08-092534-9.50007-2"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB25","unstructured":"K.R. Rao, J.J. Hwang, Techniques and Standards for Digital Image, Video and Audio Coding, Prentice-Hall, Upper Saddle River, NJ, 1996."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB26","doi-asserted-by":"crossref","unstructured":"R.O. Rowlands, The odd discrete Fourier transform, in: Proc. IEEE ICASSP, Philadelphia, PA, April 1976, pp. 130\u2013133.","DOI":"10.1109\/ICASSP.1976.1170122"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB27","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1109\/PROC.1971.8471","article-title":"Real signals fast Fourier transform: Storage capacity and step number reduction by means of an odd discrete Fourier transform","volume":"59","author":"Vernet","year":"1971","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB28","doi-asserted-by":"crossref","unstructured":"M. Vetterli, Fast 2D-discrete cosine transform, in: Proc. IEEE ICASSP, Tampa, FL, March 1985, pp. 1538\u20131541.","DOI":"10.1109\/ICASSP.1985.1168211"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB29","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0165-1684(84)90059-8","article-title":"Simple FFT and DCT algorithms with reduced number of operations","volume":"6","author":"Vetterli","year":"1984","journal-title":"Signal Processing"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB30","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TASSP.1984.1164399","article-title":"Fast algorithms for the discrete W transform and for the discrete Fourier transform","volume":"ASSP-32","author":"Wang","year":"1984","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB31","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1109\/TASSP.1985.1164710","article-title":"On computing the discrete Fourier and cosine transforms","volume":"ASSP-33","author":"Wang","year":"1985","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB32","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1109\/78.398733","article-title":"Comments on generalized discrete Hartley transforms","volume":"43","author":"Wang","year":"1995","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB33","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0096-3003(85)90008-6","article-title":"The discrete W transform","volume":"16","author":"Wang","year":"1985","journal-title":"Applied Math. and Comput."},{"key":"10.1016\/S0165-1684(99)00088-2_BIB34","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0165-1684(94)90181-3","article-title":"The generalized discrete W transform and its application to interpolation","volume":"36","author":"Wang","year":"1994","journal-title":"Signal Processing"},{"key":"10.1016\/S0165-1684(99)00088-2_BIB35","doi-asserted-by":"crossref","first-page":"2195","DOI":"10.1109\/78.414784","article-title":"A New transform with symmetrical coding performance for Markov(1) signals","volume":"43","author":"Zou","year":"1995","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168499000882?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168499000882?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T06:33:00Z","timestamp":1733466780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168499000882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0165168499000882"],"URL":"https:\/\/doi.org\/10.1016\/s0165-1684(99)00088-2","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}