Abstract:
The invention concerns a circuit arrangement which is intended for five bit/six bit (= 5b/6b) coding and decoding, an associated coding device and corresponding methods by means of which a high coded data transfer rate can be attained. The circuit arrangement (Z) determines from the five bits of the input data word (A, B, C, D, E) information about the number of the "1" values (l1-, I2,I3, I4+) occurring therein.
Abstract:
Um eine zum Kodieren und/oder Dekodieren eines Datenstroms, insbesondere aus bis zu 24Bit breiten R[ot]G[rün]B[lau]-Videosignalen, vorgesehene Schaltungsanordnung (100) sowie ein entsprechendes Verfahren so weiterzuentwickeln, dass eine effiziente, insbesondere möglichst overheadarme, DC-balancierte Kodierung und/oder Dekodierung möglich ist, werden/wird - mindestens ein Kodierer (10) -- mit fünf parallel zueinander angeordneten 5b/6b-Kodierblöcken (20) und -- mit einem parallel zu den 5b/6b-Kodierblöcken (20) angeordneten 2b/2b-Kodierblock (30) und/oder - mindestens ein Dekodierer (60) -- mit fünf parallel zueinander angeordneten 6b/5b-Dekodierblöcken (70) und -- mit einem parallel zu den 6b/5b-Dekodierblöcken (70) angeordneten 2b/2b-Dekodierblock (80) vorgeschlagen.
Abstract:
For turbo equalization decoding of received binary words that were zArray coded, the invention proposes a method comprising super trellis code block detecting (401) and LDPC code block decoding (403). For decreasing the bit error rate in the presence of colored noise while minimizing the number of iterations, block interleaving is used, and within the step of LDPC code block decoding (403) a success flag (d) for every codeword is set (409) if the estimated codeword remains unchanged in an iteration, and LDPC code word decoding (408) is skipped (413, 412, 415) if the success flag (d) of the codeword is set (413).
Abstract:
An unencoded m -bit data input sequence is divided into a block of n bits and a block of m-n bits. The block of n bits is divided into a first set of n +1 encoded bits, wherein at least one of P 1subblocks of the first set satisfies a G , M and I constraints. The first set of n +1 encoded bits is mapped into a second set of n +1 encoded bits wherein at least one of P 2 subblocks of the second set gives rise to at least Q 1 transitions after 1/(1+ D 2 ) precoding. A second set of n +1 encoded bits is divided into P 3 encoded subblocks and the P 3 encoded subblocks are interleaved among ( m-n )/s unencoded symbols so as to form a ( m+ 1)-bit output sequence codeword which is then stored on a data storage medium.
Abstract:
A method for error detection and correction comprising performing a first modulation error scan (310) of said modulation symbol, marking (305) data that fails to comply with a predetermined criteria, demodulating (303) said modulation symbols, computing a first error syndrome (309) using said demodulated symbols, and correcting (315) errors using said error syndrome computation.
Abstract:
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.