{"title":"用于广义傅里叶变换的具有恒定I/O带宽的收缩阵列","authors":"H. Hellwagner","doi":"10.1109/ARRAYS.1988.18061","DOIUrl":null,"url":null,"abstract":"A linear systolic array for computing the generalized Fourier transform is proposed. The transform, which is an extension of the discrete Fourier transform, is briefly reviewed. The basic architecture is formally presented and proved, and an example is given. Some implementation issues are addressed. The array is versatile in the sense that it can compute a variety of different transforms. The array is programmed by simply adapting control input streams to the specific transform to be executed. Loading programs into the cells is not required. The design has constant I/O bandwidth requirements as a result of its dual systolic architecture.<<ETX>>","PeriodicalId":339807,"journal":{"name":"[1988] Proceedings. International Conference on Systolic Arrays","volume":"221 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A systolic array with constant I/O bandwidth for the generalized Fourier transform\",\"authors\":\"H. Hellwagner\",\"doi\":\"10.1109/ARRAYS.1988.18061\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A linear systolic array for computing the generalized Fourier transform is proposed. The transform, which is an extension of the discrete Fourier transform, is briefly reviewed. The basic architecture is formally presented and proved, and an example is given. Some implementation issues are addressed. The array is versatile in the sense that it can compute a variety of different transforms. The array is programmed by simply adapting control input streams to the specific transform to be executed. Loading programs into the cells is not required. The design has constant I/O bandwidth requirements as a result of its dual systolic architecture.<<ETX>>\",\"PeriodicalId\":339807,\"journal\":{\"name\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"volume\":\"221 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. International Conference on Systolic Arrays\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARRAYS.1988.18061\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. International Conference on Systolic Arrays","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARRAYS.1988.18061","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A systolic array with constant I/O bandwidth for the generalized Fourier transform
A linear systolic array for computing the generalized Fourier transform is proposed. The transform, which is an extension of the discrete Fourier transform, is briefly reviewed. The basic architecture is formally presented and proved, and an example is given. Some implementation issues are addressed. The array is versatile in the sense that it can compute a variety of different transforms. The array is programmed by simply adapting control input streams to the specific transform to be executed. Loading programs into the cells is not required. The design has constant I/O bandwidth requirements as a result of its dual systolic architecture.<>