Time-recursive lattice structure for IFFT in DMT application

Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

06985919

ABSTRACT:
The present invention may significantly reduce the number of iteration of the time recursive IFFT structure. First, the real and imaginary part of the input signal are modified based on the symmetric and anti-symmetric. Then, they are mixed together by an adder and fed into the lattice module. Next, an IFFT is performed on the modified input data sequence to generate a transformed sequence. Through the symmetric and anti-symmetric properties, the redundant terms may be eliminated.

REFERENCES:
patent: 5633817 (1997-05-01), Verhenne et al.
patent: 6157938 (2000-12-01), Wu et al.
patent: 2003/0212722 (2003-11-01), Jain et al.
patent: 2004/0162866 (2004-08-01), Malvar
“An Improved Time-Recursive Lattice Structure for Low-Latency IFFT Architecture in DMT Transmitter” by Chi-Li Yu, Dept. of Electrical Engineering , National Central University, Taiwan and An-Yeu Wu, Dept. of Electrical Engineering, National Taiwan University, Taiwan, pp. IV-250-253.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Time-recursive lattice structure for IFFT in DMT application does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Time-recursive lattice structure for IFFT in DMT application, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time-recursive lattice structure for IFFT in DMT application will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3603516

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.