Can LOOKUP/2 now contain enough elements,
or you'd need to use 4 lookups? (One for each byte element of the 32 bit val).
It does sound like reading program memory would be economical for that.
|
Re: Another way to left shift a 32 bit data?
Can LOOKUP/2 now contain enough elements,
or you'd need to use 4 lookups? (One for each byte element of the 32 bit val).
It does sound like reading program memory would be economical for that.
Last edited by Art; - 24th November 2015 at 17:47.
Members who have read this thread : 1You do not have permission to view the list of names.
Posting Permissions
Bookmarks