orthogonal frequency division multiplex
Recently Published Documents


TOTAL DOCUMENTS

28
(FIVE YEARS 3)

H-INDEX

9
(FIVE YEARS 0)

Electronics ◽  
2021 ◽  
Vol 10 (16) ◽  
pp. 2021
Author(s):  
Ammar Armghan

The evolution journey of optical network (ON) towards heterogeneous and flexible frameworks with high order of applications is continued from the last decade. Furthermore, the prominence of optical security, amount of transmitted data, bandwidth, and dependable presentation are heightened. The performance of ON is degraded in view of various natures of attacks at the physical layer, such as service disrupting and access to carrier data. In order to deal with such security breaches, new and efficient ON must be identified. So, this paper elaborates a detailed structure on physical layer security for heterogeneous ON. Possible mechanisms, such as Elliptic-curve Diffie–Hellman (ECDH), are used to treat a physical layer attack, and an efficient framework is proposed in this paper for 64 quadrature amplitude modulation-based orthogonal frequency division multiplex (64QAM-OFDM) ONs. Finally, theoretical and simulation validations are presented, and the effective results of the proposed method and viewpoint are concluded.


In 1965 a technique called Fast Fourier Transform (FFT) was invented to find the Fourier Transform. This paper compares three architectures, the basic architecture/ non-reduced architecture of FFT, decomposed FFT architecture without retiming and decomposed FFT architecture with retiming. In each case, the adder used will be Ripple Carry Adder (RCA) and Carry Save Adder (CSA). A fast Fourier transform (FFT) calculates the discrete Fourier transform (DFT) or the inverse (IDFT) of a sequence. Fourier analysis transforms a signal from time to frequency domain or vice versa. One of the most burgeoning use of FFT is in Orthogonal Frequency Division Multiplex (OFDM) used by most cell phones, followed by the use in image processing. The synthesis has been carried out on Xilinx ISE Design Suite 14.7. There is a decrease in delay of 0.824% in Ripple Carry Adder and 6.869% in Carry Save Adder, further the reduced architecture for both the RCA and CSA architectures shows significant area optimization (approximately 20%) from the non-reduced counterparts of the FFT implementation.


Sign in / Sign up

Export Citation Format

Share Document