Patents by Inventor Avi Steiner

Avi Steiner has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8539311
    Abstract: A system and method are provided for data recovery in a multi-level cell memory device. One or more bits may be programmed sequentially in one or more respective levels of multi-level cells in the memory device. An interruption of programming a subsequent bit in a subsequent second or greater level of the multi-level cells may be detected. Data may be recovered from the multi-level cells defining the one or more bits programmed preceding the programming interruption of the second or greater level.
    Type: Grant
    Filed: May 26, 2011
    Date of Patent: September 17, 2013
    Assignee: Densbits Technologies Ltd.
    Inventors: Avi Steiner, Michael Katz, Hanan Weingarten, Erez Sabbag, Ofir Avraham Kanter, Avigdor Segal
  • Publication number: 20130212315
    Abstract: A non-transitory computer readable medium, a flash controller and a method for state responsive encoding and programming; the method may include encoding an information entity by applying a state responsive encoding process to provide at least one codeword; wherein the state responsive encoding process is responsive to a state of flash memory cells; and programming the at least one codeword to at least one group of flash memory cells by applying a state responsive programming process that is responsive to the state, the state being either an estimated state or an actual state.
    Type: Application
    Filed: February 9, 2012
    Publication date: August 15, 2013
    Applicant: DensBits Technologies Ltd.
    Inventors: Avi Steiner, Hanan Weingarten, Igal Maly, Avigdor Segal
  • Patent number: 8510639
    Abstract: A system and method for decoding multi-dimensional encoded data. A set of multi-dimensional encoded data may be received encoding each input bit in a set of input bits by multiple different component codes in multiple different encoding dimensions. The multi-dimensional data may potentially have errors. A map may be used to locate each set of intersection bits that encode the same input bit by multiple unsolved component codes. The unsolved component codes may be decoded using one or a plurality of tested error correction hypotheses that yields a decoding success, where each hypothesis correcting a different set of intersection bits for a different input bit. The successful hypothesis may be applied for correcting the multi-dimensional encoded data.
    Type: Grant
    Filed: June 28, 2011
    Date of Patent: August 13, 2013
    Assignee: Densbits Technologies Ltd.
    Inventors: Avi Steiner, Erez Sabbag, Avigdor Segal, Ilan Bar, Eli Sterin
  • Patent number: 8468431
    Abstract: A system and method is provided for decoding a set of bits using a plurality of hypotheses, for example, each independently tested on-the-fly. Initial bit states and associated reliability metrics may be received for the set of bits. A current hypothesis may be decoded for correcting the set of bits, wherein the current hypothesis defines different bit states and associated reliability metrics for the set of bits. If decoding the current hypothesis is not successful, a subsequently ordered hypothesis may be decoded, wherein the hypotheses are ordered such that their associated reliability metric is a monotonically non-decreasing sequence. Decoding may proceed iteratively until the current hypothesis is successful.
    Type: Grant
    Filed: June 28, 2011
    Date of Patent: June 18, 2013
    Assignee: Densbits Technologies Ltd.
    Inventors: Avi Steiner, Erez Sabbag, Avigdor Segal, Ilan Bar, Eli Sterin
  • Patent number: 8458574
    Abstract: A method and an apparatus that has Chien search capabilities, the apparatus includes a first hardware circuit and a second hardware circuit. The first hardware circuit evaluates an error locator polynomial for a first element of a finite field over which the error locator polynomial is defined to provide a first set of intermediate results and a first Chien search result and provides the first set of intermediate results to the second hardware circuit; the second hardware circuit evaluates the error locator polynomial for a second element of the finite field to provide a second Chien search result in response to the first set of intermediate results. The first hardware circuit may be substantially bigger than the second hardware circuit and the first element may differ from the second element.
    Type: Grant
    Filed: July 27, 2009
    Date of Patent: June 4, 2013
    Assignee: Densbits Technologies Ltd.
    Inventors: Hanan Weingarten, Ofir Avraham Kanter, Avi Steiner, Erez Sabbag
  • Publication number: 20130070527
    Abstract: Embodiments of the invention are directed to managing a memory component. A method may include performing a first erase operation according to a first set of erase parameters, determining a result of the first erase operation, modifying the first set erase parameters based on the result to produce a second set of erase parameters and performing a second erase operation according to a second set of erase parameters. A condition parameter may be maintained based on the erased parameters and/or based on a result of an erase procedure.
    Type: Application
    Filed: September 21, 2011
    Publication date: March 21, 2013
    Inventors: Erez SABBAG, Avi STEINER
  • Patent number: 8341502
    Abstract: A system and method for soft decoding data. A plurality of candidate error corrections may be generated to correct one or more data bits having soft bit information. Each candidate error correction may define suggested changes to the data bits and is associated with a soft bit value. The soft bit values associated the plurality of candidate error corrections may be mapped to a uniform scale, for example, a uniform finite or integer grid. The plurality of candidate error corrections may be ordered to have combined associated mapped values in a monotonically non-decreasing order. One or more of the plurality of candidate error corrections may be soft decoded in the order of the associated mapped values by a decoding operation for each candidate error correction therein with the associated non-mapped soft bit values.
    Type: Grant
    Filed: February 28, 2011
    Date of Patent: December 25, 2012
    Assignee: Densbits Technologies Ltd.
    Inventors: Avi Steiner, Hanan Weingarten
  • Patent number: 8305812
    Abstract: A flash memory module and a method for programming a page of flash memory cells, the method includes: receiving a cycle count indication indicative of a number of program cycles of the page of memory cells; setting a value of a programming parameter of a programming operation based on the cycle count indication; and programming at least one flash memory cell of the page of flash memory cells by performing the programming operation.
    Type: Grant
    Filed: April 28, 2010
    Date of Patent: November 6, 2012
    Assignee: Densbits Technologies Ltd.
    Inventors: Shmuel Levy, Avi Steiner
  • Patent number: 8295258
    Abstract: A wireless access point coherently receives signals transmitted from client devices and from interfering devices, measures noise and interference capture samples from the received signals, and computes a characterization of noise plus interference. Receive gains and threshold levels are adjusted based on the computed noise plus interference characterization. A set of weights for an interference suppression spatial filter are calculated from the measured noise and interference capture samples and used to produce a filtered signal by spatially filtering the received signals such that interference is spatially nulled in the filtered signal. The method may also include setting PHY parameters at the wireless access point based on the computed noise plus interference characterization. In some embodiments, a protection transmission is transmitted from the wireless access point, requesting connected client devices to suspend transmissions during a specified time period.
    Type: Grant
    Filed: January 21, 2010
    Date of Patent: October 23, 2012
    Assignee: Wavion, Ltd
    Inventors: Mati Wax, Reuven Tweg, Avi Steiner, Hanan Leizerovich, Evgeny Levitan, Aviv Aviram
  • Publication number: 20120216085
    Abstract: A system, a non-transitory computer readable medium and a method for wear estimation of a flash memory device, the method may include: programming information to a first portion of the flash memory device during a test programming process; measuring a duration of the test programming process; and estimating a wear characteristic of the first portion of the flash memory device thereby providing an estimated wear characteristic, wherein the estimating is responsive to the duration of the test programming process.
    Type: Application
    Filed: January 3, 2012
    Publication date: August 23, 2012
    Applicant: DensBits Technologies Ltd.
    Inventors: Hanan Weingarten, Avi Steiner
  • Publication number: 20120144093
    Abstract: A system, a method and non-transitory computer readable medium storing instructions for interleaving at least two portions of a first codeword of the group between at least two flash memory planes while violating at least one ordering rule out of (a) an even odd ordering rule, (b) a programming type ordering rule, and (c) a codeword portions ordering rule and interleaving different portions of other codewords of the group between multiple flash memory planes while maintaining the even odd ordering rule, the programming type ordering rule and the codeword portions ordering rule.
    Type: Application
    Filed: November 17, 2011
    Publication date: June 7, 2012
    Applicant: DENSBITS TECHNOLOGIES LTD.
    Inventors: Avi Steiner, Hanan Weingarten, Guy Azrad, Avigdor Segal
  • Publication number: 20120001778
    Abstract: A system and method for decoding multi-dimensional encoded data. A set of multi-dimensional encoded data may be received encoding each input bit in a set of input bits by multiple different component codes in multiple different encoding dimensions. The multi-dimensional data may potentially have errors. A map may be used to locate each set of intersection bits that encode the same input bit by multiple unsolved component codes. The unsolved component codes may be decoded using one or a plurality of tested error correction hypotheses that yields a decoding success, where each hypothesis correcting a different set of intersection bits for a different input bit. The successful hypothesis may be applied for correcting the multi-dimensional encoded data.
    Type: Application
    Filed: June 28, 2011
    Publication date: January 5, 2012
    Inventors: Avi STEINER, Erez SABBAG, Avigdor SEGAL, Ilan BAR, Eli STERIN
  • Publication number: 20120005560
    Abstract: A system and method is provided for decoding a set of bits using a plurality of hypotheses, for example, each independently tested on-the-fly. Initial bit states and associated reliability metrics may be received for the set of bits. A current hypothesis may be decoded for correcting the set of bits, wherein the current hypothesis defines different bit states and associated reliability metrics for the set of bits. If decoding the current hypothesis is not successful, a subsequently ordered hypothesis may be decoded, wherein the hypotheses are ordered such that their associated reliability metric is a monotonically non-decreasing sequence. Decoding may proceed iteratively until the current hypothesis is successful.
    Type: Application
    Filed: June 28, 2011
    Publication date: January 5, 2012
    Inventors: Avi STEINER, Erez SABBAG, Avigdor Segal, Ilan Bar, Eli Sterin
  • Publication number: 20120005558
    Abstract: A system and method are provided for data recovery in a multi-level cell memory device. One or more bits may be programmed sequentially in one or more respective levels of multi-level cells in the memory device. An interruption of programming a subsequent bit in a subsequent second or greater level of the multi-level cells may be detected. Data may be recovered from the multi-level cells defining the one or more bits programmed preceding the programming interruption of the second or greater level.
    Type: Application
    Filed: May 26, 2011
    Publication date: January 5, 2012
    Inventors: Avi STEINER, Michael Katz, Hanan Weingarten, Erez Sabbag, Ofir Avraham Kanter, Avigdor Segal
  • Publication number: 20120005554
    Abstract: A system and method for using a cyclic redundancy check (CRC) to evaluate error corrections. A set of data and initial CRC values associated therewith may be received. The set of data by changing a sub-set of the data may be corrected. Intermediate CRC values may be computed for the entire uncorrected set of data in parallel with said correcting. Supplemental CRC values may be computed for only the sub-set of changed data after said correcting. The intermediate and supplemental CRC values may be combined to generate CRC values for the entire corrected set of data. The validity of the corrected set of data may be evaluated by comparing the combined CRC values with the initial CRC values.
    Type: Application
    Filed: June 28, 2011
    Publication date: January 5, 2012
    Inventors: Avi STEINER, Erez SABBAG, Avigdor SEGAL, Ilan BAR, Eli STERIN
  • Publication number: 20110214029
    Abstract: A system and method for soft decoding data. A plurality of candidate error corrections may be generated to correct one or more data bits having soft bit information. Each candidate error correction may define suggested changes to the data bits and is associated with a soft bit value. The soft bit values associated the plurality of candidate error corrections may be mapped to a uniform scale, for example, a uniform finite or integer grid. The plurality of candidate error corrections may be ordered to have combined associated mapped values in a monotonically non-decreasing order. One or more of the plurality of candidate error corrections may be soft decoded in the order of the associated mapped values by a decoding operation for each candidate error correction therein with the associated non-mapped soft bit values.
    Type: Application
    Filed: February 28, 2011
    Publication date: September 1, 2011
    Inventors: Avi STEINER, Hanan Weingarten
  • Publication number: 20110214039
    Abstract: A system and method for decoding data. Multi-dimensional encoded data may be received that potentially has errors. The multi-dimensional encoded data may encode each input bit in a set of input bits multiple times in multiple different dimensions to generate encoded bits. The encoded bits may be decoded in at least one of the multiple dimensions. If one or more errors are detected in a plurality of encoded bits in the at least one of the multiple dimensions, an intersection sub-set of the encoded data may be decoded that includes data encoding the same input bits encoded by the plurality of encoded bits in at least a second dimension of the multiple dimensions. The values of the input bits by decoding the intersection sub-set may be changed.
    Type: Application
    Filed: February 28, 2011
    Publication date: September 1, 2011
    Inventors: Avi Steiner, Hanan Weingarten
  • Publication number: 20110119562
    Abstract: A device, method, and computer readable medium for programming a codeword are presented. The method includes writing a first codeword portion to portions of nonvolatile memory rows, and writing a second codeword portion to portions of nonvolatile memory rows, wherein the first group of memory rows and the second group belong to non-overlapping groups. The device includes multiple nonvolatile memory rows, and a controller receiving a codeword comprising a first codeword portion and a second codeword portion. The controller writing the first codeword portion to portions of nonvolatile memory rows, and writing the second codeword portion to portions of nonvolatile memory rows, wherein the first group of nonvolatile memory rows differs and the second group of nonvolatile memory rows belong to non-overlapping groups, and the first and second groups of memory rows belong to multiple rows. A computer readable medium having stored thereon instructions performing methods described herein.
    Type: Application
    Filed: November 9, 2010
    Publication date: May 19, 2011
    Inventors: Avi Steiner, Hanan Weingarten
  • Publication number: 20110096612
    Abstract: A system, method and computer readable medium for programming and reading flash memory cells. Respective first and second read operations may be performed while supplying respective first and second bias voltage to multiple flash memory cells, to provide respective first and second read results, where the first bias voltage may be higher then the second bias voltage, and providing a read outcome that may be responsive to the first read results and to the second read results. A programming method may include performing first and second programming operations while supplying respective first and second bias voltages to multiple flash memory cells. The programming method may further include performing the first programming operation while programming information mapped to a highest least significant bit positive lobe, and performing the second programming operation while programming information mapped to at least one other least significant bit positive lobe.
    Type: Application
    Filed: August 27, 2010
    Publication date: April 28, 2011
    Inventors: Avi STEINER, Hanan Weingarten
  • Publication number: 20110055461
    Abstract: A system, computer readable program, and method for programming flash memory, the method includes: providing multiple pairs of most significant bit (MSB) page uncoded bit error rates (UBERs) and least significant bit (LSB) page UBERs; selecting a selected MSB page code rate and a selected LSB page code rate so that a selected MSB page UBER associated with the selected MSB page code rate and a selected LSB page UBER associated with the selected LSB page code rate support a highest average UBER out of the multiple pairs of MSB page UBERs and LSB page UBERs, wherein the selected MSB page code rate and the selected LSB page code rate are obtainable under a desired code rate constraint; and determining an encoding and programming scheme that may be based on the selected MSB page UBER, the selected MSB code rate, the selected LSB page UBER and the selected LSB code rate.
    Type: Application
    Filed: July 15, 2010
    Publication date: March 3, 2011
    Inventors: Avi STEINER, Hanan WEINGARTEN