Abstract:
The invention relates to a time-continous FIR (Finite Impulse Response) filter whereby a Hilbert transform can be implemented. The filter comprises a cascade of delay cells connected between an input terminal of the filter and an output terminal; constant filter coefficients (cO,...,cn) and a programmable time delay (Td) of the programmable filter cells are provided. The invention also relates to a filtering method effective to enable use of this Hilbert FIR filter structure for processing signals originated by the reading of data from magnetic storage media which employ perpendicular recording.
Abstract:
The present invention relates to a method and apparatus for detecting and correcting errors in a magnetic recording channel of a mass storage system, that combines a Soft Output Viterbi Algorithm SOVA (39), having the capability of detecting the reliability of a discrete, equalized signal (38), and a post processor (37), having the capability of detecting specific error events in said discrete, equalized signal (38), so as to correct said error events and to generate an output bit stream (48).
Abstract:
In the MSN encoded form, the symbols of each block define a running digital sum (RSD) value, defined as RDS ([a 0 a 1 ...a N-1 ]) = - Σ 1 (-1) i a where the symbols a i belong to the set {0,1} and the sum extends for values of i from 0 to N-1. The encoder (16) is configured to satisfy at least one of the following characteristics:
a) blocks of symbols with a given length (L) are used for encoding, wherein
RDS = RDS 0 + 4.K, where K is an integer, RDS is the said running digital sum, RDS 0 is defined as zero for even values of the said length (L), and one for odd values of said length (L), and
b) blocks of symbols with a given length (L) are used for MSN coding and encoding is effected by selecting encoded blocks such that the set of running digital sum (RDS) values is the set with the minimum number of elements that satisfy the required rate value, defined as the ratio between the length of the input blocks and the length of the output blocks.
Abstract:
A system (10) for decoding digital signals subjected to block coding (B) comprising a post-processor (13) which corrects (13) the codewords affected by error, identifying them with the most likely sequence which is a channel sequence and which satisfies a syndrome check. The post-processor (13) is a finite-state machine described by a graph (G) which represents the set of error events (E), the set of respective transitions defining the structure of said set of error events. Preferably, the post-processor (13) evolves in steps through subsequent transition matrixes (G), deleting at each step the following graph paths
paths which accumulate an invalid number of error events (N E ) or an excessive number of wrong bits (N), paths which accumulate a total reliability higher than a given threshold (β), paths with a invalid check on the received sequence (P), and paths which reveal an invalid syndrome (S) after having reached a maximum number of events.