摘要:
The present invention relates to SISO decoder for iteratively decoding a block of received information symbols (r), in particular for use in a turbo decoder, said block being divided into a number of windows of information symbols. In order to achieve a significant reduction of power consumption a SISO decoder is proposed comprising at least one SISO decoding unit (17, 21) for SISO decoding of the received information symbols (r) of a window, wherein a stopping criterion is applied to each window. This allows to abort iterative decoding for each window individually once convergence of decoding is determined by marking a window or sub-block inactive (17,23). An inactive window is no longer SISO decoded in subsequent iterations.
摘要:
When processing a two dimensional data area it is known to be advantageous to divide the two dimensional are into stripes and process each stripe using a stripe-wise detector. The stripe being processed shifts row per row downwards. Each stripe has as its output the bit-decisions of the top bit-row of the stripe which is the most reliable. That output bit-row is also used as side-information for the bit detection of the next stripe which is the stripe which is shifted one bit-row downwards. The bit-row just across the bottom of the stripe on the other hand still needs to be determined in the current iteration, so only the initialisation bit-values can be used in the first iteration of the stripe-wise bit-detector. In order to prevent the propagation of errors towards the top bit row of the stripe the relative weight for the bottom branch bit in the figure-of-merit is reduced from the full 100% to a lower fraction.
摘要:
The invention relates to a method of decoding possibly multilated code words (r) of a code (C), wherein an information word (m) and an address word (a) are encoded into a code word (c) of said code (C) using a generator matrix (G) and wherein said address words (a) are selected such that address words (a) having a known relationship are assigned to consecutive code words (c). To provide a reliable way of decoding making use of the known relationship, a method comprising the following steps is proposed: decoding the differences (D) of a number (L-1) of pairs of possibly mutilated code words (rib, ri+1) to obtain estimates (u, v) for the differences of the corresponding pairs of code words (ci, ci+1), combining said estimates (u, v) to obtain a number (L) of at least two corrupted versions (wj) of a particular code word (c), forming a code vector (z) from said number (L) of corrupted versions (wj) of said particular code word (c) in each coordinate, decoding said code vector (z) to a decoded code word (c') in said code (C), and- using said generator matrix (G) to obtain the information word (m) and the address word (a) embedded in said decoded code word (c').
摘要:
A method for driving a light source (11, 12, 13) is described, wherein the light source is alternately switched ON and OFF in an ON/OFF pattern, wherein the duty cycle of the ON/OFF pattern is varied to vary the average light intensity of the light source, and wherein the shape of the ON/OFF pattern is varied to transmit data. Thus, a control signal for the light source comprises data information as well as duty cycle information. The duty cycle is varied within a range from almost zero to almost 100%, and data is varied and transmitted without affecting the duty cycle.
摘要:
The invention provides an efficient reading device in which, even if one radiation beam should fail, no information is lost and the information can still be read out without time-consuming recurring operations. The present invention solves this problem by providing a reading device (Fig. 5A) and a means (Fig. 4) for forming read-out spots (A, B, C, D, E) that are built up by multiple radiation beams from the radiation source (4). This has the advantage that each read-out spot will have energy contributions from different radiation beams and, should one radiation beam break down, the intensity of some of the read-out spots may indeed diminish, but the information can still be read out thanks to the contributions from other radiation beams.
摘要:
This ID proposes synchronization patterns for RLL codes with a (repeated) minimum transition run (RMTR) constraint, where the synchronization pattern comprises a synchronization pattern-body that contains a characteristic bit-pattern that represents a violation of the RMTR constraint. Using a violation of the RMTR constraint allows for short synchronization patterns.
摘要:
The present invention relates to SISO decoder for iteratively decoding a block of received information symbols (r), in particular for use in a turbo decoder, said block being divided into a number of windows of information symbols. In order to achieve a significant reduction of power consumption a SISO decoder is proposed comprising at least one SISO decoding unit (17, 21) for SISO decoding of the received information symbols (r) of a window, wherein a stopping criterion is applied to each window. This allows to abort iterative decoding for each window individually once convergence of decoding is determined by marking a window or sub-block inactive (17,23). An inactive window is no longer SISO decoded in subsequent iterations.
摘要:
When processing a two dimensional data area it is known to be advantageous to divide the two dimensional are into stripes and process each stripe using a stripe-wise detector. When using several iterations it is advantageous to use higher complexity detectors in later iterations and lower complexity detectors in the initial iterations.
摘要:
When processing a two dimensional data area it is known to be advantageous to divide the two dimensional are into stripes and process each stripe using a stripe-wise detector. When processing a data area delimited by more than one guard band it is advantageous to start a subset of bit detectors from each guard band in order to propagate the improved reliability of the side information obtained from the guard band through the subset of detectors. Because the subsets can start processing at the same time the overall detection delay is reduced.
摘要:
The present invention relates to a method of determining write parameters for recording information on an optical record carrier, said information being in the form of a channel data stream to be recorded as a channel band of at least one symbol row onedimensionally evolving along a first direction, wherein the write parameters are determined by an iterative procedure. In particular for determining pit-hole sizes as the write parameters of pit-bits to be mastered on a ROM disc the proposed method comprises the steps of: setting the write parameters for recording pit-symbols of said channel data stream to preliminary parameter values, updating the preliminary parameter values by searching for the updated parameter values that best fulfil a predetermined criterion for the write parameters for recording of pit-symbols, said criterion being determined by the difference of HF-signal values, which will be determined by use of a channel model or obtained during read-out of pit-symbols recorded by use of the updated parameter values, and reference HF-signal values, - iterating said updating until a predetermined condition is fulfilled. Thus, a pre-compensation of non-linearities of the read-channel at the side of the write-channel can be obtained without the need to use a large write-strategy matrix or table containing a large number of write parameters.