Hi Glenn,
I'm actually in the process of doing this partway for the biplex
unscramblers. For large FFTs, the arbitrary reorders consume an
insanely huge number of resources trying to get the mapping ROM.
Since the biplex unscramble reorders use a known and easily-described
reorder, I was just going to hardcode them for this special case.
The thing about the pink block reorders, though, was it that it
depended on espresso, which I think we were trying to avoid using
for one reason or another.
Let me know if you want me to wait so we standardize on yours, or
if you want me to just proceed with mine, and then we can converge
in the future.
Thanks,
Henry
G Jones wrote:
For anyone who's interested, I've begun porting the map function used in
the pink reorder blocks to 10.1. For complex reorderings, the green
block seems to be inefficient since it implements the map using ROM
rather than logic as was done in the pink blocks. Ideally, the synthesis
tool would automatically apply logic reduction to the ROM and the two
would be equivalent in implementation, but this does not seem to be the
case. I plan to add an option to the 10.1 FFT block to use either the
logic based or ROM based map, but in case I get side tracked, I wanted
to share what I've done so far. It is not yet tested. The code is here:
http://casper.berkeley.edu/svn/trunk/caltech/lib10.1/map_init.m
Glenn
