Technique for obtaining checksum in a fast fourier transformatio

Details Technique for obtaining checksum in a fast fourier transformatio Technique for obtaining checksum in a fast fourier transformatio

1997-12-23

1999-11-30

Patel, Ajit

Multiplex communications

Generalized orthogonal or special mathematical techniques

Fourier transform

370388, 714746, H04J 1100

Patent

active

059954841

ABSTRACT:
A technique for obtaining checksum in an FFT network composed of N stage modules includes: an adder-multiplier and a first adder respectively connected to two inputs of each stage module, a second and a third adder respectively connected to two outputs of each stage module, a first comparator for comparing the outputs of the first and second adders, and a second comparator for comparing the outputs of the adder-multiplier and third adder, the checksum being calculated at every stage to detect defects.

REFERENCES:
patent: 4964126 (1990-10-01), Musicus et al.
patent: 4977533 (1990-12-01), Miyabayashi et al.
patent: 5091875 (1992-02-01), Wong et al.
patent: 5247524 (1993-09-01), Callon
patent: 5297070 (1994-03-01), Hua et al.
patent: 5481488 (1996-01-01), Luo et al.
patent: 5491652 (1996-02-01), Luo et al.
patent: 5500864 (1996-03-01), Gonia et al.
patent: 5663952 (1997-09-01), Gentry, Jr.

Affiliated with

Also associated with

Rating

Technique for obtaining checksum in a fast fourier transformatio does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Technique for obtaining checksum in a fast fourier transformatio, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Technique for obtaining checksum in a fast fourier transformatio will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1682359