A new superfast bit reversal algorithm

Rubio, Marcelo; Gómez-Vilda, Pedro; Drouiche, Karim

doi:10.1002/acs.718

Cited by 9 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead of one pixel, to get a high visual quality, a hidden sub-message is inserted into two interpolated pixels. Bit reversal permutation (BRP) [37] is a permutation of a sequence of n items where n = 2 k is a power of two and k = 1, 2, 3, 4. It is defined by indexing the elements of the sequence by the numbers from 0 to (n − 1).…”

Section: The Proposed Schemementioning

confidence: 99%

A Secured Reversible Data Hiding Technique for Multiple Secrets using Image Interpolation with Bit Reversal Permutation

Jana

et al. 2022

Preprint

View full text Add to dashboard Cite

Early interpolation based data hiding methods embed one secret information with lower hiding capacity and suffer visual distortion with security loophole caused by the hidden message embedding. In this paper, we have proposed a secured high capacity reversible data hiding technique for multiple secrets using image interpolation with bit reversal permutation to overcome the said problem. Multiple secret messages are encrypted using bit reversal permutation before embedding within cover image to make it more robust and secure. Here, we proposed a mechanism which divides a fixed length sub-message into two values for each (4 × 4) overlapping block. Then one value is added and another is subtracted from two adjacent interpolated pixels to minimize the image distortion. Two interpolated pixels are calculated between each adjacent pixels to increase the embedding capacity. The experimental results show that the proposed scheme has better performance than other state-of-the-art interpolation based data hiding methods. Moreover, the proposed scheme has a low-time complexity with good visual quality. Finally, some standard steganographic analysis is used to measure the effectiveness of the proposed scheme. The intended result brought some remarkable sublime features to the limelight in the area of image verification, tamper identification and electronic forgery detection without which the technical life is hindered. This scheme profits enormously from numerous aspects of government and private sector including health-care, economic protection, defence, intellectual property rights and so on.

show abstract

Section: The Proposed Schemementioning

confidence: 99%

A Secured Reversible Data Hiding Technique for Multiple Secrets using Image Interpolation with Bit Reversal Permutation

Jana

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Data reordering in FFT program using bit-reverse of array index has been widely studied (Bollman et al, 1996;Karp, 1996;Lokhmotov and Mycroft, 2007;Rodriguez, 1988;Rubio et al, 2002;Seguel et al, 2000;Zhang and Zhang, 2000). Most of algorithms proposed were designed to be executed on single processor platforms (Karp, 1996;Lokhmotov and Mycroft, 2007;Rodriguez, 1988;Rubio et al, 2002). Lokhmotov proposed the optimal Bit-reversal using vector permutations with experiments performed on single processor (Karp, 1996).…”

Section: Related Workmentioning

confidence: 99%

Parallel fast Fourier transform in SPMD style of Cilk

Weng

Wang

Hsieh

et al. 2019

IJES

View full text Add to dashboard Cite

In this paper, we propose a parallel one-dimensional non-recursive fast Fourier transform (FFT) program based on conventional Cooley-Tukey's algorithm written in C using Cilk in single program multiple data (SPMD) style. As a highly compact designed code, this code is compared with a highly tuned parallel recursive fast Fourier transform (FFT) using Cilk, which is included in Cilk package of version 5.4.6. Both algorithms are executed on multicore servers, and experimental results show that the performance of the SPMD style of Cilk fast Fourier transform (FFT) parallel code is highly competitive and promising.

show abstract

“…A significant amount of research has been done on the problem of how to quickly obtain the bit-reversed index, e.g., [7]. Some websites provide good collections of suitable methods [9], [10].…”

Section: Related Workmentioning

confidence: 99%

QTIB: Quick bit-reversed permutations on CPUs

Knittel

2011

2011 17th International Conference on Digital Signal Processing (DSP)

View full text Add to dashboard Cite

We present a fast algorithm for out-of-place bit-reversed permutation of large vectors for input to an FFT. It is an extension of two previously published methods with special consideration of advanced CPU hardware features. In particular, the method makes heavy use of cache prefetching, MMX and SSE units, and write-combining buffers. Implementations have been made in assembly language for 2-byte and 4-byte operands. In terms of efficiency the method significantly outperforms previously reported methods. INTRODUCTIONThe Fast Fourier Transform (FFT) is a frequently used operation in many engineering applications. Often, overall application performance is determined by FFT runtime. Therefore, an efficient FFT implementation can be of greatest importance. One problem is that for a radix-2 FFT, input data is not read in natural order, but instead in the order of the bitreversed indices. This can cause severe performance penalties due to the irregular memory address pattern. The problem becomes worse if special-purpose processors such as Graphics Processing Units (GPUs) are used for FFT processing. These chips are optimized for linear access to video memory, any deviation from this access pattern can cause the memory bandwidth to drop to a few percent of peak performance.CPUs, on the other hand, are much better optimized for irregular memory accesses by means of large on-chip caches. Also, typical memory systems in modern PCs are designed for shorter access latencies.Moreover, a common scenario includes a data acquisition device providing a constant stream of data. Then, offloading the bit-reversed permutation (henceforth BRP) from the GPU can increase system efficiency by establishing concurrent CPU-GPU operation. Lastly, if the data stream needs to be reformatted anyway (stripping headers etc.) then it might be possible to merge the bit reversal with the required reformatting. Thus, using the CPU for BRP has potential benefits.However, such operation needs to keep pace with the algorithms running on the GPU. FFTs even on large vectors (>8M elements) take only a few milliseconds. All previously published methods on CPU-based BRP appeared to be too slow. This was the motivation for this work.Our department's main mission is processing signals from the Effelsberg radio telescope in Germany. The actual project deals with high-precision pulsar timing. Here, the signal chain includes analog amplifiers and filters, a high-speed data acquisition device, and one or more PCs equipped with powerful GPUs for signal processing.Inside the PC, data travels from the network adapter to main memory, possibly multiple times between the CPU and main memory, and finally via DMA to video memory. The task is to minimize traffic between CPU and main memory.The hardware features we can use are the caches and the write buffers of the CPU, as will be detailed later. Bit-reversed permutation in the inner loop is done using the interleave-operations provided by the MMX-and SSE-units as was proposed in [6]. Loop organization is done in the spiri...

show abstract

A new superfast bit reversal algorithm

Cited by 9 publications

References 9 publications

A Secured Reversible Data Hiding Technique for Multiple Secrets using Image Interpolation with Bit Reversal Permutation

A Secured Reversible Data Hiding Technique for Multiple Secrets using Image Interpolation with Bit Reversal Permutation

Parallel fast Fourier transform in SPMD style of Cilk

QTIB: Quick bit-reversed permutations on CPUs

Contact Info

Product

Resources

About