Reconfigurable priority encoding

Electronic digital logic circuitry – Multifunctional or programmable – Having details of setting or programming of interconnections...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C326S105000

Reexamination Certificate

active

06621295

ABSTRACT:

FIELD OF THE INVENTION
The present invention generally relates to priority encoders, and more particularly to a reconfigurable priority encoder.
BACKGROUND
Some content addressable memory (CAM) arrangements include a “priority encoder” circuit. The priority encoder circuit determines, for input data that match multiple entries in the CAM, which entry has the highest priority. The priority of entries in the CAM is generally predefined by the system designer.
Priority encoders generally implement the priority either implicitly or explicitly. Implicit priority uses the physical locations of CAM entries to denote priority. For example, the entry at address
0
has higher priority than the entry at address
1
, the entry at address
1
has higher priority than the entry at address
2
, and so on. Explicit priority involves codes that are associated with the CAM entries to designate the relative priorities.
Because implicit priority relies on the physical position to denote priority, determining which of multiple matching entries is the highest priority is fast and requires minimal logic. However, adding a new CAM entry involves finding an insertion point in the CAM for the new entry and shifting all lower priority entries to make room for the new entry.
Because explicit priority relies on associated codes to designate priority, new entries can be easily added to the CAM. However, determining which of multiple matching entries is the highest priority is more complex and slower in an explicit priority arrangement than in an implicit priority arrangement. The explicit priority arrangement must sort matching entries, which adds logic and introduces latency.
A system and method that address the aforementioned problems, as well as other related problems, are therefore desirable.
SUMMARY OF THE INVENTION
The invention provides a reconfigurable priority encoding for identifying, from a plurality of input signals, a highest priority signal that is in a selected state. A priority routing block is implemented on a programmable logic device (PLD). The routing block has a plurality of input ports arranged to receive the respective input signals and a plurality of output ports respectively coupled to the input ports. A priority encoder is also implemented on the PLD and has input ports respectively coupled to the output ports of the priority routing block. Each input port has a priority relative to others of the input ports. The priority encoder is configured to generate an address signal that identifies the input signal having a highest priority and that is in the selected state.
It will be appreciated that various other embodiments are set forth in the Detailed Description and Claims which follow.


REFERENCES:
patent: 4831573 (1989-05-01), Norman
patent: 6081914 (2000-06-01), Chaudhary
patent: 6329838 (2001-12-01), Hayakawa
Gordon Brebner and Adam Donlin; “Runtime Reconfigurable Routing”; published in 5th Reconfigurable Architectures Workshop; Orlando, Florida; Mar. 30, 1998; pp. 1-10.
Eric Keller; “JRoute: A Run-Time Routing API for FPGA Hardware”; published in 7th Reconfigurable Archietectures Workshop; Cancun, Mexico, May 1, 2000; pp. 1-8.

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

Reconfigurable priority encoding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reconfigurable priority encoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reconfigurable priority encoding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3070174

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