{"title":"用于二维离散余弦变换的线性收缩阵列","authors":"Chin-Liang Wang, Chang-Yu Chen","doi":"10.1109/APCCAS.1994.514527","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a linear systolic array of N basic cells (including 2N multipliers) for computing the two-dimensional (2-D) N/spl times/N-point discrete cosine transform (DCT). The array is based on the row-column decomposition but involves no matrix transposition problems. The proposed architecture is highly regular, modular, and thus very suitable for VLSI implementation. Also, it has an efficiency of 100 percent and a throughput of one N/spl times/N-point transform per N/sup 2/ cycles. As compared to existing array structures for the 2-D DCT, the proposed one achieves lower or the same area-time complexity with better regularity. Without change in circuit design, it can be directly used to compute the 2-D N/spl times/N-point inverse DCT and other discrete sinusoidal transforms, such as the discrete sine transform and the discrete Hartley transform. By using the GENESIL CAD tool we design a prototype chip of the proposed linear array for the 8/spl times/8-point DCT in a 0.8 /spl mu/m CMOS technology. The chip requires a die size of about 6.95 mm/spl times/6.9 mm (including 108363 transistors) and is able to operate at a clock rate up to 33 MHz.","PeriodicalId":231368,"journal":{"name":"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A linear systolic array for the 2-D discrete cosine transform\",\"authors\":\"Chin-Liang Wang, Chang-Yu Chen\",\"doi\":\"10.1109/APCCAS.1994.514527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a linear systolic array of N basic cells (including 2N multipliers) for computing the two-dimensional (2-D) N/spl times/N-point discrete cosine transform (DCT). The array is based on the row-column decomposition but involves no matrix transposition problems. The proposed architecture is highly regular, modular, and thus very suitable for VLSI implementation. Also, it has an efficiency of 100 percent and a throughput of one N/spl times/N-point transform per N/sup 2/ cycles. As compared to existing array structures for the 2-D DCT, the proposed one achieves lower or the same area-time complexity with better regularity. Without change in circuit design, it can be directly used to compute the 2-D N/spl times/N-point inverse DCT and other discrete sinusoidal transforms, such as the discrete sine transform and the discrete Hartley transform. By using the GENESIL CAD tool we design a prototype chip of the proposed linear array for the 8/spl times/8-point DCT in a 0.8 /spl mu/m CMOS technology. The chip requires a die size of about 6.95 mm/spl times/6.9 mm (including 108363 transistors) and is able to operate at a clock rate up to 33 MHz.\",\"PeriodicalId\":231368,\"journal\":{\"name\":\"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCCAS.1994.514527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCCAS.1994.514527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A linear systolic array for the 2-D discrete cosine transform
In this paper, we propose a linear systolic array of N basic cells (including 2N multipliers) for computing the two-dimensional (2-D) N/spl times/N-point discrete cosine transform (DCT). The array is based on the row-column decomposition but involves no matrix transposition problems. The proposed architecture is highly regular, modular, and thus very suitable for VLSI implementation. Also, it has an efficiency of 100 percent and a throughput of one N/spl times/N-point transform per N/sup 2/ cycles. As compared to existing array structures for the 2-D DCT, the proposed one achieves lower or the same area-time complexity with better regularity. Without change in circuit design, it can be directly used to compute the 2-D N/spl times/N-point inverse DCT and other discrete sinusoidal transforms, such as the discrete sine transform and the discrete Hartley transform. By using the GENESIL CAD tool we design a prototype chip of the proposed linear array for the 8/spl times/8-point DCT in a 0.8 /spl mu/m CMOS technology. The chip requires a die size of about 6.95 mm/spl times/6.9 mm (including 108363 transistors) and is able to operate at a clock rate up to 33 MHz.