scholarly journals Physical IC Design Layout of Memory-Based Real Fast Fourier Transform Architecture using 90nm Technology

2020 ◽  
Vol 8 (5) ◽  
pp. 3681-3685
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Communication Systems ◽  
High Speed ◽  
Large Scale ◽  
Low Complexity ◽  
Design Flow ◽  
Digital Subscriber Line ◽  
Ic Design ◽  
Subscriber Line

In this paper we present a low complexity physical IC layout for memory based Real Fast Fourier Transform (RFFT) architecture using 90nm technology. FFT architectures are the most important algorithms in the modern communication systems like and very high bit rate digital subscriber line (VDSL) asymmetric digital subscriber line (ADSL). In this FFT algorithm is based on radix-2 decimation-in-frequency. In order to meet the real time requirements of very large scale integration (VLSI), we designed a low complexity and high speed FFT architecture. The RFFT architecture was realised using Verilog hardware description language (HDL). This architecture is simulated using Native code launch of cadence and synthesized using RTL code complier of cadence tool. Each step of application specific integrated circuit (ASIC) physical IC design flow was synthesized using cadence Innovus 90nm technology and we optimize the design to reduce the area, power and timing requirements

scholarly journals Design of High Speed FFT using Urdhva-Tiryagbhyam Algorithm and Karatsuba Algorithm

2020 ◽  
Vol 9 (4) ◽  
pp. 1904-1908
Keyword(s):  
Image Processing ◽  
Signal Processing ◽  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Execution Time ◽  
Communication Systems ◽  
High Speed ◽  
Floating Point ◽  
Calculation Algorithms ◽  
Floating Point Number

In gift scenario each method has to be compelled to be quick, adept and simple. Fast Fourier transform (FFT) may be a competent algorithmic program to calculate the N purpose Discrete Fourier transform (DFT).It has huge applications in communication systems, signal processing and image processing and instrumentation. However the accomplishment of FFT needs immense range of complicated multiplications, therefore to create this method quick and simple. It’s necessary for a number to be quick and power adept. To influence this problem the mixture of Urdhva Tiryagbhyam associate degreed Karatsuba algorithmic program offers is an adept technique of multiplication [1]. Vedic arithmetic is that the aboriginal system of arithmetic that includes a distinctive technique of calculation supported sixteen Sutras. Using these techniques within the calculation algorithms of the coprocessor can reduce the complexness, execution time, area, power etc. The distinctiveness during this project is Fast Fourier Transform (FFT) style methodology exploitation mixture of Urdhva Tiryagbhyam and Karatsuba algorithmic program based mostly floating point number. By combining these two approaches projected style methodology is time-area-power adept [1] [2]. The code writing is completed in verilog and also the FPGA synthesis on virtex 5 is completed using Xilinx ISE 14.5.

scholarly journals A fast methodology for large-scale focusing inversion of gravity and magnetic data using the structured model matrix and the 2-D fast Fourier transform

2020 ◽  
Vol 223 (2) ◽  
pp. 1378-1397
Author(s):  
Rosemary A Renaut ◽  
Jarom D Hogue ◽  
Saeed Vatankhah ◽  
Shuang Liu
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Linear Systems ◽  
Large Scale ◽  
Surface Measurement ◽  
Magnetic Data ◽  
Uniform Grid ◽  
Data Sets ◽  
Inversion Algorithm ◽  
Data Set

SUMMARY We discuss the focusing inversion of potential field data for the recovery of sparse subsurface structures from surface measurement data on a uniform grid. For the uniform grid, the model sensitivity matrices have a block Toeplitz Toeplitz block structure for each block of columns related to a fixed depth layer of the subsurface. Then, all forward operations with the sensitivity matrix, or its transpose, are performed using the 2-D fast Fourier transform. Simulations are provided to show that the implementation of the focusing inversion algorithm using the fast Fourier transform is efficient, and that the algorithm can be realized on standard desktop computers with sufficient memory for storage of volumes up to size n ≈ 106. The linear systems of equations arising in the focusing inversion algorithm are solved using either Golub–Kahan bidiagonalization or randomized singular value decomposition algorithms. These two algorithms are contrasted for their efficiency when used to solve large-scale problems with respect to the sizes of the projected subspaces adopted for the solutions of the linear systems. The results confirm earlier studies that the randomized algorithms are to be preferred for the inversion of gravity data, and for data sets of size m it is sufficient to use projected spaces of size approximately m/8. For the inversion of magnetic data sets, we show that it is more efficient to use the Golub–Kahan bidiagonalization, and that it is again sufficient to use projected spaces of size approximately m/8. Simulations support the presented conclusions and are verified for the inversion of a magnetic data set obtained over the Wuskwatim Lake region in Manitoba, Canada.

