Bio-Inspired Imprecise Computational Blocks for Efficient VLSI Implementation of Soft-Computing Applications
Citations
921 citations
637 citations
453 citations
Cites background or methods from "Bio-Inspired Imprecise Computationa..."
...The recently proposed LOA is based on such a design [7]....
[...]
...Hardware structure of the lower-part-OR adder [7]....
[...]
...The bioinspired lowerpart OR adder (LOA) [7] is based on approximate logic, whose truth table is slightly different from the original truth table of a full adder....
[...]
447 citations
Cites background or methods from "Bio-Inspired Imprecise Computationa..."
...Addition and multiplication are widely used operations in computer arithmetic; for addition full-adder cells have been extensively analyzed for approximate computing [2], [3], [4]....
[...]
...In [4], an imprecise array multiplier is used for neural network applications by omitting some of the least significant bits in the partial products (and thus removing some adders in the array)....
[...]
...Several approximate multipliers have been proposed in the literature [4], [5], [6], [7]....
[...]
423 citations
Cites background from "Bio-Inspired Imprecise Computationa..."
...Imprecise integer logic blocks have also been designed [20]....
[...]
References
6,012 citations
"Bio-Inspired Imprecise Computationa..." refers methods in this paper
...The network MSE is determined as the average MSE values of the network outputs for all testing and training patterns based on [42]...
[...]
2,744 citations
"Bio-Inspired Imprecise Computationa..." refers background in this paper
...An Array multiplier with a -bit multiplicand and -bit multiplier array multiplier consists of similar cells called carry-save adder (CSA) array whose cells are shown by squares, followed by a -bit vector merging adder (whose cells are shown by rounded squares) to convert the carry-save redundant form into regular binary format [34]....
[...]
2,355 citations
"Bio-Inspired Imprecise Computationa..." refers background in this paper
...5(b) illustrates the internal gate-level structure of each CSA array and also vector merging adder cell [35]....
[...]
...Each cell contains a 2-input AND gate that forms partial product and a full-adder (CSA) to add the partial product into the running sum [35]....
[...]
...Although our main focus is on unsigned multiplication, the basic structure and operation of the signed and unsigned BAM are the same [35]....
[...]
1,024 citations