Abstract
Abstract An easy improvement of the Gold bit-reversal permutation algorithm is based on some observations concerning the distribution of pairs (i, revn (i)) in a set Z n = {0, 1, …, 2 n − 1} , where i ∈ Z n and rev n (i) is a bit-reversal of i. A number of consecutively inspected indexes is reduced to 2 n 4 . The improved algorithm preserves simplicity of the original and it saves 8% of the execution time on a PC/XT.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
