FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2893894989> ?p ?o ?g. }

• W2893894989 abstract "In modern technologies, the DSP algorithms behind the VLSI architectures play a significant role. The latest standards in wireless communications rise the challenges in theimplementations of future communications systems. The high-speed Wi-Fi (5G) technology is standardised a few years ago as IEEE 802.11ac standard that adopts an orthogonal frequency division multiplexing (OFDM) technique. The fast Fourier transform (FFT) is a traditional DSP algorithm, that plays a key role in wide range of applications in electricalengineering. In OFDM system, the FFT and inverse fast Fourier transform (IFFT) plays a crucial role. A multiple input multiple output (MIMO) OFDM system needs multiple FFTprocessors in the receiver and multiple IFFT processors on the transmitter side. The number of FFT/IFFT processors is linearly increased with the number of data streams. For example,an IEEE 802.11ac baseband processor handles up to eight spatial streams. The traditional approach employs eight IFFT processors for the transmitter and eight FFT processors for the receiver. Since the FFT/IFFT processors requirement linearly increases with the number of spatial data streams, implementation of a low power MIMO-OFDM system may not be feasible when the number of spatial streams is more. Hence, it is an interesting research problem to come up with a single FFT/IFFT processor that can handle multiple streams. To this end, there is a scope for developing new algorithms, architectures and design techniques for portable system applications.The objective of this work is to investigate the methodologies and architectures for a variable length multi-path pipelined FFT/IFFT, the input-output data scheduling, reordering and the twiddle coefficient multiplication. Here, the input data scheduling, reordering plays an important role in multiplexing various streams into a single pipeline processor. Output reordering unit aligns the FFT/IFFT output into the standard order. On the other hand, hardware complexity and performance of an FFT/IFFT processor is highly influenced by the complex multipliers employed in the design. Therefore, this work is focussed on the fixed width signed multipliers used for twiddle coefficient multiplication in the proposed variable length FFT/IFFT processor. The proposed methodologies in this investigation are validated through MATLAB prior to the ASIC implementation. Then, various architectures are designed based the proposed methods, and RTL modelling in each case is done using the Verilog HDL. The functional verification is performed using Synopsys VCS and Synthesis is done by Synopsys Design Compiler using TSMC 65 nm CMOS standard cell library at 160 MHz. The functionality of the netlist after synthesis is also verified by using Synopsys VCS. Automatic Place and Route (APR) is performed using Cadence SOC Encounter. Moreover, Xilinx 14.2 ISE tools are used for the FPGA implementation.In this thesis work, a brief review of the literature on various FFT/IFFT processors, input-output data reordering units and fixed width multipliers is presented. This thesiswork proposes a variable length FFT/IFFT computation algorithm for pipeline processing. Here, various butterfly calculations are time division multiplexed to optimize the hardware complexity by a factor of N/8 for the given FFT length N. A multi-path delay commutator(MDC) based FFT/IFFT processor is proposed where, it adopts various IEEE 802.11acstandard FFT/IFFT design requirements likeN = 512/256/128/64, up to eight spatial streams and computation time (TDFT ) of 3.2 s etc. A staggered wordlength scheme is proposed in this work to have a controlled data path width across the pipelined structure. Moreover, Algorithms and architectures for MIMO data reordering and scheduling for variable length MDC FFT/IFFT are proposed. A modified procedure for radix-8 based Booth 2k-bit signedmultiplication is presented. The fixed-width signed multiplication with error compensation is proposed. A method to compute the error compensation bias for the proposed fixed-width multiplication is presented. Moreover, 12-bit, 14-bit and 16-bit real and complex multipliers based on the proposed methods are designed and implemented. In addition, the FPGA resource requirements of various proposed architectures are presented in this work." @default.
• W2893894989 created "2018-10-05" @default.
• W2893894989 creator A5008669449 @default.
• W2893894989 date "2018-01-01" @default.
• W2893894989 modified "2023-09-26" @default.
• W2893894989 title "Variable length FFT/IFFT Processor: Algorithm to Architecture Mapping and Implementation" @default.
• W2893894989 hasPublicationYear "2018" @default.
• W2893894989 type Work @default.
• W2893894989 sameAs 2893894989 @default.
• W2893894989 citedByCount "0" @default.
• W2893894989 crossrefType "dissertation" @default.
• W2893894989 hasAuthorship W2893894989A5008669449 @default.
• W2893894989 hasConcept C11413529 @default.
• W2893894989 hasConcept C119857082 @default.
• W2893894989 hasConcept C127162648 @default.
• W2893894989 hasConcept C130946814 @default.
• W2893894989 hasConcept C207987634 @default.
• W2893894989 hasConcept C40409654 @default.
• W2893894989 hasConcept C41008148 @default.
• W2893894989 hasConcept C47798520 @default.
• W2893894989 hasConcept C75172450 @default.
• W2893894989 hasConcept C76155785 @default.
• W2893894989 hasConcept C84462506 @default.
• W2893894989 hasConcept C85884896 @default.
• W2893894989 hasConcept C89198739 @default.
• W2893894989 hasConcept C9390403 @default.
• W2893894989 hasConceptScore W2893894989C11413529 @default.
• W2893894989 hasConceptScore W2893894989C119857082 @default.
• W2893894989 hasConceptScore W2893894989C127162648 @default.
• W2893894989 hasConceptScore W2893894989C130946814 @default.
• W2893894989 hasConceptScore W2893894989C207987634 @default.
• W2893894989 hasConceptScore W2893894989C40409654 @default.
• W2893894989 hasConceptScore W2893894989C41008148 @default.
• W2893894989 hasConceptScore W2893894989C47798520 @default.
• W2893894989 hasConceptScore W2893894989C75172450 @default.
• W2893894989 hasConceptScore W2893894989C76155785 @default.
• W2893894989 hasConceptScore W2893894989C84462506 @default.
• W2893894989 hasConceptScore W2893894989C85884896 @default.
• W2893894989 hasConceptScore W2893894989C89198739 @default.
• W2893894989 hasConceptScore W2893894989C9390403 @default.
• W2893894989 hasLocation W28938949891 @default.
• W2893894989 hasOpenAccess W2893894989 @default.
• W2893894989 hasPrimaryLocation W28938949891 @default.
• W2893894989 hasRelatedWork W183166219 @default.
• W2893894989 hasRelatedWork W1972313501 @default.
• W2893894989 hasRelatedWork W2010747745 @default.
• W2893894989 hasRelatedWork W2047539705 @default.
• W2893894989 hasRelatedWork W2161509834 @default.
• W2893894989 hasRelatedWork W2176914859 @default.
• W2893894989 hasRelatedWork W2183279891 @default.
• W2893894989 hasRelatedWork W2295677199 @default.
• W2893894989 hasRelatedWork W2331171968 @default.
• W2893894989 hasRelatedWork W2541393808 @default.
• W2893894989 hasRelatedWork W2554906330 @default.
• W2893894989 hasRelatedWork W2561727020 @default.
• W2893894989 hasRelatedWork W2620516473 @default.
• W2893894989 hasRelatedWork W2730839619 @default.
• W2893894989 hasRelatedWork W2765674441 @default.
• W2893894989 hasRelatedWork W2920557768 @default.
• W2893894989 hasRelatedWork W3111727985 @default.
• W2893894989 hasRelatedWork W2414093707 @default.
• W2893894989 hasRelatedWork W2580956697 @default.
• W2893894989 hasRelatedWork W2589101770 @default.
• W2893894989 isParatext "false" @default.
• W2893894989 isRetracted "false" @default.
• W2893894989 magId "2893894989" @default.
• W2893894989 workType "dissertation" @default.