Results 81 to 90 of about 4,861 (197)
Single Pixel Imaging Based on Bicubic Interpolation Walsh Transform Matrix
Single pixel imaging is a new method, but imaging quality and speed are the main factors affecting its practicality. Building upon the attributes of the random measurement and deterministic matrices, a Walsh transformation matrix with bicubic ...
Wenying Zhang, Shanshan Jia, Haoran Zhu
doaj +1 more source
Single-pixel imaging with Morlet wavelet correlated random patterns
Single-pixel imaging is an indirect imaging technique which utilizes simplified optical hardware and advanced computational methods. It offers novel solutions for hyper-spectral imaging, polarimetric imaging, three-dimensional imaging, holographic ...
Czajkowski, Krzysztof M. +2 more
core +2 more sources
Blind Recognition Algorithm of Convolutional Code via Convolutional Neural Network
Pointing at the vexed question of blind recognition in the convolutional code class, this paper proposes a convolutional code blind identification method via convolutional neural networks (CNNs). First, this algorithm uses the traditional method to generate different convolutional codes, and the feature extraction algorithm adopts the theorem of Euclid’
Pan Deng +6 more
wiley +1 more source
Semi-automated bed boundary detection and log alignment using fast Walsh–Hadamard transform
Depth mismatches between well logs acquired in different runs (e.g., electrical wireline logging (EWL) versus logging while drilling (LWD)) impede stratigraphic correlation and bias reservoir property estimation.
Sushil Acharya +3 more
doaj +1 more source
Orthogonal frequency division multiplexing (OFDM) is a widely used modern communications technology due to its resistance to selective frequency fading and efficient use of spectrum. However, the security of OFDM signals remains a source of serious concern, especially in the face of network encryption that aims to disrupt communications or extract ...
Ammar Mohammedali Fadhil +2 more
wiley +1 more source
Q2SV: A High‐Level Synthesis Approach for State Vector Quantum Simulation
This study presents Q2SV, an FPGA‐based quantum state vector simulator implemented using high‐level synthesis (HLS), capable of simulating quantum circuits with up to 29 qubits. Using FPGA parallelism, efficient memory allocation, and hardware‐optimized execution pipelines, Q2SV achieves scalable quantum simulation without requiring iterative ...
Ahmad Bennakhi +3 more
wiley +1 more source
FPGA‐based parallel process for Walsh–Hadamard transform
A field‐programmable gate array‐based reconfigurable parallel computing unit to calculate the Walsh–Hadamard transform is proposed. The architecture can process long‐duration signals with a large number of samples. Obtained results demonstrate its versatility and usefulness in applications requiring online digital signal processing, utilising few ...
R. Reynoso‐Godinez +3 more
openaire +1 more source
REGULAR METHOD FOR SYNTHESIS OF BASIC BENT-SQUARES OF RANDOM ORDER
The paper is devoted to the class construction of the most non-linear Boolean bent-functions of any length N = 2k (k = 2, 4, 6…), on the basis of their spectral representation – Agievich bent squares.
A. V. Sokolov
doaj +1 more source
Generalized bent Boolean functions and strongly regular Cayley graphs [PDF]
In this paper we define the (edge-weighted) Cayley graph associated to a generalized Boolean function, introduce a notion of strong regularity and give several of its properties.
Gangopadhyay, Sugata +2 more
core +1 more source
Characterizing and Enumerating Walsh-Hadamard Transform Algorithms
We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies ($I_{2^{n-1}}\otimes \text{DFT}_2$) interleaved by linear permutations. Linear permutations are those that map linearly the binary representation of its element indices.
Serre, François, Püschel, Markus
openaire +2 more sources

