This invention relates to digital signal processing (“DSP”) circuitry, and more particularly to arrays of DSP circuit modules or blocks that can optionally work together to perform DSP operations of greater complexity and/or greater mathematical or arithmetic precision, and that when thus needed to work together, can accommodate the possibility that a circuit defect may make a DSP block unusable.
Various circumstances may call for an integrated circuit to be fabricated with multiple instances of blocks or modules of DSP circuitry. An example of such an integrated circuit is a programmable logic device (“PLD”) or a field-programmable gate array (“FPGA”). Such a device may have a plurality of rows of various kinds of circuitry, such as relatively general-purpose programmable logic. Each such row may also include a block of DSP circuitry (i.e., circuitry that is hard-wired to at least some degree to perform a particular DSP function or a particular set of DSP functions). It can be desirable in such a situation to size the DSP blocks so that they fit within the (row) boundaries of the other circuitry in the row. This may mean that a DSP block is too small, by itself, to perform some DSP functions that it may be desired for the integrated circuit to perform. In such cases it would be desirable to facilitate optional “stitching together” of multiple DSP blocks in various ways so that larger DSP functions can be efficiently performed in two or more DSP blocks. However, a countervailing concern may be that if any portion of the circuitry associated with DSP blocks that need to be stitched together is not usable (e.g., because of a manufacturing defect in the integrated circuit), that can make it much more difficult or impossible to stitch together those DSP blocks. This may greatly increase the chances that a partly defective integrated circuit cannot be used at all.
In accordance with certain possible aspects of the present invention, DSP circuit blocks are provided that can more easily work together to perform larger (e.g., more complex and/or more arithmetically precise) DSP operations if desired. For example, such DSP blocks may include routing circuitry for optionally or selectively routing signals to other DSP blocks on either side of each block.
In accordance with other possible aspects of the invention, the inter-DSP-block routing circuitry may also include redundancy capability that enables an outbound signal to go to either of two other DSP blocks to one side of each DSP block, and that enables an inbound signal to come from either of two DSP blocks to one side of each DSP block. If some DSP block that it is desired to stitch to another DSP block cannot be used (e.g., because of a circuit defect), this redundancy capability allows the stitching together of DSP blocks to take place by effectively skipping over the defective DSP block.
In accordance with still other possible features of the disclosure, a DSP circuit block may include two multiplier circuits (“multipliers”). These multipliers may operate independently or at least partly independently of one another in various ways. Alternatively, these multipliers may operate together in various ways. One of these multipliers may have some optionally usable extended capabilities that can facilitate using the two multipliers together to perform one multiplication that is significantly larger than the base multiplication performable by either multiplier alone.
In accordance with yet other possible features of the disclosure, a DSP block may include systolic registers at various points in the circuitry to help the DSP block perform functions of a systolic form, finite-impulse-response (“FIR”), digital filter.
Further features of the invention, its nature and various advantages, will be more apparent from the accompanying drawings and the following detailed description.
A representative portion of an illustrative embodiment of an integrated circuit (“IC” or “device”) 10 in accordance with the invention is shown in
Each row RN includes a block of digital signal processing or DSP circuitry 100. Each row RN also includes areas of other circuitry 20 to the left and right of the DSP block in that row. That other circuitry 20 may include such components as logic circuitry and interconnection conductors for conveying signals to and from that row's DSP block, and also to, from, and between that row's logic and other circuitry, as well as between the rows. Various aspects of some or all of this circuitry may be programmable, e.g., to enable a generic device 10 to be put to any of several different uses. For example, although the circuitry of DSP blocks 100 is typically hard-wired to some extent to perform certain DSP functions, that circuitry may also be programmable to some extent so that certain aspects of the DSP operations performed can be varied by different users of the device to meet each user's particular needs and requirements. Such programming may be the result of storing control data in memory cells on the integrated circuit, blowing fuses on the integrated circuit, mask programming the integrated circuit, or any other suitable programming technique or technology.
Device 10 may be constructed so that the rows are redundant. This means, for example, that each row RN is identical or substantially identical to all other rows. In addition, device 10 may be constructed so that if any row RN is defective, the row immediately above or below that row can effectively take the place of the defective row. In addition, all other rows above or below the row that is effectively taking the place of the defective row effectively replace other adjacent rows. In this way, many devices 10 that are inadvertently manufactured with some defective circuitry can still be used, which significantly increases the yield of the manufacturing process.
In accordance with the present invention, a DSP block 100 can extend its functionality by sending certain signals to and/or receiving certain signals from an adjacent DSP block or blocks. These are relatively direct connections between adjacent DSP blocks 100. These inter-DSP-block connections do not rely on other, more general, interconnection resources of device 10 such as the interconnection resources that form part of circuitry 20. Rather, these inter-DSP-block connections go directly from one DSP block 100 to another adjacent DSP block 100, subject only to the possibility that the redundancy circuitry that will now be described may be employed to allow these inter-DSP-block signals to effectively “jump over” a row that has been taken out of service due to one or more defects in that row.
Considering representative row R7 as an example, a signal that needs to go (in accordance with this invention) from the DSP block 100 in row R7 to another DSP block may originate at node A in the row R7 DSP block. This signal is applied to one selectable input terminal of the multiplexer circuitry (“mux”) 110 in that DSP block, and also to one selectable input terminal of the similar mux 110 in the DSP block 100 in the row R6 above row R7. The output signal of mux 110 in row R7 goes to a destination in the DSP block 100 in row R6. The output of mux 110 in row R6 goes to a destination in the DSP block 100 in row R5. If row R6 is not defective and is therefore in use, the mux 110 in row R7 is controlled to select the signal from node A for application to row R6. But if row R6 is defective and is therefore effectively cut out of the circuitry of device 10, then mux 110 in row R6 is controlled to select the signal from node A for application to row R5. This example shows how redundancy muxes 110 can be used to apply a signal from the DSP block 100 in any row to the DSP block 100 in the row immediately above or to the DSP block 100 two rows above the source row.
Redundancy muxes 120 can be used similarly to route a signal from any DSP block 100 to either the DSP block 100 immediately below or the DSP block 100 two rows below. For example, a signal that originates at node B in the DSP block 100 in row R5 is applied to one selectable input of the muxes 120 in each of rows R6 and R7. If row R6 is in use, the mux 120 in row R6 is controlled to apply the signal from node B to the destination in row R6. On the other hand, if row R6 is not in use, then the mux 120 in row R7 is controlled to apply the signal from node B to the destination in row R7.
A point to be made in connection with
A possible consequence of making the height of each DSP block 100 the same as the height of other circuitry 20 in a row is that it tends to force the size or functional capacity of each DSP block to be commensurate with the size and capacity of the adjacent other circuitry 20 in the row that includes that DSP block. For example, a DSP block 100 may only be able to get a certain number of input signals from the adjacent circuitry 20 in the row that includes that DSP block. This may limit the number and/or size of the DSP operations (e.g., multiplications) the DSP block can perform. However, some users of device 10 may want to perform larger multiplications than can be performed in one such limited DSP block. The present invention therefore provides for extending the multiplication and other capacities of one DSP block 100 by, for example, allowing some portions or aspects of a large multiplication and/or other DSP operation to be performed in another adjacent DSP block 100. In accordance with the present invention, this is done by sending signals substantially directly between adjacent DSP blocks via redundancy circuitry like that shown in general at 110 and 120 in
Turning now to the basic structure of representative DSP block 100 as shown in either
The next element in representative DSP block 100 is four-to-two (“4-2”) compressor circuit 210. Compressor 210 can combine the two sum and carry signal vectors it receives from each of shifter 202 and multiplier 200b (i.e., a total of four such signal vectors) down to two such signal vectors. Because the vectors from shifter 202 may be increased in numerical significance by 18 bit positions, the “width” of compressor 210 needs to be increased to 57 bits. Hence compressor 210 is shown having 57 bit positions (i.e., [57:1]).
The sum and carry vectors output by compressor 210 (each vector possibly including as many as 57 bits) are applied to muxes 220a and 220b, and also to controllable shifter circuit 230. Mux circuitry 220a can select any one of various 38-bit subsets of the 57-bit signal vectors output by compressor 210 for application to an adjacent DSP block to the left as viewed in
Controllable shifter 230 can shift bits applied to it by 18 bits to the left (thereby increasing the numerical significance of those bits), or by 18 bits to the right (thereby decreasing the numerical significance of those bits). As a third alternative, shifter 230 may apply no shift to the data applied to it. All of elements 220 and 230 may be controlled by programmable fuse or memory circuit elements like 130 in
Note that in order to exit the representative DSP block 100 shown in
Muxes 232 receive 38-bit sum and carry vectors from redundancy muxes 120a and 120b. Again, redundancy muxes 120a and 120b are specific instances of the type of redundancy muxes that are shown more generally or generically at 120 in
The next element in the representative DSP block 100 shown in
The 38-bit sum and carry vectors output by compressor 240 are applied to three-to-two (“3-2”) compressor circuit 250. The final product output by an adjacent DSP block 100 can also be applied to 3-2 compressor 250 via redundancy muxes 120d and 120e and muxes 248. Again, this inter-DSP-block routing feature can be used when certain more complex DSP operations are to be performed. The arrangement and use of muxes 120d and 120e are similar to the arrangement and use of other such muxes like 120a and 120b. Thus the solid line inputs to muxes 120d and 120e come from the primary outputs of the carry-propagate adder (CPA) circuit 260 in the DSP block 100 above (
In addition to being substantially directly routable back to muxes 248 in another adjacent DSP block 100, the final, up-to-38-bit signal product output by CPA 260 is typically applied to the other circuitry 20 in the row RN that includes representative DSP block 100 as shown in
We turn now to considering examples of the various operating modes that one or more DSP blocks 100 can support.
A. 18×18 and 18×18 Complex
Relatively simple modes like 18×18 multiplication and 18×18 complex multiplication (e.g., (a+bi)×(c+di)) can be done within one DSP block 100. For example, either multiplier 200 can be used to form sum and carry signal vectors from an 18×18 multiplication, and those vectors can be passed down through subsequent components to CPA 260, which forms the final product of the multiplication.
B. Sum of Four 18×18
The sum of the products of four 18×18 multiplications can be formed using two adjacent DSP blocks. (“Adjacent” means immediately adjacent if there is no intervening row that has been taken out of service by operation of the redundancy circuitry; or, alternatively, adjacent but for such an intervening out-of-service row.) In discussions such as the following, each letter such as A, B, C, etc., denotes or represents an 18-bit input, and each letter pair like AB, CD, etc., is the multiplication result for a multiplication of the two 18-bit inputs identified by the letters in that pair. Such a letter pair may represent either intermediate sum and carry vectors for such a multiplication result, or the final multiplication product. Thus AB+CD+EF+GH is the sum of four products of eight, paired, 18-bit inputs.
Multiplier 200a in a first DSP block 100 may be used to form AB. Multiplier 200b in that DSP block may be used to form CD. Compressor 210 in the first DSP block forms AB+CD. Muxes 220b can be used to route AB+CD to muxes 232 and compressor 240 in the adjacent DSP block 100. Multiplier 200a in the adjacent DSP block can be used to form EF. Multiplier 200b in that adjacent block can be used to form GH. Compressor 210 in that adjacent block forms EF+GH. Compressor 240 in that adjacent block forms AB+CD+EF+GH, which CPA 260 in that same block outputs in final product form. Note that the block forming AB+CD can be a block to either side of the block forming EF+GH and AB+CD+EF+GH.
C. Sum of Two 36×18
In discussions such as the following, letters like A, B, C, etc., have the same meaning as before; letter pairs like AC, BC, etc., have the same meaning as before; letter pairs like (A,B) denote 36-bit data words in which the letter on the left refers to the 18 more significant bits, and the letter on the right refers to the 18 less significant bits; and letter combinations like (A,B)*C denote the multiplication result for a multiplication of a 36-bit data word (e.g., (A,B)) multiplied by an 18-bit data word (e.g., C). Thus the objective of the mode being discussed here is to produce (A,B)*C+(D,E)*F.
More particularly, in block 100a, shifter 230 is used to shift the outputs of compressor 210 18 bit positions to the right so that the more significant outputs of compressor 210 that are not transferred to block 100b are shifted to the less significant portion of compressor 240 in block 100a. In block 100b shifter 230 shifts the data from compressor 210 18 bit positions to the left, and the data passing through mux circuitry 232 in block 100b is applied to the more significant inputs to compressor 240 that are associated with that mux circuitry 232. The compressor 240 in block 100b is thus able to begin finishing the addition shown to the right of the dotted line in Part 3 of
The data output by each of compressors 240 flows through the respectively associated compressor 250 to the respectively associated carry-propagate adder (“CPA”) 260, where the final sum-out data for (A,B)*C+(D,E)*F is produced. Again, any carry overflow from the most significant end of CPA 260 in block 100b is applied (as a carry in) to the least significant end of CPA 260 in block 100a via mux 262 in block 100a. This again enables both of CPAs 260 to effectively operate together as one much longer CPA. Thus block 100a outputs the 18 more significant bits of final product (A,B)*C+(D,E)*F, while block 100b outputs the 36 less significant bits of that final product.
D. 36×36 Mode Using Two DSP Blocks
In discussions such as the following, letter pairs like (A,B) again denote a 36-bit data word in which the letter on the left refers to the 18 more significant bits, and the letter on the right refers to the 18 less significant bits. Letter pairs like BD also have basically the same meaning as before (although now such a letter pair typically refers to the product of two 18-bit portions of two different 36-bit data words). Thus the objective of the work being discussed in this section is to produce the product of (A,B) and (C,D), or (A,B)*(C,D).
Two adjacent DSP blocks 100 can be used to perform the arithmetic functions illustrated by
As shown in
The 18 least significant bits output by the compressor 210 in DSP block 100a are routed via elements 220b in block 100a and 232 in block 100b to compressor 240 in block 100b, where these bits are routed to the more significant end of the associated compressor 240 inputs. (Dotted line 213 highlights this routing.) The 18 most significant bits output by compressor 210 in DSP block 100b are routed via elements 220a in block 100b and 232 in block 100a to compressor 240 in block 100a, where these bits are routed to the less significant end of the associated compressor inputs. (Dotted line 215 highlights this routing.) Shifter 230 in DSP block 100a shifts the data output by compressor 210 in that block 18 bits to the right to prevent the less significant bits that have been transferred from block 100a to block 100b from also being applied to compressor 240 in block 100a. Shifter 230 in DSP block 100b shifts the data output by compressor 210 in that block 18 bits to the left in order to prevent the more significant bits that have been transferred from block 100b to block 100a from also being applied to compressor 240 in block 100b.
Compressors 240 in DSP blocks 100a and 100b work together to add the partial product information applied to them (with element 242 in block 100a applying any overflow from the highest-order (most-significant) bit position in compressor 240 in block 100b to the lowest-order (least-significant) bit position in compressor 240 in block 100a). Compressor 240 in block 100a is thus beginning to form the result of addition of data to the left of the vertical dotted line in Part 2 of
The data output by each of compressors 240 flows through the respective compressor 250 to the respective carry-propagate adder (“CPA”) 260. Again, element 262 in block 100a applies any carry out from the most significant end of CPA 260 in block 100b to the least significant end of CPA 260 in block 100a. The final outputs of these two CPAs 260 collectively comprise the final product (A,B)*(C,D), with the outputs of CPA 260 in block 100a constituting the more significant bits of that final product, and with the outputs of CPA 260 in block 100b constituting the less significant bits of that final product.
E. 54×54 Mode Using Four DSP Blocks
Another example of how DSP blocks 100 in accordance with this invention can be used is illustrated by
Considering
Turning now to Part 3 of
Multipliers 200a and 200b in DSP block 100c form partial products AF and DC, respectively. Compressor 210 in block 100c adds these two partial products together. Multipliers 200a and 200b in DSP block 100d form partial products BF and EC, and the compressor 210 in that block adds these two partial products together. Routing 220a in block 100d and 232 in block 100c applies the 18 more significant bits output by compressor 210 in block 100d to the less significant end of compressor 240 in block 100c. Shifter 230 in block 100d shifts the outputs of the compressor 210 in that block 18 bit positions to the left. Compressor 240 in block 100c compresses the four vectors applied to it down to two vectors, which flow down through the compressor 250 in that block to the CPA 260 in that block. (This is basically the final addition work required to the left of the dotted line in Part 3 of
Recapitulating some aspects of the foregoing, and also in some respects extending what has been said, a digital signal processing (“DSP”) block (e.g., 100) may include first and second N-bit (e.g., 18-bit) multiplier circuits (e.g., 200a and 200b). The DSP block may further include first shifter circuitry (e.g., 202) for shifting outputs of the first multiplier circuit by a selectable one of (1) zero bit positions and (2) N bit positions toward greater arithmetic significance. The DSP block may still further include first compressor circuitry (e.g., 210) for additively combining outputs of the first shifter circuitry and the second multiplier circuit. The DSP block may yet further include circuitry (e.g., 220a and 220b) for selectively routing outputs of the first compressor circuitry to first and second other DSP circuit blocks that are on respective opposite sides of the DSP circuit block. The DSP block may still further include second shifter circuitry (e.g., 230) for shifting outputs of the first compressor circuitry by a selectable one of (1) zero bit positions, (2) N bit positions toward greater arithmetic significance, and (3) N bit positions toward lesser arithmetic significance. The DSP block may yet further include second compressor circuitry (e.g., 240) for additively combining any outputs received from the first compressor circuitry in either of the first and second other DSP circuit blocks.
In a DSP circuit block as described above, the routing circuitry (e.g., 220a and/or 220b) may be controllable to select for routing any one of a plurality of subsets of the outputs of the first compressor circuitry (e.g., 210). These selectable subsets may include (1) a subset including a most significant output bit position of the first compressor circuitry, and (2) a subset including a least significant output bit position of the first compressor circuitry.
In a DSP circuit block as described above the second compressor circuitry (e.g., 240) may include overflow output circuitry (e.g., output leads from most significant end of compressor 240 to adjacent DSP block) for applying overflow output signals of the second compressor circuitry to the first other DSP circuit block, and overflow input circuitry (e.g., 242) for selectively receiving overflow output signals of the second compressor circuitry in the second other DSP circuit block.
A DSP circuit block as described above may further include third compressor circuitry (e.g., 250) for additively combining outputs of the second compressor circuitry and any further outputs received from the second other DSP circuit block, and further routing circuitry (e.g., 248) for selectively routing outputs of the third compressor circuitry, as further outputs, to the first other DSP circuit block. In such a DSP circuit block, the third compressor circuitry (e.g., 250) may comprise overflow output circuitry (e.g., output leads from most significant end of compressor 250 to adjacent DSP block) for applying overflow output signals of the third compressor circuitry to the first other DSP circuit block, and overflow input circuitry (e.g., 252) for selectively receiving overflow output signals of the third compressor circuitry in the second other DSP circuit block.
In a DSP circuit that includes the above-mentioned further routing circuitry (e.g., 248), that further routing circuitry may include carry-propagate adder (“CPA”) circuitry (e.g., 260) for operating on the outputs of the third compressor circuitry (e.g., 250) to produce the further outputs. The CPA circuitry may include carry-out circuitry (e.g., output lead from most significant end of CPA 260 to adjacent DSP block) for applying a carry out signal of the CPA circuitry to the first other DSP circuit block, and carry-in circuitry (e.g., 262) for selectively receiving a carry out signal of the CPA circuitry in the second other DSP circuit block.
A DSP circuit block as described above may further include redundancy circuitry (e.g., 110 and/or 120) for allowing the first other DSP circuit block to be a selectable one of (1) another DSP circuit block that is immediately adjacent to the DSP circuit block, and (2) yet another DSP circuit block that is not immediately adjacent to the DSP circuit block. For example, if the DSP circuit block is in row R7 in
A DSP circuit block as described above may also include further redundancy circuitry (e.g., 110 and/or 120) for allowing the second other DSP circuit block to be a selectable one of (1) still another DSP circuit block that is immediately adjacent to the DSP circuit block, and (2) still a further other DSP circuit block that is not immediately adjacent to the DSP circuit block. For example, if the DSP circuit block is in row R7 in
In accordance with other possible aspects of the invention, DSP circuitry (e.g., 10) may comprise a plurality of DSP circuit blocks (e.g., 100), each of which is capable of performing DSP operations (e.g., 200, 202, 210, 230, 240, etc.) on signals applied to that circuit block (e.g., A, B, C, etc.), each of the DSP circuit blocks may include circuitry (e.g., 220, 232, 242, etc.) for selectively routing outputs of at least some of the DSP operations to first and second other ones of the DSP circuit blocks that are on respective opposite sides of the DSP circuit block. In such cases, the circuitry for selectively routing may include redundancy circuitry (e.g., 110 and/or 120) for allowing the first other DSP circuit block for a DSP circuit block to be a selectable one of (1) another DSP circuit block that is immediately adjacent to that DSP circuit block, and (2) yet another DSP circuit block that is not immediately adjacent to that DSP circuit block. For example, if the DSP circuit block is in row R7 in
The circuitry for selectively routing in DSP circuitry as described above may further include further redundancy circuitry (e.g., 110 and/or 120) for allowing the second other DSP circuit block for a DSP circuit block to be a selectable one of (1) still another DSP circuit block that is immediately adjacent to that DSP circuit block, and (2) still a further other DSP circuit block that is not immediately adjacent to that DSP circuit block. For example, if the DSP circuit block is in row R7 in
In DSP circuitry as described above, the circuitry for selectively routing of each of the DSP circuit blocks may selectively route the outputs to inputs of the first and second other ones of the DSP circuit blocks that are downstream from some but not all DSP operations that the first and second other ones of the DSP circuit blocks are capable of performing. For example, selective routing circuitry 220 can route outputs of compressor 210 in one DSP block to inputs of a compressor 240 in another DSP block, and compressor 240 is downstream from some (but not all) other DSP operations in the other DSP block (e.g., it is downstream from operations 200, 202, 210, and 230, but it is upstream from operations 250 and 260).
In accordance with still other possible aspects of the invention, DSP circuitry (e.g., 10) may include a plurality of DSP circuit blocks (e.g., 100), each of which is capable of performing a plurality of DSP operations (e.g., 200, 202, 210, 230, 240, etc.) one after another in succession. Each of the DSP circuit blocks may further include circuitry (e.g., 220) for selectively routing outputs of at least one of the DSP operations (e.g., 210) of that DSP circuit block to first and second other ones of the DSP circuit block that are on respective opposite sides of that DSP circuit block. The circuitry for selectively routing in each DSP circuit block may selectively route at least some of the outputs to inputs to DSP operations in the first and second other DSP circuit blocks that are intermediate in the succession of DSP operations in those other DSP circuit blocks. For example, routing circuitry 220 can route outputs of a DSP block to inputs of compressor 240 in another DSP block, and compressor 240 is intermediate in the succession of DSP operations (i.e., it is preceded by DSP operations like 200 and 202, and it is followed by DSP operations like 250 and 260).
In DSP circuitry as described above, at least some of the inputs may be inputs to DSP operations at a different point in the succession in the DSP blocks than the point in the succession in the DSP circuit block from which the circuitry for selectively routing received the outputs selectively routed to those at least some inputs. For example, compressor 210, from which routing elements 220 get outputs to apply to compressor 240 in another DSP block, is at a different point in the succession of DSP operations in the first-mentioned DSP block than the point at which compressor 240 is in the succession of DSP operations in the second-mentioned DSP block.
In DSP circuitry as described above, each DSP circuit block may further include second circuitry (e.g., the lead from the most significant end of compressor 240 to an adjacent DSP block) for selectively routing a second output of a DSP operation in that DSP circuit block to an input of a same DSP operation in the first other DSP circuit block. For example, the immediately above-mentioned lead and element 242 allows overflow signals to go from the compressor 240 in one DSP block to the compressor 240 in another DSP block.
In DSP circuitry as described above, each DSP circuit block may further include third circuitry (e.g., 248) for selectively routing outputs of a final DSP operation (e.g., 260) in that DSP circuit block to inputs to a DSP operation (e.g., 250) in the first other DSP circuit that is at an intermediate point in the succession in that other DSP circuit block.
DSP circuitry as described above may further include redundancy circuitry (e.g., 110 and/or 120) for allowing the first other DSP circuit block of each of the DSP circuit blocks to be a selectable one of (1) another of the DSP circuit blocks that is immediately adjacent to the DSP circuit block, and (2) yet another of the DSP circuit blocks that is not immediately adjacent to the DSP circuit block. For example, if a DSP block 100 is in row R7 in
DSP circuitry as described above may also include further redundancy circuitry (e.g., 110 and/or 120) for allowing the second other DSP circuit block of each of the DSP circuit blocks to be a selectable one of (1) still another of the DSP circuit blocks that is immediately adjacent to the DSP circuit block, and (2) still a further another one of the DSP circuit blocks that is not immediately adjacent to the DSP circuit block. For example, if the DSP circuit block is in row R7 in
The circuitry of this invention allows summations to be performed by bidirectional shifting between DSP circuit blocks. For example, a value can be shifted from a first DSP block to a second DSP block to the right of the first block and combined (e.g., compressed) with another signal in the second block. The result of this combination can then be shifted back to the left (i.e., to the first block) and combined with other signals in the first block. This shifting back can occur (for example) through (1) the carry vectors from compressor to compressor (compressors 240 or compressors 250), (2) the carry bit of the CPA 260, or (3) the output of the CPA 260 to the 3-2 compressor 250.
Any of the multiplexers employed in the DSP circuitry of this invention can be of the type that can selectively (i.e., controllably) output zero (0) data. This also includes any of the controllable shifters employed herein.
Another illustrative embodiment of a DSP circuit block 500 in accordance with certain possible aspects of this disclosure is shown in
In the illustrative embodiment shown in
In the illustrative embodiment shown in
Certain inputs can be routed via an input cascade chain, if desired. For example, one set of inputs can be cascaded in from a similar DSP block 500 to the right of the depicted DSP block. Such cascade in inputs go to one selectable set of inputs to mux 515bx (see also
An example of an application of the circuitry in which the immediately above-described cascade chain may be used is implementation of a finite-impulse-response (“FIR”) digital filter. Such filters are discussed in more detail later is this specification. Here, however, it will be sufficient to note that
Circuitry 502 is pre-adder circuitry. It can add two of the dynamic inputs (e.g., ax and ay, or bx and by) together. The results of the pre-adder then go to controllable routing circuitry 503 to become two of several sets of possible inputs to the downstream multipliers (described later). Pre-adder 502 may provide a more cost-efficient and faster alternative to having the above-described addition done outside of DSP block 500. The eight possible sets of inputs to routing circuitry 503 are ax, bx, ay, by, c, d, (ax+ay), and (bx+by).
Routing circuitry 503 (see also
Although depicted like a single multiplexer (“mux”) in
From the foregoing it will be seen that circuitry 503 is preferably highly flexible routing circuitry that can connect any of its various, selectable, input signal groups (or subsets of such groups) to the various ones of its output signal groups that may need those inputs to support any of the multiplier functions that will be described later in this disclosure.
Returning to
The default condition of multipliers 505 and 506 is as two 18×18 multipliers. In general (i.e., in all modes of operation), each of multipliers 505 and 506 produces two product vectors in redundant form (e.g., one sum vector and one carry vector as described in more detail earlier for other embodiments). Thus in 18×18 mode, each multiplier 505 and 506 produces a 36-bit sum vector and a 36-bit carry vector. Circuitry downstream from multipliers 505 and 506 can be used to further process (e.g., additively combine) these vectors in various ways to produce one or more final products (or a final sum of products) as will be fully described later in this specification. Preliminarily, however, more will first be said about multiplier 505.
Multiplier 505 is modified (e.g., as compared to multiplier 506) so that, together, multipliers 505 and 506 can perform a 27×27 multiplication.
As shown in
Routing circuitry 503 routes segments x3 and x2 to one axis (e.g., the multiplicand axis or inputs) of multiplier 506. Routing circuitry 503 routes segments y3 and y2 to the other axis (e.g., the multiplier axis or inputs) of multiplier 506. Routing circuitry 503 routes segments x3, x2, and x1 to the multiplicand axis or inputs of multiplier 650a. Routing circuitry 503 routes segment y1 to the multiplier axis or inputs of multiplier 650a. Routing circuitry 503 routes segments y3 and y2 to the multiplicand axis or inputs of multiplier 650b. Routing circuitry 503 routes segment x1 to the multiplier axis or inputs of multiplier 650b. Each multiplier circuit 506, 650a, and 650b multiplies the data applied to its multiplicand axis by the data applied to its multiplier axis. (Of course, it will be understood that the multiplicand and multiplier in a multiplication are interchangeable, so it does not matter which data is supplied as, or referred to as, the multiplicand, or which data is supplied as, or referred to as, the multiplier. The terms multiplicand and multiplier are therefore used arbitrarily and interchangeably herein. Reference to some data as a multiplicand or as a multiplier is not intended to be limiting in any way, and in other embodiments the opposite terms could be employed without departing from the scope or spirit of this disclosure.) Each multiplier 506, 650a, and 650b produces a redundant form sum output vector and a redundant form carry output vector, which are collectively indicative of the multiplication product formed by that multiplier. (Again, this redundant form (i.e., sum vector and carry vector) product formation is as described earlier in this specification.)
At this point it may be helpful to interrupt the discussion of
The last major partial product that is needed for the 27×27 multiplication being considered is the partial product that results from the 18×18 multiplication shown in line 5 of
The outputs of multipliers 505 and 506 are applied to 4:2 compressor circuitry 508. This circuitry can again be similar to other compressor circuitry described earlier in this specification. Thus circuitry 508 compresses the two sum vectors and the two carry vectors applied to it down to one further sum vector and one further carry vector. These further vectors are indicative of the final product of the 27×27 multiplication being performed. In particular, these further vectors (output by compressor 508) are indicative of the result shown in line 6 of
Note that for the operations shown in
For completeness,
If rather than being kept separate, the results of the multiplications performed by multipliers 505 and 506 need to be added together, those results preferably go through compressor 508 before going to the final adder stage farther downstream. The result from multiplier 506 can be (optionally) left-shifted by 18 bit positions going through elements 507 before going into block 508. This controllably selectable left-shift option provides the flexibility of different multiplication configurations. The above-described 27×27 multiplication is one example in which compressor 508 is used to add together the results from multipliers 505 and 506, with the results from multiplier 506 first being shifted left 18 bit positions by operation of elements 507. Another example of use of compressor 508 (and elements 507) is 36×18 multiplication as will now be described beginning in the next paragraph.
Lines 1 and 2 of
If no further operations need to be performed on the outputs of compressor 508, further 4:2 compressor circuitry 510 can be bypassed/disabled, and only final, carry-propagate adder (“CPA”) circuitry 511 is enabled in order to send the final result to output register circuitry 512.
An advantage of the
In the first scenario, multiplexer circuitry 516 (controlled by CRAM circuitry 670) is used to select the result “out” through the output chaining path. (This path extends from output registers 512, through mux 680 (controlled by CRAM 682), mux 516, and mux 517c (controlled by CRAM 672c).) In this way, two or more DSP modules 500 can be chained together through the car_in/car_out connections between adjacent ones of those modules 500. For example, the module 500 on the left as viewed in
A second scenario involving use of direct, dedicated, inter-DSP-block connections like sum_in/sum_out and car_in/car_out between adjacent DSP blocks 500 is as follows. In this scenario, sum and carry vectors from element 508 in one DSP block (instead of the final result from the output chaining including the output registers 512 in that block) are connected through the sum_in/sum_out and car_in/car_out tracks between adjacent blocks 500. This again allows a DSP block 500 (e.g., like the one on the left in
Again, it will be remembered that muxes 517s and 517c (controlled by CRAM bits 672s and 672c, respectively (or possibly in tandem by one such CRAM bit)) are the so-called redundancy muxes. As just a brief reminder, these muxes allow data to flow via the sum_in/sum_out and car_in/car_out tracks from either (a) the DSP block 500 immediately adjacent a receiving DSP block 500, or (b) the DSP block 500 that is one block away from the receiving DSP block (e.g., in the event that the immediately adjacent DSP block is defective and therefore must be functionally replaced by the slightly more distant DSP block). In the representative configuration shown in
To expressly state what should already be apparent,
Returning once again to
Elements 504 and 513 are systolic delay registers. They can be used, for example, for 18-bit, systolic, finite-impulse-response (“FIR”), digital filtering applications. The principles of systolic FIR filters are described in the next several paragraphs.
FIR filters are widely used in DSP applications. The basic structure of a FIR filter is a plurality of parallel multiplications with addition of the resulting products. A FIR filter operation can be represented by the equation shown in
Circuitry 800 for implementing (in so-called direct form) the FIR filter equation shown in
Additional delay elements 812 and 822 may sometimes be referred to as systolic registers. Delay elements 812 break the otherwise long chain of adders 830 down into individual adders. Each adder 830 is therefore followed by a register 812 which registers the sum produced by that adder before passing that sum on to the next adder. This avoids having to operate the circuitry at the relatively slow speed that would otherwise be required for data to propagate all the way through a long adder chain in one operating (clock) cycle of the circuitry. Systolic filter 800′ allows a faster clock to be used because each adder 830 can complete its addition operation relatively quickly, and the result of that addition is not needed or used by the next adder until the next clock cycle. Delay elements 822 are added to keep the propagation of data samples through the data sample path synchronized with the delayed propagation of product sums through the product-sum-accumulation path.
Although systolic filter 800′ tends to have greater latency (overall delay through the filter from input x[n] to availability of the corresponding output y[n]) than a direct form filter 800 with the same number of taps (due to the additional delays 812 and 822 in filter 800′), other circuitry (e.g., on an integrated circuit with the FIR filter) can benefit greatly (in terms of operating speed) from having a faster clock signal, which filter 800′ permits the circuitry to have.
To help better relate the immediately preceding discussion of systolic FIR filters like 800′ in
Assume that each of multipliers 810 in
With the foregoing as a starting point, the chain-dotted lines 500e and 500f in
Chain-dotted line 500f surrounds the elements in
The delay performed by elements 820 and 822 in
The preceding paragraphs demonstrate how DSP blocks 500 constructed as shown, for example, in
We return now to consideration of the broader range of capabilities of DSP blocks 500. The following is a list of the major features that a single DSP block or module 500 can support:
1. Three 9×9 multiplications.
2. One 18×18 multiplication.
3. Two partial 18×18 multiplications.
4. One 27×27 multiplication.
5. One 27×27 multiplication with accumulation.
6. One 26×22 multiplication with one 25-bit pre-adder.
7. One 36×18 multiplication.
8. One sum of two 18×18 multiplications.
9. One sum of two 18×18 multiplications with accumulation.
10. One sum of two 18×18 multiplications with pre-adders.
11. One sum of square difference.
12. (a*b)+c, (a, b=18 bits each, c=36 bits).
13. One sum of two 18-bit systolic FIR filter taps.
14. One sum of two 18-bit systolic FIR filter taps with pre-adders.
In the case of three 9×9 multiplications (item 1 above), two 18×18 multipliers (blocks 505 and 506) can be configured as four 9×9 multipliers. However, the number of outputs (56) is only sufficient to support three 9×9 multiplication results (18 bits+18 bits+18 bits=54) bits). The same restriction applies to the case of two partial 18×18 multiplications (item 3) above, where only 28 bits (out of 36 bits) of the result of each 18 bit multiplication can be routed to the output (out) of the DSP module.
In the application of one 26×22 multiplication with one 25-bit pre-adder (item 6 above), the restriction comes from the number of inputs to DSP block 500. Even though DSP block 500 can support up to 27-bit multiplication, the number of dynamic inputs is only 72, which is only enough to support (25+25)*22.
One sum of square difference (item 11 above) can be implemented by enabling the pre-adders 502 and applying the results of the pre-adders to both inputs of the multipliers (505 and 506). Thus in this case the result of (ax−ay)2+(bx−by)2 can be obtained at the output.
The following is a list of features that can be supported when multiple DSP blocks or modules 500 are combined together:
a. Three 18×18 multiplications in two DSP modules.
b. Sum of four 18×18 multiplications.
c. Sum of two 27×27 multiplications.
d. Sum of two 36×18 multiplications.
e. Complex 18×18 multiplication (i.e., (a+bi)*(c+di), where a, b, c, and d are each 18 bits).
f. 36×36 multiplication.
g. 72×18 multiplication.
h. Complex 18×25 multiplication in three DSP modules (i.e., (a+bi)*(c+di), where a and b are each 18 bits, and c and d are each 25 bits).
i. Complex 27×27 multiplication (i.e., similar to item e above, except that a, b, c, and d are each 27 bits).
j. 54×54 multiplication.
k. Sum of two 18×18 multiplications with output chaining.
l. One 27×27 multiplication with output chaining.
One DSP module 500 is not sufficient to support the outputs of two 18×18 multiplications. However, two DSP modules 500 are sufficient to support the outputs of three 18×18 multiplications with one result distributed between the two modules.
For applications such as sum of two 36×18 multiplications (item d above), and 72×18 multiplication (item g above), two DSP blocks 500 are connected through the dedicated, direct, inter-module sum and carry tracks. The following discussion contains more information about how these connections work.
Line 1 of
The 18-bit portions of the data in lines 5 and 6 in
The more significant 36-bit portions of the data in lines 5 and 6 in
The more significant 18-bit sub-word y2 of the multiplier and x1 are applied to multiplier 505 in DSP block 500i for multiplication by that multiplier to produce the partial product shown in line 7 of
Compressor 508 in DSP block 500i reduces the four redundant form partial product vectors it receives from elements 505, 506, and 507 in block 500i to two redundant form vectors indicative of the sum of partial products y2*x1 and x2*y2. These two redundant form vectors from compressor 508 in DSP block 500i are applied to compressor 510 in block 500i. Compressor 510 in block 500i compresses the four redundant form vectors that it receives (two from compressor 508 in block 500i, and two from block 500h via the sum_out/sum_in and car_out/car_in tracks from block 500h to block 500i as described earlier) down to two redundant form vectors indicative of the sum of (1) partial product y2*x1, (2) partial product x2*y2, and (3) the 36 more significant bits of the sum of (a) partial product x1*y1 and (b) partial product x2*y1. The two redundant form vectors output by compressor 510 in DSP block 500i are applied to CPA 511 in block 500i, which combines those two vectors to the 54 more significant bits of the non-redundant-form (or normal form) final result shown to the left of the dotted line in line 9 of
The foregoing demonstrates how two DSP blocks 500h and 500i can be used to perform a full 36×36 multiplication, with the 18 less significant bits of the final product being output by DSP block 500h, and with the 54 more significant bits of the final product being output by DSP block 500i.
For applications such as sum of four 18×18 multiplications (items b above) and sum of two 27×27 multiplications (item c above), the result can be achieved by combining two DSP modules 500 through either the sum and carry direct, dedicated, inter-DSP-module connections (i.e., sum_out/sum_in and car_out/car_in) as illustratively shown and described above in connection with
In the illustrative embodiment shown in
It is emphasized that although
As an example of use of the circuit arrangements like those shown and emphasized in
In general (with continued reference to
Still referring to
Although FIGS. like
As another illustration of how the locations and/or order of various elements can change without departing from the scope and spirit of this disclosure, systolic register circuitry 513 can be moved to any other suitable point along the output chaining path in (e.g.)
Recapitulating some aspects of the foregoing, and also in some respects extending what has been said, a digital signal processing (“DSP”) circuit block (e.g., 500 in
A DSP circuit block as recapitulated above may further include adder circuitry (e.g., 511) for additively combining outputs of the second compressor circuitry. Such adder circuitry may comprise carry-propagate adder circuitry.
A DSP circuit block as recapitulated above may further include first register circuitry (e.g., 512) for registering outputs of the adder circuitry.
A DSP circuit block as recapitulated above may further include first, second, third, and fourth pluralities of data signal input leads (e.g., ax, ay, bx, by) for supplying inputs for processing by the multiplier circuits; and pre-adder circuitry (e.g., 502) for additively combining the inputs from at least two of the pluralities of data signal input leads.
A DSP circuit block as recapitulated above may further include circuitry (e.g., 503) for selecting outputs of the pre-adder circuitry as an alternative to inputs from at least one of the pluralities of data signal input leads for processing by at least one of the multiplier circuits.
A DSP circuit block as recapitulated above may further include selectively usable systolic register circuitry (e.g., 504p, 504q) in input data signal paths to one of the multiplier circuits.
A DSP circuit block as recapitulated above may further include selectively usable systolic register circuitry (e.g., 513) in output data signal paths for data output by the second compressor circuitry.
A DSP circuit block as recapitulated above may further include circuitry (e.g., 512) for registering signals indicative of outputs of the second compressor circuitry; and circuitry (e.g., 514) for selectively applying outputs of the circuitry for registering to inputs of the second compressor circuitry for additive combination by the second compressor circuitry with the outputs of the first compressor circuitry.
In a DSP circuit block as recapitulated above the circuitry for routing may include second shifter circuitry (e.g., 509s/509c) for shifting the outputs of the first compressor circuitry by a selectable one of (1) zero bit positions and (2) N bit positions toward lesser arithmetic significance.
In a DSP circuit block as recapitulated above the circuitry for routing may include alternative routing circuitry (e.g., SUM_IN/CAR_IN leads) for routing to the first other DSP circuit block signals output by circuitry for routing in the second other DSP circuit block.
In a DSP circuit block as recapitulated above the circuitry for routing may include alternative routing circuitry (e.g., output chaining leads) for routing to the first other DSP circuit block signals indicative of outputs of the second compressor circuitry.
In a DSP circuit block as recapitulated immediately above the alternative routing circuitry may include systolic register circuitry (e.g., 513) that is selectively usable for the signals indicative of outputs of the second compressor circuitry.
In a DSP circuit block as recapitulated above the second multiplier circuit may alternatively perform (1) a 0.5N-bit by M-bit (“0.5N×M”) multiplication (e.g., a 9×27 multiplication), and (2) a 0.5N bit by N bit (“0.5N×N”) multiplication (e.g., a 9×18 multiplication), where M is equal to 1.5N (e.g., M is 27 when N is 18).
A DSP circuit block as recapitulated immediately above may further include circuitry (e.g., 503) for selectively routing bits of an M-bit multiplicand data word and an M-bit multiplier data word to the first and second multiplier circuits so that the first multiplier circuit can multiply the N most significant bits of the multiplicand data word by the N most significant bits of the multiplier data word to produce a first partial product data word, and so that the second multiplier circuit can multiply (1) the M bits of the multiplicand data word by the 0.5N least significant bits of the multiplier data word to produce a second partial product data word, and (2) the N most significant bits of the multiplier data word by the 0.5N least significant bits of the multiplicand data word to produce a third partial product data word.
In a DSP circuit block as recapitulated immediately above the second multiplier circuit may include third compressor circuitry (e.g., 652) for additively combining the second and third partial product data words, with bits of the third partial product data word being increased in arithmetic significance by 0.5N bit positions relative to bits of the second partial product data word.
In a DSP circuit block as recapitulated above the circuitry for routing may be dedicated to only conveying signals between instances of the DSP circuit block.
In a DSP circuit block as recapitulated above the outputs received from a second other DSP block may be received via circuitry (e.g., SUM_IN/CAR_IN leads) that is dedicated to only conveying signals between instances of the DSP circuit block.
Recapitulating some other aspects of the foregoing, and also in some respects extending what has been said, circuitry (e.g.,
In circuitry as recapitulated above N may be equal to 18 and M may be equal to 27.
Circuitry as recapitulated above may further include first, second, third, and fourth pluralities of data signal input leads (e.g. any four of d, c, ax, ay, bx, by in
In circuitry as recapitulated immediately above the routing circuitry may include first, second, third, and fourth N-bit multiplexers (e.g., 630r, 630s, 630u, 630w), each of which is controllable to route N bits from any one of the pluralities to a respective one of (1) multiplicand inputs to the N×N multiplier circuitry, (2) multiplier inputs to the N×N multiplier circuitry; (3) N less significant multiplicand inputs to the 0.5N×M multiplier circuitry, and (4) multiplicand inputs to the 0.5N×N multiplier circuitry; and first, second, and third 0.5N-bit multiplexers (e.g., 630t, 630v, 630x), each of which is controllable to route 0.5N bits from any of at least some of the pluralities to a respective one of (1) 0.5N more significant multiplicand inputs to the 0.5N×M multiplier circuitry, (2) multiplier inputs to the 0.5N×M multiplier circuitry, and (3) multiplier inputs to the 0.5N×N multiplier circuitry.
Recapitulating some still other aspects of the foregoing, and also in some respects extending what has been said, a digital signal processing (“DSP”) circuit block (e.g., 500 in
In such a DSP circuit block the second means may include seventh means (e.g., 650a) for performing the 0.5N×M multiplication; eighth means (e.g., 650b) for performing the 0.5N×N multiplication; and ninth means (e.g., 652) for additively combining outputs of the seventh and eighth means, with bits of the outputs of the eighth means being increased in arithmetic significance by 0.5N bit positions relative to bits of the outputs of the seventh means.
A DSP circuit block such as is here being recapitulated may further include tenth means (e.g., 630s) for selectively routing the N most significant bits of an M-bit multiplicand data word to multiplicand inputs to the first means; eleventh means (e.g., 630r) for selectively routing the N most significant bits of an M-bit multiplier data word to multiplier inputs to the first means; twelfth means (e.g., 630v and 630w) for selectively routing the M-bit multiplicand to the multiplicand inputs to the seventh means; thirteenth means (e.g., 630x) for selectively routing the 0.5N least significant bits of the multiplier data word to multiplier inputs to the seventh means; fourteenth means (e.g., 630u) for selectively routing the N most significant bits of the multiplier data word to multiplicand inputs to the eighth means; and fifteenth means (e.g., 630t) for selectively routing the 0.5N least significant bits of the multiplicand data word to the multiplier inputs to the eighth means.
A DSP circuit block such as is here being recapitulated may further include sixteenth means (e.g., ax, ay, bx, and by leads) for receiving multiple pluralities of data input signals for use as inputs to the first and second means; seventeenth means (e.g., 502) for selectively pre-adding at least some of the data input signals; and eighteenth means (e.g., 503) for selectively applying outputs of the seventeenth means to selected inputs to at least one of the first and second means.
A DSP circuit block such as is here being recapitulated may further include nineteenth means (e.g., 504p, 504q) for selectively giving inputs to the second means a systolic register delay.
In a DSP circuit block such as is here being recapitulated the fifth means may include twentieth means (e.g., 509s/509c) for shifting the outputs of the fourth means by a selectable one of (1) zero bit positions and (2) N bit positions toward lesser arithmetic significance.
In a DSP circuit block such as is here being recapitulated the fifth means may include twenty-first means (e.g., 516) for selectively alternatively routing output signals indicative of outputs of the sixth means to the first other DSP circuit block.
In a DSP circuit block such as is here being recapitulated the twenty-first means may include twenty-second means (e.g., 513) for selectively giving the output signals indicative of outputs of the sixth means a systolic register delay.
In a DSP circuit block such as is here being recapitulated the fifth means may include twenty-third means (e.g., SUM_IN/CAR_IN leads) for alternatively routing signals from the second other DSP circuit block to the first other DSP circuit block.
In a DSP circuit block such as is here being recapitulated the sixth means may include twenty-fourth means (e.g., 512) for registering output signals indicative of outputs of the sixth means; and twenty-fifth means (e.g., 514) for applying outputs of the twenty-fourth means to inputs to the sixth means.
It will be understood that the foregoing is only illustrative of the principles of the invention, and that various modifications can be made by those skilled in the art without departing from the scope and spirit of the invention. For example, the use of 18×18 multipliers 200 is only illustrative, and other sizes of multipliers can be used instead, if desired. It will also be understood that the FIGS. herein like
In certain of the appended claims, words like first, second, third, fourth, etc., may be used. This is done only to provide unique identifiers for various claim elements and not for any other purpose. For example, these words are not intended to imply anything about how elements are ordered or used. Also, a reference to a higher numbered element (e.g., the “fourth” element) does not by itself imply that all lower numbered elements (e.g., the first through third elements) are also present in a particular claim.
This is a continuation of commonly-assigned U.S. patent application Ser. No. 13/961,534, filed Aug. 7, 2013, now U.S. Pat. No. 8,620,977, which is division of commonly-assigned U.S. patent application Ser. No. 12/716,878, now U.S. Pat. No. 8,549,055, which is a continuation-in-part of commonly-assigned U.S. patent application Ser. No. 12/380,841, filed Mar. 3, 2009, each of which is hereby incorporated by reference herein in its respective entirety.
Number | Name | Date | Kind |
---|---|---|---|
3473160 | Wahlstrom | Oct 1969 | A |
4156927 | McElroy et al. | May 1979 | A |
4179746 | Tubbs | Dec 1979 | A |
4212076 | Conners | Jul 1980 | A |
4215406 | Gomola et al. | Jul 1980 | A |
4215407 | Gomola et al. | Jul 1980 | A |
4422155 | Amir et al. | Dec 1983 | A |
4484259 | Palmer et al. | Nov 1984 | A |
4521907 | Amir et al. | Jun 1985 | A |
4597053 | Chamberlin | Jun 1986 | A |
4623961 | Mackiewicz | Nov 1986 | A |
4682302 | Williams | Jul 1987 | A |
4718057 | Venkitakrishnan et al. | Jan 1988 | A |
4727508 | Williams | Feb 1988 | A |
4736333 | Mead et al. | Apr 1988 | A |
4791590 | Ku et al. | Dec 1988 | A |
4799004 | Mori | Jan 1989 | A |
4823295 | Mader | Apr 1989 | A |
4839847 | Laprade | Jun 1989 | A |
4871930 | Wong et al. | Oct 1989 | A |
4912345 | Steele et al. | Mar 1990 | A |
4967160 | Quievy et al. | Oct 1990 | A |
4972356 | Williams | Nov 1990 | A |
4982354 | Takeuchi et al. | Jan 1991 | A |
4994997 | Martin et al. | Feb 1991 | A |
5122685 | Chan et al. | Jun 1992 | A |
5128559 | Steele | Jul 1992 | A |
5175702 | Beraud et al. | Dec 1992 | A |
5208491 | Ebeling et al. | May 1993 | A |
RE34363 | Freeman | Aug 1993 | E |
5258668 | Cliff et al. | Nov 1993 | A |
5267187 | Hsieh et al. | Nov 1993 | A |
5296759 | Sutherland et al. | Mar 1994 | A |
5338983 | Agarwala | Aug 1994 | A |
5349250 | New | Sep 1994 | A |
5357152 | Jennings, III et al. | Oct 1994 | A |
5371422 | Patel et al. | Dec 1994 | A |
5381357 | Wedgwood et al. | Jan 1995 | A |
5404324 | Colon-Bonet | Apr 1995 | A |
5424589 | Dobbelaere et al. | Jun 1995 | A |
5442576 | Gergen et al. | Aug 1995 | A |
5442799 | Murakami et al. | Aug 1995 | A |
5446651 | Moyse et al. | Aug 1995 | A |
5451948 | Jekel | Sep 1995 | A |
5452231 | Butts et al. | Sep 1995 | A |
5452375 | Rousseau et al. | Sep 1995 | A |
5457644 | McCollum | Oct 1995 | A |
5465226 | Goto | Nov 1995 | A |
5465375 | Thepaut et al. | Nov 1995 | A |
5483178 | Costello et al. | Jan 1996 | A |
5497498 | Taylor | Mar 1996 | A |
5500828 | Doddington et al. | Mar 1996 | A |
5517436 | Andreas et al. | May 1996 | A |
5523963 | Hsieh et al. | Jun 1996 | A |
5528550 | Pawate et al. | Jun 1996 | A |
5537601 | Kimura et al. | Jul 1996 | A |
5546018 | New et al. | Aug 1996 | A |
5550993 | Ehlig et al. | Aug 1996 | A |
5559450 | Ngai et al. | Sep 1996 | A |
5563526 | Hastings et al. | Oct 1996 | A |
5563819 | Nelson | Oct 1996 | A |
5570039 | Oswald et al. | Oct 1996 | A |
5570040 | Lytle et al. | Oct 1996 | A |
5572148 | Lytle et al. | Nov 1996 | A |
5581501 | Sansbury et al. | Dec 1996 | A |
5590350 | Guttag et al. | Dec 1996 | A |
5594366 | Khong et al. | Jan 1997 | A |
5594912 | Brueckmann et al. | Jan 1997 | A |
5596763 | Guttag et al. | Jan 1997 | A |
5606266 | Pedersen | Feb 1997 | A |
5617058 | Adrian et al. | Apr 1997 | A |
5633601 | Nagaraj | May 1997 | A |
5636150 | Okamoto | Jun 1997 | A |
5636368 | Harrison et al. | Jun 1997 | A |
5640578 | Balmer et al. | Jun 1997 | A |
5644522 | Moyse et al. | Jul 1997 | A |
5646545 | Trimberger et al. | Jul 1997 | A |
5648732 | Duncan | Jul 1997 | A |
5652903 | Weng et al. | Jul 1997 | A |
5655069 | Ogawara et al. | Aug 1997 | A |
5664192 | Lloyd et al. | Sep 1997 | A |
5689195 | Cliff et al. | Nov 1997 | A |
5696708 | Leung | Dec 1997 | A |
5729495 | Madurawe | Mar 1998 | A |
5740404 | Baji | Apr 1998 | A |
5744980 | McGowan et al. | Apr 1998 | A |
5744991 | Jefferson et al. | Apr 1998 | A |
5751622 | Purcell | May 1998 | A |
5754459 | Telikepalli | May 1998 | A |
5761483 | Trimberger | Jun 1998 | A |
5764555 | McPherson et al. | Jun 1998 | A |
5765013 | Jang et al. | Jun 1998 | A |
5768613 | Asghar | Jun 1998 | A |
5777912 | Leung et al. | Jul 1998 | A |
5784636 | Rupp | Jul 1998 | A |
5790446 | Yu et al. | Aug 1998 | A |
5794067 | Kadowaki | Aug 1998 | A |
5801546 | Pierce et al. | Sep 1998 | A |
5805477 | Perner | Sep 1998 | A |
5805913 | Guttag et al. | Sep 1998 | A |
5812479 | Cliff et al. | Sep 1998 | A |
5812562 | Baeg | Sep 1998 | A |
5815422 | Dockser | Sep 1998 | A |
5821776 | McGowan | Oct 1998 | A |
5825202 | Tavana et al. | Oct 1998 | A |
5838165 | Chatter | Nov 1998 | A |
5841684 | Dockser | Nov 1998 | A |
5847579 | Trimberger | Dec 1998 | A |
5859878 | Phillips et al. | Jan 1999 | A |
5869979 | Bocchino | Feb 1999 | A |
5872380 | Rostoker et al. | Feb 1999 | A |
5874834 | New | Feb 1999 | A |
5878250 | LeBlanc | Mar 1999 | A |
5880981 | Kojima et al. | Mar 1999 | A |
5883525 | Tavana et al. | Mar 1999 | A |
5892962 | Cloutier | Apr 1999 | A |
5894228 | Reddy et al. | Apr 1999 | A |
5898602 | Rothman et al. | Apr 1999 | A |
5914616 | Young et al. | Jun 1999 | A |
5931898 | Khoury | Aug 1999 | A |
5942914 | Reddy et al. | Aug 1999 | A |
5944774 | Dent | Aug 1999 | A |
5949710 | Pass et al. | Sep 1999 | A |
5951673 | Miyata | Sep 1999 | A |
5956265 | Lewis | Sep 1999 | A |
5959871 | Pierzchala et al. | Sep 1999 | A |
5960193 | Guttag et al. | Sep 1999 | A |
5961635 | Guttag et al. | Oct 1999 | A |
5963048 | Harrison et al. | Oct 1999 | A |
5963050 | Young et al. | Oct 1999 | A |
5968196 | Ramamurthy et al. | Oct 1999 | A |
5970254 | Cooke et al. | Oct 1999 | A |
5978260 | Trimberger et al. | Nov 1999 | A |
5982195 | Cliff et al. | Nov 1999 | A |
5986465 | Mendel | Nov 1999 | A |
5991788 | Mintzer | Nov 1999 | A |
5991898 | Rajski et al. | Nov 1999 | A |
5995748 | Guttag et al. | Nov 1999 | A |
5999015 | Cliff et al. | Dec 1999 | A |
5999990 | Sharrit et al. | Dec 1999 | A |
6005806 | Madurawe et al. | Dec 1999 | A |
6006321 | Abbott | Dec 1999 | A |
6009451 | Burns | Dec 1999 | A |
6020759 | Heile | Feb 2000 | A |
6021423 | Nag et al. | Feb 2000 | A |
6029187 | Verbauwhede | Feb 2000 | A |
6031763 | Sansbury | Feb 2000 | A |
6041340 | Mintzer | Mar 2000 | A |
6052327 | Reddy et al. | Apr 2000 | A |
6052755 | Terrill et al. | Apr 2000 | A |
6064614 | Khoury | May 2000 | A |
6065131 | Andrews et al. | May 2000 | A |
6066960 | Pedersen | May 2000 | A |
6069487 | Lane et al. | May 2000 | A |
6072994 | Phillips et al. | Jun 2000 | A |
6073154 | Dick | Jun 2000 | A |
6075381 | LaBerge | Jun 2000 | A |
6084429 | Trimberger | Jul 2000 | A |
6085317 | Smith | Jul 2000 | A |
6091261 | DeLange | Jul 2000 | A |
6091765 | Pietzold, III et al. | Jul 2000 | A |
6094726 | Gonion et al. | Jul 2000 | A |
6097988 | Tobias | Aug 2000 | A |
6098163 | Guttag et al. | Aug 2000 | A |
6107820 | Jefferson et al. | Aug 2000 | A |
6107821 | Kelem et al. | Aug 2000 | A |
6107824 | Reddy et al. | Aug 2000 | A |
6130554 | Kolze et al. | Oct 2000 | A |
6140839 | Kaviani et al. | Oct 2000 | A |
6154049 | New | Nov 2000 | A |
6157210 | Zaveri et al. | Dec 2000 | A |
6163788 | Chen et al. | Dec 2000 | A |
6167415 | Fischer et al. | Dec 2000 | A |
6175849 | Smith | Jan 2001 | B1 |
6215326 | Jefferson et al. | Apr 2001 | B1 |
6226735 | Mirsky | May 2001 | B1 |
6242947 | Trimberger | Jun 2001 | B1 |
6243729 | Staszewski | Jun 2001 | B1 |
6246258 | Lesea | Jun 2001 | B1 |
6278291 | McClintock et al. | Aug 2001 | B1 |
6279021 | Takano et al. | Aug 2001 | B1 |
6286024 | Yano et al. | Sep 2001 | B1 |
6298366 | Gatherer et al. | Oct 2001 | B1 |
6314442 | Suzuki | Nov 2001 | B1 |
6314551 | Borland | Nov 2001 | B1 |
6321246 | Page et al. | Nov 2001 | B1 |
6323680 | Pedersen et al. | Nov 2001 | B1 |
6344755 | Reddy et al. | Feb 2002 | B1 |
6351142 | Abbott | Feb 2002 | B1 |
6359468 | Park et al. | Mar 2002 | B1 |
6362650 | New et al. | Mar 2002 | B1 |
6366944 | Hossain et al. | Apr 2002 | B1 |
6367003 | Davis | Apr 2002 | B1 |
6407576 | Ngai et al. | Jun 2002 | B1 |
6407694 | Cox et al. | Jun 2002 | B1 |
6438570 | Miller | Aug 2002 | B1 |
6448808 | Young et al. | Sep 2002 | B2 |
6453382 | Heile | Sep 2002 | B1 |
6467017 | Ngai et al. | Oct 2002 | B1 |
6480980 | Koe | Nov 2002 | B2 |
6483343 | Faith et al. | Nov 2002 | B1 |
6531888 | Abbott | Mar 2003 | B2 |
6538470 | Langhammer et al. | Mar 2003 | B1 |
6542000 | Black et al. | Apr 2003 | B1 |
6556044 | Langhammer et al. | Apr 2003 | B2 |
6557092 | Callen | Apr 2003 | B1 |
6571268 | Giacalone et al. | May 2003 | B1 |
6573749 | New et al. | Jun 2003 | B2 |
6574762 | Karimi et al. | Jun 2003 | B1 |
6591283 | Conway et al. | Jul 2003 | B1 |
6591357 | Mirsky | Jul 2003 | B2 |
6600788 | Dick et al. | Jul 2003 | B1 |
6628140 | Langhammer et al. | Sep 2003 | B2 |
6700581 | Baldwin et al. | Mar 2004 | B2 |
6725441 | Keller et al. | Apr 2004 | B1 |
6728901 | Rajski et al. | Apr 2004 | B1 |
6731133 | Feng et al. | May 2004 | B1 |
6744278 | Liu et al. | Jun 2004 | B1 |
6745254 | Boggs et al. | Jun 2004 | B2 |
6774669 | Liu et al. | Aug 2004 | B1 |
6781408 | Langhammer | Aug 2004 | B1 |
6781410 | Pani et al. | Aug 2004 | B2 |
6788104 | Singh et al. | Sep 2004 | B2 |
6836839 | Master et al. | Dec 2004 | B2 |
6874079 | Hogenauer | Mar 2005 | B2 |
6904471 | Boggs et al. | Jun 2005 | B2 |
6924663 | Masui et al. | Aug 2005 | B2 |
6971083 | Farrugia et al. | Nov 2005 | B1 |
7047271 | Aldrich et al. | May 2006 | B2 |
7061268 | Lee et al. | Jun 2006 | B1 |
7119576 | Langhammer et al. | Oct 2006 | B1 |
7180324 | Chan et al. | Feb 2007 | B2 |
7230451 | Langhammer | Jun 2007 | B1 |
7269617 | Esposito et al. | Sep 2007 | B1 |
7287051 | Langhammer | Oct 2007 | B1 |
7346644 | Langhammer | Mar 2008 | B1 |
7368942 | Hutton et al. | May 2008 | B1 |
7471643 | Stansfield | Dec 2008 | B2 |
7698358 | Langhammer et al. | Apr 2010 | B1 |
7746112 | Gaide et al. | Jun 2010 | B1 |
7836117 | Langhammer et al. | Nov 2010 | B1 |
8458243 | Demirsoy et al. | Jun 2013 | B1 |
20010029515 | Mirsky | Oct 2001 | A1 |
20020089348 | Langhammer | Jul 2002 | A1 |
20030041082 | Dibrino | Feb 2003 | A1 |
20030072185 | Lane et al. | Apr 2003 | A1 |
20030088757 | Lindner et al. | May 2003 | A1 |
20040064770 | Xin | Apr 2004 | A1 |
20040083412 | Corbin et al. | Apr 2004 | A1 |
20040178818 | Crotty et al. | Sep 2004 | A1 |
20040193981 | Clark et al. | Sep 2004 | A1 |
20050144215 | Simkins et al. | Jun 2005 | A1 |
20050166038 | Wang et al. | Jul 2005 | A1 |
20050187999 | Zheng et al. | Aug 2005 | A1 |
20060075012 | Minz et al. | Apr 2006 | A1 |
20060158219 | Sunkavalli et al. | Jul 2006 | A1 |
20070143577 | Smith | Jun 2007 | A1 |
20070185951 | Lee et al. | Aug 2007 | A1 |
20070185952 | Langhammer et al. | Aug 2007 | A1 |
20080133627 | Langhammer et al. | Jun 2008 | A1 |
20090228538 | Nagano et al. | Sep 2009 | A1 |
20090259824 | Smith et al. | Oct 2009 | A1 |
20100097099 | Minz et al. | Apr 2010 | A1 |
20100228806 | Streicher et al. | Sep 2010 | A1 |
20100306292 | Catherwood et al. | Dec 2010 | A1 |
20120290819 | Langhammer | Nov 2012 | A1 |
20130135008 | Zhang et al. | May 2013 | A1 |
Number | Date | Country |
---|---|---|
0 158 430 | Oct 1985 | EP |
0 380 456 | Aug 1990 | EP |
0 411 491 | Feb 1991 | EP |
0 461 798 | Dec 1991 | EP |
0 498 066 | Aug 1992 | EP |
0 555 092 | Aug 1993 | EP |
0 606 653 | Jul 1994 | EP |
0 657 803 | Jun 1995 | EP |
0 660 227 | Jun 1995 | EP |
0 668 659 | Aug 1995 | EP |
0 905 906 | Mar 1999 | EP |
0 909 028 | Apr 1999 | EP |
0 927 393 | Jul 1999 | EP |
0 992 885 | Apr 2000 | EP |
1 031 934 | Aug 2000 | EP |
1 058 185 | Dec 2000 | EP |
1 220 108 | Jul 2002 | EP |
1 603 241 | Dec 2005 | EP |
2 283 602 | May 1995 | GB |
2 286 737 | Aug 1995 | GB |
2 318 198 | Apr 1998 | GB |
61-237133 | Oct 1986 | JP |
7-135447 | May 1995 | JP |
11-296345 | Oct 1999 | JP |
2000-347834 | Dec 2000 | JP |
WO9200561 | Jan 1992 | WO |
WO9527243 | Oct 1995 | WO |
WO9628774 | Sep 1996 | WO |
WO9708606 | Mar 1997 | WO |
WO9812629 | Mar 1998 | WO |
WO9832071 | Jul 1998 | WO |
WO9838741 | Sep 1998 | WO |
WO9922292 | May 1999 | WO |
WO9931574 | Jun 1999 | WO |
WO9956394 | Nov 1999 | WO |
WO0051239 | Aug 2000 | WO |
WO0052824 | Sep 2000 | WO |
WO0113562 | Feb 2001 | WO |
WO2005066832 | Jul 2005 | WO |
WO2005101190 | Oct 2005 | WO |
WO2006076276 | Jul 2006 | WO |
Entry |
---|
Amos, D., “PLD architectures match DSP algorithms,” Electronic Product Design, vol. 17, No. 7, Jul. 1996, pp. 30, 32. |
Analog Devices, Inc., The Applications Engineering Staff of Analog Devices, DSP Division, Digital Signal Processing Applications Using the ADSP-2100 Family (edited by Amy Mar), 1990, pp. 141-192). |
Andrejas, J., et al., “Reusable DSP functions in FPGAs,” Field-Programmable Logic and Applications. Roadmap to Reconfigurable Computing. 10th International Conference, FPL 2000. Proceedings (Lecture Notes in Computer Science vol. 1896), Aug. 27-30, 2000, pp. 456-461. |
Aoki, T., “Signed-weight arithmetic and its application to a field-programmable digital filter architecture,” IEICE Transactions on Electronics, 1999, vol. E82C, No. 9, Sep. 1999, pp. 1687-1698. |
Ashour, M.A., et al., “An FPGA implementation guide for some different types of serial-parallel multipier-structures,” Microelectronics Journal, vol. 31, No. 3, 2000, pp. 161-168. |
Berg. B.L., et al.“Designing Power and Area Efficient Multistage FIR Decimators with Economical Low Order Filters,” ChipCenter Technical Note, Dec. 2001. |
Bursky, D., “Programmable Logic Challenges Traditional ASIC SoC Designs”, Electronic Design, Apr. 15, 2002. |
Chhabra, A. et al., Texas Instruments Inc., “A Block Floating Point Implementation on the TMS320C54x DSP”, Application Report SPRA610, Dec. 1999, pp. 1-10. |
Colet, p., “When DSPs and FPGAs meet: Optimizing image processing architectures,” Advanced Imaging, vol. 12, No. 9, Sep. 1997, pp. 14, 16, 18. |
Crookes, D., et al., “Design and implementation of a high level programming environment for FPGA-based image processing,” IEE Proceedings-Vision, Image and Signal Processing, vol. 147, No. 4, Aug. 2000, pp. 377-384. |
Debowski, L., et al., “A new flexible architecture of digital control systems based on DSP and complex CPLD technology for power conversion applications,” PCIM 2000: Europe Official Proceedings of the Thiry-Seventh International Intelligent Motion Conference, Jun. 6-8, 2000, pp. 281-286. |
Dick, C., et al., “Configurable logic for digital communications: some signal processing perspectives,” IEEE Communications Magazine, vol. 37, No. 8, Aug. 1999, pp. 107-111. |
Do, T.-T., et al., “A flexible implementation of high-performance FIR filters on Xilinx FPGAs,” Field-Programmable Logic and Applications: From FPGAs to Computing Paradigm. 8th International Workshop, FPL'98. Proceedings, Hartenstein, R.W., et al., eds., Aug. 31-Sep. 3, 1998, pp. 441-445. |
“DSP Blocks in Arria GX Devices,” Arria GX Device Handbook, vol. 2, pp. 10-1 through 10-32, Altera Corporation, San Jose, CA, May 2008. |
“DSP Blocks in Stratix & Stratix GX Devices,” Stratix Device Handbook, vol. 2, pp. 6-1 through 6-28, Altera Corporation, San Jose, CA, Jul. 2005. |
“DSP Blocks in Stratix II and Stratix II GX Devices,” Stratix II Device Handbook, vol. 2, pp. 6-1 through 6-34, Altera Corporation, San Jose, CA, Jan. 2008. |
“DSP Blocks in Stratix III Devices,” Stratix III Device Handbook, vol. 1, pp. 5-1 through 5-50, Altera Corporation, San Jose, CA, Oct. 2007. |
“DSP Blocks in Stratix III Devices,” Stratix III Device Handbook, vol. 1, pp. 5-1 through 5-40, Altera Corporation, San Jose, CA, May 2009. |
“DSP Blocks in Stratix IV Devices,” Stratix IV Device Handbook, vol. 1, pp. 4-1 through 4-44, Altera Corporation, San Jose, CA, May 2008. |
“DSP Blocks in Stratix IV Devices,” Stratix IV Device Handbook, vol. 1, pp. 4-1 through 4-34, Altera Corporation, San Jose, CA, Nov. 2008. |
“DSP Blocks in Stratix IV Devices,” Stratix IV Device Handbook, vol. 1, pp. 4-1 through 4-36, Altera Corporation, San Jose, CA, Nov. 2009. |
“Embedded Multipliers in Cyclone III Devices,” Cyclone III Device Handbook, vol. 1, pp. 5-1 through 5-8, Altera Corporation, San Jose, CA, Jul. 2007. |
“Embedded Multipliers in Cyclone III Devices,” Cyclone III Device Handbook, vol. 1, pp. 4-1 through 4-8, Altera Corporation, San Jose, CA, Jul. 2009. |
Gaffer, A.A., et al., “Floating-Point Bitwidth Analysis via Automatic Differentiation,” IEEE Conference on Field Programmable Technology, Hong Kong, Dec. 2002. |
Guccione, S.A., “Run-time Reconfiguration at Xilinx,” Parallel and distributed processing: 16 IPDPS 2000 workshops, Rolim, J., ed., May 1-5, 2000, p. 873. |
Hauck, S., “The Future of Reconfigurable Systems,” Keynote Address, 5th Canadian Conference on Field Programmable Devices, Jun. 1998, http:--www.ee.washington.edu-people-faculty-hauck-publications-ReconfigFuture.PDF. |
Heysters, P.M., et al., “Mapping of DSP algorithms on field programmable function arrays,” Field-Programmable Logic and Applications. Roadmap to Reconfigurable Computing. 10th International Conference, FPL 2000. Proceedings (Lecture Notes in Computer Science vol. 1896), Aug. 27-30, 2000, pp. 400-411. |
Huang, J., et al., “Simulated Performance of 1000BASE-T Receiver with Different Analog Front End Designs,” Proceedings of the 35th Asilomar Conference on Signals, Systems, and Computers, Nov. 4-7, 2001. |
Lattice Semiconductor Corp, ORCA® FPGA Express™ Interface Manual: ispLEVER® Version 3.0, 2002. |
Lucent Technologies, Microelectronics Group,“Implementing and Optimizing Multipliers in ORCA™ FPGAs,”, Application Note.AP97-008FGPA, Feb. 1997. |
“Implementing Multipliers in FLEX 10K EABs”, Altera, Mar. 1996. |
“Implementing Logic with the Embedded Array in FLEX 10K Devices”, Altera, May 2001, ver. 2.1. |
Jinghua Li, “Design a pocket multi-bit multiplier in FPGA,”1996 2nd International Conference on ASIC Proceedings (IEEE Cat. No. 96TH8140), Oct. 21-24, 1996, pp. 275-279. |
Jones, G., “Field-programmable digital signal conditioning ” Electronic Product Design, vol. 21, No. 6, Jun. 2000, pp. C36-C38. |
Kiefer, R., et al., “Performance comparison of software-FPGA hardware partitions for a DSP application,” 14th Australian Microelectronics Conference. Microelectronics: Technology Today for the Future, MICRO '97 Proceedings, Sep. 28-Oct. 1, 1997, pp. 88-93. |
Kramberger, I., “DSP acceleration using a reconfigurable FPGA,” ISIE 'Proceedings of the IEEE International Symposium on Industrial Electronics (Cat. No. 99TH8465), vol. 3, Jul. 12-16, 1999, pp. 1522-1525. |
Langhammer, M., “How to implement DSP in programmable logic,” Elettronica Oggi, No. 266 , Dec. 1998, pp. 113-115. |
Langhammer, M., “Implementing a DSP in Programmable Logic,” Online EE Times, May 1998, http:--www.eetimes.com-editorial-1998-coverstory9805.html. |
Lazaravich, B.V., “Function block oriented field programmable logic arrays,” Motorola, Inc. Technical Developments, vol. 18, Mar. 1993, pp. 10-11. |
Lund, D., et al., “A new development system for reconfigurable digital signal processing,” First International Conference on 3G Mobile Communication Technologies (Conf. Publ. No. 471), Mar. 27-29, 2000, pp. 306-310. |
Miller, N.L., et al., “Reconfigurable integrated circuit for high performance computer arithmetic,” Proceedings of the 1998 IEE Colloquium on Evolvable Hardware Systems (Digest), No. 233, 1998, pp. 2-1-2-4. |
Mintzer, L., “Xilinx FPGA as an FFT processor,” Electronic Engineering, vol. 69, No. 845, May 1997, pp. 81, 82, 84. |
Faura et al., “A Novel Mixed Signal Programmable Device With On-Chip Microprocessor,” Custom Integrated Circuits Conference, 1997. Proceedings of the IEEE 1997 Santa Clara, CA, USA, May 5, 1997, pp. 103-106. |
Nozal, L., et al., “A new vision system: programmable logic devices and digital signal processor architecture (PLD+DSP),” Proceedings IECON '91. 1991 International Conference on Industrial Electronics, Control and Instrumentation (Cat. No. 91CH2976-9), vol. 3, Oct. 28-Nov. 1, 1991, pp. 2014-2018. |
Papenfuss, J.R, et al., “Implementation of a real-time, frequency selective, RF channel simulator using a hybrid DSP-FPGA architecture,” RAWCON 2000: 2000 IEEE Radio and Wireless Conference (Cat. No. 00EX404), Sep. 10-13, 2000, pp. 135-138. |
Parhami, B., “Configurable arithmetic arrays with data-driven control,” 34th Asilomar Conference on Signals, Systems and Computers, vol. 1, 2000, pp. 88-93. |
“The QuickDSP Design Guide”, Quicklogic, Aug. 2001, revision B. |
“QuickDSP™ Family Data Sheet”, Quicklogic, Aug. 7, 2001, revision B. |
Rangasayee, K., “Complex PLDs let you produce efficient arithmetic designs,” EDN (European Edition), vol. 41, No. 13, Jun. 20, 1996, pp. 109, 110, 112, 114, 116. |
Rosado, A., et al., “A high-speed multiplier coprocessor unit based on FPGA,” Journal of Electrical Engineering, vol. 48, No. 11-12, 1997, pp. 298-302. |
Santillan-Q., G.F., et al., “Real-time integer convolution implemented using systolic arrays and a digit-serial architecture in complex programmable logic devices,” Proceedings of the Third International Workshop on Design of Mixed-Mode Integrated Circuits and Applications (Cat. No. 99EX303), Jul. 26-28, 1999, pp. 147-150. |
Stratix III Device Handbook, vol. 1, pp. 5-22 through 5-23, Altera Corporation, San Jose, CA, Nov. 2006. |
Texas Instruments Inc., “TMS320C54x DSP Reference Set, vol. 1: CPU and Peripherals”, Literature No. SPRU131F, Apr. 1999, pp. 2-1 through 2-16 and 4-1 through 4-29. |
Tisserand, A., et al., “An on-line arithmetic based FPGA for low power custom computing,” Field Programmable Logic and Applications, 9th International Workshop, FPL'99, Proceedings (Lectures Notes in Computer Science vol. 1673), Lysaght, P., et al., eds., Aug. 30-Sep. 1, 1999, pp. 264-273. |
Tralka, C., “Symbiosis of DSP and PLD,” Elektronik, vol. 49, No. 14 , Jul. 11, 2000, pp. 84-96. |
Valls, J., et al., “A Study About FPGA-Based Digital Filters,” Signal Processing Systems, 1998, SIPS 98, 1998 IEEE Workshop, Oct. 10, 1998, pp. 192-201. |
“Virtex-II 1.5V Field-Programmable Gate Arrays”, Xilinx, Jan. 25, 2001, module 2 of 4. |
“Virtex-II 1.5V Field-Programmable Gate Arrays”, Xilinx, Apr. 2, 2001, module 1 of 4. |
“Virtex-II 1.5V Field-Programmable Gate Arrays”, Xilinx, Apr. 2, 2001, module 2 of 4. |
“Virtex-5 XtremeDSP Design Considerations,” User Guide, UG193 (v1.3), pp. 71-72, Xilinx Corporation, Jul. 28, 2006. |
Walters, A.L., “A Scaleable FIR Filter Implementation Using 32-bit Floating-Point Complex Arithmetic on ,a FPGA Based Custom Computing Platform,” Allison L. Walters, Thesis Submitted to the Faculty of Virginia Polytechnic Institute and State University, Jan. 30, 1998. |
Weisstein, E.W., “Karatsuba Multiplication ” MathWorld—A Wolfram Web Resource (Dec. 9, 2007), accessed Dec. 11, 2007 at http:--mathworld.wolfram.com-KaratsubaMultiplication.html. |
Wenzel, L., “Field programmable gate arrays (FPGAs) to replace digital signal processor integrated circuits,” Elektronik , vol. 49, No. 5, Mar. 7, 2000, pp. 78-86. |
“Xilinx Unveils New FPGA Architecture to Enable High-Performance, 10 Million System Gate Designs”, Xilinx, Jun. 22, 2000. |
“Xilinx Announces DSP Algorithms, Tools and Features for Virtex-II Architecture”, Xilinx, Nov. 21, 2000. |
Xilinx Inc., “Virtex-II 1.5V Field-Programmable Gate Arrays”, Advance Product Specification, DS031-2 (v1.9), Nov. 29, 2001, Module 2 of 4, pp. 1-39. |
Xilinx Inc., “Using Embedded Multipliers”, Virtex-II Platform FPGA Handbook, UG002 (v1.3), Dec. 3, 2001, pp. 251-257. |
Xilinx, Inc., “A 1D Systolic FIR,” copyright 1994-2002, downloaded from http:--www.iro.umontreal.ca-˜aboulham-F6221-Xilinx%20A%201D%20systolic%20FIR.htm. |
Xilinx, Inc., “The Future of FPGA's,” White Paper, available Nov. 14, 2005 for download from http:--www.xilinx.com-prs—rls,5yrwhite.htm. |
“XtremeDSP for Spartan-3A DSP,” User Guide, UG431 (v1.0), pp. 29-30, Xilinx Corporation, Apr. 2, 2007. |
“XtremeDSP for Virtex-4 FPGAs,” User Guide, UG073 (v2.4), pp. 35-36, Xilinx Corporation, Jan. 8, 2007. |
Number | Date | Country | |
---|---|---|---|
20140082035 A1 | Mar 2014 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12716878 | Mar 2010 | US |
Child | 13961534 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13961534 | Aug 2013 | US |
Child | 14086328 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12380841 | Mar 2009 | US |
Child | 12716878 | US |