Search results

This paper introduces an audio encryption algorithm based on permutation of audio samples using discrete modified Henon map followed by substitution operation with keystream generated from the modified Lorenz-Hyperchaotic system. In this work, the audio file is initially compressed by Fast Walsh Hadamard Transform (FWHT) for removing the residual intelligibility in the transform domain. The resulting file is then encrypted in two phases. In the first phase permutation operation is carried out using modified discrete Henon map to weaken the correlation between adjacent samples. In the second phase it utilizes modified-Lorenz hyperchaotic system for substitution operation to fill the silent periods within the speech conversation. Dynamic keystream generation mechanism is also introduced to enhance the correlation between plaintext and encrypted text. Various quality metrics analysis such as correlation, signal to noise ratio (SNR), differential attacks, spectral entropy, histogram analysis, keyspace and key sensitivity are carried out to evaluate the quality of the proposed algorithm. The simulation results and numerical analyses demonstrate that the proposed algorithm has excellent security performance and robust against various cryptographic attacks.

An introduction is given to the generation and use of new transform techniques which have important applications in binary control and processing methods. A comparison is made between the fast Fourier transform and the equivalent fast Walsh transform together with the steps required to produce a transform algorithm and computer program. Some applications of the transform are then discussed and which include spectral analysis, filtering, non‐linear control and communications uses. 18 references to current work in these applications areas are included.

Watermarking technique is one of the significant methods in which carrier signal hides digital information in the form of watermark to prevent the authenticity of the stakeholders by manipulating different coefficients as watermark in time and frequency domain to sustain trade-off in performance parameters. One challenging component among others is to maintain the robustness, to limit perceptibility with embedding information. Transform domain is more popular to achieve the required results in color image watermarking. Variants of complex Hadamard transform (CHT) have been applied for gray image watermarking, and it has been proved that it has better performance than other orthogonal transforms. This paper is aimed at analyzing the performance of spatio-chromatic complex Hadamard transform (Sp-CHT) that is proposed as an application of color image watermarking in sequency domain (SD).

In this paper, color image watermarking technique is designed and implemented in SD using spatio-chromatic – conjugate symmetric sequency – ordered CHT. The color of a pixel is represented as complex number a*+jb*, where a* and b* are chromatic components of International Commission on Illumination (CIE) La*b* color space. The embedded watermark is almost transparent to human eye although robust against common signal processing attacks.

Based on the results, bit error rate (BER) and peak signal to noise ratio are measured and discussed in comparison of CIE La*b* and hue, saturation and value color model with spatio-chromatic discrete Fourier transform (Sp-DFT), and results are also analyzed with other discrete orthogonal transforms. It is observed from BER that Sp-CHT has 8%–12% better performance than Sp-DFT. Structural similarity index has been measured at different watermark strength and it is observed that presented transform performs better than other transforms.

This work presents the details and comparative analysis of two orthogonal transforms as color image watermarking application using MATLAB software. A finding from this study demonstrates that the Complex Hadamard transform is the competent candidate that can be replaced with DFT in many signal processing applications.

Several chaotic system-based encryption techniques have been presented in recent years to protect digital images using cryptography. The challenges of key distribution and administration make symmetric encryption difficult. The purpose of this paper is to address these concerns, the novel hybrid partial differential elliptical Rubik’s cube algorithm is developed in this study as an asymmetric image encryption approach. This novel algorithm generates a random weighted matrix, and uses the masking method on image pixels with Rubik’s cube principle. Security analysis has been conducted, it enhances and increases the reliability of the proposed algorithm against a variety of attacks including statistical and differential attacks.

In this light, a differential elliptical model is designed with two phases for image encryption and decryption. A modified image is achieved by rotating and mixing intensities of rows and columns with a masking matrix derived from the key generation technique using a unique approach based on the elliptic curve and Rubik’s cube principle.

To evaluate the security level, the proposed algorithm is tested with statistical and differential attacks on a different set of test images with peak signal-to-noise ratio, unified average changed intensity and number of pixel change rate performance metrics. These results proved that the proposed image encryption method is completely reliable and enhances image security during transmission.

The elliptic curve–based encryption is hard to break by hackers and adding a Rubik’s cube principle makes it even more complex and nearly impossible to decode. The proposed method provides reduced key size.

The tremendous growth of wireless applications and the demand for high data rate, the spectrum utilization improvement has been the most crucial challenges for wireless communication. Adapting cognitive radio with orthogonal frequency division multiplexing or offset quadrature amplitude modulation (OFDM/OQAM) improves the spectrum and energy efficiencies.

