P
Peter Alfke
Guest
Logjam, it is hard for a rader of this newsgroup to understand why you
are doing what you are doing.
Why a combinatorial divider, when division is a rare operation, and
sequential circuits are more efficient?
And why insist on a 30-year old technology?
If you had picked a 50-year old technology, you would use Germanium
transistors, diodes, resistors, and capacitors, and you would really
learn the very details of circuit design. (I did, it was fun while
there was nothing better available!)
Or a 20-year old technology, using AMD bit-slice (2900) chips?
Or a 10-year-old original FPGA technology (XC3000), where all logic is
implemented in LUTs and flip-flops?
If you absolutely want to make life tough for yourself, what is so
special about 1975-vintage circuits? Just nostalgia, and those lovely
yellow books?
Peter Alfke, Xilinx Applications
=======================
logjam wrote:
are doing what you are doing.
Why a combinatorial divider, when division is a rare operation, and
sequential circuits are more efficient?
And why insist on a 30-year old technology?
If you had picked a 50-year old technology, you would use Germanium
transistors, diodes, resistors, and capacitors, and you would really
learn the very details of circuit design. (I did, it was fun while
there was nothing better available!)
Or a 20-year old technology, using AMD bit-slice (2900) chips?
Or a 10-year-old original FPGA technology (XC3000), where all logic is
implemented in LUTs and flip-flops?
If you absolutely want to make life tough for yourself, what is so
special about 1975-vintage circuits? Just nostalgia, and those lovely
yellow books?
Peter Alfke, Xilinx Applications
=======================
logjam wrote:
Frist a little bit of information before my question. I don't know
where the best place is for this question. I'm building a 64bit ALU
using standard TTL devices. I made a 4bit adder with fast carry,
combined 4 of those with 16 AND gates (ends up as a 4x4=8bit
multiplier), and then combined 64 groups to provide 15 partial products
to a wallace tree (which I also had to make a model for). A final
summing adder takes the two partial products from the wallace tree and
adds them together. This final summing adder is built using 181 and
182 TTL devices, so I can also subtract and preform basic logic
operations if necessary.
I basically followed the datasheet from Texas Instruments from 1975.
I had to make models of the 74274 and 74275 because they weren't
included as standard Altera macros I guess (which is very
understandable... )
Anyway, my schematic program produces an EDIF netlist which I'm able to
import into Altera's software and compile and simulate my schematic for
their FPGA devices. I've been simulating my project with great
success. So we are on topic with the whole FPGA thing.
Now on to my question. Is there a simple combinatorial design for
division? So far the whole schematic is made using "Combinatorial
logic"? I'm not sure that's the right word. The ALU can perform any
function without clock inputs, its also faster than a lot of the other
methods I've found. For example, calculating one partial product at a
time for multiplication.
For more info on the multiplication circuit I've described you can look
at the datasheet below. On page 7-398 through 7-400 is a schematic for
a 16x16 bit multiplier. Mine is pretty much the same, except mine is
4x larger. This is the first time I've used D size schematic layout.
For more informatio
http://www.tech-systems-labs.com/booksdata/TI-DATA-1976.pdf
Any hints for what I should be looking for or links would be great.
Searching for combinatorial division I found what looked like to be
some good hits, but the website was in the CGI error mood.