Method and apparatus for selecting a most signficant priority number for a device using a partitioned priority index table
First Claim
Patent Images
1. A digital signal processor, comprising:
- a content addressable memory (CAM) array for storing entries;
a partitioned priority index table having a plurality of rows and columns of priority blocks, the priority blocks of each row for storing a respective portion of a priority number associated with an entry in the CAM array and each column having compare logic coupled to each of the priority blocks in its respective column; and
an encoder coupled to the partitioned priority index table.
13 Assignments
0 Petitions
Accused Products
Abstract
A digital signal processor. The digital signal processor includes a content addressable memory (CAM) array for storing entries. The digital signal processor includes a partitioned priority index table having a plurality of rows and columns of priority blocks. Each row of the plurality of rows of priority blocks is capable of storing a priority number associated with an entry in the CAM array. Each column of the plurality of columns of priority blocks has compare logic coupled to each of the priority blocks in its respective column. The digital signal processor includes an encoder coupled to the partitioned priority index table.
83 Citations
34 Claims
-
1. A digital signal processor, comprising:
-
a content addressable memory (CAM) array for storing entries; a partitioned priority index table having a plurality of rows and columns of priority blocks, the priority blocks of each row for storing a respective portion of a priority number associated with an entry in the CAM array and each column having compare logic coupled to each of the priority blocks in its respective column; and an encoder coupled to the partitioned priority index table. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A partitioned priority index table, comprising:
-
a first row of priority blocks for storing a first plurality of priority numbers, each priority number from the first plurality of priority numbers having bits distributed within at least two of the priority blocks in the first row; a second row of priority blocks that stores a second plurality of priority numbers, each priority number from the second plurality of priority numbers having bits distributed within at least two of the priority blocks in the second row; a first compare logic circuit that determines a most significant block priority number (MSBPN) for a first column of priority blocks from a first block priority number (BPN) from a first priority block in the first row and a BPN from a second priority block in the second row; and a second compare logic circuit that determines a MSBPN for a second column of priority blocks from a BPN from a third priority block in the first row and a BPN from a fourth priority block in the second row. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A partitioned priority index table having a plurality of rows and columns of priority blocks, comprising:
-
a first priority block in a first row that compares a first plurality of bits of a first plurality of priority numbers including a first priority number having bits distributed in at least two priority blocks in the first row and determines a block priority number (BPN) for the first priority block; a second priority block in a second row that compares a second plurality of bits of a second plurality of priority numbers including a second priority number having bits distributed in at least two priority blocks in the second row and determines a BPN for the second priority block; a first compare logic circuit that determines a most significant block priority number (MSBPN) for a first column from a plurality of BPNs including, at least, the BPNs for the first and second priority blocks; a third priority block in the first row that compares a second plurality of bits of the first plurality of priority numbers and determines a BPN for the third priority block; a fourth priority block in the second row that compares a second plurality of bits of the second plurality of priority numbers and determines a BPN for the fourth priority block; and a second compare logic circuit that determines a MSBPN for the second column from a plurality of BPNs including, at least, the BPNs for the third and fourth priority blocks. - View Dependent Claims (20, 21, 22, 23, 24)
-
-
25. A method for selecting a most significant priority number for a device, comprising:
-
determining a first block priority number (BPN) from a first plurality of bits from a first plurality of priority numbers; determining a second BPN from a first plurality of bits from a second plurality of priority numbers; and determining a most significant block priority number (MSBPN) for a first column from the first and second BPNs, wherein the first plurality of priority numbers includes a first priority number having bits distributed within at least two priority blocks in a same row. - View Dependent Claims (26, 27, 28, 29, 30, 31)
-
-
32. A partitioned priority index table, comprising:
-
a first row of priority blocks that stores a first plurality of priority numbers, each of the first plurality of priority number having bits in at least two of the priority blocks in the first row; a second row of priority blocks that stores a second plurality of priority numbers, each of the second plurality numbers having bits in at least two of the priority blocks in the second row; means for determining a most significant block priority number (MSPBN) for a first column of priority blocks from a first block priority number (BPN) from a first priority block in the first row and a BPN from a second priority block in the second row; and means for determining a MSBPN for a second column of priority blocks from a BPN from a third priority block in the first row and a BPN from a fourth priority block in the second row. - View Dependent Claims (33, 34)
-
Specification