The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Sep. 05, 2000
Filed:
Aug. 07, 1998
Douglas J Rhodes, Long Valley, NJ (US);
Mark Ernest Thierbach, South Whitehall Township, Lehigh County, PA (US);
Larry R Tate, South Barrington, IL (US);
Lucent Technology Inc., Murray Hill, NJ (US);
Abstract
A non-aligned double word fetch buffer is integrated into a digital signal processor to handle non-aligned double word (32 bit) fetches. When a misaligned double word fetch is detected, the buffer causes a two cycle non-interruptable instruction to be initiated. The first cycle is a 16-bit misaligned data fetch. The address pointer is incremented by 2 and stored in a temporary pointer register. The second cycle is a 32-bit double word fetch based on the temporary pointer with its least significant bit set to 0 (an aligned fetch). The low word from this fetch is used to satisfy the current misaligned double word fetch and the high word is stored in a temporary buffer register in case it proves useful in subsequent misaligned double fetch instructions. Finally, the temporary address pointer is incremented by 2 for possible use in subsequent misaligned fetches. If a subsequent misaligned fetch using the same address pointer is detected, a one-cycle misaligned double word fetch may be simulated by using the buffered memory fetch data combined with another aligned double word fetch and an appropriate pointer update. A double word per cycle data rate may thereby be maintained during an entire sequence of misaligned data fetches, except when processing the first state of the loop, during which time the buffer is set up.