B
Brannon King
Guest
I've made an image illustrating a certain optimization that the VHDL/Verilog
compilers seem to make, but which the mapper does not seem to make. Can
someone explain why this is not done in the mapper?
Picture: http://www.starbridgesystems.com/images/brans/or_gates.png
The picture shows some linearly cascaded OR gates vs. a binary tree of OR
gates. The Xilinx Map/Par seem to have a much easier time with timing
constraints when the incoming file is organized binarily, yet it would seem
to me that would be an easy optimization for the mapper to perform.
What I want to do is use some 3rd-party EDIF generator tools and yet I'm
forced to manually tile out my gates binarily. Thoughts?
compilers seem to make, but which the mapper does not seem to make. Can
someone explain why this is not done in the mapper?
Picture: http://www.starbridgesystems.com/images/brans/or_gates.png
The picture shows some linearly cascaded OR gates vs. a binary tree of OR
gates. The Xilinx Map/Par seem to have a much easier time with timing
constraints when the incoming file is organized binarily, yet it would seem
to me that would be an easy optimization for the mapper to perform.
What I want to do is use some 3rd-party EDIF generator tools and yet I'm
forced to manually tile out my gates binarily. Thoughts?