{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:33:17Z","timestamp":1648535597301},"reference-count":17,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":[[2001,11]]},"DOI":"10.1016\/s0165-1684(01)00021-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:02:32Z","timestamp":1027602152000},"page":"2437-2443","source":"Crossref","is-referenced-by-count":1,"title":["Bit-level systolic implementation of discrete orthogonal transforms"],"prefix":"10.1016","volume":"81","author":[{"given":"S.S.","family":"Nayak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.N.","family":"Murty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Panda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0165-1684(01)00021-4_BIB1","doi-asserted-by":"crossref","unstructured":"J.W. Cooley, J.W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comput. 19 (April 1965) 297\u2013301.","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB2","doi-asserted-by":"crossref","unstructured":"H.V. Sorensen, D.L. Jones, C.S. Burrus, M.T. Heideman, On computing the discrete Hartley transform, IEEE Trans. Acoustics, Speech, Signal Process. ASSP-33 (4) (October 1985) 1231\u20131238.","DOI":"10.1109\/TASSP.1985.1164687"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB3","series-title":"Digital Coding of Wave Forms","author":"Jayant","year":"1984"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB4","doi-asserted-by":"crossref","unstructured":"R.J. Clarke, Relation between the Karhunen\u2013Loeve and cosine transforms, IEE Proc. 128 (6) (November 1981) 359\u2013360.","DOI":"10.1049\/ip-f-1.1981.0061"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB5","doi-asserted-by":"crossref","unstructured":"D.P. Kolba, T.W. Parks, A prime-factor FFT algorithm using high-speed convolution, IEEE Trans. Acoustics, Speech, Signal Process. ASSP-25 (4) (August 1977) 281\u2013294.","DOI":"10.1109\/TASSP.1977.1162973"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB6","doi-asserted-by":"crossref","unstructured":"H.F. Silverman, An introduction to programming the Winograd Fourier transform algorithm (WFTA), IEEE Trans. Acoustics, Speech, Signal Process. ASSP-25 (2) (April 1977) 152\u2013163.","DOI":"10.1109\/TASSP.1977.1162924"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB7","doi-asserted-by":"crossref","unstructured":"P.K. Meher, J.K. Satapathy, G. Panda, New high speed prime-factor algorithm for discrete Hartley transform, IEE Proc., \u2013 F. Radar and Signal Process. 140 (1) (February 1993) 63\u201370.","DOI":"10.1049\/ip-f-2.1993.0009"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB8","doi-asserted-by":"crossref","unstructured":"P.Z. Lee, F.Y. Huang, An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations, IEEE Trans. Signal Process. 42 (8) (August 1994) 1996\u20132005.","DOI":"10.1109\/78.301838"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB9","doi-asserted-by":"crossref","unstructured":"H.T. Kung, Why systolic architectures?, IEEE Trans. Computers 15 (1) (January 1982) 37\u201346.","DOI":"10.1109\/MC.1982.1653825"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB10","unstructured":"J.A. Eldon, in: R.W. Brodersen, H.S. Moscovitz (Eds.), Fourier on chip, VLSI Signal Processing, Vol. 111, IEEE Press, New York, 1988, pp. 15\u201320."},{"key":"10.1016\/S0165-1684(01)00021-4_BIB11","doi-asserted-by":"crossref","unstructured":"J.I. Guo, C.M. Liu, C.W. Jen, A novel CORDIC-based array architecture for the multidimensional discrete Hartley transform, IEEE Trans. Circuits Systems-11: Analog and Digital Signal Process. 42 (5) (May 1995) 349\u2013355.","DOI":"10.1109\/82.386175"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB12","doi-asserted-by":"crossref","unstructured":"J.V. McCanny, J.G. McWhirter, S.Y. Kung, The use of data dependence graphs in the design of bit-level systolic arrays, IEEE Trans. Acoustics, Speech, Signal Process. ASSP-18 (5) (May 1990) 787\u2013793.","DOI":"10.1109\/29.56023"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB13","doi-asserted-by":"crossref","unstructured":"R.M. Owens, J. Ja\u2019 Ja\u2019, A VLSI chip for the winograd\/prime-factor algorithm to compute the discrete Fourier transform, IEEE Trans. Acoustics, Speech, Signal Process. ASSP-34 (4) (August 1986) 979\u2013989.","DOI":"10.1109\/TASSP.1986.1164888"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB14","doi-asserted-by":"crossref","unstructured":"C. Chakrabarti, J. Ja\u2019 Ja\u2019, Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime-factor decomposition, IEEE Trans. Computers 39 (11) (November 1990) 1359\u20131368.","DOI":"10.1109\/12.61045"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB15","doi-asserted-by":"crossref","unstructured":"M.T. Sun, T.C. Chen, A.M. Gottlieb, VLSI Implementation of a 16\u00d716 discrete cosine transform, IEEE Trans. Circuits Systems CAS-36 (4) (April 1989) 610\u2013617.","DOI":"10.1109\/31.92893"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB16","doi-asserted-by":"crossref","unstructured":"F.A. McGovern, R.F. Woods, M. Yan, Novel VLSI implementation of (8\u00d78) point 2-D DCT, Electron. Lett. 30 (8) (April 1994) 624\u2013626.","DOI":"10.1049\/el:19940423"},{"key":"10.1016\/S0165-1684(01)00021-4_BIB17","doi-asserted-by":"crossref","unstructured":"S.S. Nayak, P.K. Meher, High throughput VLSI implementation of discrete orthgonal transforms using bit-level vector-matrix multiplier, IEEE Trans. Circuits Systems 46 (5) (May 1999) 655\u2013658.","DOI":"10.1109\/82.769818"}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168401000214?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168401000214?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T10:43:32Z","timestamp":1578825812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168401000214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":17,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0165168401000214"],"URL":"https:\/\/doi.org\/10.1016\/s0165-1684(01)00021-4","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}