Optimal synchronization mark/address mark construction. These marks can generally be referred to as sync marks. A novel means is presented by which sync marks can be generated for use within a variety of communication systems including HDD systems. The sync marks generated hereby have a largest possible minimum distance measurement that ensures highly accurate detection of the transition between the data portion and the preamble portion of information that is processed. Various types of distance measurement criteria can be employed, including a Euclidean distance measurement or a Hamming distance measurement, when selecting the sync mark from among a plurality of possible sync marks.
Symbol By Symbol Map Detection For Signals Corrupted By Colored And/Or Signal Dependent Noise
Symbol by symbol MAP detection for signals corrupted by colored and/or signal dependent noise. A novel means is presented for recursive calculation of forward metrics (α), backward metrics (β), and corresponding soft information (e. g. , which can be provided as LLRs (log likelihood ratios)) within communication systems in which a trellis can be employed to perform demodulation of a received signal sequence. For signals that have been corrupted by colored and/or signal dependent noise, this means provides for the ability to perform novel soft information calculation for subsequent use in iterative decoding processing. Many types of communication channels can benefit from this novel means of detection including communication channels within hard disk drives (HDDs).
Minimal Hardware Implementation Of Non-Parity And Parity Trellis
Minimal hardware implementation of non-parity and parity trellis. More than one type of trellis can be represented using a minimal amount of hardware. In magnetic recording systems and other communication systems types, there is oftentimes a need to switch between trellises which support parity and ones which do not. Rules are presented herein which will ensure joint representation of more than one trellis while requiring minimal additional hardware when compared to representing only one trellis. To represent the non-parity trellis, emanating states, resultant states, and one or more expansion states (if needed) are all that is required. Any expansion states may also need to have its path metric and path memory corresponded to one of the resultant states to ensure proper detection according to the non-parity trellis.
Techniques for decoding levels in non-volatile memory. A level of a cell in a multi-bit non-volatile memory is read. A minimum of Log-Likelihood Ratio (LLR) and a modified LLR to decode the level, wherein the modified LLR is a function of a misplacement probability is used. A value corresponding the decoded level is written to a volatile memory.
For storage drives with LDPC encoded data, read techniques are provided whereby an errantly read memory unit (e. g. , faulty LDPC codeword) may be recovered.
Minimal Hardware Implementation Of Non-Parity And Parity Trellis
Broadcom Corporation, a California Corporation - Irvine CA
International Classification:
H03M 13/03
US Classification:
714792
Abstract:
Minimal hardware implementation of non-parity and parity trellis. A novel means is presented by which more than one type of trellis can be represented using a minimal amount of hardware. In magnetic recording systems and other communication systems types, there is oftentimes a need to switch between trellises which support parity and ones which do not. A very efficient means is provided with rules which will ensure joint representation of more than one trellis while requiring minimal additional hardware when compared to representing only one trellis. To represent the non-parity trellis, emanating states, resultant states, and one or more expansion states (if needed) are all that is required. Any expansion states may also need to have its path metric and path memory corresponded to one of the resultant states to ensure proper detection according to the non-parity trellis.
Apparatus, System, And Method For Generating And Decoding A Longer Linear Block Codeword Using A Shorter Block Length
An apparatus, system, and method for generating and decoding a longer linear block codeword using a shorter block length. The method comprises receiving data from a storage area and generating a codeword from the received data with an encoder, the codeword having a data portion and a parity portion, wherein the codeword has a first block length, and wherein the encoder applies a linear block code, the linear block code having a second block length that is shorter than the first block length.
Maximum-Likelihood Decoder In A Memory Controller For Synchronization
Described herein are apparatus, system, and method for data synchronization via a maximum-likelihood decoder in a memory controller. The method comprises receiving a constrained codeword from a non-volatile memory (NVM) via a channel, the constrained codeword including an appended bit-stream; and decoding the received constrained codeword by reconstructing the appended bit-stream and invoking a synchronization procedure that applies a maximum-likelihood (ML) estimator to estimate locations of any insertion, deletion, or error in the reconstructed appended bit-stream.
Intel Corporation
Ecc Team Lead For Nvm Storage Division
Broadcom Mar 2005 - May 2010
Principal Scientist
Dsi and Nus Feb 2003 - Mar 2005
Research Engineer and Adjunct Assistant Professor
Indian Institute of Technology, Kanpur 2001 - 2003
Assistant Professor
Philips Aug 1998 - Dec 2000
Research Scientist
Education:
Indian Institute of Science (Iisc) 1995 - 1998
Doctorates, Doctor of Philosophy, Electrical Engineering
Indian Institute of Technology, Kanpur 1992 - 1994
Pune University 1987 - 1991
Bachelor of Engineering, Bachelors, Electronics Engineering, Electronics
Skills:
Algorithms Signal Processing Digital Signal Processors Matlab Asic C Soc Semiconductors C++ Image Processing Vlsi Wireless Simulations Embedded Systems Verilog