An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations
The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). The authors present a new prime-factor algorithm...
        Saved in:
      
    
          | Published in | IEEE transactions on signal processing Vol. 42; no. 8; pp. 1996 - 2005 | 
|---|---|
| Main Authors | , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
            IEEE
    
        01.08.1994
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1053-587X | 
| DOI | 10.1109/78.301838 | 
Cover
| Abstract | The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). The authors present a new prime-factor algorithm for the DCT. They also design a prime-factor algorithm for the discrete sine transform based on the prime-factor DCT algorithm. Hardware implementations for the prime-factor DCT are also studied. They are especially interested in the hardware designs which are suitable for the VLSI implementations. They show three hardware designs for the prime-factor DCT, including a VLSI circuit fabricated directly according to the signal-flow graph, a linear systolic array, and a mesh-connected systolic array. These three designs show the trade-off between cost and performance. The methodology, which deals with general (N/sub 1//spl times/ N/sub 2/)-point DCTs, where N/sub 1/ and N/sub 2/ are mutually prime, is illustrated by converting a 15-point DCT problem into a (3/spl times/5)-point 2D DCT problem.< > | 
    
|---|---|
| AbstractList | The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). The authors present a new prime-factor algorithm for the DCT. They also design a prime-factor algorithm for the discrete sine transform based on the prime-factor DCT algorithm. Hardware implementations for the prime-factor DCT are also studied. They are especially interested in the hardware designs which are suitable for the VLSI implementations. They show three hardware designs for the prime-factor DCT, including a VLSI circuit fabricated directly according to the signal-flow graph, a linear systolic array, and a mesh-connected systolic array. These three designs show the trade-off between cost and performance. The methodology, which deals with general (N/sub 1//spl times/ N/sub 2/)-point DCTs, where N/sub 1/ and N/sub 2/ are mutually prime, is illustrated by converting a 15-point DCT problem into a (3/spl times/5)-point 2D DCT problem.< > The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). The authors present a new prime-factor algorithm for the DCT. They also design a prime-factor algorithm for the discrete sine transform based on the prime-factor DCT algorithm. Hardware implementations for the prime-factor DCT are also studied. They are especially interested in the hardware designs which are suitable for the VLSI implementations. They show three hardware designs for the prime-factor DCT, including a VLSI circuit fabricated directly according to the signal-flow graph, a linear systolic array, and a mesh-connected systolic array. These three designs show the trade-off between cost and performance. The methodology, which deals with general (N(1)x N(2))-point DCTs, where N(1) and N(2) are mutually prime, is illustrated by converting a 15-point DCT problem into a (3x5)-point 2D DCT problem  | 
    
| Author | Fang-Yu Huang Pei-Zong Lee  | 
    
| Author_xml | – sequence: 1 givenname: Pei-Zong surname: Lee fullname: Lee, Pei-Zong – sequence: 2 givenname: Fang-Yu surname: Huang fullname: Huang, Fang-Yu  | 
    
| BookMark | eNptkM1LAzEQxXOoYFs9ePWUk-Bh28x-ZXssxS8oeFHwtsxmJzaym9QkRfzv3bLFg3gahvm9x5s3YxPrLDF2BWIBIFZLWS0yAVVWTdgURJElRSXfztkshA8hIM9X5ZTpteWktVGGbOR7b3pKNKroPMfu3XkTdz3XwxZ3xFsTlKdIXLlgLPHo0Ybh2HO0LTcx8B369gs9cdPvO-oHT4zG2XDBzjR2gS5Pc85e7-9eNo_J9vnhabPeJiqVMia6bGWbUglKNtSmWhIIKrAsUa7yptGQNwqwgiwH3WCjSVEBTalR6BSKFrM5uxl99959HijEuh8yU9ehJXcIdVrlWQGQDuByBJV3IXjStTJj1uEp09Ug6mOHtazqscNBcftHcWwL_fe_7PXIGiL65U7HH6eIgO0 | 
    
| CODEN | ITPRED | 
    
| CitedBy_id | crossref_primary_10_1109_78_651233 crossref_primary_10_1016_S0165_1684_01_00021_4 crossref_primary_10_1016_j_proeng_2012_01_883 crossref_primary_10_1049_ip_cds_19960347 crossref_primary_10_3103_S0735272719110025 crossref_primary_10_1109_82_769818 crossref_primary_10_20535_S0021347019110025 crossref_primary_10_1109_78_558495 crossref_primary_10_1080_03772063_2001_11416222 crossref_primary_10_1109_78_942642 crossref_primary_10_1016_S0165_1684_00_00251_6 crossref_primary_10_1109_82_974787  | 
    
| Cites_doi | 10.1109/TASSP.1987.1165220 10.1109/78.157181 10.1109/29.60072 10.1109/TASSP.1977.1162973 10.1016/0165-1684(84)90059-8 10.1109/TASSP.1982.1163852 10.2307/2006266 10.1109/ICASSP.1990.115691 10.1109/ICASSP.1985.1168330 10.1109/TASSP.1982.1163963 10.1016/0021-9991(83)90024-4 10.1109/29.1631 10.1109/78.298269 10.1007/978-3-662-00551-4 10.1109/TASSP.1981.1163645 10.1109/12.83654 10.1109/TASSP.1977.1162938 10.1016/0167-8191(88)90008-7 10.1109/78.136537 10.1109/TCOM.1978.1094144 10.1109/12.61045 10.1109/TASSP.1985.1164687 10.1109/71.80125 10.1109/78.139244 10.1109/TASSP.1984.1164399 10.1109/29.21686 10.1016/0021-9991(85)90164-0 10.1109/ICASSP.1989.266622 10.1109/29.45624  | 
    
| ContentType | Journal Article | 
    
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D  | 
    
| DOI | 10.1109/78.301838 | 
    
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts  Academic Computer and Information Systems Abstracts Professional  | 
    
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional  | 
    
| DatabaseTitleList | Computer and Information Systems Abstracts  | 
    
| DeliveryMethod | fulltext_linktorsrc | 
    
| Discipline | Engineering | 
    
| EndPage | 2005 | 
    
| ExternalDocumentID | 10_1109_78_301838 301838  | 
    
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 53G 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AJQPL AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 E.L EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D  | 
    
| ID | FETCH-LOGICAL-c277t-f6d7d2e61c7bed2f7e10e5a66a794bbf14bc1a81341fbabfece51b6fa0f215da3 | 
    
| IEDL.DBID | RIE | 
    
| ISSN | 1053-587X | 
    
| IngestDate | Wed Oct 01 14:35:20 EDT 2025 Wed Oct 01 01:57:46 EDT 2025 Thu Apr 24 23:08:22 EDT 2025 Tue Aug 26 16:39:25 EDT 2025  | 
    
| IsPeerReviewed | true | 
    
| IsScholarly | true | 
    
| Issue | 8 | 
    
| Language | English | 
    
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html | 
    
| LinkModel | DirectLink | 
    
| MergedId | FETCHMERGED-LOGICAL-c277t-f6d7d2e61c7bed2f7e10e5a66a794bbf14bc1a81341fbabfece51b6fa0f215da3 | 
    
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23  | 
    
| PQID | 28435112 | 
    
| PQPubID | 23500 | 
    
| PageCount | 10 | 
    
| ParticipantIDs | proquest_miscellaneous_28435112 crossref_primary_10_1109_78_301838 ieee_primary_301838 crossref_citationtrail_10_1109_78_301838  | 
    
| ProviderPackageCode | CITATION AAYXX  | 
    
| PublicationCentury | 1900 | 
    
| PublicationDate | 1994-08-01 | 
    
| PublicationDateYYYYMMDD | 1994-08-01 | 
    
| PublicationDate_xml | – month: 08 year: 1994 text: 1994-08-01 day: 01  | 
    
| PublicationDecade | 1990 | 
    
| PublicationTitle | IEEE transactions on signal processing | 
    
| PublicationTitleAbbrev | TSP | 
    
| PublicationYear | 1994 | 
    
| Publisher | IEEE | 
    
| Publisher_xml | – name: IEEE | 
    
| References | ref35 ref13 ref34 ref15 ref14 ref31 ref30 ref33 lee (ref12) 1984; assp 32 ref32 ref10 ref1 ref17 ref16 ref19 ref18 cho (ref7) 1990; 38 chan (ref6) 1992 rao (ref21) 1990 ref24 ref23 ref26 ref25 ref22 ref28 ref27 ref29 hou (ref9) 1987; assp 35 nussbaumer (ref20) 1981 ref8 ref4 ref3 burrus (ref2) 1987 ref5 kung (ref11) 1980  | 
    
| References_xml | – ident: ref24 doi: 10.1109/TASSP.1987.1165220 – ident: ref8 doi: 10.1109/78.157181 – ident: ref32 doi: 10.1109/29.60072 – ident: ref10 doi: 10.1109/TASSP.1977.1162973 – ident: ref28 doi: 10.1016/0165-1684(84)90059-8 – ident: ref22 doi: 10.1109/TASSP.1982.1163852 – ident: ref31 doi: 10.2307/2006266 – ident: ref17 doi: 10.1109/ICASSP.1990.115691 – ident: ref35 doi: 10.1109/ICASSP.1985.1168330 – ident: ref29 doi: 10.1109/TASSP.1982.1163963 – ident: ref25 doi: 10.1016/0021-9991(83)90024-4 – ident: ref3 doi: 10.1109/29.1631 – ident: ref14 doi: 10.1109/78.298269 – year: 1981 ident: ref20 publication-title: Springer Series in Information Sciences doi: 10.1007/978-3-662-00551-4 – ident: ref4 doi: 10.1109/TASSP.1981.1163645 – ident: ref34 doi: 10.1109/12.83654 – start-page: 1045 year: 1992 ident: ref6 article-title: Prime factor real-valued Fourier, cosine, and Hartley transforms publication-title: Proc Sixth Europ Signal Processing Conf – volume: assp 32 start-page: 1243 year: 1984 ident: ref12 article-title: A new algorithm to compute the discrete cosine transform publication-title: IEEE Trans Acoust Speech Signal Processing – year: 1990 ident: ref21 publication-title: Discrete Cosine Transform Algorithms Advantages and Applications – ident: ref1 doi: 10.1109/TASSP.1977.1162938 – ident: ref27 doi: 10.1016/0167-8191(88)90008-7 – ident: ref16 doi: 10.1109/78.136537 – ident: ref19 doi: 10.1109/TCOM.1978.1094144 – ident: ref5 doi: 10.1109/12.61045 – ident: ref23 doi: 10.1109/TASSP.1985.1164687 – ident: ref15 doi: 10.1109/71.80125 – ident: ref18 doi: 10.1109/78.139244 – start-page: 1809 year: 1987 ident: ref2 article-title: Bit reverse unscrambling for a radix-2M FFT publication-title: ?roc IEEE Int Conf Acoust Speech Signal Processing – ident: ref30 doi: 10.1109/TASSP.1984.1164399 – ident: ref13 doi: 10.1109/29.21686 – ident: ref26 doi: 10.1016/0021-9991(85)90164-0 – volume: assp 35 start-page: 1455 year: 1987 ident: ref9 article-title: A fast recursive algorithm for computing the discrete cosine transform publication-title: IEEE Trans Acoust Speech Signal Processing – year: 1980 ident: ref11 publication-title: Introduction to VLSI Systems – ident: ref33 doi: 10.1109/ICASSP.1989.266622 – volume: 38 start-page: 121 year: 1990 ident: ref7 article-title: DCT algorithms for VLSI parallel implementations publication-title: IEEE Trans Acoust Speech Signal Processing doi: 10.1109/29.45624  | 
    
| SSID | ssj0014496 | 
    
| Score | 1.5506394 | 
    
| Snippet | The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete... | 
    
| SourceID | proquest crossref ieee  | 
    
| SourceType | Aggregation Database Enrichment Source Index Database Publisher  | 
    
| StartPage | 1996 | 
    
| SubjectTerms | Algorithm design and analysis Convolution Digital signal processing Discrete cosine transforms Discrete Fourier transforms Fast Fourier transforms Hardware Signal processing algorithms Systolic arrays Very large scale integration  | 
    
| Title | An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations | 
    
| URI | https://ieeexplore.ieee.org/document/301838 https://www.proquest.com/docview/28435112  | 
    
| Volume | 42 | 
    
| hasFullText | 1 | 
    
| inHoldings | 1 | 
    
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 1053-587X databaseCode: RIE dateStart: 19910101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0014496 providerName: IEEE  | 
    
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZoJxh4FBDlaSEGlrSJ87AzVoiqYmCiUrfIjzNUtEnVpkLi12M7ScWjA1sU-aTIPvs-5777DqE7SUjKA516EIK5oEAYe6mMAi9lwieSi0hKR5B9Tkbj6GkST2qdbVcLAwCOfAY9--hy-aqQa_urrG-ckYWshVqUJVWp1iZhEEWuFZdBC6EXMzqpRYQCP-1T1qsMf4Qe10vlzwHsosrwoCrXXjkxQksmee-tS9GTn7-kGv_5wYdov0aXeFC5wxHagbyD9r5pDh4jPcgxON0IY4oXVt3fq5ruYD57LZbT8m2ODZLFBhliW7O7NLAay8Ly43HZwFzMc4Wn5Qrboq0PvgQ8nTdMdOfJJ2g8fHx5GHl1swVPEkpLTyeKKgJJIKkARTSFwIeYJwk3O1YIHURCBpxZ_TctuNAgIQ5EormvDWpQPDxF7bzI4QxhTfyQgQpVQmREOOHMyhCak0H5AnzgXXTfrEMmayVy2xBjlrkbiZ9mlGXV1HXR7WboopLf2DaoY6d-M6B5e9OsbWa2jM2D8ByK9SozEdmmT8n5VrsLtFvpJVuS3yVql8s1XBngUYpr53JfcvnaGw | 
    
| linkProvider | IEEE | 
    
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwELVYDsCBpYDYayEOXNImjpM4R4RABQonKvUWeRlDBSSoTYXE12M7ScXSA7co8kiRPfY8Z968QehMEpLyQKcehGAuKBBGXipp4KVM-ERyQaV0BNmHuDegt8NoWOtsu1oYAHDkM-jYR5fLV4Wc2l9lXeOMLGSLaDmilEZVsdYsZUCpa8Zl8ELoRSwZ1jJCgZ92E9apTH8EH9dN5c8R7OLK9UZVsD1xcoSWTvLSmZaiIz9_iTX-85M30XqNL_FF5RBbaAHyFlr7pjq4jfRFjsEpRxhT_G71_b2q7Q7mr0_FeFQ-v2GDZbHBhthW7Y4NsMaysAx5XDZAF_Nc4VE5wbZs64OPAY_eGi668-UdNLi-erzseXW7BU-SJCk9HatEEYgDmQhQRCcQ-BDxOOZmzwqhAypkwJlVgNOCCw0SokDEmvva4AbFw120lBc57CGsiR8yUKGKiaSEE86sEKE5G5QvwAe-j86bdchkrUVuW2K8Zu5O4qdZwrJq6vbR6WzoeyXAMW9Qy079bEDztt2sbWY2jc2E8ByK6SQzMdkmUMnBXLs2Wuk93vez_s3D3SFardSTLeXvCC2V4ykcGxhSihPnfl8AHd1o | 
    
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+efficient+prime-factor+algorithm+for+the+discrete+cosine+transform+and+its+hardware+implementations&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Pei-Zong+Lee&rft.au=Fang-Yu+Huang&rft.date=1994-08-01&rft.issn=1053-587X&rft.volume=42&rft.issue=8&rft.spage=1996&rft.epage=2005&rft_id=info:doi/10.1109%2F78.301838&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_78_301838 | 
    
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon | 
    
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon | 
    
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon |