Search Results (30)

The resource limitations of Low-Power Wireless Networks (LP-WNs), such as Wireless Sensor Networks (WSNs), Wireless Actuator/Sensor Networks (WA/SNs), and Internet of Things (IoT) outdoor applications, restrict the utilization of the error-performance-enhancing techniques and the use of the powerful and robust security tools. Therefore, these LP-WN applications require special techniques to satisfy the requirements of a low data loss rate and satisfy the security requirements while considering the accepted level of complexity and power efficiency of these techniques. This paper focuses on proposing a power-efficient, robust cryptographic algorithm for the WA/SNs. The lower-complexity cryptographic algorithm is proposed, based on merging the data composition tools utilizing data transforms and chaos mapping techniques. The decomposing tool is performed by the various data transforms: Discrete Cosine Transform (DCT), Discrete Cosine Wavelet (DWT), Fast Fourier Transform (FFT), and Walsh Hadamard Transform (WHT); the DWT performs better with efficient complexity. It is utilized to separate the plaintext into the main portion and side information portions to reduce more than 50% of complexity. The main plaintext portion is ciphered in the series of cryptography to reduce the complexity and increase the security capabilities of the proposed algorithm by two chaos mappings. The process of reduction saves complexity and is employed to feed the series of chaos cryptography without increasing the complexity. The two chaos mappings are used, and two-dimensional (2D) chaos logistic maps are used due to their high sensitivity to noise and attacks. The chaos 2D baker map is utilized due to its high secret key managing flexibility and high sensitivity to initial conditions and plaintext dimensions. Several computer experiments are demonstrated to evaluate the robustness, reliability, and applicability of the proposed complexity-efficient crypto-system algorithm in the presence of various attacks. The results prove the high suitability of the proposed lower-complexity crypto-system for WASN and LP-WN applications due to its robustness in the presence of attacks and its power efficiency. Full article

The autofluorescence of erythrocyte porphyrins has emerged as a potential method for multi-cancer early detection (MCED). With this method’s dependence on research-grade spectrofluorometers, significant improvements in instrumentation are necessary to translate its potential into clinical practice, as with any promising medical technology. To fill this gap, in this paper, we present an automated ratio porphyrin analyzer for cancer screening (ARPA-CS), a low-cost, portable, and automated instrument for MCED via the ratio fluorometry of porphyrins. The ARPA-CS aims to facilitate cancer screening in an inexpensive, rapid, non-invasive, and reasonably accurate manner for use in primary clinics or at point of care. To accomplish this, the ARPA-CS uses an ultraviolet-excited optical apparatus for ratio fluorometry that features two photodetectors for detection at 590 and 630 nm. Additionally, it incorporates a synchronous detector for the precision measurement of signals based on the Walsh-ordered Walsh–Hadamard transform (WHT)_w and circular shift. To estimate its single-photodetector capability, we established a linear calibration curve for the ARBA-CS exceeding four orders of magnitude with a linearity of up to 0.992 and a low detection limit of 0.296 µg/mL for riboflavin. The ARPA-CS also exhibited excellent repeatability (0.21%) and stability (0.60%). Moreover, the ratio fluorometry of three serially diluted standard solutions of riboflavin yielded a ratio of 0.4, which agrees with that expected based on the known emission spectra of riboflavin. Additionally, the ratio fluorometry of the porphyrin solution yielded a ratio of 49.82, which was ascribed to the predominant concentration of protoporphyrin IX in the brown eggshells, as confirmed in several studies. This study validates this instrument for the ratio fluorometry of porphyrins as a biomarker for MCED. Nevertheless, large and well-designed clinical trials are necessary to further elaborate more on this matter. Full article

Developing precise deep learning (DL) models for predicting tool wear is challenging, particularly due to the scarcity of experimental data. To address this issue, this paper introduces an innovative approach that leverages the capabilities of tabular generative adversarial networks (TGAN) and conditional single image GAN (ConSinGAN). These models are employed to generate synthetic data, thereby enriching the dataset and enhancing the robustness of the predictive models. The efficacy of this methodology was rigorously evaluated using publicly available milling datasets. The pre-processing of acoustic emission data involved the application of the Walsh-Hadamard transform, followed by the generation of spectrograms. These spectrograms were then used to extract statistical attributes, forming a comprehensive feature vector for model input. Three DL models—encoder-decoder long short-term memory (ED-LSTM), gated recurrent unit (GRU), and convolutional neural network (CNN)—were applied to assess their tool wear prediction capabilities. The application of 10-fold cross-validation across these models yielded exceptionally low RMSE and MAE values of 0.02 and 0.16, respectively, underscoring the effectiveness of this approach. The results not only highlight the potential of TGAN and ConSinGAN in mitigating data scarcity but also demonstrate significant improvements in the accuracy of tool wear predictions, paving the way for more reliable and precise predictive maintenance in manufacturing processes. Full article

With the exponential growth of the Internet of Things (IoT), ensuring robust end-to-end encryption is paramount. Current cryptographic accelerators often struggle with balancing security, area efficiency, and power consumption, which are critical for compact IoT devices and system-on-chips (SoCs). This work presents a novel approach to designing substitution boxes (S-boxes) for Advanced Encryption Standard (AES) encryption, leveraging dual quad-bit structures to enhance cryptographic security and hardware efficiency. By utilizing Algebraic Normal Forms (ANFs) and Walsh–Hadamard Transforms, the proposed Register Transfer Level (RTL) circuitry ensures optimal non-linearity, low differential uniformity, and bijectiveness, making it a robust and efficient solution for ASIC implementations. Implemented on 65 nm CMOS technology, our design undergoes rigorous statistical analysis to validate its security strength, followed by hardware implementation and functional verification on a ZedBoard. Leveraging Cadence EDA tools, the ASIC implementation achieves a central circuit area of approximately 199 μm². The design incurs a hardware cost of roughly 80 gate equivalents and exhibits a maximum path delay of 0.38 ns. Power dissipation is measured at approximately 28.622 μW with a supply voltage of 0.72 V. According to the ASIC implementation on the TSMC 65 nm process, the proposed design achieves the best area efficiency, approximately 66.46% better than state-of-the-art designs. Full article

In this paper, three discrete transforms related to vector spaces over finite fields are studied. For our purposes, and according to the properties of the finite fields, the most suitable transforms are as follows: for binary fields, this is the Walsh–Hadamard transform; for odd prime fields, the Vilenkin–Chrestenson transform; and for composite fields, the trace transform. A factorization of the transform matrices using Kronecker power is given so that the considered discrete transforms are reduced to the fast discrete transforms. Examples and applications are also presented of the considered transforms in coding theory for calculating the weight distribution of a linear code. Full article

This paper introduces an effective blind watermarking algorithm for double-color images utilizing the Walsh–Hadamard Transform (WHT) with symmetric embedding locations to enhance imperceptibility. The proposed algorithm leverages the energy accumulation capability and significant correlations among coefficients of the WHT. First, the color host image undergoes partitioning into its respective red (R), green (G), and blue (B) channels, followed by further subdivision into 4 × 4 blocks. Through research, the algorithm determines which WHT coefficients are least visually sensitive to embedding a color image, and as a result, optimizes the embedding locations to achieve better imperceptibility. The extensive simulation results verify the superior performance of the proposed algorithm compared to other related approaches, showcasing its excellence not only in imperceptibility but also in embedding capacity and robustness. Full article

Tool wear is an important concern in the manufacturing sector that leads to quality loss, lower productivity, and increased downtime. In recent years, there has been a rise in the popularity of implementing TCM systems using various signal processing methods and machine learning algorithms. In the present paper, the authors propose a TCM system that incorporates the Walsh–Hadamard transform for signal processing, DCGAN aims to circumvent the issue of the availability of limited experimental dataset, and the exploration of three machine learning models: support vector regression, gradient boosting regression, and recurrent neural network for tool wear prediction. The mean absolute error, mean square error and root mean square error are used to assess the prediction errors from three machine learning models. To identify these relevant features, three metaheuristic optimization feature selection algorithms, Dragonfly, Harris hawk, and Genetic algorithms, were explored, and prediction results were compared. The results show that the feature selected through Dragonfly algorithms exhibited the least MSE (0.03), RMSE (0.17), and MAE (0.14) with a recurrent neural network model. By identifying the tool wear patterns and predicting when maintenance is required, the proposed methodology could help manufacturing companies save money on repairs and replacements, as well as reduce overall production costs by minimizing downtime. Full article

This paper proposes an identification approach for the Electronic Control Units (ECUs) in the vehicle, which are based on the physical characteristics of the ECUs extracted from their voltage output. Then, the identification is not based on cryptographic means, but it could be used as an alternative or complementary means to strengthen cryptographic solutions for vehicle cybersecurity. While previous research has used hand-crafted features such as mean voltage, max voltage, skew or variance, this study applies Convolutional Neural Networks (CNNs) in combination with the Walsh–Hadamard Transform (WHT), which has useful properties of compactness and robustness to noise. These properties are exploited by the CNN, and in particular, the pooling layers, to reduce the size of the feature maps in the CNN. The proposed approach is applied to a recently public data set of ECU voltage fingerprints extracted from different automotive vehicles. The results show that the combination of CNN and the WHT outperforms, in terms of identification accuracy, robustness to noise and computing times, and other approaches proposed in the literature based on shallow machine learning and tailor-made features, as well as CNN with other linear transforms such as the Discrete Fourier Transform (DFT) or CNN with the original time domain representations. Full article

Boolean functions are important in terms of their cryptographic and combinatorial properties for different kinds of cryptosystems. The nonlinearity and resiliency of cryptographic functions are crucial criteria with respect to protection of ciphers from affine approximation and correlation attacks. In this article, some constructions of disjoint spectra Boolean that function by concatenating the functions on a lesser number of variables are provided. The nonlinearity and resiliency profiles of the constructed functions are obtained. From the profiles of the constructed functions, it is observed that the nonlinearity of these functions is greater than or equal to the nonlinearity of some existing functions. Furthermore, in the security analysis of cryptosystems, 4th order nonlinearity of Boolean functions play a crucial role. It provides protection against various higher order approximation attacks. The lower bounds on 4th order nonlinearity of some classes of Boolean functions having degree 5 are provided. The lower bounds of two classes of functions have form $T{r}_1^n\left(\lambda x^d\right)$ for all $x\in {\mathbb{F}}_{2^n},$$\lambda \in {\mathbb{F}}_{2^n}^{*},$ where (i) $d=2^i+2^j+2^k+2^{\ell }+1,$ where $i,j,k,\ell$ are integers such that $i>j>k>\ell \ge 1$ and $n>2i$, and (ii) $d=2^{4\ell }+2^{3\ell }+2^{2\ell }+2^{\ell }+1,$ where $\ell >0$ is an integer with property $\gcd (\ell ,n)=1$, $n>8$ are provided. The obtained lower bounds are compared with some existing results available in the literature. Full article

Among the leading causes of mortality and morbidity in people are lung and colon cancers. They may develop concurrently in organs and negatively impact human life. If cancer is not diagnosed in its early stages, there is a great likelihood that it will spread to the two organs. The histopathological detection of such malignancies is one of the most crucial components of effective treatment. Although the process is lengthy and complex, deep learning (DL) techniques have made it feasible to complete it more quickly and accurately, enabling researchers to study a lot more patients in a short time period and for a lot less cost. Earlier studies relied on DL models that require great computational ability and resources. Most of them depended on individual DL models to extract features of high dimension or to perform diagnoses. However, in this study, a framework based on multiple lightweight DL models is proposed for the early detection of lung and colon cancers. The framework utilizes several transformation methods that perform feature reduction and provide a better representation of the data. In this context, histopathology scans are fed into the ShuffleNet, MobileNet, and SqueezeNet models. The number of deep features acquired from these models is subsequently reduced using principal component analysis (PCA) and fast Walsh–Hadamard transform (FHWT) techniques. Following that, discrete wavelet transform (DWT) is used to fuse the FWHT’s reduced features obtained from the three DL models. Additionally, the three DL models’ PCA features are concatenated. Finally, the diminished features as a result of PCA and FHWT-DWT reduction and fusion processes are fed to four distinct machine learning algorithms, reaching the highest accuracy of 99.6%. The results obtained using the proposed framework based on lightweight DL models show that it can distinguish lung and colon cancer variants with a lower number of features and less computational complexity compared to existing methods. They also prove that utilizing transformation methods to reduce features can offer a superior interpretation of the data, thus improving the diagnosis procedure. Full article

Transmission capacity and receiver sensitivity of an intensity-modulation direct detection (IM-DD) optical discrete multi-tone (DMT) system can be improved by using the probabilistically shaping (PS) technique. However, different probabilistic distributions will be required owing to the unbalanced signal-to-noise ratio (SNR) among data-carrying subcarriers (SCs) induced by the imperfect frequency response of optical/electrical devices, which can increase the implementation complexity of the PS-DMT transceiver. In this work, different signal pre-processing schemes including pre-equalization, Walsh–Hadamard transform (WHT)-based full data-carrying SCs precoding (FDSP) and fast WHT-based partial data-carrying SCs precoding (PDSP) are investigated for SNR equalization in a short-reach PS-DMT transmission system. After transmission over 50 km single-mode fiber, the experimental results indicated that three pre-processed signals have almost the same generalized mutual information (GMI) performance and receiver sensitivity improvements. The proposed fast WHT-based PDSP scheme may be a good option for the implementation of the PS-DMT transmission systems with a large SC SNR fluctuation regarding computational complexity. Full article

