Patents by Inventor Torkjell Berge

Torkjell Berge 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: 6704901
    Abstract: A runtime programable RS decoder that can operate on multiple pieces of data during one clock cycle in order to generate, reduce, and evaluate polynomials involved in the decoding of an RS code, and which allows a user to choose the RS code after the circuit has been implemented.
    Type: Grant
    Filed: July 11, 2000
    Date of Patent: March 9, 2004
    Assignee: AMI Semiconductor, Inc.
    Inventors: Torkjell Berge, Aaron James Brennan
  • Patent number: 5822341
    Abstract: A memory block structure for use within a viterbi decoder includes multiple dual port RAMs configured as multiport RAMs. The memory block structure is configured to allow a one-word write operation and an N-word read operation during a single clock cycle in order to achieve one decoded output symbol per clock period using the viterbi algorithm. By using dual port RAMs, a more densely packed and less expensive memory block structure is achieved. An encoded stream of input symbols are input to the viterbi decoder and written to the memory block structure one word at a time. Once X+Y bits have been written to the memory block structure, the decoder will then read N words from the memory block structure, simultaneously, reading back through X+Y words and outputting Y bits N at a time at the end of the trace back through memory.
    Type: Grant
    Filed: April 6, 1995
    Date of Patent: October 13, 1998
    Assignee: Advanced Hardware Architectures, Inc.
    Inventors: Paul Winterrowd, Torkjell Berge
  • Patent number: 5396502
    Abstract: The present invention is for a Error Correction Unit (ECU) that uses a single stack architecture for the generation, reduction and evaluation of the polynomials involved in the correction of a Reed-Solomon code. The circuit uses the same hardware to generate the syndromes, reduce the .OMEGA.(x) and .LAMBDA.(x) polynomials and evaluate the .OMEGA.(x) and .LAMBDA.(x) polynomials. Some of the specifics involved in calculating and reducing the polynomials mentioned above are novel as well. First, the implementation of the general Galois field multiplier is new and faster than previous implementations. Second, the circuit for implementing the Galois field inverse function has not appeared in prior art designs. Third, a novel method of generating the .OMEGA.(x) and .LAMBDA.(x) polynomials (including alignment of these polynomials prior to evaluation) is utilized. Fourth, corrections are performed in the same order as they are received using a premultiplication step prior to evaluation.
    Type: Grant
    Filed: July 9, 1992
    Date of Patent: March 7, 1995
    Assignee: Advanced Hardware Architectures, Inc.
    Inventors: Patrick A. Owsley, Torkjell Berge, Catherine A. French