Teknekron Communications Systems, Inc.

International Business Machines Corporation

Tcsi Corporation

Gerhard P Fettweis

Martin Aureliano Hassner

Razmik Karabed

Charles Edwin Cox

Paul H Siegel

Hemant K Thapar

Uwe Schwiegelshohn

Herbert R Dawid

A method and apparatus for implementing a discrete cosine transform (DCT) or an inverse DCT (IDCT) with a single hardware unit which applies only positive valued multiplicative coefficients and can be switched to either perform a DCT or an IDCT. The invention processes parallel input digital data signals to produce parallel output digital data signals which represent a discrete transform (either a DCT or an IDCT) of the input data. One aspect of the invention is a method and apparatus for performing discrete transforms using a multiplier which implements MSB-first, bit-serial, carry-save, multiplication of an input word by a positive fixed coefficient. In one class of embodiments, the serially received digits of the input word can take on positive values only. In other embodiments, the serially received digits of the input word can take on positive or negative values. Performance of MSB-first carry-save multiplication allows the design of extremely efficient transforming hardware having low processing delay and high precision, and supporting medium to low speed transform rates. Another aspect of the invention is a method and apparatus for performing discrete transforms using a butterfly addition/subtraction circuit which receives two serial signals and generates both the sum and difference of such signals. In one class of embodiments, the inventive butterfly addition/subtraction circuit implements MSB-first, bit-serial addition and subtraction. In other embodiments, the inventive butterfly addition/subtraction circuit implements LSB-first, bit-serial addition and subtraction.

Method and apparatus for preforming DCT and IDCT transforms on data

A composite encoder/syndrome generating circuit computes both check symbols and error syndromes using a single set of multiplier devices with varying tap weights having values that provide a maximum preselected error correction capability but is readily adjustable, such as by programmable latches, to eliminate from the circuit selectable multiplier devices to reduce the error correction capability without requiring a change in the tap weight values. The circuit may be used to increase or decrease error correction capability (a) according to which of a plurality of concentric bands of recording tracks is being accessed in a banded direct access data storage device, (b) according to noise level as sensed in a data communications channel having an output subject to noise, or (c) according to changes in sending rates in a sending device that sends data at variable rates.

Adjustable error-correction composite Reed-Solomon encoder/syndrome

A parallel processing circuit and a digital signal processor employing such a parallel circuit employs a plurality of identical multiply and accumulate (MAC) processing units. Two input signals are supplied to each of the MAC processing units. In one embodiment, a delay or a shift register delays one of the input digital signal from one MAC to another MAC. A plurality of different processed signals can be generated simultaneously based upon the supplied input digital signals, greatly increasing processing capability without increasing clock speed or increasing bandwidth access to a memory.

Parallel processing circuit and a digital signal processer including same

A Viterbi decoder having a recursive processor modified to process each node in a trellis of a partial response coded signal to shift the branch metric additions over the node to effectuate compare, select, add operation order on the predecessor survivor metrics terminating in that node, to compare the metrics of the predecessor sequences terminating in the node, to select a survivor sequence, and to add the shifted branch metrics to the metric of the selected survivor sequence.

Method and means for detecting partial response waveforms using a

A divide circuit having bit level pipeline capability uses an array of bit level carry save adders with each carry save adder having a corresponding absolute value bit level circuit. In one or two's complement notation, the carry save adders subtract the binary values supplied thereto and generates an intermediate binary signal which is supplied to the absolute value circuit. The absolute value circuit determines the absolute value of the binary number supplied thereto. The circuit performs division in accordance with the following algorithm: Q.sub.w 1 I=W-1 to 0 N=N-D S=Signbit (N) Q.sub.I =S (EXOR) Q.sub.I+1 N=.vertline.N.vertline. D=D/2 END A recursive divide circuit employing an array of carry save adders and absolute value bit level circuits achieves full pipeline bit level capability.

Bit level pipeline divide circuit and method therefor

A multiply and divide circuit having full bit level pipeline capability uses an array of bit level carry-save adders with each carry-save bit adder having a corresponding absolute value bit circuit. In one or two's complement notation, the carry-save adders subtract the binary values supplied thereto and generate an intermediate binary signal which is supplied to the absolute value circuit. The absolute value circuit determines the absolute value of the binary numbers supplied thereto. In one mode of operation, the circuit can be used to perform division. In another mode of operation, the circuit can be used to perform multiply and accumulate operation, again with bit level pipeline capability.

Growing community of inventors

Berkeley, CA, United States of America

Gerhard P Fettweis