A tensor representation structure based on the multilayer tensor spectrum pyramid (MLTSP) is introduced in this work. The structure is “truncated”, i.e., part of the high-frequency spectrum coefficients is cut-off, and on the retained low-frequency coefficients, obtained at the output of each pyramid layer, a hierarchical tensor SVD (HTSVD) is applied. This ensures a high concentration of the input tensor energy into a small number of decomposition components of the tensors obtained at the coder output. The implementation of this idea is based on a symmetrical coder/decoder. An example structure for a cubical tensor of size 8 × 8 × 8, which is represented as a two-layer tensor spectrum pyramid, where 3D frequency-ordered fast Walsh–Hadamard transform and HTSVD are used, is given in this paper. The analysis of the needed mathematical operations proved the low computational complexity of the new approach, due to a lack of iterative calculations. The high flexibility of the structure in respect to the number of pyramid layers, the kind of used orthogonal transforms, the number of retained spectrum coefficients, and HTSVD components, permits us to achieve the desired accuracy of the restored output tensor, imposed by the application. Furthermore, this paper presents one possible application for 3D object searches in a tensor database. In this case, to obtain the invariant representation of the 3D objects, in the spectrum pyramid, the 3D modified Mellin–Fourier transform is embedded, and the corresponding algorithm is shown. Full article

To meet the high bit rate requirements in many multimedia applications, a lossy image compression algorithm based on Walsh–Hadamard kernel-based feature extraction, discrete cosine transform (DCT), and bi-level quantization is proposed in this paper. The selection of the quantization matrix of the block is made based on a weighted combination of the block feature strength (BFS) of the block extracted by projecting the selected Walsh–Hadamard basis kernels on an image block. The BFS is compared with an automatically generated threshold for applying the specific quantization matrix for compression. In this paper, higher BFS blocks are processed via DCT and high Q matrix, and blocks with lower feature strength are processed via DCT and low Q matrix. So, blocks with higher feature strength are less compressed and vice versa. The proposed algorithm is compared to different DCT and block truncation coding (BTC)-based approaches based on the quality parameters, such as peak signal-to-noise ratio (PSNR) and structural similarity (SSIM) at constant bits per pixel (bpp). The proposed method shows significant improvements in performance over standard JPEG and recent approaches at lower bpp. It achieved an average PSNR of 35.61 dB and an average SSIM of 0.90 at a bpp of 0.5 and better perceptual quality with lower visual artifacts. Full article

The electro-optic output of light-emitting diodes commonly used in visible light communication systems is generally nonlinear in nature. It is particularly problematic when using advanced modulation formats, such as orthogonal frequency-division multiplexing (OFDM), which have a high peak-to-average power ratio due to clipping and distortion. In this work, we introduce the so-called C-transform to the system architecture, which utilises a Walsh–Hadamard matrix in conjunction with a discrete cosine transform to deterministically spread the information and reduce the peak-to-average power ratio (PAPR). Several bias points along the electro-optic transfer function were selected for comparison purposes, and the new transform was compared with more traditional formulations of OFDM. This paper determines that the C-transform-based OFDM demonstrated the highest degree of independence from the non-linearity and yielded superior bit-error rate (BER) results. We note an improvement of ~2.5 dB in the power penalty at a BER of 10⁻⁴ in comparison to OFDM. Full article

The data space for audio signals is large, the correlation is strong, and the traditional encryption algorithm cannot meet the needs of efficiency and safety. To solve this problem, an audio encryption algorithm based on Chen memristor chaotic system is proposed. The core idea of the algorithm is to encrypt the audio signal into the color image information. Most of the traditional audio encryption algorithms are transmitted in the form of noise, which makes it easy to attract the attention of attackers. In this paper, a special encryption method is used to obtain higher security. Firstly, the Fast Walsh–Hadamar Transform (FWHT) is used to compress and denoise the signal. Different from the Fast Fourier Transform (FFT) and the Discrete Cosine Transform (DCT), FWHT has good energy compression characteristics. In addition, compared with that of the triangular basis function of the Fast Fourier Transform, the rectangular basis function of the FWHT can be more effectively implemented in the digital circuit to transform the reconstructed dual-channel audio signal into the R and B layers of the digital image matrix, respectively. Furthermore, a new Chen memristor chaotic system solves the periodic window problems, such as the limited chaos range and nonuniform distribution. It can generate a mask block with high complexity and fill it into the G layer of the color image matrix to obtain a color audio image. In the next place, combining plaintext information with color audio images, interactive channel shuffling can not only weaken the correlation between adjacent samples, but also effectively resist selective plaintext attacks. Finally, the cryptographic block is used for overlapping diffusion encryption to fill the silence period of the speech signal, so as to obtain the ciphertext audio. Experimental results and comparative analysis show that the algorithm is suitable for different types of audio signals, and can resist many common cryptographic analysis attacks. Compared with that of similar audio encryption algorithms, the security index of the algorithm is better, and the efficiency of the algorithm is greatly improved. Full article