Thus, it overcomes the spectral leakage problem at the transmitter side and leads to less interference from secondary user (SUs) to primary user (PUs) and between the SUs in cognitive radio technology. The benefit of exploiting pulse shape filtering in the OFDM/OQAM is to not only eliminate the requirement of the guard bands but also reduce the out of band energy transmission, which also improves the spectral isolation from the neighboring systems. But the high peak to average power ratio (PAPR) phenomenon is a common issue in the majority of the multicarrier modulation systems and thus OFDM/OQAM is no exception in this case.

Therefore, this paper aims to examine the effect of integrating the Walsh–Hadamard Transform (WHT) on the power spectral density and investigates the problem of PAPR in the WHT/OQAM system.

Thus, it overcomes the spectral leakage problem at the transmitter side and leads to less interference from SUs to PUs and between the SUs in cognitive radio technology. The benefit of exploiting pulse shape filtering in the OFDM/OQAM is to not only eliminate the requirement of the guard bands but also reduce the out of band energy transmission, which also improves the spectral isolation from the neighboring systems. But the high PAPR phenomenon is a common issue in the majority of the multicarrier modulation systems thus OFDM/OQAM is no exception in this case.

Current practices in data classification and retrieval have experienced a surge in the use of multimedia content. Identification of desired information from the huge image databases has been facing increased complexities for designing an efficient feature extraction process. Conventional approaches of image classification with text-based image annotation have faced assorted limitations due to erroneous interpretation of vocabulary and huge time consumption involved due to manual annotation. Content-based image recognition has emerged as an alternative to combat the aforesaid limitations. However, exploring rich feature content in an image with a single technique has lesser probability of extract meaningful signatures compared to multi-technique feature extraction. Therefore, the purpose of this paper is to explore the possibilities of enhanced content-based image recognition by fusion of classification decision obtained using diverse feature extraction techniques.

Three novel techniques of feature extraction have been introduced in this paper and have been tested with four different classifiers individually. The four classifiers used for performance testing were K nearest neighbor (KNN) classifier, RIDOR classifier, artificial neural network classifier and support vector machine classifier. Thereafter, classification decisions obtained using KNN classifier for different feature extraction techniques have been integrated by Z-score normalization and feature scaling to create fusion-based framework of image recognition. It has been followed by the introduction of a fusion-based retrieval model to validate the retrieval performance with classified query. Earlier works on content-based image identification have adopted fusion-based approach. However, to the best of the authors’ knowledge, fusion-based query classification has been addressed for the first time as a precursor of retrieval in this work.

The proposed fusion techniques have successfully outclassed the state-of-the-art techniques in classification and retrieval performances. Four public data sets, namely, Wang data set, Oliva and Torralba (OT-scene) data set, Corel data set and Caltech data set comprising of 22,615 images on the whole are used for the evaluation purpose.

To the best of the authors’ knowledge, fusion-based query classification has been addressed for the first time as a precursor of retrieval in this work. The novel idea of exploring rich image features by fusion of multiple feature extraction techniques has also encouraged further research on dimensionality reduction of feature vectors for enhanced classification results.

The purpose of this paper is to introduce an approach for m‐valued classical and non‐classical (reversible and quantum) optical computing. The developed approach utilizes new multiplexer‐based optical devices and circuits within switch logic to perform the required optical computing. The implementation of the new optical devices and circuits in the optical regular logic synthesis using new lattice and systolic architectures is introduced, and the extensions to quantum optical computing are also presented.

The new linear optical circuits and systems utilize coherent light beams to perform the functionality of the basic logic multiplexer. The 2‐to‐1 multiplexer is a basic building block in switch logic, where in switch logic a logic circuit is implemented as a combination of switches rather than a combination of logic gates as in the gate logic, which proves to be less‐costly in synthesizing wide variety of logic circuits and systems. The extensions to quantum optical computing using photon spins and the collision of Manakov solitons are also presented.

New circuits for the optical realizations of m‐valued classical and reversible logic functions are introduced. Optical computing extensions to linear quantum computing using photon spins and nonlinear quantum computing using Manakov solitons are also presented. Three new multiplexer‐based linear optical devices are introduced that utilize the properties of frequency, polarization and incident angle that are associated with any light‐matter interaction. The hierarchical implementation of the new optical primitives is used to synthesize regular optical reversible circuits such as the m‐valued regular optical reversible lattice and systolic circuits. The concept of parallel optical processing of an array of input laser beams using the new multiplexer‐based optical devices is also introduced. The design of regular quantum optical systems using regular quantum lattice and systolic circuits is introduced. New graph‐based quantum optical representations using various types of quantum decision trees are also presented to efficiently represent quantum optical circuits and systems.

