A new DRAM architecture and its control method for the system power consumption

Y. Riho, K. Nakazato
{"title":"A new DRAM architecture and its control method for the system power consumption","authors":"Y. Riho, K. Nakazato","doi":"10.1145/2591513.2591516","DOIUrl":null,"url":null,"abstract":"Demands have been placed on dynamic random access memory (DRAM) to not only increase memory capacity and data transfer speed but also to reduce operating and standby currents. When a system uses DRAM, the restricted data retention time necessitates a re-write operation because each bit of the DRAM is stored as an amount of electrical charge in a storage capacitor. Power consumption for the refresh operation increases in proportion to memory capacity. According to a new proposed method the refresh operation frequency and its power consumption reduce to 1/(2 to the Nth) (N=1, 2, 3, 4) when full memory capacity is not required, by effectively extending the refresh operation interval. The proposal includes the conversion from 1 cell/bit to (2 to the Nth) cells/bit, which reduces the variation of retention times among memory cells. This leads the refresh operation frequency from 1/(2 to the Nth) to 1/(2 to the Nth) X 1/(2 to the Nth), while it accompanies the additional charging power for the composed memory cell. A system can select the best way of 1 cell/bit and (2 to the Nth) cells/bit from the total viewpoint, while all conventional functions and operations in the full array access mode are fully compatible.","PeriodicalId":272619,"journal":{"name":"ACM Great Lakes Symposium on VLSI","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Great Lakes Symposium on VLSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2591513.2591516","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Demands have been placed on dynamic random access memory (DRAM) to not only increase memory capacity and data transfer speed but also to reduce operating and standby currents. When a system uses DRAM, the restricted data retention time necessitates a re-write operation because each bit of the DRAM is stored as an amount of electrical charge in a storage capacitor. Power consumption for the refresh operation increases in proportion to memory capacity. According to a new proposed method the refresh operation frequency and its power consumption reduce to 1/(2 to the Nth) (N=1, 2, 3, 4) when full memory capacity is not required, by effectively extending the refresh operation interval. The proposal includes the conversion from 1 cell/bit to (2 to the Nth) cells/bit, which reduces the variation of retention times among memory cells. This leads the refresh operation frequency from 1/(2 to the Nth) to 1/(2 to the Nth) X 1/(2 to the Nth), while it accompanies the additional charging power for the composed memory cell. A system can select the best way of 1 cell/bit and (2 to the Nth) cells/bit from the total viewpoint, while all conventional functions and operations in the full array access mode are fully compatible.
一种新的DRAM架构及其系统功耗控制方法
动态随机存取存储器(DRAM)不仅需要增加存储器容量和数据传输速度,而且需要减少工作和待机电流。当一个系统使用DRAM时,有限的数据保留时间需要重写操作,因为DRAM的每一位都以一定数量的电荷存储在存储电容器中。刷新操作的功耗与内存容量成正比。提出了一种新的方法,通过有效地延长刷新操作间隔,使刷新操作频率和功耗降低到1/(2 ^ N) (N= 1,2,3,4)。该方案包括从1个单元/位到(2 ^ n)个单元/位的转换,减少了存储单元之间的保留时间变化。这导致刷新操作频率从1/(2到n)到1/(2到n) X 1/(2到n),同时它伴随着复合存储单元的额外充电功率。从总角度来看,系统可以选择1 cell/bit和(2 ^ n) cell/bit的最佳方式,而全阵列访问模式下的所有常规功能和操作都是完全兼容的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信