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

Proceedings of the 2022 International Symposium on Memory Systems

作者： Amit Berman Samsung Electronics Corporation Israel

ISBN: (纸本)9781450398008

The need for high-density non-volatile memory is addressed by shrinking cells and increasing the number of bits per cell. These approaches, however, reduce the signal-to-noise ratio and degrade read and write *** paper presents a method to reduce the number of occupied levels in multi-level cells (MLC/TLC/QLC) to improve reliability and performance. The proposed concept compresses the data and then expands it back to its original size using coding into patterns with fewer levels. The modulation maintains random access for page reads where each bit of each cell can be sensed independently. For example, 8-level TLC is used, and the data is reduced by 14%, and the utilized cell levels are reduced to six, advancing reliability, program, and sequential read bandwidth by over 29%.

关键词： constrained coding Multi-Level Cell Non-Volatile Memory Performance Reliability

来源：评论

学校读者我要写书评

暂无评论

Properties and Constructions of constrained Codes for DNA-Based Data Storage

引用

IEEE ACCESS 2020年 8卷 49523-49531页

作者： Immink, Kees A. Schouhamer Cai, Kui Turing Machines Inc NL-3016 DK Rotterdam Netherlands SUTD Singapore 487372 Singapore

We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. Expressions for the redundancy of codes that account for both the maximum repetition length and AT/GC balance are derived.

关键词： Encoding Memory DNA Redundancy Sequential analysis Table lookup Licenses constrained coding maximum runlength balanced words storage systems DNA-based storage

来源：评论

学校读者我要写书评

暂无评论

A Deliberate Bit Flipping coding Scheme for Data-Dependent Two-Dimensional Channels

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2020年第2期68卷 752-764页

作者： Bahrami, Mohsen Vasic, Bane Univ Arizona Dept Elect & Comp Engn Tucson AZ 85721 USA

In this paper, we present a deliberate bit flipping (DBF) coding scheme for binary two-dimensional (2-D) channels, where specific patterns in channel inputs are the significant cause of errors. The idea is to eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword that is arranged into a 2-D array by deliberately flipping the bits that violate the constraint. The DBF method relies on the error correction capability of the code being used so that it should be able to correct both deliberate errors and channel errors. Therefore, it is crucial to flip minimum number of bits in order not to overburden the error correction decoder. We devise a constrained combinatorial formulation for minimizing the number of flipped bits for a given set of harmful patterns. The generalized belief propagation algorithm is used to find an approximate solution for the problem. We evaluate the performance gain of our proposed approach on a data-dependent 2-D channel, where 2-D isolated-bits patterns are the harmful patterns for the channel. Furthermore, the performance of the DBF method is compared with classical 2-D constrained coding schemes for the 2-D no isolated-bits constraint on a memoryless binary symmetric channel.

关键词： Error correction codes Channel coding Decoding Two dimensional displays Belief propagation Magnetic recording Data dependent channels constrained coding probabilistic inference graphical models generalized belief propagation (GBP)

来源：评论

学校读者我要写书评

暂无评论

Efficient and Explicit Balanced Primer Codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第9期66卷 5344-5357页

作者： Chee, Yeow Meng Kiah, Han Mao Wei, Hengjia Natl Univ Singapore Dept Ind Syst Engn & Management Singapore 117576 Singapore Nanyang Technol Univ Sch Phys & Math Sci Singapore 637371 Singapore Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel

To equip DNA-based data storage with random-access capabilities, Yazdi et al. (2018) prepended DNA strands with specially chosen address sequences called primers and provided certain design criteria for these primers. We provide explicit constructions of error-correcting codes that are suitable as primer addresses and equip these constructions with efficient encoding algorithms. Specifically, our constructions take cyclic or linear codes as inputs and produce sets of primers with similar error-correcting capabilities. Using certain classes of BCH codes, we obtain infinite families of primer sets of length n, minimum distance d with (d + 1) log(4) n + O(1) redundant symbols. Our techniques involve reversible cyclic codes (1964), an encoding method of Tavares et al. (1971) and Knuth's balancing technique (1986). In our investigation, we also construct efficient and explicit binary balanced error-correcting codes and codes for DNA computing.

关键词： constrained coding DNA-based data storage systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Balanced and Maximum Homopolymer-Run Restricted Block Codes for DNA-Based Data Storage

引用

IEEE COMMUNICATIONS LETTERS 2019年第10期23卷 1676-1679页

作者： Immink, Kees A. Schouhamer Cai, Kui Turing Machines Inc NL-3016 DK Rotterdam Netherlands SUTD Singapore 487372 Singapore

We analyze codes for DNA-based data storage, which accounts for the maximum homopolymer repetition length and GC-AT balance. We present a new precoding method for translating words with a maximum run of k zeros into words with a maximum homopolymer runm = k+ 1, which is attractive for securing GC-AT balance. Generating functions are presented for enumerating the number of n-symbol k-constrained codewords of given GC-AT balance. Various efficient constructions are presented for block codes that satisfy a combined balance and maximum homopolymer run.

关键词： Precoding Block codes Art Memory DNA Sequential analysis constrained coding maximum runlength balanced words storage systems DNA-based storage

来源：评论

学校读者我要写书评

暂无评论

A New DC-Free Runlength Limited coding Method for Data Transmission and Recording

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2019年第4期65卷 502-505页

作者： Immink, Kees A. Schouhamer Turing Machines Inc NL-3016 DK Rotterdam Netherlands

