Search

The multimedia applications and mobile communication systems require an efficient reconfigurable finite impulse response (RFIR) filter designs for achieving low area, power, cost, and high speed of system operation. In this paper, an efficient RFIR filter is designed based on the Radix-2 algorithm and Look-up-table Carry Select Adder (Radix 2 – LCSLA). Generally, the RFIR filter is controlled by multiplier and adder, which improves the performances of the filter. Hence, this research work is mostly concentrated on the multiplier and adder design. Here, the radix-2 algorithm is used instead of normal multiplier for multiplication operation in the RFIR filter design. Additionally, CSLA and LCSLA approaches used in the Radix-2 structure for adding partial products. The LCSLA has achieved better performance compared to the normal CSLA approaches. In this paper, both the Radix-2 algorithm and LCSLA approach improved the performances of the proposed RFIR filter design. The proposed RFIR filter design was implemented in the Xilinx and Cadence RTL compiler by using the Verilog code. The RFIR-Radix 2-LCSLA filter design was verified in the Modelsim by utilizing the Verilog code. The experimental result showed that the RFIR-Radix 2-LCSLA methodology has improved the performance of ASIC and FPGA in the RFIR filter design up to 5–15% compared to the existing filter architecture: DA-RFIR and LC-CBA-RFIR methods. [ABSTRACT FROM AUTHOR]

Confidentiality and integrity processes are based on SNOW and ZUC algorithms. These standardized algorithms are designed by the 3rd Generation Partnership Project (3GPP) for advanced mobile communication systems. Each algorithm has two S-boxes in its nonlinear layer structure. This paper proposes three different approaches to enhance the security level of both algorithms. The first approach aims to select the best combination of two S-boxes in the nonlinear part of each algorithm. Results showed that the best randomness properties are achieved by combining the Feistel structure (S1-box) and Rijndael (S2-box) in the SNOW algorithm and New Rijndael (S1-box) and Rijndael (S2-box) in the ZUC algorithm. The second approach aims to increase the nonlinearity and complexity of these algorithms by selecting a strong S-box to cascade the best-existing two S-boxes for both algorithms. The third approach is an extension of the former, based on a dynamic reform of such S-boxes as a function of the "Authentication Token" to increase the computational complexity of the upgraded two algorithms. These proposed upgrades are simulated by C language and tested successfully for their statistical properties using the standard NIST SP 800-22 test suite. [ABSTRACT FROM AUTHOR]