Patents by Inventor Alexander Andreev
Alexander Andreev 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: 8629548Abstract: A clock architecture for a Structured ASIC chip, manufactured using a CMOS process is shown. A via-configurable logic block (VCLB) architecture in the Structured ASIC has a core region containing memory and logic cells arranged in columns that are supplied by a clock network having a global clock network tree and a low-level clock mesh to distribute the global clock signal in a repeating pattern. The clock mesh has a fishbone configuration in outline and allows for scalable expansion of the clock network. In one embodiment 36 global clocks may be provided to the Structured ASIC, with four clocks per logic cell. The VCLB Structured ASIC chip is manufactured on a 28 nm CMOS process lithographic node, having several metal layers but preferably is programmable on a single via layer.Type: GrantFiled: October 11, 2012Date of Patent: January 14, 2014Assignee: EASIC CorporationInventors: Alexander Andreev, Andrey Nikishin, Sergey Gribok, Phey-Chuin Tan, Choon-Hun Choo
-
Publication number: 20130254252Abstract: A low-density parity check min-sum decoder including a variable node processing unit having N+1 inputs. A first bank of N+1 two-input adders each have an associated output, and at least one of the N+1 inputs go to more than two of the adders of the first bank. A second bank of N two-input adders has no adders in common with the first bank. At least one of the adders of the first bank provides its associated output to more than one adder of the second bank. The banks of adders are disposed in series. A sign module outputs a sign value produced from one of the inputs and an output from one of the adders of the second bank. N+1 outputs are provided, where one of the outputs is the sign value.Type: ApplicationFiled: May 13, 2013Publication date: September 26, 2013Applicant: LSI CorporationInventors: Alexander Andreev, Sergey Gribok, Oleg Izyumin
-
Patent number: 8443033Abstract: A variable node processing unit with N+1 inputs, having at least a first bank of two-input adders and a separate last bank of two-input adders, where the banks of adders are disposed in series.Type: GrantFiled: August 4, 2008Date of Patent: May 14, 2013Assignee: LSI CorporationInventors: Alexander Andreev, Sergey Gribok, Oleg Izyumin
-
Patent number: 8347167Abstract: A parity unit circuit for use in a parallel, pipelined, low density parity check (LDPC) decoder that implements an iterative, min-sum, message passing LDPC algorithm. The parity unit provides a memory logic block for storing information relating to a current and next iteration of the LDPC computations and includes a “compute 1” logic block for computing a parity message (with sign) for application to related bit nodes and a “compute2” logic block for updating the data stored in the memory logic block for a next iteration of the LDPC decoder.Type: GrantFiled: December 19, 2008Date of Patent: January 1, 2013Assignee: LSI CorporationInventors: Alexander Andreev, Vojislav Vukovie, Igor Vikhliantsev
-
Publication number: 20120278372Abstract: An apparatus and method are provided in various illustrative embodiments for an integrated circuit chip that provides a fast, compact, and cryptographically strong random number generator. In one illustrative embodiment, an apparatus includes an initial random source, and a post-processing block in communicative connection with the initial random source. The post-processing block is configured to receive signals from the initial random source, to apply one or more finite field operations to the signals to generate an output, and to provide an output signal based on the output via an output channel, in this illustrative embodiment.Type: ApplicationFiled: June 12, 2012Publication date: November 1, 2012Applicant: LSI CORPORATIONInventors: Sergey Gribok, Alexander Andreev, Sergey Gashkov
-
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
-
Patent number: 8250129Abstract: An apparatus and method are provided in various illustrative embodiments for an integrated circuit chip that provides a fast, compact, and cryptographically strong random number generator. In one illustrative embodiment, an apparatus includes an initial random source, and a post-processing block in communicative connection with the initial random source. The post-processing block is configured to receive signals from the initial random source, to apply one or more finite field operations to the signals to generate an output, and to provide an output signal based on the output via an output channel, in this illustrative embodiment.Type: GrantFiled: June 22, 2007Date of Patent: August 21, 2012Assignee: LSI CorporationInventors: Sergey Gribok, Alexander Andreev, Sergey Gashkov
-
Publication number: 20120161093Abstract: A via-configurable circuit block may contain chains of p-type and n-type transistors that may or may not be interconnected by means of configurable vias. Configurable vias may also be used to connect various transistor terminals to a ground line, a power line and/or to various terminals that may provide connections outside of the circuit block.Type: ApplicationFiled: October 12, 2011Publication date: June 28, 2012Applicant: eASIC CorporationInventors: Alexander Andreev, Sergey Gribok, Ranko Scepanovic
-
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
-
Patent number: 8035537Abstract: Methods and apparatus are provided for programmable decoding of a plurality of code types. A method is provided for decoding data encoded using one of a plurality of code types, where each of the code types correspond to a communication standard. The code type associated with the data is identified and the data is allocated to a plurality of programmable parallel decoders. The programmable parallel decoders can be reconfigured to decode data encoded using each of the plurality of code types. A method is also provided for interleaving data among M parallel decoders using a communications network. An interleaver table is employed, wherein each entry in the interleaver table identifies one of the M parallel decoders as a target decoder and a target address of a communications network for interleaved data. Data is interleaved by writing the data to the target address of the communications network.Type: GrantFiled: June 13, 2008Date of Patent: October 11, 2011Assignee: LSI CorporationInventors: Alexander Andreev, Sergey Gribok, Oleg Izyumin, Ranko Scepanovic, Igor Vikhliantsev, Vojislav Vukovic
-
Publication number: 20110173510Abstract: An LDPC decoder that implements an iterative message-passing algorithm, where the improvement includes a pipeline architecture such that the decoder accumulates results for row operations during column operations, such that additional time and memory are not required to store results from the row operations beyond that required for the column operations.Type: ApplicationFiled: March 22, 2011Publication date: July 14, 2011Applicant: LSI CORPORATIONInventors: Alexander Andreev, Igor Vikhliantsev, Sergey Gribok
-
Publication number: 20110099454Abstract: A method of encoding a binary source message u, by calculating x:=Au, calculating y:=B?x, resolving the equation Dp=y for p, and incorporating u and p to produce an encoded binary message v, where A is a matrix formed only of permutation sub matrices, B? is a matrix formed only of circulant permutation sub matrices, and D is a matrix of the form D = ( T 0 … 0 0 0 T … 0 0 … … … … … 0 0 … T 0 I I … I I ) where T is a two-diagonal, circulant sub matrix, and I is an identity sub matrix.Type: ApplicationFiled: January 6, 2011Publication date: April 28, 2011Applicant: LSI CORPORATIONInventors: Sergey Gribok, Alexander Andreev, Igor Vikhliantsev
-
Patent number: 7934139Abstract: An LDPC decoder that implements an iterative message-passing algorithm, where the improvement includes a pipeline architecture such that the decoder accumulates results for row operations during column operations, such that additional time and memory are not required to store results from the row operations beyond that required for the column operations.Type: GrantFiled: December 1, 2006Date of Patent: April 26, 2011Assignee: LSI CorporationInventors: Alexander Andreev, Igor Vikhliantsev, Sergey Gribok
-
Patent number: 7913149Abstract: A method of encoding a binary source message u, by calculating x:=Au, calculating y:=B?x, resolving the equation Dp=y for p, and incorporating u and p to produce an encoded binary message v, where A is a matrix formed only of permutation sub matrices, B? is a matrix formed only of circulant permutation sub matrices, and D is a matrix of the form D = ( T 0 … 0 0 0 T … 0 0 … … … … … 0 0 … T 0 I I … I I ) where T is a two-diagonal, circulant sub matrix, and I is an identity sub matrix.Type: GrantFiled: December 20, 2006Date of Patent: March 22, 2011Assignee: LSI CorporationInventors: Sergey Gribok, Alexander Andreev, Igor Vikhliantsev
-
Patent number: 7877724Abstract: An arbitrary function may be represented as an optimized decision tree. The decision tree may be calculated, pruned, and factored to create a highly optimized set of equations, much of which may be represented by simple circuits and little, if any, complex processing. A circuit design system may automate the decision tree generation, optimization, and circuit generation for an arbitrary function. The circuits may be used for processing digital signals, such as soft decoding and other processes, among other uses.Type: GrantFiled: May 9, 2008Date of Patent: January 25, 2011Assignee: LSI CorporationInventors: Alexander Andreev, Vojislav Vokovic, Ranko Scepanovic
-
Patent number: 7823050Abstract: An improvement to a key equation solver block for a BCH decoder, where the key equation solver block having a number of multiplier units specified by X, where: t*(7*t?1)/(codeword_len?3)?X<(t+1), where t is a number of transmission errors for the key equation solver block to correct, and codeword_len is a length of a transmitted codeword to be decoded by the BCH decoder.Type: GrantFiled: December 20, 2006Date of Patent: October 26, 2010Assignee: LSICorporationInventors: Elyar E. Gasanov, Alexander Andreev, Ilya V. Neznanov, Pavel A. Panteleev, Sergei Gashkov
-
Patent number: 7818703Abstract: A system for layout of a module in an integrated circuit layout pattern has a cell library and a cell placement system. The cell library includes a plurality of cells. The cell placement system is adapted to select one or more cells from the cell library and to locally place each selected cell within the module layout so that each cell pin of the selected cells and each port of the module layout occupies a unique vertical routing track within the module layout.Type: GrantFiled: June 1, 2007Date of Patent: October 19, 2010Assignee: LSI CorporationInventors: Alexander Andreev, Ivan Pavisic, Anatoli Bolotov
-
Publication number: 20100162071Abstract: A parity unit circuit for use in a parallel, pipelined, low density parity check (LDPC) decoder that implements an iterative, min-sum, message passing LDPC algorithm. The parity unit provides a memory logic block for storing information relating to a current and next iteration of the LDPC computations and includes a “compute 1” logic block for computing a parity message (with sign) for application to related bit nodes and a “compute2” logic block for updating the data stored in the memory logic block for a next iteration of the LDPC decoder.Type: ApplicationFiled: December 19, 2008Publication date: June 24, 2010Inventors: Alexander Andreev, Vojislav Vukovie, Igor Vikhliantsev
-
Patent number: 7739575Abstract: An improvement to an arithmetic unit of a low-density parity-check decoder, where the arithmetic unit has a pipelined architecture of modules. A first module calculates a difference between absolute values of md_R and md_g_in, and passes the result to a first Gallager module. The first Gallager module converts this value from a p0/p1 representation to a 2*p0?1 representation, and passes the result to a second module. The second module selectively adjusts the result of the previous module based on the sign values of md_g_in and md_R, and passes one of its outputs to a third module (the other two outputs, loc_item_out and hard_out, are not a part of the pipeline). The third module calculates a new md_g value by adding the result of the second module and loc_item_in, and passes this result to a fourth module. The fourth module separates a sign and an absolute value of the new md_g, and passes the result to a second Gallager module.Type: GrantFiled: January 24, 2007Date of Patent: June 15, 2010Assignee: LSI CorporationInventors: Alexander Andreev, Vojislav Vukovic, Ranko Scepanovic
-
Patent number: 7739471Abstract: A method of configuring a random access memory matrix containing partially configured memories in the matrix. The method includes the steps of independently calculating a memory enable signal and a configuration signal for a partially configured memory in each memory tile of the memory matrix. Memory tiles not supported by a memory compiler are determined. A memory wrapper is provided for each tile not supported by the memory compiler. An address controller is inserted in the memory matrix for each tile in a group of tiles. Output signals from each memory location in a memory group having a common group index are combined into a single output signal. A first stripe of memory tiles containing non-configured memory having a first width is selected. A second strip of memory tiles containing configured memory having a second width is also selected.Type: GrantFiled: October 24, 2005Date of Patent: June 15, 2010Assignee: LSI CorporationInventors: Alexander Andreev, Igor Vikhliantsev, Ranko Scepanovic