The introduced methods for classical and non‐classical (reversible and quantum) optical regular circuits and systems are new and interesting for the design of several future technologies that require optimal design specifications such as super‐high speed, minimum power consumption and minimum size such as in quantum computing and nanotechnology.

The purpose of this paper is to introduce new non‐classical implementations of neural networks (NNs). The developed implementations are performed in the quantum, nano, and optical domains to perform the required neural computing. The various implementations of the new NNs utilizing the introduced architectures are presented, and their extensions for the utilization in the non‐classical neural‐systolic networks are also introduced.

The introduced neural circuits utilize recent findings in the quantum, nano, and optical fields to implement the functionality of the basic NN. This includes the techniques of many‐valued quantum computing (MVQC), carbon nanotubes (CNT), and linear optics. The extensions of implementations to non‐classical neural‐systolic networks using the introduced neural‐systolic architectures are also presented.

Novel NN implementations are introduced in this paper. NN implementation using the general scheme of MVQC is presented. The proposed method uses the many‐valued quantum orthonormal computational basis states to implement such computations. Physical implementation of quantum computing (QC) is performed by controlling the potential to yield specific wavefunction as a result of solving the Schrödinger equation that governs the dynamics in the quantum domain. The CNT‐based implementation of logic NNs is also introduced. New implementations of logic NNs are also introduced that utilize new linear optical circuits which use coherent light beams to perform the functionality of the basic logic multiplexer by utilizing the properties of frequency, polarization, and incident angle. The implementations of non‐classical neural‐systolic networks using the introduced quantum, nano, and optical neural architectures are also presented.

The introduced NN implementations form new important directions in the NN realizations using the newly emerging technologies. Since the new quantum and optical implementations have the advantages of very high‐speed and low‐power consumption, and the nano implementation exists in very compact space where CNT‐based field effect transistor switches reliably using much less power than a silicon‐based device, the introduced implementations for non‐classical neural computation are new and interesting for the design in future technologies that require the optimal design specifications of super‐high speed, minimum power consumption, and minimum size, such as in low‐power control of autonomous robots, adiabatic low‐power very‐large‐scale integration circuit design for signal processing applications, QC, and nanotechnology.

In order to optimize BER and to substantiate performance measures, initially, the filter bank multicarrier (FBMC) quadrature amplitude modulation (QAM) performance metrics are evaluated with the cyclic prefix-orthogonal frequency division multiplexing (CP-OFDM) system. The efficiency of CP-OFDM, as well as FBMC/QAM that is transmitting over specific fading channels, is evaluated in terms of quality trade-off metrics over bit error rate (BER) as well as modulation order. When compared with the traditional FBMC systems, the proposed FBMC QAM system shows better performance. The performance metrics of FBMC/QAM with the inclusion of multiuser multiple-input-multiple-output (MUMIMO) is validated with worst case channel environment. The performance penalty gap that exists in CP- OFDM is compared with improved FBMC QAM in terms of both BER and OOB radiation measures. The BER trade off comparison between ML and MMSE optimally determine the prominent signal detection model for high performance FBMC QAM system.

The main objective of this research work is to provide perceptions about performance, co-channel interference avoidance as well as about the techniques that are used for minimizing the complexity of the system that is related to FBMC QAM structure for reducing intrinsic interference with higher spectral features as well as maximal likelihood (ML) detector systems.

This research work also looks at the efficiency of multiuser multiple-input-multiple-output (MU-MIMO) FBMC/QAM over nonlinear channels. Furthermore, when compared with OFDM, it also significantly reduces the penalty gap efficiency, thereby enabling the accessibility of the proposed FBMC QAM system from BER as well as implementation point of view. Finally, the signal detection is facilitated by the sub-detector and is achieved on the downlink side by making use of threshold-driven statistical measures that accurately minimize the complexity trade-off measures of the ML detector over modulation order. The computation of the proposed FBMC method’s BER performance measures was carried out through MATLAB simulation environments, as well as efficiency of the suggested work was demonstrated through detailed analyses.

This research work intend to combine the efficient MU-MIMO based transmission scheme with optimal FBMC/QAM for improved QoS over highly nonlinear channels which includes both delay spread and Doppler effects. And optimal signal detection model is facilitated at the downlink side by making use of threshold-driven statistical measures that accurately minimize the complexity trade-off measures of the ML detector over modulation order. The computation of the proposed FBMC method’s BER performance measures was carried out through MATLAB simulation environments, as well as efficiency of the suggested work was demonstrated through detailed analyses.