This paper describes a new coding method based on binary (d, k) runlength constraints used for recording or transmitting an audio or video signal, computer data, etc. Data words of m bits are translated into codewords of n bits using a conversion table. The codewords satisfy a (d, k) runlength constraint in which at least d and not more than k '0's occur between consecutive '1's. The n-bit codewords alternate with p-bit merging words which in the prior art are selected such that the d and k are satisfied at the borders of consecutive codewords. We present a new coding method, where the codewords obey the (d, k)-constraint, but the merging words are not required to obey the (d)-constraint. The merging word that satisfies said conditions, yielding the lowest low-frequency spectral content of the encoded signal obtained after modulo-2 integration, is selected. The spectral performance of the new coding method has been appraised by computer simulations for the EFM (Eight-to-Fourteen Modulation) parameters, d = 2, k = 10, and p = 3. The low-frequency content of the signal generated by the newly presented coding method is around 4 dB lower in the relevant low-frequency range than that generated by the conventional EFM method.

关键词： constrained coding runlength limited code eight-to-fourteen modulation EFM

来源：评论

学校读者我要写书评

暂无评论

Mutually Uncorrelated Primers for DNA-Based Data Storage

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第9期64卷 6283-6296页

作者： Yazdi, S. M. Hossein Tabatabaei Kiah, Han Mao Gabrys, Ryan Milenkovic, Olgica Univ Illinois Elect & Comp Engn Dept Champaign IL 61801 USA Nanyang Technol Univ Sch Phys & Math Sci Singapore 639798 Singapore

We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNA-based data storage systems and synchronization between communication devices. WMU sequences are characterized by the property that no sufficiently long suffix of one sequence is the prefix of the same or another sequence. WMU sequences used for primer design in DNA-based data storage systems are also required to be at large mutual Hamming distance from each other, have balanced compositions of symbols, and avoid primer-dimer byproducts. We derive bounds on the size of WMU and various constrained WMU codes and present a number of constructions for balanced, error-correcting, primer-dimer free WMU codes using Dyck paths, prefix-synchronized, and cyclic codes.

关键词： Biological information theory constrained coding channel coding data storage systems DNA-based data storage systems bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Dynamic Threshold Detection Based on Pearson Distance Detection

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2018年第7期66卷 2958-2965页

作者： Immink, Kees A. Schouhamer Cal, Kui Weber, Jos H. Turing Machines Inc NL-3016 DK Rotterdam Netherlands Singapore Univ Technol & Design Singapore 487372 Singapore Delft Univ Technol Fac Elect Engn Math & Comp Sci Delft Netherlands

We consider the transmission and storage of encoded strings of symbols over a noisy channel, where dynamic threshold detection is proposed for achieving resilience against unknown scaling and offset of the received signal. We derive simple rules for dynamically estimating the unknown scale (gain) and offset. The estimates of the actual gain and offset so obtained are used to adjust the threshold levels or to re-scale the received signal within its regular range. Then, the re-scaled signal, brought into its standard range, can be forwarded to the final detection/decoding system, where optimum use can be made of the distance properties of the code by applying, for example, the Chase algorithm. A worked example of a spin-torque transfer magnetic random access memory with an application to an extended (72, 64) Hamming code is described, where the retrieved signal is perturbed by additive Gaussian noise and unknown gain or offset.

关键词： constrained coding storage systems non-volatile memories Pearson distance Euclidean distance channel mismatch Pearson code

来源：评论

学校读者我要写书评

暂无评论

Codes With Run-Length and GC-Content Constraints for DNA-Based Data Storage

引用

IEEE COMMUNICATIONS LETTERS 2018年第10期22卷 2004-2007页

作者： Song, Wentu Cai, Kui Zhang, Mu Yuen, Chau Singapore Univ Technol & Design Singapore 487372 Singapore

We propose a coding method to transform binary sequences into DNA base sequences (codewords), namely sequences of the symbols A, T, C, and G, that satisfy the following two properties: 1) run-length constraint: the maximum run-length of each symbol in each codeword is at most three and 2) GC-content constraint: the GC-content of each codeword is close to 0.5, say between 0.4 and 0.6. The proposed coding scheme is motivated by the problem of designing codes for DNA-based data storage systems, where the binary digital data is stored in synthetic DNA base sequences. Existing literature either achieve code rates not greater than 1.78 bits per nucleotide or lead to severe error propagation. Our method achieves a rate of 1.9 bits per DNA base with low encoding/decoding complexity and limited error propagation.

关键词： DNA data storage constrained coding channel coding

来源：评论

学校读者我要写书评

暂无评论

On Encoding Semiconstrained Systems

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第4期64卷 2474-2484页

作者： Elishco, Ohad Meyerovitch, Tom Schwartz, Moshe Ben Gurion Univ Negev Dept Elect & Comp Engn IL-8410501 Beer Sheva Israel Ben Gurion Univ Negev Dept Math IL-8410501 Beer Sheva Israel

Semiconstrained systems (SCSs) were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply the techniques from constrained systems, we study the sequences of constrained systems that are contained in, or contain, a given SCS, while approaching its capacity. In the former case, we describe two such sequences resulting in constant-to-constant bit-rate block encoders and finite-state encoders. Perhaps surprisingly, we show in the latter case, under commonly made assumptions, that the only constrained system that contains a given SCS is the entire space. A refinement to this result is also provided, in which semiconstraints and zero constraints are mixed together.

关键词： constrained coding channel capacity encoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：