Abstract: Novel constrained parity-check code and post-processor are proposed for advanced blue laser disk systems. Simulation results with the blu-ray disc show that an increase of 5GB in capacity can be achieved over the standard system. 1.
Novel Constrained Parity-Check Code and Post-Processor
for Advanced Blue Laser Disk 231Kui Cai1,4, Kees A. Schouhamer Immink , Jan W. M. Bergmans, and L.P. Shi
1
1. Introduction
Coding and signal processing have become increasingly important and powerful parts of optical recording systems. The reception techniques for blue laser disk systems (i.e. the blu-ray disc (BD) and high-definition digital versatile disc (HD-DVD)) are significantly different from that used in compact disc (CD) and DVD. For example, the threshold detector is replaced by more powerful Viterbi-like bit detectors, and the minimum runlength constraint is reduced from d=2 to d=1. Improvements have also been made in pre-processing, which increase the recording capacity of BD from the standard 23.3-25-27 GB to 35GB on a single layer [1].
In this paper, we propose an advanced detector with a novel capacity approaching constrained parity-check (PC) code and a multiple-error-event correction post-processor, for blue laser disk systems with even higher capacity. Fig. 1 shows the block diagram of a d=1 channel with PC code and post-processor. The d=1 constrained PC encoder adds a d=1 constraint and parity-check constraint on fixed-length segments of user data. Violation of the parity-check constraint in the detected bit sequence enables error detection. The task of locating the exact positions of the errors is done by a post-processor. In this way, dominant short error events at the output of the channel detector can be corrected by the PC code with very low redundancy, and the correction capacity loss of the outer error correction code (ECC) is reduced. Therefore, this approach provides an efficient solution to improve the overall performance, with affordable implementation complexity. 2. Novel capacity approaching constrained parity-check (PC) codes
Fig. 2 is a block diagram for encoding a constrained PC code in non-return-to-zero-inverse (NRZI) format. A M-bit segment of user data is first partitioned into K+1 data words. The K leading data words are encoded by the coding method proposed in [2], since the rates of the constructed codes are only a few tenths below the capacity. The obtained codewords are referred to as “normal constrained (NC) codewords”. The (K+1)’th data word is encoded by a novel parity-related constrained encoder, and the resulting codeword is referred to as the “parity-related constrained (PRC) codeword”. It is designed to realize a certain parity-check constraint over the combined codeword, which is a concatenation of the sequence of NC codewords and the PRC codeword. The parity-check constraint corresponds to a predetermined generator matrix (or generator polynomial), which is defined to detect any dominant error events or error event combinations in optical recording systems. For ease in imposing the modulation constraints, the generator matrix needs to be chosen or designed to generate a systematic PC code. This code design principle is based on the following proposition.
Proposition 1: Consider a [j,i] systematic linear binary parity-check code C. Let u1 and u2, respectively, denote row vectors with i1 bits and i2 = i - i1 bits consisting of a sequence of NC codewords and a PRC codeword. If the
parity bits of [u1 | 0,",0] and [0,",0 | u2] are equal, then the combined codeword [u1 | u2], appended with j - i 1×i21×i1 Abstract: Novel constrained parity-check code and post-processor are proposed for advanced blue laser disk systems. Simulation results with the blu-ray disc show that an increase of 5GB in capacity can be achieved over the standard system. Data Storage Institute, DSI Building, 5 Engineering Drive 1, Singapore 117608 2Turing Machines Inc., The Netherlands 3Technical University, Eindhoven, The Netherlands 4Nathional University of Singapore, Singapore 117608 1E-mail: Cai_Kui@dsi.a-star.edu.sg
bits of zeros, generates a codeword of C.
Proof: Let G=[I P] be a generator matrix that describes the encoder of C, where I is an i × i identity matrix, and P is an i × (j - i) matrix. The parity bits of [u1 | 0,",0] and [0,",0 | u2] are computed as p1 = [u1 | 0,",0] P and 1×i21×i11×i2p2 = [0,",0]. Thus, [u1 | u2 | 0,",0] is a codeword ",0 | u2] P, respectively. If p1 = p2, we obtain [u1 | u2] P = [0, 1×i11×(j i)1×(j i)
of C. □
A novel correlation ap... 16人阅读 4页 2.00A novel deadline an...
Novel Constrained Parity... 暂无评价 3页 免费 ...POST Code Definition AWARD POST Code Definition: ...(multi-processor platform) A-3 57 59 5B 5D ...
Novel modified min-sum decoding algorithm for low-density parity-check codes_专业资料。Avlbl lea vsicdic.oaieoni tanw cenertcm e iSinerc cecDite ...
Novel Adaptive Simulated Annealing Algorithm for Constrained Multi-Objective Optimization_专业资料。/专h rii j ioncnf CamuasnntCoNovel AdapiSiuledAnnealgtve mat ...
Novel modified min-sum decoding algorithm for low-density parity-check codes_专业资料。Avlbl lea vsicdic.oaieoni tanw cenertcm e iSinerc cecDite ...
热门文档