检索结果-内蒙古大学图书馆

An Innovative program scheme for Reducing Z-Interference in Charge-Trap-Based 3-D NAND Flash Memory

IEEE TRANSACTIONS ON ELECTRON DEVICES 2023年第12期70卷 6695-6698页

作者： Ahn, Sangmin Jo, Hyungjun Kim, Sungju Park, Sechun Lim, Kyunam Kim, Jongwoo Shin, Hyungcheol Seoul Natl Univ Dept Elect & Comp Engn Seoul 08826 South Korea SK Hynix Inc NAND Design Team Icheon Si 17336 South Korea Integra Semicond Co Ltd Seoul 06970 South Korea

In this brief, we propose an innovative program scheme to mitigatez-direction interference(Z-interference) in charge-trap-based 3-DNANDflash memory. Our approach adjusts the position of trapped electronsin charge trap nitride (CTN) layer during the program oper-ation by varying the pass voltage (V-pass) on both side wordlines (WLs) of the selected WL. Specifically, cells with a high threshold voltage (V-th) place electrons in the program direction, whereas cells with a low V-th place electrons inthe opposite direction. Depending on the program-verify(PV) level pattern of the aggressor (Agr)-victim cell (Vic),the effective gate pitch can be modified, even though the physical gate pitch is fixed. We validate our proposed scheme using technology computer-aided design (TCAD)simulations and experimental measurements.

关键词： Flash memories Logic gates Electron traps Interference Three-dimensional displays Threshold voltage Simulation 3-D NAND flash charge trap program scheme technology computer-aided design (TCAD) simulation z-direction interference (Z-interference)

来源：评论

学校读者我要写书评

暂无评论

A Novel program scheme for program Disturbance Optimization in 3-D NAND FlashMemory

IEEE ELECTRON DEVICE LETTERS

引用

IEEE ELECTRON DEVICE LETTERS 2018年第7期39卷 959-962页

作者： Zhang, Yu Jin, Lei Zou, Xingqi Liu, Hongtao Zhang, An Huo, Zongliang Chinese Acad Sci Inst Microelect Beijing 100029 Peoples R China Univ Chinese Acad Sci Sch Microelect Beijing 100049 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Yangtze Memory Technol Co Ltd Wuhan 430205 Hubei Peoples R China

A new program scheme using an "eraselike" waveform for precharge operation is proposed for program disturbance optimization in 3-D vertical channel flash memories. With the proposed scheme, the effect of precharge operation, which is followed by program operation, on the initial unselected channel is enhanced by charging additional holes from p-type well. Consequently, boosting efficiency and boosting potential of unselected string are promoted, leading to a significant suppressed programdisturbance, and the V-pass windowcan be enlarged notably as well. Meanwhile, the timing requirement of the proposed scheme is evaluated. The advantage of the erase assisted precharge scheme has been demonstrated by TCAD simulation and measurement in mini-array test-key device.

关键词： 3D NAND flash memory vertical poly silicon channel erase assisted precharge program scheme program disturbance

来源：评论

学校读者我要写书评

暂无评论

ON THE COMPUTATIONAL-COMPLEXITY OF program scheme EQUIVALENCE

引用

SIAM JOURNAL ON COMPUTING 1980年第2期9卷 396-416页

作者： HUNT, HB CONSTABLE, RL SAHNI, S

The computatiional complexity of several decidable problems about program schemes, recursion schemes, and simple programming languages is considered. The strong equivalence, weak equivalence, containment, halting, and divergence problems for the single variable program schemes and the linear monadic recursion schemes are shown to be

N P

$NP$ -complete. The equivalence problem for the Loop 1 programming language is also shown to be

关键词： computational complexity P NP NP-complete program scheme recursion scheme equivalence containment halting divergence and isomorphism

来源：评论

学校读者我要写书评

暂无评论

Adaptive Pulse program scheme to Improve the Vth Distribution for 3D NAND Flash 52

Adaptive Pulse Program Scheme to Improve the Vth Distributio...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Li, Shuang Du, Zhichao Wang, Yu Liu, Fei Wang, Qi Huo, Zongliang Chinese Acad Sci Inst Microelect Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Yangtze Memory Technol Co Ltd Wuhan Peoples R China

ISBN: (纸本)9781728133201

As the demand of multi-bit/cell NAND flash devices is increasing rapidly, getting a narrow cell Vth distribution becomes more challenging and necessary. To overcome this challenge, an adaptive pulse program (APP) scheme is reported that can tighten the Vth distribution in this work. Compared with conventional incremental step pulse program (ISPP) scheme, this proposed scheme uses adaptive program pulse to the cells with different program speed, which targets to prevent the extension of Vth distribution's upper tail. Our experimental result demonstrates that APP scheme achieves similar to 15% improvement for reducing cell Vth distribution width. This comparison of APP scheme and general ISPP scheme is performed by the FPGA platform using 64-layer 3D charge-trapping NAND flash chip.

关键词： 3D NAND flash memory program scheme adaptive pulse program

来源：评论

学校读者我要写书评

暂无评论

Idiom Recognition and program scheme Recognition based program Transformations for Performance Tuning-Beyond Compiler Optimizations-

Idiom Recognition and Program Scheme Recognition based Progr...

引用

10th International Conference on Parallel and Distributed Computing, Applications and Technologies

作者： Hiroyuki, Sato Univ Tokyo Ctr Informat Technol Tokyo 1138654 Japan

ISBN: (纸本)9781424452910

