Error-correcting code interleaver

Error detection/correction and fault detection/recovery – Pulse or data error handling – Data formatting to improve error detection correction...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S788000

Reexamination Certificate

active

06839870

ABSTRACT:
Memory may be partitioned into ever-sliding FIFOs. Each of the FIFOs may be stacked end-to-end in memory with the oldest data at the base offset and the newest at the end (or vice-virsa). Each symbol, the pointer may be incremented (modulo the set size) by an appropriate amount (typically J more than for the previous symbol). After each set, the pointers may be incremented by J more than the previous increment and the process starts over, wrapping around the memory if the end of the memory is reached. After a preset number of symbols, the process may restart from an increment of J. Alternatively, the pointers may be decremented rather than incremented. Thus, the newest symbol cannibalizes the memory position vacated by the oldest symbol in the current FIFO, causing the FIFOs to “slide”, providing for a very efficient and reliable use of memory for error-correcting code interleaving.

REFERENCES:
patent: 5764649 (1998-06-01), Tong
patent: 6536001 (2003-03-01), Cai et al.
patent: 20030023909 (2003-01-01), Ikeda et al.

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

Error-correcting code interleaver does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Error-correcting code interleaver, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error-correcting code interleaver will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3372551

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