{"title":"利用TMS320C50 DSP实现离散余弦变换的快速精确计算","authors":"J. Agbinya","doi":"10.1109/ISSPA.1996.615133","DOIUrl":null,"url":null,"abstract":"In this paper a DCT algorithm is implemented which requires only 2N DCT coefficients i n the look-up table. Fixed-point methods are used, inputs are represented as 14-bit fixed-point numbers, and computation is done in double precision to increase accuracy. Results are presented as 16-bit values. My algorithm uses Clenshaw's recursive formula described in [3-51 to compute the DCT coefficients, {X(k)}, for the sequence {x(n)). I assume a series expansion of x(t) as N k=O x (t) = L h k F k (t) (3) where Fk(t) is a sequence chosen to obey the recursive relation:","PeriodicalId":359344,"journal":{"name":"Fourth International Symposium on Signal Processing and Its Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast And Accurate Computation Of The Discrete Cosine Transform Using TMS320C50 DSP\",\"authors\":\"J. Agbinya\",\"doi\":\"10.1109/ISSPA.1996.615133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a DCT algorithm is implemented which requires only 2N DCT coefficients i n the look-up table. Fixed-point methods are used, inputs are represented as 14-bit fixed-point numbers, and computation is done in double precision to increase accuracy. Results are presented as 16-bit values. My algorithm uses Clenshaw's recursive formula described in [3-51 to compute the DCT coefficients, {X(k)}, for the sequence {x(n)). I assume a series expansion of x(t) as N k=O x (t) = L h k F k (t) (3) where Fk(t) is a sequence chosen to obey the recursive relation:\",\"PeriodicalId\":359344,\"journal\":{\"name\":\"Fourth International Symposium on Signal Processing and Its Applications\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth International Symposium on Signal Processing and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPA.1996.615133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Symposium on Signal Processing and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.1996.615133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文实现了一种查找表中只需要2N个DCT系数i的DCT算法。采用定点法，输入用14位定点数表示，并采用双精度计算提高精度。结果以16位值表示。我的算法使用[3-51]中描述的Clenshaw递归公式来计算序列{X(n))的DCT系数{X(k)}。假设x(t)的级数展开式为N k=O x(t) = L h k Fk(t)(3)其中Fk(t)是一个服从递归关系的序列
Fast And Accurate Computation Of The Discrete Cosine Transform Using TMS320C50 DSP
In this paper a DCT algorithm is implemented which requires only 2N DCT coefficients i n the look-up table. Fixed-point methods are used, inputs are represented as 14-bit fixed-point numbers, and computation is done in double precision to increase accuracy. Results are presented as 16-bit values. My algorithm uses Clenshaw's recursive formula described in [3-51 to compute the DCT coefficients, {X(k)}, for the sequence {x(n)). I assume a series expansion of x(t) as N k=O x (t) = L h k F k (t) (3) where Fk(t) is a sequence chosen to obey the recursive relation:
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