Much effort has been performed for performance tuning. However, it is becoming clear that performance tuning is much harder in complicated modern parallel architectures. For performance tuning, compiler approach was prevailing in the era of vector architecture. Today, instead, PSE approach which provides users with abstract programming emerges, which also has a problem in tuning fine points. Another approach is "autotuning" which is a brute force attack for performance tuning. We have proposed that idiom recognition can be a bridge between abstract source programs and concrete architectures. This paper applies term rewriting theory -a very general framework to the idiom recognition system. Moreover, we apply higher order term rewriting to find better patterns. We show that tiling and recursive algorithm scheme patterns can be reinvented by the extended idiom recognition. Furthermore, we discuss a method of enrichment of candidates of optimizations by using the general framework of graph rewriting.

关键词： performance tuning idiom recognition program scheme autotuning

来源：评论

学校读者我要写书评

暂无评论

Halting and Equivalence of program schemes in Models of Arbitrary Theories

Halting and Equivalence of Program Schemes in Models of Arbi...

引用

YuriFest: Symposium on Logic in Computer Science

作者： Kozen, Dexter Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9783642150241

In this note we consider the following decision problems. Let Sigma be a fixed first-order signature. (i) Given a first-order theory or ground theory T over Sigma of Turing degree a, a program scheme p over Sigma, and input values specified by ground terms t(1), ... t(n), does p halt on input t(1), ... t(n), in all models of T? (ii) Given a first-order theory or ground theory T over Sigma of Turing degree a and two program schemes p and q over Sigma, are p and q equivalent in all models of T? When T is empty, these two problems are the classical halting and equivalence problems for program schemes, respectively. We show that problem (i) is Sigma(alpha)(1)-complete and problem (ii) is Pi(alpha)(2)-complete. Both problems remain hard for their respective complexity classes even if Sigma is restricted to contain only a single constant, a single unary function symbol, and a single monadic predicate. It follows from (ii) that there can exist no relatively complete deductive system for scheme equivalence over models of theories of any Turing degree.

关键词： dynamic model theory program scheme scheme equivalence

来源：评论

学校读者我要写书评

暂无评论

Counter machines

引用

INFORMATION PROCESSING LETTERS 1999年第5-6期71卷 193-197页

作者： Wojna, A Warsaw Univ Inst Informat PL-02097 Warsaw Poland

In this paper we study the computational power of counters. Two different notions of a counter occur in the literature. One, which we call a two-way counter, is common in automata theory and is provided with the following operations: increment and decrement by 1 and test for zero. Another notion was used in schematology and logics of programs. The corresponding set of operations comes from the simplest algebraic structure of positive integers with increment by 1, reset to 0 and comparison of two counter values. There is no decrementation, therefore we call it a one-way counter. It is known that two two-way counters are enough to simulate a Turing machine. We present the same result for the one-way model: two one-way counters can simulate each Turing machine. We also discuss some consequences of this result for the hierarchy of program schemes. O 1999 Published by Elsevier Science B.V. All rights reserved.

关键词： theory of computation counter machine program scheme program equivalence

来源：评论

学校读者我要写书评

暂无评论

ON THE POLYNOMIAL COMPLEXITY OF THE EQUIVALENCE CHECKING PROBLEM IN ALGEBRAIC MODELS OF programS

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2012年第5期48卷 653-659页

作者： Podlovchenko, R. I. Moscow MV Lomonosov State Univ Res Comp Ctr Moscow Russia

Algebraic models of programs are considered for which the decidability of the equivalence checking problem is proved. A new equivalence checking algorithm stemmed from the well-known Moore technique for finite state automata is introduced. It is shown that, for some subclasses of models, this algorithm is reduced to a polynomial-time equivalence checking procedure.

关键词： algebraic model of programs program scheme equivalence algorithmic decidability computational complexity

来源：评论

学校读者我要写书评

暂无评论

Schema-Guided Inductive Functional programming Through Automatic Detection of Type Morphisms

引用

KUNSTLICHE INTELLIGENZ 2012年第1期26卷 83-86页

作者： Hofmann, Martin Schutzen Str. 48 D-76137 Karlsruhe Germany Otto Friedrich Univ Business Informat Syst & Business Management Bamberg Germany Univ Coll Swansea Swansea W Glam Wales SAP AG Walldorf Germany

Inductive program Synthesis or Inductive programming (IP) is the task of generating (recursive) programs from an incomplete specification, such as input/output (I/O) examples. All known IP algorithms can be described as search in the space of all candidate programs, with consequently exponential complexity. To constrain the search space and guide the search traditionally program schemes are used, usually given a priori by an expert user. Consequently, all further given data is interpreted w. r. t. this schema which now almost exclusively decides on success and failure, depending on whether it fits the data or not. Instead of trying to fit the data to a given schema indiscriminately, in my thesis (Schema-guided inductive functional programmin through automatic detection of type morphisms, 2010) I proposed to utilise knowledge about data types to choose and fit a suitable schema to the data! Recursion operators associated with data type definitions are well known in functional programming, but less in IP. I showed how to exploit universal properties of type morphisms which may be detected in the given I/O examples. This technique allows to introduce generic recursion schemes, such as catamorphisms or paramorphisms, on arbitrary inductive data types in the analytical inductive functional programming system IGOR II which was already presented here in a previous issue

关键词： Expert User Functional programming program scheme Structural Recursion Universal Property

来源：评论

学校读者我要写书评

暂无评论

THE LOGIC-TERMAL EQUIVALENCE IS POLYNOMIAL-TIME DECIDABLE

引用

INFORMATION PROCESSING LETTERS 1980年第2期10卷 57-62页

作者： SABELFELD, VK Computing Center Siberian Branch of the Academy of Sciences Novosibirsk 630090 U.S.S.R.

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：