基于收缩处理器的广义最快LIA变换谱计算

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI:10.1109/ISIT.2006.261903

B. Falkowski, C. C. Lozano, S. Rahardja

{"title":"基于收缩处理器的广义最快LIA变换谱计算","authors":"B. Falkowski, C. C. Lozano, S. Rahardja","doi":"10.1109/ISIT.2006.261903","DOIUrl":null,"url":null,"abstract":"Hardware calculation of generalized fastest linearly independent arithmetic (LIA) expansions using systolic processor is presented in this paper. The relation between the forward flow graph of a particular LIA transform and the systolic processor structure for its spectra calculation is given. In general, a particular systolic hardware structure can be used for more than one fastest LIA transforms with appropriate reordering of inputs and/or outputs","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Generalized Fastest LIA Transform Spectra Calculation by Systolic Processor\",\"authors\":\"B. Falkowski, C. C. Lozano, S. Rahardja\",\"doi\":\"10.1109/ISIT.2006.261903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hardware calculation of generalized fastest linearly independent arithmetic (LIA) expansions using systolic processor is presented in this paper. The relation between the forward flow graph of a particular LIA transform and the systolic processor structure for its spectra calculation is given. In general, a particular systolic hardware structure can be used for more than one fastest LIA transforms with appropriate reordering of inputs and/or outputs\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"133 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261903\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文给出了利用收缩处理器实现广义最快线性无关算术展开的硬件计算。给出了特定LIA变换的前向流图与其谱计算的收缩处理器结构之间的关系。一般来说，一个特定的收缩硬件结构可以用于多个最快的LIA转换，并对输入和/或输出进行适当的重新排序

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Generalized Fastest LIA Transform Spectra Calculation by Systolic Processor

Hardware calculation of generalized fastest linearly independent arithmetic (LIA) expansions using systolic processor is presented in this paper. The relation between the forward flow graph of a particular LIA transform and the systolic processor structure for its spectra calculation is given. In general, a particular systolic hardware structure can be used for more than one fastest LIA transforms with appropriate reordering of inputs and/or outputs

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE International Symposium on Information Theory

自引率

0.00%

发文量