为什么我们在未来的无线通信系统中需要所有这些MIPS,以及如何为这些系统设计算法和架构

H. Meyr
{"title":"为什么我们在未来的无线通信系统中需要所有这些MIPS,以及如何为这些系统设计算法和架构","authors":"H. Meyr","doi":"10.1109/SIPS.2001.957323","DOIUrl":null,"url":null,"abstract":"Summary form only given. Advanced communication systems obey a generalized Moore's law. Not only does hardware complexity double every 18 months, but also the other performance indicators such as program size or memory content-increase by a factor of two in a period of one and a half and three years, to mention two examples. The drawing force behind this growth is the algorithmic complexity which is needed to design communication systems operating close to the information theoretic limits: near optimum system performance is bound to exponentially increasing algorithmic complexity. Stated differently, the usefulness for the user only grows logarithmically with complexity. Basically, this logarithmic complexity provides the rational for the continued growth of the semiconductor industry. Advanced communication systems will be implemented as reconfigurable, heterogeneous multiprocessor platforms. This hypothesis is based on the fundamental trade-off between computational efficiency (MOPS/mW) and flexibility. While programmable devices (processors or DSPs) have the highest degree of flexibility, they have at least a two to three orders of magnitude smaller computational efficiency than the intrinsic computational efficiency (ICE) of fixed architectures. Hence, since power is the limiting factor, the SOCs of the future will carefully match algorithm with architecture to achieve an optimum. (\"just as much flexibility as needed\"). These SOC's will, therefore, become application specific platforms.","PeriodicalId":246898,"journal":{"name":"2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Why we need all these MIPS in future wireless communication systems-and how to design algorithms and architecture for these systems\",\"authors\":\"H. Meyr\",\"doi\":\"10.1109/SIPS.2001.957323\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. Advanced communication systems obey a generalized Moore's law. Not only does hardware complexity double every 18 months, but also the other performance indicators such as program size or memory content-increase by a factor of two in a period of one and a half and three years, to mention two examples. The drawing force behind this growth is the algorithmic complexity which is needed to design communication systems operating close to the information theoretic limits: near optimum system performance is bound to exponentially increasing algorithmic complexity. Stated differently, the usefulness for the user only grows logarithmically with complexity. Basically, this logarithmic complexity provides the rational for the continued growth of the semiconductor industry. Advanced communication systems will be implemented as reconfigurable, heterogeneous multiprocessor platforms. This hypothesis is based on the fundamental trade-off between computational efficiency (MOPS/mW) and flexibility. While programmable devices (processors or DSPs) have the highest degree of flexibility, they have at least a two to three orders of magnitude smaller computational efficiency than the intrinsic computational efficiency (ICE) of fixed architectures. Hence, since power is the limiting factor, the SOCs of the future will carefully match algorithm with architecture to achieve an optimum. (\\\"just as much flexibility as needed\\\"). These SOC's will, therefore, become application specific platforms.\",\"PeriodicalId\":246898,\"journal\":{\"name\":\"2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIPS.2001.957323\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIPS.2001.957323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

只提供摘要形式。先进的通信系统遵循广义的摩尔定律。不仅硬件复杂性每18个月翻一番,而且其他性能指标(如程序大小或内存内容)也会在一年半和三年的时间内增加两倍,举两个例子。这种增长背后的推动力是设计接近信息理论极限的通信系统所需的算法复杂性:接近最佳系统性能必然会以指数方式增加算法复杂性。换句话说,对用户的有用性只会随着复杂性呈对数增长。基本上,这种对数复杂性为半导体行业的持续增长提供了理性。先进的通信系统将作为可重构的异构多处理器平台来实现。这个假设是基于计算效率(MOPS/mW)和灵活性之间的基本权衡。虽然可编程器件(处理器或dsp)具有最高程度的灵活性,但它们的计算效率至少比固定架构的固有计算效率(ICE)低两到三个数量级。因此,由于功率是限制因素,未来的soc将仔细匹配算法和架构以达到最佳效果。(“需要多少灵活性就有多少”)。因此,这些SOC将成为特定于应用的平台。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Why we need all these MIPS in future wireless communication systems-and how to design algorithms and architecture for these systems
Summary form only given. Advanced communication systems obey a generalized Moore's law. Not only does hardware complexity double every 18 months, but also the other performance indicators such as program size or memory content-increase by a factor of two in a period of one and a half and three years, to mention two examples. The drawing force behind this growth is the algorithmic complexity which is needed to design communication systems operating close to the information theoretic limits: near optimum system performance is bound to exponentially increasing algorithmic complexity. Stated differently, the usefulness for the user only grows logarithmically with complexity. Basically, this logarithmic complexity provides the rational for the continued growth of the semiconductor industry. Advanced communication systems will be implemented as reconfigurable, heterogeneous multiprocessor platforms. This hypothesis is based on the fundamental trade-off between computational efficiency (MOPS/mW) and flexibility. While programmable devices (processors or DSPs) have the highest degree of flexibility, they have at least a two to three orders of magnitude smaller computational efficiency than the intrinsic computational efficiency (ICE) of fixed architectures. Hence, since power is the limiting factor, the SOCs of the future will carefully match algorithm with architecture to achieve an optimum. ("just as much flexibility as needed"). These SOC's will, therefore, become application specific platforms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A real-time HDTV video decoder A multi-level block priority based instruction caching scheme for multimedia processors Reliable low-power multimedia communication systems Design of Viterbi decoders with in-place state metric update and hybrid traceback processing Index-based RNS DWT architectures for custom IC designs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1