Patents by Inventor Pavel A. Panteleev
Pavel A. Panteleev 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: 8539009Abstract: A system having an entropy module, a memory module and a main module is disclosed. The entropy module may be configured to generate a plurality of first random numbers. The memory module may be configured to buffer (i) the first random numbers and (ii) a plurality of second random numbers. The main module is generally configured to (i) control a first transfer of the first random numbers from the entropy module to the memory module, (ii) control a second transfer of the first random numbers from the memory module to the main module, (iii) generate the second random numbers by encrypting the first random numbers and (iv) control a third transfer of the second random numbers from the main module to the memory module. The generation of the first random numbers and the generation of the second random numbers may be performed in parallel.Type: GrantFiled: December 16, 2008Date of Patent: September 17, 2013Assignee: LSI CorporationInventors: Pavel A. Aliseychik, Elyar E. Gasanov, Oleg N. Izyumin, Ilya V. Neznanov, Pavel A. Panteleev
-
Publication number: 20130235907Abstract: In described embodiments, data streams with irregular patterns are processed by transformations defined by recursively changing processor state, or iteration level. The data transformations are applied to an arbitrary long portion of data, instead of small portions, that are defined directly by a current processor state. Embodiments combine small parts of, for example, puncturing/repetition patterns into a pattern of bigger parts and apply these patterns of bigger parts to relatively large portions of input data.Type: ApplicationFiled: December 6, 2012Publication date: September 12, 2013Applicant: LSI CORPORATIONInventors: Yurii S. Shutkin, Ilya V. Neznanov, Andrey P. Sokolov, Pavel A. Panteleev, Elyar E. Gasanov
-
Patent number: 8527851Abstract: The present invention is a configurable binary BCH encoder having a variable number of errors. The encoder may implement a universal multipole block which may be configured for receiving an error number input, which may include a maximum error number limit for the encoder, and for calculating a plurality of error coefficients based on the error number input. The encoder may be further configured for receiving a plurality of information bits of an information word. The encoder may be further configured for transmitting/outputting a first (ex.—unmodified) subset of the information bits as an encoder output. The encoder may be further configured for calculating a plurality of parity bits based on a second subset of the information bits and the error coefficients. The encoder may be further configured for transmitting/outputting the calculated parity bits as part of the encoder output.Type: GrantFiled: August 4, 2008Date of Patent: September 3, 2013Assignee: LSI CorporationInventors: Alexander E. Andreev, Elyar E. Gasanov, Pavel Aliseychik, Ilya Neznanov, Pavel Panteleev
-
Patent number: 8397143Abstract: An apparatus generally having a first circuit, a second circuit and a third circuit is disclosed. The first circuit may be configured to calculate a plurality of preliminary syndromes from a plurality of received symbols. The second circuit may be configured to calculate a plurality of normal syndromes by modifying the preliminary syndromes using at most two Galois Field multiplications. The third circuit is generally configured to calculate an errata polynomial based on the normal syndromes.Type: GrantFiled: November 24, 2009Date of Patent: March 12, 2013Assignee: LSI CorporationInventors: Ilya V. Neznanov, Elyar E. Gasanov, Pavel A. Panteleev, Pavel A. Aliseychik, Andrey P. Sokolov
-
Patent number: 8365054Abstract: An apparatus having a first circuit and a second circuit is disclosed. The first circuit may (i) generate a decoded codeword by decoding a first codeword a plurality of times based on a respective plurality of erasure location vectors and (ii) assert a fail signal upon each failure of the decoding of the first codeword, the decoding comprising an error-and-erasure Reed-Solomon decoding. The second circuit may (i) generate a count of the assertions of the fail signal and (ii) generate the erasure location vectors based on (a) the count and (b) a plurality of reliability items corresponding to the first codeword.Type: GrantFiled: November 4, 2009Date of Patent: January 29, 2013Assignee: LSI CorporationInventors: Elyar E. Gasanov, Andrey P. Sokolov, Pavel A. Panteleev, Ilya V. Neznanov, Pavel A. Aliseychik
-
Publication number: 20130019139Abstract: An apparatus generally having a plurality of first circuits and a second circuit is disclosed. The first circuits may be configured to (i) generate a plurality of intermediate bits by dividing a plurality data bits by a plurality of minimal polynomials of an encoding along a first path and (ii) generate a plurality of parity bits by multiplying the intermediate bits by the minimal polynomials along a second path. A number of the parity bits may be variable based on a configuration signal. The second circuit may be configured to (i) delay the data bits and (ii) generate a plurality of code bits by appending the parity bits to a last of the data bits.Type: ApplicationFiled: January 17, 2012Publication date: January 17, 2013Inventors: Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin
-
Publication number: 20120284731Abstract: A method for two-pass scheduling of a plurality of tasks generally including steps (A) to (C). Step (A) may assign each of the tasks to a corresponding one or more of a plurality of processors in a first pass through the tasks. The first pass may be non-iterative. Step (B) may reassign the tasks among the processors to shorten a respective load on one or more of the processors in a second pass through the tasks. The second pass may be non-iterative and may begin after the first pass has completed. Step (C) may generate a schedule in response to the assigning and the reassigning. The schedule generally maps the tasks to the processors.Type: ApplicationFiled: November 7, 2011Publication date: November 8, 2012Inventors: Yurii S. Shutkin, Pavel A. Aliseychik, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Pavel A. Panteleev
-
Publication number: 20120281790Abstract: A method of parallel decoding for a plurality of communications standards generally including steps (A) to (C) is disclosed. Step (A) may receive a plurality of first words, at least two of the first words generally have a different length than each other. Step (B) may parse the first words into a plurality of memories. Step (C) may generate a plurality of second words by decoding the first words using a plurality of decoders. The decoders generally operate in parallel. The decoding of at least one of the first words may be performed by at least two of the decoders. The decoding is generally based on a signal that identifies a current one of the communications standards used to transfer the first words.Type: ApplicationFiled: November 8, 2011Publication date: November 8, 2012Inventors: Andrey P. Sokolov, Elyar E. Gasanov, Pavel A. Panteleev, Ilya V. Neznanov, Yurii S. Shutkin
-
Publication number: 20120278648Abstract: An apparatus having a first memory and a circuit is disclosed. The first memory may be configured to store a plurality of timers. Each of the timers may have a respective value that indicates an expiration time. A first one of the timers nearest to expiring is generally stored at a first address of the first memory. The circuit may be configured to (i) assert a signal in response to the respective value of the first timer matching a counter of time, (ii) read a second of the timers and a third of the timers both from a second address of the first memory, (iii) sort the second timer and the third timer to determine which expires next and (iv) replace the first timer by writing one of the second timer or the third timer that expires next into the first memory at the first address.Type: ApplicationFiled: October 27, 2011Publication date: November 1, 2012Inventors: Elyar E. Gasanov, Ilya V. Neznanov, Yurii S. Shutkin, Andrey P. Sokolov, Pavel A. Panteleev
-
Patent number: 8286060Abstract: A method to generate an erasure locator polynomial in an error-and-erasure decode. The method generally includes the steps of (A) storing current values in multiple registers at a current moment, (B) generating first values by multiplying each current value by a respective one of multiple constants, (C) generating second values by gating at least all but one of the first values with a current one of multiple erasure values of an erasure position vector, (D) generating next values by combining each one of the second values with a corresponding one of the first values, (E) loading the next values into the registers in place of the current values at a next moment and (F) generating an output signal carrying the current values at a last moment such that the current values form the coefficients of the erasure locator polynomial.Type: GrantFiled: July 30, 2008Date of Patent: October 9, 2012Assignee: LSI CorporationInventors: Pavel A. Panteleev, Elyar E. Gasanov, Alexander Andreev, Ilya V. Neznanov, Pavel A. Aliseychik
-
Publication number: 20120166501Abstract: An apparatus generally having a first circuit, a second circuit and a third circuit is disclosed. The first circuit may be configured to generate a plurality of first signals carrying (i) a maximum value among a plurality of input values and (ii) a plurality of difference values based on the input values. The second circuit may be configured to generate a plurality of second signals carrying a plurality of intermediate values based on the difference values. The intermediate values are generally respective powers of two. The third circuit may be configured to generate a third signal carrying an output value by adding the maximum value and the intermediate values. The output value may be a Jacobian logarithm computation of the input values.Type: ApplicationFiled: August 3, 2011Publication date: June 28, 2012Inventors: Andrey P. Sokolov, Sergey B. Gashkov, Elyar E. Gasanov, Pavel A. Panteleev, Ilya V. Neznanov
-
Patent number: 8209589Abstract: A syndrome calculator receives an input codeword and calculates a first set of syndromes. A syndrome transform receives the first set of syndromes having and determines a second set of syndromes. The second set of syndromes is based on the first set of syndromes. The second set of syndromes has number of syndromes that is less than the number of syndromes in the first set of syndromes. A key equation solver receives the second set of syndromes and produces an indication of zero or more error locations and an indication of zero or more error values.Type: GrantFiled: September 17, 2008Date of Patent: June 26, 2012Assignee: LSI CorporationInventors: Alexandre Andreev, Ilya Neznanov, Elyar Gasanov, Pavel Panteleev
-
Publication number: 20120144274Abstract: A method for forward error correction decoding is disclosed. The method generally includes steps (A) to (D). Step (A) may calculate a plurality of metrics of a codeword using a forward error correction process on a trellis having a plurality of stages. Step (B) may update the metrics over each of the stages. Step (C) may permute the metrics in each of the stages. Step (D) may generate a signal carrying a plurality of decoded bits of the codeword.Type: ApplicationFiled: June 13, 2011Publication date: June 7, 2012Inventors: Elyar E. Gasanov, Pavel A. Panteleev, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin
-
Publication number: 20120134325Abstract: A method for branch metric calculation in a plurality of communications standards is disclosed. The method generally includes steps (A) to (C). Step (A) may calculate a plurality of sum values by adding a plurality of first values related to a plurality of information bits, a plurality of second values related to the information bits and a plurality of third values related to a plurality of parity bits. Step (B) may generate a plurality of permutated values by permutating the sum values based on a configuration signal. The configuration signal generally identifies a current one of the communications standards. Step (C) may generate a plurality of branch metrics values by adding pairs of the permutated values.Type: ApplicationFiled: June 9, 2011Publication date: May 31, 2012Inventors: Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin
-
Publication number: 20120137190Abstract: An apparatus generally including a first circuit and a second circuit is disclosed. The first circuit may be configured to (i) receive a configuration signal that identifies a current one of a plurality of communications standards and (ii) generate a plurality of matrix elements based on the configuration signal. The second circuit may include a plurality of matrixes. The second circuit may be configured to (i) fill the matrixes with the matrix elements and (ii) generate an encoded signal by forward error correction encoding an input signal using the matrixes. The encoded signal generally complies with the current communications standard.Type: ApplicationFiled: May 26, 2011Publication date: May 31, 2012Inventors: Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin
-
Publication number: 20120128102Abstract: An apparatus having a first circuit, a second circuit and a third circuit is disclosed. The first circuit may be configured to generate a plurality of load values corresponding to a trellis of a decoding process. The second circuit generally includes a plurality of calculation layers. The calculation layers may be configured to generate a plurality of maximum values in response to the load values. The third circuit may be configured to generate a plurality of L-values of the decoding process in response to the maximum values.Type: ApplicationFiled: May 25, 2011Publication date: May 24, 2012Inventors: Andrey P. Sokolov, Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Yurii S. Shutkin
-
Patent number: 8181096Abstract: A method of configurable decoding is disclosed. The method generally includes the steps of (A) receiving a variable value in a configuration signal, (B) calculating a plurality of first syndromes corresponding to a particular codeword of a plurality of codewords received in an input signal, the particular codeword having a plurality of information symbols and a plurality of parity symbols coded such that up to a fixed value of a plurality of errors in the particular codeword are correctable, the fixed value being greater than the variable value, (C) transforming the first syndromes into a plurality of second syndromes such that no greater than the variable value of the errors in the particular codeword are correctable and (D) generating an intermediate signal carrying the second syndromes.Type: GrantFiled: December 17, 2007Date of Patent: May 15, 2012Assignee: LSI CorporationInventors: Alexander Andreev, Ilya V. Neznanov, Elyar E. Gasanov, Pavel A. Panteleev
-
Publication number: 20120117359Abstract: An apparatus generally including a memory and a circuit is disclosed. The memory may be configured to store a plurality of instructions. Each of the instructions generally includes a corresponding command and a corresponding command repeat count. At least one of the instructions may include a subprocedure call. The circuit may be configured to (i) decode the instructions one at a time and (ii) present a sequence of the commands at an interface. The sequence (i) may be based on the decoding and (ii) may have no delays between consecutive the commands at the interface.Type: ApplicationFiled: May 12, 2011Publication date: May 10, 2012Inventors: Yurii S. Shutkin, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Pavel A. Panteleev
-
Patent number: 8176397Abstract: A fixed length Reed-Solomon encoder is configured to produce a first fixed number of redundant symbols. The fixed length Reed-Solomon encoder is configured with an encoding polynomial that is fixed. A symbol preprocessor maps each input data symbol to a transformed input data symbol. A symbol postprocessor maps a second fixed number of redundant symbols output from the fixed length Reed-Solomon encoder to a set of redundant symbols. The second fixed number of redundant symbols is less than the first fixed number of redundant symbols.Type: GrantFiled: September 17, 2008Date of Patent: May 8, 2012Assignee: LSI CorporationInventors: Pavel Panteleev, Alexandre Andreev, Elyar Gasanov, Ilya Neznanov
-
Publication number: 20120054586Abstract: An apparatus generally having a port, a first circuit and a second circuit is disclosed. The port may be configured to receive a current length of a codeword. The current length may be less than a maximum length of the codeword that the apparatus is designed to decode. The first circuit may be configured to calculate in parallel (i) a sequence of intermediate syndromes from the codeword and (ii) a sequence of correction values based on the current length. The second circuit may be configured to generate a particular number of updated syndromes by modifying the intermediate syndromes with the correction values. The particular number is generally twice a maximum error limit of the codeword.Type: ApplicationFiled: March 10, 2011Publication date: March 1, 2012Inventors: Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin