Based on the two path metrics being equal at a merged node in the trellis employed to describe a Viterbi detector for the detection of data encoded with a rate 6:8 balanced binary code in page-oriented optical memorie...
详细信息
Based on the two path metrics being equal at a merged node in the trellis employed to describe a Viterbi detector for the detection of data encoded with a rate 6:8 balanced binary code in page-oriented optical memories, the combined Viterbi detector scheme is proposed to improve raw biterror rate performance by mitigating the occurrence of a twobit reversing error event in an estimated codeword for the balanced code. The effectiveness of the detection scheme is verified for different data quantizations using Monte Carlo simulations.
Key words holographic data storage - balanced code - modulation code - Viterbi algorithm - path metric
CLC number TN 911. 21
Foundation item: Supported by National 973 Research Program of China (G1999033006)
Biography: Chen Duan-rong (1960-), male, Lecturer, Ph. D candidate, research direction: coding and signal processing for the recording channel of holographic data storage.
We propose an error correctible, balanced code for holographic data storage. As the transitions of a message word are considered and parity bits that check for errors in the section are appended on encoding, we can de...
详细信息
We propose an error correctible, balanced code for holographic data storage. As the transitions of a message word are considered and parity bits that check for errors in the section are appended on encoding, we can decode message words with the Viterbi algorithm and correct errors. The effectiveness of the proposed method is validated by numerical simulations and experiments. An improvement in bit error rate (BER) is achieved.
Two words u and v have a t-overlap if the length t prefix of u is equal to the length t suffix of v, or vice versa. A code C is t-overlap-free if no two words u and v in C (including u = v) have a t-overlap. A code of...
详细信息
Two words u and v have a t-overlap if the length t prefix of u is equal to the length t suffix of v, or vice versa. A code C is t-overlap-free if no two words u and v in C (including u = v) have a t-overlap. A code of length n is said to be (t(1), t(2))-overlap-free if it is t-overlap-free for all t such that 1 <= t(1) <= t <= t(2) <= n - 1. A (1, n - 1)-overlap-free code of length n is called non-overlapping, which has applications in DNA-based data storage systems and frame synchronization. In this paper, we initialize the study for codes of length n which are simultaneously (1, k)-overlap-free and (n - k, n - 1)-overlap-free, and establish lower and upper bounds for the size of balanced and error-correcting (1, k)-overlap-free codes. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
We investigate a Knuth-like scheme for balancing q-ary code words, which has the virtue that lookup tables for coding and decoding the prefix are avoided by using precoding and error correction techniques. We show how...
详细信息
We investigate a Knuth-like scheme for balancing q-ary code words, which has the virtue that lookup tables for coding and decoding the prefix are avoided by using precoding and error correction techniques. We show how the scheme can be extended to allow for error correction of single channel errors using a fast decoding algorithm that depends on syndromes only, making it considerably faster compared with the prior art exhaustive decoding strategy. A comparison between the new and prior art schemes, both in terms of redundancy and error performance, completes the study.
We present and analyze a new construction of bipolar balanced codes where each codeword contains equally many -1's and +1's. The new code is minimally modified as the number of symbol changes made to the sourc...
详细信息
We present and analyze a new construction of bipolar balanced codes where each codeword contains equally many -1's and +1's. The new code is minimally modified as the number of symbol changes made to the source word for translating it into a balanced codeword is as small as possible. The balanced codes feature low redundancy and time complexity. Large look-up tables are avoided.
In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "-1"s, called balanced codes. Knuth's algorithm is well suited for...
详细信息
In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "-1"s, called balanced codes. Knuth's algorithm is well suited for use with large codewords. The redundancy of Knuth's balanced codes is a factor of two larger than that of a code comprising the full set of balanced codewords. In this paper, we will present results of our attempts to improve the performance of Knuth's balanced codes.
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated by Knuth's algorithm falls a fac...
详细信息
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated by Knuth's algorithm falls a factor of two short with respect to the minimum required. We present a new construction, which is simple, does not use look-up tables, and is less redundant than Knuth's construction. In the new construction, the user word is modified in the same way as in Knuth's construction, that is by inverting a segment of user symbols. The prefix that indicates which segment has been inverted, however, is encoded in a different, more efficient, way.
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated by Knuth's algorithm falls a fac...
详细信息
ISBN:
(纸本)9781424443123
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated by Knuth's algorithm falls a factor of two short with respect to capacity. We present a new construction, which is simple, does not use look-up tables, and is less redundant than Knuth's construction. In the new construction, the user word is modified in the same way as in Knuth's construction, that is by inverting a segment of user symbols. The prefix that indicates which segment has been inverted, however, is encoded and decoded in a different, more efficient, way.
Tallini and Bose defined a random walk function on which an efficient encoding/decoding algorithm for second-order spectral-null (2-OSN) codes was based. Later, Yang enhanced Tallini-Bose code by using quasi 2-OSN cod...
详细信息
Tallini and Bose defined a random walk function on which an efficient encoding/decoding algorithm for second-order spectral-null (2-OSN) codes was based. Later, Yang enhanced Tallini-Bose code by using quasi 2-OSN codes. Both 2-OSN codes encode the information word into a balanced word and then append extra bits to make the length of this balanced word equal to 0 (or 2) modulo 4. The main innovation is to eliminate the need for appended bits, thereby increasing the code rate.
Some efficient second-order spectral-null codes encoded an index of the random walk function recursively and ended with the short base second-order spectral-null codes. All of these codes used the Tallini-Bose random ...
详细信息
Some efficient second-order spectral-null codes encoded an index of the random walk function recursively and ended with the short base second-order spectral-null codes. All of these codes used the Tallini-Bose random walk function that exchanges two consecutive bits. In this paper, we propose a new random walk function based on cyclic bit-shift, on which the redundancy can be improved. Moreover, the bit-shift can be implemented efficiently by either software or hardware.
暂无评论