blackfin 代码优化.pptVIP

下载本文档

2
0
约6.38千字
约 25页
2016-06-04 发布于河南
举报
版权申诉

blackfin 代码优化.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Instruction Line Considerations Instruction Line Considerations Optimization Techniques for BlackfinJul,25 Profile Pipeline Using C programming-branch Using Assembly language - introduction Using Assembly language – Software loop Using Assembly language – hardware loop Using Assembly language – 32 bit register/ operation Using Assembly language – multi-instructions Using Assembly language – separate data sections Using Assembly language – Loop analysis Using Assembly language – Simple software pipeline Using Assembly language – Loop analysis co. Using Assembly language – Advanced software pipeline Please refer to the “1 C program – un optimized” Please refer to “2 Asm program Un Optimized” Please refer to folder “3 Hardware Loop” Please refer to folder “4 using 2 MAC operation” Please refer to folder “5 using multi-instructions” a w w w . a n a l o g . c o m a The World Leader in High-Performance Signal Processing Solutions Why and Where to Optimization? Why The need of real-time The need of portable Where Tools Linear Profiling New Profile View Debug Windows Pipeline viewer Levels Of Optimization C language Assemble language Algorithm Using C programming-loop1 Using C programming-loop2 Avoid calling function, division （除法）,module and other complicated operation. Using C programming-loop3 Avoid complicated condition judgement Using C programming-using look-up table Notes:Use memory to change for time. for (i = 0, x = -128; i 256; i++, x++) { m_CrToR[i] = (int) ( FIX(1.40200) * x + nHalf ) 16; m_CbToB[i] = (int) ( FIX(1.77200) * x + nHalf ) 16; m_CrToG[i] = (int) (- FIX(0.71414) * x ); m_CbToG[i] = (int) (- FIX(0.34414) * x + nHalf ); } Using C programming-using correct data type Using unsigned type Using data type as short as possible Using the least global variables # define the most constant Using array but not chain table Using fix point type not float point data type Using C programming-others a++ s