Patents by Inventor Alexander Smekhov

Alexander Smekhov 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: 11201629
    Abstract: There is provided a method of recursive sequential list decoding of a codeword of a polar code comprising: obtaining an ordered sequence of constituent codes usable for the sequential decoding of the polar code, representable by a layered graph; generating a first candidate codeword (CCW) of a first constituent code, the first CCW being computed from an input model informative of a CCW of a second constituent code, the first constituent code and second constituent code being children of a third constituent code; using the first CCW and the second CCW to compute, by the decoder, a CCW of the third constituent code; using the CCW of the third constituent code to compute a group of symbol likelihoods indicating probabilities of symbols of a fourth (higher-layer) constituent code having been transmitted with a particular symbol value, and using the group of symbol likelihoods to decode the fourth constituent code.
    Type: Grant
    Filed: July 15, 2018
    Date of Patent: December 14, 2021
    Assignee: TSOFUN ALGORITHMS LTD.
    Inventors: Eldad Meller, Noam Presman, Alexander Smekhov
  • Patent number: 11165447
    Abstract: There is provided a method of sequential list decoding of an error correction code (ECC) utilizing a decoder comprising a plurality of processors. The method comprises: a) obtaining an ordered sequence of constituent codes usable for the sequential decoding of the ECC; b) executing, by a first processor, a task of decoding a first constituent code, the executing comprising: a. generating decoding candidate words (DCWs) usable to be selected for decoding a subsequent constituent code, each DCW associated with a ranking; b. for the first constituent code, upon occurrence of a sufficiency criterion, and prior to completion of the generating all DCWs and rankings, selecting, in accordance with a selection criterion, at least one DCW; c) executing, by a second processor, a task of decoding a subsequent constituent code, the executing comprising processing data derived from the selected DCWs to generate data usable for decoding a next subsequent constituent code.
    Type: Grant
    Filed: April 10, 2018
    Date of Patent: November 2, 2021
    Assignee: TSOFUN ALGORITHMS LTD.
    Inventors: Eldad Meller, Noam Presman, Alexander Smekhov, Nissim Halabi
  • Patent number: 10866857
    Abstract: There is provided a method of obtaining one or more parity symbols (PS) of an encoding of information symbols (IS) according to a linear cyclic code, the method comprising: upon a permutation of information symbols (IS), generating data indicative of parity coefficients of a row of a generator matrix associated with the linear cyclic code, computing, for each given parity coefficient, a first data in accordance with, at least, the given parity coefficient and the first IS; updating, by the processing circuitry, for each given parity coefficient of the one or more parity coefficients, the first data, in accordance with, at least, the given parity coefficient and the respective IS; and upon meeting a parity completion criterion for a given parity coefficient, deriving a parity symbol from the respective first data, thereby obtaining the one or more parity symbols of the codeword of the linear cyclic code.
    Type: Grant
    Filed: October 9, 2018
    Date of Patent: December 15, 2020
    Assignee: TSOFUN ALGORITHMS LTD.
    Inventors: Noam Presman, Eldad Meller, Alexander Smekhov, Nissim Halabi
  • Publication number: 20200295787
    Abstract: There is provided a method of recursive sequential list decoding of a codeword of a polar code comprising: obtaining an ordered sequence of constituent codes usable for the sequential decoding of the polar code, representable by a layered graph; generating a first candidate codeword (CCW) of a first constituent code, the first CCW being computed from an input model informative of a CCW of a second constituent code, the first constituent code and second constituent code being children of a third constituent code; using the first CCW and the second CCW to compute, by the decoder, a CCW of the third constituent code; using the CCW of the third constituent code to compute a group of symbol likelihoods indicating probabilities of symbols of a fourth (higher-layer) constituent code having been transmitted with a particular symbol value, and using the group of symbol likelihoods to decode the fourth constituent code.
    Type: Application
    Filed: July 15, 2018
    Publication date: September 17, 2020
    Inventors: Eldad MELLER, Noam PRESMAN, Alexander SMEKHOV
  • Publication number: 20200259510
    Abstract: There is provided a method of sequential list decoding of an error correction code (ECC) utilizing a decoder comprising a plurality of processors. The method comprises: a) obtaining an ordered sequence of constituent codes usable for the sequential decoding of the ECC; b) executing, by a first processor, a task of decoding a first constituent code, the executing comprising: a. generating decoding candidate words (DCWs) usable to be selected for decoding a subsequent constituent code, each DCW associated with a ranking; b. for the first constituent code, upon occurrence of a sufficiency criterion, and prior to completion of the generating all DCWs and rankings, selecting, in accordance with a selection criterion, at least one DCW; c) executing, by a second processor, a task of decoding a subsequent constituent code, the executing comprising processing data derived from the selected DCWs to generate data usable for decoding a next subsequent constituent code.
    Type: Application
    Filed: April 10, 2018
    Publication date: August 13, 2020
    Inventors: Eldad MELLER, Noam PRESMAN, Alexander SMEKHOV, Nissim HALABI
  • Publication number: 20190108093
    Abstract: There is provided a method of obtaining one or more parity symbols (PS) of an encoding of information symbols (IS) according to a linear cyclic code, the method comprising: upon a permutation of information symbols (IS), generating data indicative of parity coefficients of a row of a generator matrix associated with the linear cyclic code, computing, for each given parity coefficient, a first data in accordance with, at least, the given parity coefficient and the first IS; updating, by the processing circuitry, for each given parity coefficient of the one or more parity coefficients, the first data, in accordance with, at least, the given parity coefficient and the respective IS; and upon meeting a parity completion criterion for a given parity coefficient, deriving a parity symbol from the respective first data, thereby obtaining the one or more parity symbols of the codeword of the linear cyclic code.
    Type: Application
    Filed: October 9, 2018
    Publication date: April 11, 2019
    Inventors: Noam PRESMAN, Eldad MELLER, Alexander SMEKHOV, Nissim HALABI
  • Patent number: 9596105
    Abstract: A method includes, in a receiver, receiving a superposition of multiple signals originating from multiple transmitters. A symbol interval of the superposition is transformed in the receiver into a frequency domain. A start time of the symbol interval to be transformed is set in accordance with a criterion that reduces Inter-Symbol Interference (ISI) in the transformed symbol interval. At least one of the multiple signals is demodulated in the receiver using the transformed symbol interval.
    Type: Grant
    Filed: December 2, 2015
    Date of Patent: March 14, 2017
    Assignee: MARVELL INTENATIONAL LTD.
    Inventors: Alexander Smekhov, Ronen Mayrench