scholarly journals Trajectory Planning in UAV Emergency Networks with Potential Underlaying D2D Communication Based on K-means

2021 ◽  
Author(s):  
Shuo Zhang ◽  
Shuo Shi ◽  
Tianming Feng ◽  
Xuemai Gu
Keyword(s):  
Trajectory Planning ◽  
Communication Systems ◽  
High Speed ◽  
Large Scale ◽  
High Reliability ◽  
Base Station ◽  
Planning Problem ◽  
Communication Signal ◽  
User Coverage ◽  
Trajectory Length

Abstract Unmanned aerial vehicles (UAVs) have been widely used in communication systems due to excellent maneuverability and mobility. The ultra-high speed, ultra-low latency, and ultra-high reliability of 5th generation wireless systems (5G) have further promoted vigorous development of UAVs. Compared with traditional means of communication, UAV can provide services for ground terminal without time and space constraints, so it is often used as air base station (BS). Especially in emergency communications and rescue, it provides temporary communication signal coverage service for disaster areas. In the face of large-scale and scattered user coverage tasks, UAV's trajectory is an important factor affecting its energy consumption and communication performance. In this paper, we consider a UAV emergency communication network where UAV aims to achieve complete coverage of potential underlying D2D users (DUs). The trajectory planning problem is transformed into the deployment and connection problem of stop points (SPs). Aiming at trajectory length and sum throughput, two trajectory planning algorithms based on K-means are proposed. Due to the non-convexity of sum throughput optimization, we present a sub-optimal solution by using the successive convex approximation (SCA) method. In order to balance the relationship between trajectory length and sum throughput, we propose a joint evaluation index which is used as an objective function to further optimize trajectory. Simulation results show the validity of the proposed algorithms which have advantages over the well-known benchmark scheme in terms of trajectory length and sum throughput.

scholarly journals Channel estimation of OFDM in C-band communication systems under different distribution conditions

2021 ◽  
Vol 23 (3) ◽  
pp. 1778
Author(s):  
Heba Abdul-Jaleel Al-Asady ◽  
Hassan Falah Fakhruldeen ◽  
Mustafa Qahtan Alsudani
Keyword(s):  
Fourier Transform ◽  
Channel Estimation ◽  
Fast Fourier Transform ◽  
Communication Systems ◽  
Orthogonal Frequency Division Multiplexing ◽  
Frequency Division Multiplexing ◽  
Frequency Division ◽  
Ofdm System ◽  
High Data ◽  
High Efficient

<p>Orthogonal frequency division multiplexing (OFDM) is a transmission system that uses multiple orthogonal carriers that are sent out at the same time. OFDM is a technique for mobile and wireless communication that has high-efficient frequency utilization, high data-rate transmission, simple and efficient implementation using the fast Fourier transform (FFT) and the inverse fast Fourier transform (IFFT), and reduces inter symbol interference (ISI) by inserting cyclic prefix (CP). One of the most important approaches in an OFDM system is channel estimation. In this paper, the orthogonal frequency division multiplexing system with the Rayleigh channel module is analyzed for different areas. The proposed approach used large numbers of subcarriers to transmit the signals over 64-QAM modulation with pilot add channel estimation. The accuracy of the OFDM system is shown in the measuring of the relationships of peak power to the noise ratio and bit error rate.</p>

scholarly journals Low-Complexity MUSIC-Based Direction-of-Arrival Detection Algorithm for Frequency-Modulated Continuous-Wave Vital Radar

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4295 ◽  
Author(s):  
Bong-seok Kim ◽  
Youngseok Jin ◽  
Jonghun Lee ◽  
Sangdong Kim
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Continuous Wave ◽  
Direction Of Arrival ◽  
Doa Estimation ◽  
Low Complexity ◽  
Detection Algorithm ◽  
Field Of View ◽  
Music Algorithm ◽  
Trade Offs

This paper proposes a low complexity multiple-signal-classifier (MUSIC)-based direction-of-arrival (DOA) detection algorithm for frequency-modulated continuous-wave (FMCW) vital radars. In order to reduce redundant complexity, the proposed algorithm employs characteristics of distance between adjacent arrays having trade-offs between field of view (FOV) and resolution performance. First, the proposed algorithm performs coarse DOA estimation using fast Fourier transform. On the basis of the coarse DOA estimation, the number of channels as input of the MUSIC algorithm are selected. If the estimated DOA is smaller than 30°, it implies that there is an FOV margin. Therefore, the proposed algorithm employs only half of the channels, that is, it is the same as doubling the spacing between arrays. By doing so, the proposed algorithm achieves more than 40% complexity reduction compared to the conventional MUSIC algorithm while achieving similar performance. By experiments, it is shown that the proposed algorithm despite the low complexity is enable to distinguish the adjacent DOA in a practical environment.

Sign in / Sign up

Export Citation Format

Share Document