A pipelined row address decoding scheme for hierarchical word line structure DRAM

Young-Min Hong, Young-Hyun Jun, L. Kim
{"title":"A pipelined row address decoding scheme for hierarchical word line structure DRAM","authors":"Young-Min Hong, Young-Hyun Jun, L. Kim","doi":"10.1109/ICVC.1999.820899","DOIUrl":null,"url":null,"abstract":"We propose a fast row cycle DRAM core architecture, which employs the pipelined row address decoding scheme for an hierarchical word line structure. The pipelined row address decoding scheme decreases the amount of the skew during the decoding operation. We obtain the row cycle time by reducing the latency from the beginning of the input address signal to the latching of the sub word line signal. We confirm an 9.14 ns row address cycle time at 2.5 V, even when a row address in the identical cell array is successively accessed by HSPICE simulation based on a LG 0.18 /spl mu/m technology. Adding the latch circuits for pipelining, the area penalty is only 2% of the total size compared with conventional pipelined row address decoding schemes and power dissipation is about 7.5% larger.","PeriodicalId":13415,"journal":{"name":"ICVC '99. 6th International Conference on VLSI and CAD (Cat. No.99EX361)","volume":"69 1","pages":"259-262"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICVC '99. 6th International Conference on VLSI and CAD (Cat. No.99EX361)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICVC.1999.820899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose a fast row cycle DRAM core architecture, which employs the pipelined row address decoding scheme for an hierarchical word line structure. The pipelined row address decoding scheme decreases the amount of the skew during the decoding operation. We obtain the row cycle time by reducing the latency from the beginning of the input address signal to the latching of the sub word line signal. We confirm an 9.14 ns row address cycle time at 2.5 V, even when a row address in the identical cell array is successively accessed by HSPICE simulation based on a LG 0.18 /spl mu/m technology. Adding the latch circuits for pipelining, the area penalty is only 2% of the total size compared with conventional pipelined row address decoding schemes and power dissipation is about 7.5% larger.
分层字行结构DRAM的流水线行地址解码方案
我们提出了一种快速行周期DRAM核心架构,该架构采用流水线行地址解码方案来实现分层字行结构。流水线行地址解码方案减少了解码操作期间的倾斜量。我们通过减少从输入地址信号开始到子字行信号锁存的延迟来获得行周期时间。我们确认了在2.5 V下的9.14 ns行地址周期时间,即使在基于LG 0.18 /spl mu/m技术的HSPICE模拟中连续访问相同单元阵列中的行地址。加上用于流水线的锁存电路,与传统的流水线行地址解码方案相比,面积损失仅为总尺寸的2%,功耗约增加7.5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信