-
公开(公告)号：AT205012T
公开(公告)日：2001-09-15
申请号：AT96304352
申请日：1996-06-10
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , TAMURA TETSUYA , WINOGRAD SHMUEL
Abstract: Parallel ML processing of an analog signal in a RLL-coded channel in which (1) vectors for a current state of the channel and the next state of the channel are computed using Walsh transform vector coefficients of the analog signal; (2) current state vectors and next state vectors and values of vectors precomputed in analog matched filters are used to generate vector scalar products which are compared against preselected threshold values for generating binary decision outputs that are used in digital sequential finite state machines to generate ML symbol decisions; and (3) ML symbol decisions are fed back and used to subtract the intersymbol interference value of the current state vector from the vector of the next state to transform the next state vector into an updated current state vector.
-
公开(公告)号：CZ2001107A3
公开(公告)日：2001-05-16
申请号：CZ2001107
申请日：1999-07-01
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , HEISE NYLEST , HIRT WALTER , TRAGER BARRY MARSHALL
-
公开(公告)号：MY134625A
公开(公告)日：2007-12-31
申请号：MYPI20034023
申请日：2003-10-22
Applicant: IBM
Inventor： ASANO HIDEO , HASSNER MARTIN AURELIANO , HEISE NYLES NORBERT , HETZLER STEVEN R , TAMURA TETSUYA
IPC: G06F11/10 , G11B5/09 , G06F11/00 , G11B20/18 , H03M13/00 , H03M13/03 , H03M13/11 , H03M13/15 , H03M13/29 , H03M13/47
Abstract: AN ENCODING SYSTEM AND ASSOCIATED METHOD PROTECT AGAINST MISCORRECTION DUE TO PARITY SECTOR CORRECTION IN, FOR EXAMPLE, AN ON-DRIVE RAID SYSTEM. THE SYSTEM ADDS A PARITY CLUSTER BLOCK, WHICH ITSELF IS A COMPLETE, C3-PROTECTED CLUSTER. HAVING THE CLUSTER LEVEL, C4 LEVEL CORRECTION, BY PARITY SECTORS, CHECKED AND VERIFIED BY C3 CHECKS THAT HAVE HIGH RELIABILITY LEVEL, AS WELL AS THE CAPABILITY FOR CHECKING CONSISTENCY OF A CLUSTER BLOCK, EVEN IN THE PRESENCE OF "JAMI" ERRORS, MAKES THIS POSSIBILITY UNLIKELY. A SCRUB ALGORITHM AVOIDS READ-MODIFY-WRITE OPERATIONS BY DEFERRING THE COMPLETION OF THE C2 AND C3-CKECKS UNTIL THE STORAGE DEVICE IS ADLE.(FIG 5)
-
公开(公告)号：PL345465A1
公开(公告)日：2001-12-17
申请号：PL34546599
申请日：1999-07-01
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , HEISE NYLES , HIRT WALTER , TRAGER BARRY MARSHALL
Abstract: A method and means for reducing high-duty-cycle unconstrained binary signal sequences in storage and communications processes and systems by invertibly mapping such sequences into a (1, k) rate ⅔ RLL codestream constrained to a duty cycle substantially approximating one-third. That is, binary sequences ordinarily mapping into high-duty-cycle RLL-code sequences are either inhibited from repeating indefinitely or excluded.
-
Patent Agency Ranking
公开(公告)号：DE69614772D1
公开(公告)日：2001-10-04
申请号：DE69614772
申请日：1996-06-10
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , TAMURA TETSUYA , WINOGRAD SHMUEL
Abstract: Parallel ML processing of an analog signal in a RLL-coded channel in which (1) vectors for a current state of the channel and the next state of the channel are computed using Walsh transform vector coefficients of the analog signal; (2) current state vectors and next state vectors and values of vectors precomputed in analog matched filters are used to generate vector scalar products which are compared against preselected threshold values for generating binary decision outputs that are used in digital sequential finite state machines to generate ML symbol decisions; and (3) ML symbol decisions are fed back and used to subtract the intersymbol interference value of the current state vector from the vector of the next state to transform the next state vector into an updated current state vector.
-
公开(公告)号：ID27940A
公开(公告)日：2001-05-03
申请号：ID20002555
申请日：1999-07-01
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , HEISE NYLES , TRAGER BARRY MARSHALL , HIRT WALTER
Abstract: A method and means for reducing high-duty-cycle unconstrained binary signal sequences in storage and communications processes and systems by invertibly mapping such sequences into a (1, k) rate ⅔ RLL codestream constrained to a duty cycle substantially approximating one-third. That is, binary sequences ordinarily mapping into high-duty-cycle RLL-code sequences are either inhibited from repeating indefinitely or excluded.
-
公开(公告)号：ES2145100T3
公开(公告)日：2000-07-01
申请号：ES94304678
申请日：1994-06-27
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , KARNIN EHUD DOV , SCHWIEGELSHOHN UWE , TAMURA TETSUYA
Abstract: An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer 22 comprises an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.
-
公开(公告)号：AT192614T
公开(公告)日：2000-05-15
申请号：AT94304678
申请日：1994-06-27
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , KARNIN EHUD DOV , SCHWIEGELSHOHN UWE , TAMURA TETSUYA
Abstract: An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer 22 comprises an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.
-
公开(公告)号：DE68921855T2
公开(公告)日：1995-10-12
申请号：DE68921855
申请日：1989-11-10
Applicant: IBM
Inventor： ABDEL-GHAFFAR KHALED , HASSNER MARTIN AURELIANO
Abstract: A method and means is described for correcting multiple error bursts in data recorded on a storage medium in blocks, comprising a plurality of sub-blocks. After reading the data, decoded block check syndromes are algebraically summed with estimated block check syndromes to provide a set of syndromes for a code for locating sub-blocks having an error burst. This set of syndromes is decoded to identify each sub-block having an error burst. Concurrently block level syndromes are computed to identify the locations and values of errors within the sub-blocks having error bursts. During writing, the data in all sub-blocks of a block is encoded and block level syndromes are generated for these sub-blocks. These block level syndromes are multiplied by a series of preselected weighting factors ( alpha ... alpha ) according to the location index l of the sub-block within the block and as multiplied, each is stored in a different one of B buffers. These are cumulatively summed to produce block check syndromes, which are encoded after the last sub-block of the block is written to provide check bytes for their protection. These check bytes and the weighted cumulative sums are stored on the medium at the end of the block as block check syndromes. , and more specifically relates to such a method and means which includes error correction code (ECC) for which decoded and estimated block check syndromes are generated
-
-
-
-
-
-
-
-
Search Results
29
records
(took 0.028 seconds)
