Patents by Inventor Arash Farhoodfar

Arash Farhoodfar 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).

  • Publication number: 20130031437
    Abstract: Multiple data permutation operations in respective different dimensions are used to provide an overall effective data permutation using smaller blocks of data in each permutation than would be used in directly implementing the overall permutation in a single permutation operation. Data that has been permuted in one permutation operation is block interleaved, and the interleaved data is then permuted in a subsequent permutation operation. A matrix transpose is one example of block interleaving that could be applied between permutation operations.
    Type: Application
    Filed: July 25, 2011
    Publication date: January 31, 2013
    Applicant: CORTINA SYSTEMS, INC.
    Inventors: Arash Farhoodfar, Frank R. Kschischang, Benjamin P. Smith, Andrew Hunt
  • Publication number: 20120266051
    Abstract: In staircase forward error correction coding, a stream of data symbols are mapped to data symbol positions in a sequence of two-dimensional symbol blocks Bi, i a positive integer. Each of the symbol blocks has data symbol positions and coding symbol positions. Coding symbols for the coding symbol positions in each symbol block Bi in the sequence are computed. The coding symbols are computed such that, for each symbol block Bi that has a preceding symbol block Bi?1 and a subsequent symbol block Bi+1 in the sequence, symbols at symbol positions along one dimension of the preceding symbol block Bi?1, concatenated with the data symbols and the coding symbols along the other dimension in the symbol block Bi, form a codeword of a FEC component code, and symbols at symbol positions along the one dimension of the symbol block Bi, concatenated with the data symbols and the coding symbols along the other dimension in the subsequent symbol block Bi+1, form a codeword of the FEC component code.
    Type: Application
    Filed: April 13, 2011
    Publication date: October 18, 2012
    Applicant: CORTINA SYSTEMS, INC.
    Inventors: Arash Farhoodfar, Frank R. Kschischang, Andrew Hunt, Benjamin P. Smith, John Lodge
  • Patent number: 8180012
    Abstract: An inter-symbol interference (ISI) pattern-weighted early-late phase detector is provided. An I clock and a function-controlled oscillation cycle phase delay Q clock are generated. The I clock frequency is divided by n, creating a reference clock. A serial data stream is sequentially sampled with the I clock, and with the function-controlled varied phase delay Q clock, creating digital I-bit and varied phase delay Q-bit values, respectively. The values are segmented into n-bit digital words. I clock phase corrections are identified and a modulation factor is determined in response to comparing varied phase delay Q-bit values with I-bit values. Also identified are bit sequence patterns associated with each I-bit value. Each I-bit value is weighted in response to the identified bit sequence pattern and the identified I clock phase correction. The modulation factor is applied to the weighted average, and I and Q clock phase error signals are generated.
    Type: Grant
    Filed: October 6, 2009
    Date of Patent: May 15, 2012
    Assignee: Applied Micro Circuits Corporation
    Inventors: Viet Linh Do, Wei Fu, Arash Farhoodfar
  • Patent number: 8090013
    Abstract: Herein described are at least a method and a system for implementing a high speed Tomlinson-Harashima Precoder. The method comprises using an L-tap transpose configuration of a Tomlinson-Harashima Precoder and processing a first discrete time sampled sequence using said L coefficients and L state variables by clocking the L-tap Tomlinson-Harashima Precoder using a clock signal wherein the clock signal has a clock rate equal to one half the symbol rate of the discrete time sampled sequence. In a representative embodiment, an L-tap Tomlinson-Harashima Precoder comprises a single integrated circuit chip, wherein the integrated circuit chip comprises at least one circuitry for processing a discrete time sampled sequence using L coefficients and L state variables by way of clocking the discrete time sampled sequence using a clock signal having a clock rate that is one half the symbol rate of the discrete time sampled sequence.
    Type: Grant
    Filed: March 6, 2008
    Date of Patent: January 3, 2012
    Assignee: Broadcom Corporation
    Inventors: Arash Farhoodfar, Kishore Kota, Alan Kwentus, David Hwang
  • Publication number: 20100228810
    Abstract: Aspects of a method and system for unconstrained frequency domain adaptive filtering include one or more circuits that are operable to select one or more time domain coefficients in a current filter partition. A value may be computed for each of the selected one or more time domain coefficients based on a corresponding plurality of frequency domain coefficients. The corresponding plurality of frequency domain coefficients may be adjusted based on the computed values. A subsequent plurality of frequency domain coefficients in a subsequent filter partition may be adjusted based on the computed values. Input signals may be processed in the current filter partition based on the adjusted corresponding plurality of frequency domain coefficients. A time-adjusted version of the input signals may be processed in a subsequent filter partition based on the adjusted subsequent plurality of frequency domain coefficients.
    Type: Application
    Filed: June 23, 2009
    Publication date: September 9, 2010
    Inventors: Kuoruey Han, Peiqing Wang, Linghsiao Wang, Kishore Kota, Arash Farhoodfar
  • Publication number: 20090172070
    Abstract: A method is provided for first order accumulation in a single clock cycle. The method accepts a limited gain value and an accumulated value stored in a previous clock cycle. Using combinational logic, the limited gain value is summed with the accumulated value. If the summed value is between upper and lower limits, a non-weighted correction signal is supplied, and the summed value is the storage value. If the summed value is greater than the upper limit, a positive weighting is supplied, the (upper limit+1) is subtracted from the summed value, and the result is the storage value. If the summed value is less than the lower limit, then a negative weighting is supplied, the lower limit is subtracted from the summed value, and the result is the storage value. The storage value is loaded in memory for use as the accumulated value in the subsequent clock cycle.
    Type: Application
    Filed: March 6, 2009
    Publication date: July 2, 2009
    Inventors: Viet Linh Do, Wei Fu, Arash Farhoodfar
  • Publication number: 20080225937
    Abstract: Herein described are at least a method and a system for implementing a high speed Tomlinson-Harashima Precoder. The method comprises using an L-tap transpose configuration of a Tomlinson-Harashima Precoder and processing a first discrete time sampled sequence using said L coefficients and L state variables by clocking the L-tap Tomlinson-Harashima Precoder using a clock signal wherein the clock signal has a clock rate equal to one half the symbol rate of the discrete time sampled sequence. In a representative embodiment, an L-tap Tomlinson-Harashima Precoder comprises a single integrated circuit chip, wherein the integrated circuit chip comprises at least one circuitry for processing a discrete time sampled sequence using L coefficients and L state variables by way of clocking the discrete time sampled sequence using a clock signal having a clock rate that is one half the symbol rate of the discrete time sampled sequence.
    Type: Application
    Filed: March 6, 2008
    Publication date: September 18, 2008
    Inventors: Arash Farhoodfar, Kishore Kota, Alan Kwentus, David Hwang
  • Publication number: 20080104158
    Abstract: Herein described is at least a method for implementing an adaptive digital filter of reduced implementation complexity. The method comprises computing at least one complex discrete Fourier transform of a complex data sequence using approximately one-half the number of points used in computing said discrete Fourier transform of a real valued sequence. Further, herein described is an adaptive digital filter of reduced implementation complexity. The adaptive digital filter comprises at least one circuitry for computing a complex discrete Fourier transform of a complex data sequence using approximately one-half the number of points used in computing the discrete Fourier transform of a real valued sequence. The adaptive digital filter may be employed in a 10 Gbit/sec Ethernet transceiver.
    Type: Application
    Filed: October 25, 2006
    Publication date: May 1, 2008
    Inventors: Arash Farhoodfar, Scott R. Powell, Peiqing Wang