Dynamic interactive bitwise meta-holography with ultra-high computational and display frame rates

Interactive holography offers unmatched levels of immersion and user engagement in the field of future display.Despite of the substantial progress has been made in dynamic meta-holography,the realization of real-time,highly smooth interactive holography remains a significant challenge due to the computational and display frame rate limitations.In this study,we introduced a dynamic interactive bitwise meta-holography with ultra-high computational and display frame rates.To our knowledge,this is the first reported practical dynamic interactive metasurface holographic system.We spa-tially divided the metasurface device into multiple distinct channels,each projecting a reconstructed sub-pattern.The switching states of these channels were mapped to bitwise operations on a set of bit values,which avoids complex holo-gram computations,enabling an ultra-high computational frame rate.Our approach achieves a computational frame rate of 800 kHz and a display frame rate of 23 kHz on a low-power Raspberry Pi computational platform.According to this methodology,we demonstrated an interactive dynamic holographic Tetris game system that allows interactive gameplay,color display,and on-the-fly hologram creation.Our technology presents an inspiration for advanced dynamic meta-holography,which is promising for a broad range of applications including advanced human-computer interaction,real-time 3D visualization,and next-generation virtual and augmented reality systems.

Study on a new chaotic bitwise dynamical system and its FPGA implementation

In this paper, the structure of a new chaotic bitwise dynamical system （CBDS） is described. Compared to our previous research work, it uses various random bitwise operations instead of only one. The chaotic behavior of CBDS is mathemat- ically proven according to the Devaney＇s definition, and its statistical properties are verified both for uniformity and by a comprehensive, reputed and stringent battery of tests called TestU01. Furthermore, a systematic methodology developing the parallel computations is proposed for FPGA platform-based realization of this CBDS. Experiments finally validate the proposed systematic methodology.

Classification of Images Based on a System of Hierarchical Features

The results of the development of the new fast-speed method of classification images using a structural approach are presented.The method is based on the system of hierarchical features,based on the bitwise data distribution for the set of descriptors of image description.The article also proposes the use of the spatial data processing apparatus,which simplifies and accelerates the classification process.Experiments have shown that the time of calculation of the relevance for two descriptions according to their distributions is about 1000 times less than for the traditional voting procedure,for which the sets of descriptors are compared.The introduction of the system of hierarchical features allows to further reduce the calculation time by 2–3 times while ensuring high efficiency of classification.The noise immunity of the method to additive noise has been experimentally studied.According to the results of the research,the marginal degree of the hierarchy of features for reliable classification with the standard deviation of noise less than 30 is the 8-bit distribution.Computing costs increase proportionally with decreasing bit distribution.The method can be used for application tasks where object identification time is critical.

Fault-Propagate Pattern Based DFA on PRESENT and PRINTcipher

This article proposes an enhanced differential fault analysis（DFA） method named as fault-propagation pattern-based DFA（FPP-DFA）.The main idea of FPP-DFA is using the FPP of the ciphertext difference to predict the fault location and the fault-propagation path.It shows that FPP-DFA is very effective on SPN structure block ciphers using bitwise permutation,which is applied to two block ciphers.The first is PRESENT with the substitution permutation sequence.With the fault model of injecting one nibble fault into the r-2nd round,on average 8 and 16 faults can reduce the key search space of PRESENT-80/128 to 214.7 and 221.1,respectively.The second is PRINTcipher with the permutation substitution sequence.For the first time,it shows that although the permutation of PRINTcipher is secret key dependent,FPP-DFA still works well on it.With the fault model of injecting one nibble fault into the r-2nd round,12 and 24 effective faults can reduce the key search space of PRINTcipher-48/96 to 213.7 and 222.8,respectively.