Chapter 3 Classification of FFT Processor Algorithms
|
|
- Lesley Whitehead
- 5 years ago
- Views:
Transcription
1 Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As a alterative to direct computatio of the DFT, we ca use Fast Fourier Trasform (FFT) algorithms to efficietly calculate the DFT. May computatioally efficiet FFT algorithms have bee proposed. This chapter presets a brief collectio of the FFT algorithms ad their properties.. Discrete Fourier Trasform (DFT) Give a legth sequece x(), a DFT geerated complex sequece X(k) ca be defied as k Xk [ ] = x [ ] k=,,..., k where Twiddle Factor, = e 2π j k (.) If the periodic ad symmetric properties of the twiddle factor m are exploited, the the computatio of X[k] will be more efficiet. symmetric : periodic : m /2 m = = m m Two types of FFT algorithms are Decimatio i Time (DIT) ad Decimatio i Frequecy (DIF). The former is based o decompositio of the iput sequece ito smaller subsequeces ad the latter is based o dividig the output sequece ito smaller subsequeces [5]. The computatioal complexity of these two types are the
2 same. I this chapter, we oly itroduce the DIF FFT algorithms..2 Fixed Radix Algorithms.2. Radix2 DIF FFT Algorithm The radix2 algorithm [5] is the most commo fixed algorithm. This algorithm ca oly compute the data havig a power of 2 legth. The radix2 butterfly calculatio is very simple amog the overall class of FFT algorithms. Each butterfly stage reads two data iputs ad produces two outputs. The defiitio of a poit DFT is give agai as follows: ( /2) k /2 X( k) = x( ) x( ) k = k Xk [ ] = x [ ] k=,,..., ( /2) /2 k ( /2) k x ( ) x ( ) 2 The iput sequece, x() ca be separated ito the first half of the sequece ad the secod half. The mathematical expressios are defied i the followig equatios: where, = ( /2) /2 k ( /2) k k x( ) x ( ) 2 (.2) 2π j k ( /2) k 2 k = = cos( π ) si( π ) = ( ) e k j k e get X( k) = x( ) ( ) x( ) ( /2) /2 k k k 2 ( /2) k k = [ x( ) ( ) x( )] (.) 2 The eve output represeted i Equatio (.2) is obtaied by the summatio of the first half ad the secod half of the iput sequece for each of the /2 poit DFTs.
3 The odd output represeted i Equatio (.) is obtaied by the subtractio of the first half ad the secod half of the iput sequece for each of the /2 poit DFTs ad multiplyig this subtractive result by. For the first stage, 2r ad 2r is substituted for idex k i Equatio (.), we get the Equatio (.4) ad (.5). ( /2) X[2 r] = ( x [ ] x [ ( / 2)]) = ( /2) g [ ] ( /2) r /2 r /2 X[2r ] = ( x [ ] x [ ( / 2)]) = ( /2) h [ ] r /2 r /2 (.4) (.5) k Xk [ ] = x [ ] k=,,..., k=2r, k=2r ( /2) ([] x x [ ( /2)]) r /2 st stage ( /2) ( x [ ] x [ ( / 2)]) r /2 r=2l, r=2l r=2l, r=2l ( /4) ([] g g [ ( /4)]) l /4 ( /4) ([] g g [ ( /4)]) l 2d stage /2 /4 ( /4) ([] h h [ ( /4)]) l /4 ( /4) ([] h h [ ( /4)]) l /2 /4 l=2p, l=2p l=2p, l=2p l=2p, l=2p l=2p, l=2p A A2 B B2 rd stage C C2 D D2 Figure. Separatio procedure for radix2 algorithm Figure. shows the basic cocept of the separatio procedure for the radix2 algorithm. This procedure ca be applied recursively util log2 stages are produced. That is, the fial stage has bee reduced to 2poit DFT computatios. 2
4 Amog the stages, there is a /2 butterfly structure i each stage, as show i Figure.2. Radix2 butterfly elemet requires oly two complex adders ad oe complex multiplier. For this reaso, its hardware cost is very low. The FFT operatio has iputs ad outputs, so we eed registers to store all the output data from all the butterfly stage calculatios. If we use iplace computatio, it will ot be ecessary to use storage registers. To reduce registers, we reuse the same registers to store successive iteratios of the results of each butterfly. This kid of calculatio is called a iplace computatio [5]. The procedure show i Figure. is depicted with a complete =6poit example i Figure.. It is obvious that whe the iput sequeces of the DIF FFT algorithm are arraged i ormal, its output sequeces are arraged i bitreversed after usig the iplace computatio method. p m P q Q P= p q Q= ( p q) Figure.2 Butterfly structure of radix2 DIF FFT m
5 ormal x[] bit reversed x[] x[2] x[4] x[] x[] x[2] x[] x[] x[4] Figure. Sigal flow graph of complete decompositio of a 6 poit radix2 DIF FFT 4
6 .2.2 Radix4 DIF FFT Algorithm Each radix4 butterfly stage reads four data iputs ad produces four data outputs. For this reaso, this algorithm provides higher computatio speed compared to the radix2 algorithm. Decomposig Equatio (.4) ad (.5) ito four groups of frequecy compoets: 4u, 4u, 4u2, 4u, the radix 4 algorithm [6] ca be obtaied. ( /4) u /4 (.6) X[4 u] = {( x [ ] x [ ( / 2)]) ( x [ / 4] x [ ( / 4)])} ( /4) X[4u ] = {( x [ ] x [ ( / 2)]) j( x [ / 4] x [ ( / 4)])} ( /4) X[4u 2] = {( x [ ] x [ ( / 2)]) ( x [ / 4] x [ ( / 4)])} ( /4) X[4u ] = {( x [ ] x [ ( / 2)]) j( x [ / 4] x [ ( / 4)])} 2 u /4 u /4 u /4 (.7) (.8) (.9) The butterfly sigal flow graph of Equatio (.6) to Equatio (.9) is depicted i Figure.4, where the iterval is ~(/4). e ca observe that the radix4 butterfly eeds oly the three complex multipliers,, ad eight complex adders 2 for each stage. Multiplicatio by the j term causes the real ad imagiary parts of the data to be exchaged. The sigal flow graph i Figure.5 is illustrated for the computatio of a6poit DFT usig the radix4 algorithm. x[] X[4u] x[/4] 2 X[4u2] x[2/4] X[4u] x[/4] j X[4u] Figure.4 Butterfly structure for radix4 algorithm 5
7 radix4 FFT radix4 FFT ormal x[] 6 4 bit reversed x[] x[] x[2] x[] x[4] j j j j j j j j x[2] x[4] x[] x[] Figure.5 Sigal flow graph of complete decompositio of a 6 poit radix4 DIF FFT.2. Radix8 DIF FFT Algorithm Based o the two algorithms preseted i the previous subsectio, we coclude that with icreasig the radix, the cost i hardware will icrease liearly, complexity will icrease, ad implemetatio difficulty will icrease. However, whe usig higher radix algorithms (e.g. radix8), the umber of complex multiplicatios 6
8 decreases [7]. I this case, the commo direct mappig method of radixr butterfly elemet operatio is more complicated ad has larger area. So, the implemetatio of the butterfly elemet structure is of great iterest to decrease the hardware complexity for higher radix algorithm. The duty of a desiger is how to arrage ad desig the data flow of the butterfly elemet structures to achieve small area ad high performace. Here, we itroduce radix8 FFT algorithm. Each radix8 butterfly stage reads eight data iputs ad produces eight data outputs. Radix8 algorithm [8] is expressed i Equatio (.) through (.7). /8 X[8k ] = [{( x [ ] x [ / 2]) ( x [ / 4] x [ / 4])} (.) {( x [ /8] x [ 5 /8]) ( x [ /8] x [ 7 /8])}] /8 /8 [8 ] = [{( [ ] [ / 2]) ( [ / 4] [ / 4])}. X k x x j x x {( [ / 8] [ 5 / 8]) ( [ / 8] [ 7 / 8])}] 8k x x j x x /8 /8 X[8k 4] = [{( x [ ] x [ /2]) ( x [ /4] x [ /4])} {( x[ / 8] x [ 5 / 8]) ( x [ / 8] x [ 7 / 8])}] 8k 4 (.4) The above eight equatios ca be depicted with the butterfly structure i Figure.6. This structure fully utilizes the twiddle factor with its properties of symmetry ad 7 8k 8k 2 (.) X[8k 2] = [{( x [ ] x [ / 2]) ( x [ / 4] x [ / 4])} j (.2) {( x[ / 8] x[ 5 / 8]) j( x[ / 8] x[ 7 / 8])}] /8 /8 [8 ] = [{( [ ] [ / 2]) ( [ / 4] [ / 4])}. X k x x j x x (.) {( x[ /8] x[ 5 /8]) j( x[ /8] x[ 7 /8])}] /8 /8 [8 5] = [{( [ ] [ / 2]) ( [ / 4] [ / 4])}. 8k X k x x j x x (.5) {( x[ /8] x[ 5 /8]) j( x[ /8] x[ 7 /8])}] /8 8k 5 X[8k 6] = [{( x [ ] x [ / 2]) ( x [ / 4] x [ / 4])} j (.6) {( x[ / 8] x [ 5 / 8]) ( x [ / 8] x [ 7 / 8])}] 8k 6 /8 /8 [8 7] = [{( [ ] [ / 2]) ( [ / 4] [ / 4])}. X k x x j x x {( x[ / 8] x[ 5 / 8]) j( x[ / 8] x[ 7 / 8])}] 8k 7 (.7)
9 periodicity. It requires two costat multipliers ad /8 /8, seve otrivial complex multipliers ad three trivial factors j. The two costat multipliers with ad /8 /8 ca be replaced by 2 additios by usig shift adders [9]. The computatio of a 8poit DFT accomplished by the radix8 algorithm is depicted i Figure.7. x[] X[8k] x[/8] 4 X[8k4] x[2/8] 2 X[8k2] x[/8] j 6 X[8k6] x[4/8] X[8k] x[5/8] / 8 5 X[8k5] x[6/8] j X[8k] x[7/8] j / 8 7 X[8k7] Figure.6 Butterfly structure of radix8 algorithm 8
10 ormal x[] 8 bit reversed X[] 8 X[4] 8 X[2] j 8 X[6] 8 X[] 8 8 X[5] x[7] j j X[] X[7] Figure.7 Sigal flow graph of a 8poit radix8 DIF FFT. Split Radix Algorithms Refereces [7] ad [] preset the fudametal idea of the split radix algorithm. The split radix algorithm specifies that a poit DFT ca be implemeted by decomposig differet parts of the iput sequece usig differet algorithms. Split radix algorithms such as the radix2/4 split algorithm, ad the radix2/8 split algorithm have yet to be preseted. Although they require less complex multipliers, they are ot ofte used i IC desig due to their irregular structure... Split Radix2/4 Algorithm This algorithm [] utilizes a radix2 algorithm to calculate the eveidexed output sequeces ad a radix4 algorithm to calculate the oddidexed output 9
11 sequeces. This idea ca be represeted by the mathematical expressio i Equatio (.8) through (.2). For the eveidexed term, ( /2) u /2. (.8) X[2 u] = ( x [ ] x [ ( / 2)]) For the oddidexed term, ( /4) u /4 (.9) X[4u ] = {( x [ ] x [ ( / 2)]) j( x [ / 4] x [ ( / 4)])} ( /4) X[4u ] = {( x [ ] x [ ( /2)]) j( x [ /4] x [ ( /4)])} u /4. (.2) Equatio (.9) ad (.2) ca be represeted by the followig butterfly elemet structure icludig twiddle factor coefficiets. Figure.9 is the computatio of a 6poit split radix2/4 algorithm. x[] x[/4] x[2/4] X[4u] x[/4] j X[4u] Figure.8 Butterfly structure of split radix2/4 algorithm 2
12 ormal x[] bit reversed x[] j x[2] 8 8 x[] x[2] j j j j x[4] x[] x[] j 6 x[] x[4] j 6 6 j 9 6 j Figure.9 Computatio of a 6poit split radix2/4 algorithm..2 Split Radix2/8 Algorithm The split radix2/8 algorithm [7] [9] utilizes a radix8 algorithm to calculate the oddidexed output istead of a radix4 algorithm. The eveidexed output is calculated the same way as i the radix2/4 algorithm. That is, the radix2/8 algorithm 2
13 is based o the decompositio of the legth DFT sequece ito oe legth/2 DFT ad four the legth/8 DFTs. For the eveidexed term with oe legth/2 DFTs, ( /2) u /2. (.2) X[2 u] = ( x [ ] x [ ( / 2)]) For the oddidexed term with four legth/8 DFTs, ( /8) /8 (.22) X[8u ] = {[([] x x [ ( /2)]) j([ x /4] x [ /4])] [( x [ /8] x [ 5 /8]) j( x [ /8] x [ 7 /8])]} u /8 ( /8) /8 (.2) X[8u ] = {[([] x x [ ( /2)]) j([ x /4] x [ /4])] [( x [ /8] x [ 5 /8]) j( x [ /8] x [ 7 /8])]} u /8 ( /8) /8 (.24) X[8u 5] = {[([] x x [ ( /2)]) j([ x /4] x [ /4])] [( x [ /8] x [ 5 /8]) j( x [ /8] x [ 7 /8])]} 5 u /8 ( /8) /8 (.25) X[8u 7] = {[( x [ ] x [ ( / 2)]) j( x [ / 4] x [ / 4])] [( x [ /8] x [ 5 /8]) j( x [ /8] x [ 7 /8])]} 7 u /8 To make the idea of the radix2/8 algorithm easier to uderstad, the simplified butterfly structure is illustrated i Figure.. A 6poit split radix2/8 algorithm is show i Figure.. x[] x[/8] x[2/8] x[/8] x[4/8] X[8u] x[5/8] / 8 5 X[8u5] x[6/8] j X[8u] x[7/8] j / 8 7 X[8u7] Figure. Butterfly structure of radix2/8 algorithm 22
14 atural x[] bit reversed x[] j x[2] 8 j j 8 x[4] x[] x[2] j x[] x[] j 6 x[] x[4] j 8 6 j Figure. A 6poit split radix2/8 algorithm 2
15 .4 Mixed Radix Algorithm The radices of the butterfly structure i differet FFT computatio stages eed ot be equal. Such a algorithm is called a mixed radix algorithm []. he the FFT size is ot a power of radixr, we ca oly use a mixed radix algorithm to desig a FFT. For example, a 24poit sequece is ot a power of 8. Thus, we ca combie three stages with a radix8 algorithm ad oe stage with a radix2 algorithm to operate the trasform over a 24poit data sequece. 24
EE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationOutline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions
FFT Circuit Desig Outlie Applicatios of FFT i Commuicatios Fudametal FFT Algorithms FFT Circuit Desig Architectures Coclusios DAB Receiver Tuer OFDM Demodulator Chael Decoder Mpeg Audio Decoder 56/5/ 4/48
More informationFast Fourier Transform (FFT)
IC Desig Lab. Fast Fourier Trasfor FFT, - e e π π G Twiddle Factor : e π Radi- DIT FFT: IC Desig Lab. π cos si π Syetry Property Periodicity Property u u u * Cougate Syetric Property a a b b a b b a b
More informationThe following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:
DBE Memo#1 MARK 5 MEMO #18 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 1886 November 19, 24 Telephoe: 978-692-4764 Fax: 781-981-59 To: From: Mark 5 Developmet Group
More informationSpectral leakage and windowing
EEL33: Discrete-Time Sigals ad Systems Spectral leakage ad widowig. Itroductio Spectral leakage ad widowig I these otes, we itroduce the idea of widowig for reducig the effects of spectral leakage, ad
More informationComputation of DFT. point DFT. W has a specific structure and because
DSP 5 Spig Computatio of DFT CTU EE Computatio of DFT Efficiet algoithms fo computig DFT Fast Fouie Tasfom. a Compute oly a few poits out of all poits b Compute all poits hat ae the efficiecy citeia? umbe
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationComputation of DFT. W has a specific structure and because
DSP 7 Computatio of DFT CTU EE Computatio of DFT Efficiet algoithms fo computig DFT Fast Fouie Tasfom. a Compute oly a few poits out of all poits b Compute all poits hat ae the efficiecy citeia? umbe of
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationINTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND TECHNOLOGY (IJARET) A NEW RADIX-4 FFT ALGORITHM
ITERATIOAL JOURAL OF ADVACED REEARC I EIEERI AD TECOLO (IJARET Iteratioal Joural of Advaced Research i Egieerig ad Techology (IJARET I 976 68(Prit I 976 699(Olie Volume Issue 3 April (3 IAEME I 976-68
More informationDesign of Efficient Pipelined Radix-2 2 Single Path Delay Feedback FFT
IOSR Joural of VLSI ad Sigal Processig IOSR-JVSP Volume Issue Ver. I May-Ju. 0 PP 88-9 e-iss: 9 00 p-iss o. : 9 97 www.iosrjourals.org Desig of Efficiet Pipelied Radi- Sigle Path Delay Feedbac FFT isha
More informationFPGA Implementation of Pipeline Digit-Slicing Multiplier-Less Radix 2 2 DIF SDF Butterfly for Fast Fourier Transform Structure
FPGA Implemetatio of Pipelie Slicig MultiplierLess Radix DIF SDF Butterfly for Fast Fourier Trasform Structure Yaza Samir Algabi,. Rozita Teymourzadeh, Masuri Othma, Md Shabiul Islam Istitute of MicroEgieerig
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationLinear Time-Invariant Systems
9/9/00 LIEAR TIE-IVARIAT SYSTES Uit, d Part Liear Time-Ivariat Sstems A importat class of discrete-time sstem cosists of those that are Liear Priciple of superpositio Time-ivariat dela of the iput sequece
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationMajor CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70
NOTE:. Attempt all seve questios. Major CSL 02 2. Write your ame ad etry o o every sheet of the aswer script. Time 2 Hrs Max Marks 70 Q No Q Q 2 Q 3 Q 4 Q 5 Q 6 Q 7 Total MM 6 2 4 0 8 4 6 70 Q. Write a
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationIntroduction to FFT Processors
Itroductio to FFT Processors Chih-ei Liu VLSI Siga Processig Lab Departmet of Eectroics Egieerig atioa Chiao-Tug Uiversity FFT Desig FFT Cosists of a series of compe additios ad compe mutipicatios Agorithm
More informationArea As A Limit & Sigma Notation
Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationCOMP Parallel Computing. PRAM (1): The PRAM model and complexity measures
COMP 633 - Parallel Computig Lecture 2 August 24, 2017 : The PRAM model ad complexity measures 1 First class summary This course is about parallel computig to achieve high-er performace o idividual problems
More informationFFT: An example of complex combinational circuits
Lecture from 6.s195 taught i Fall 2013 Costructive Computer Architecture FFT: A example of complex combiatioal circuits Arvid Computer Sciece & Artificial Itelligece Lab. Massachusetts Istitute of Techology
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationEE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering
EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors
More informationGPUMP: a Multiple-Precision Integer Library for GPUs
GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationMatrix representation of a solution of a combinatorial problem of the group theory
Matrix represetatio of a solutio of a combiatorial problem of the group theory Krasimir Yordzhev, Lilyaa Totia Faculty of Mathematics ad Natural Scieces South-West Uiversity 66 Iva Mihailov Str, 2700 Blagoevgrad,
More informationLecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 2 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationA Study on the Performance of Cholesky-Factorization using MPI
A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio
More informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationRecurrent Formulas of the Generalized Fibonacci Sequences of Third & Fourth Order
Natioal Coferece o 'Advaces i Computatioal Mathematics' 7-8 Sept.03 :- 49 Recurret Formulas of the Geeralized Fiboacci Sequeces of hird & Fourth Order A. D.Godase Departmet of Mathematics V.P.College Vaijapur
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationLifting a butterfly A component-based FFT
Scietific Programmig 11 (2003) 291 307 291 IOS Press Liftig a butterfly A compoet-based FFT Sibylle Schupp Departmet of Computer Sciece, Resselaer Polytechic Istitute, 110 8th Street, Troy, NY 12180, USA
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationFPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea
FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationIntroduction to FFT Processors. Chih-Wei Liu VLSI Signal Processing Lab Department of Electronics Engineering National Chiao-Tung University
Itroductio to FFT Processors Chihei Liu VLSI Siga Processig Lab Departmet of Eectroics Egieerig atioa ChiaoTug Uiversity FFT Desig FFT Cosists of a series of compe additios ad compe mutipicatios Agorithm
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationAlgorithm. Counting Sort Analysis of Algorithms
Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationA Very Simple Approach for 3-D to 2-D Mapping
A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationChapter 24. Sorting. Objectives. 1. To study and analyze time efficiency of various sorting algorithms
Chapter 4 Sortig 1 Objectives 1. o study ad aalyze time efficiecy of various sortig algorithms 4. 4.7.. o desig, implemet, ad aalyze bubble sort 4.. 3. o desig, implemet, ad aalyze merge sort 4.3. 4. o
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationExamples and Applications of Binary Search
Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationMath 3201 Notes Chapter 4: Rational Expressions & Equations
Learig Goals: See p. tet.. Equivalet Ratioal Epressios ( classes) Read Goal p. 6 tet. Math 0 Notes Chapter : Ratioal Epressios & Equatios. Defie ad give a eample of a ratioal epressio. p. 6. Defie o-permissible
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationArithmetic Transforms for Verifying Compositions of Sequential Datapaths
Arithmetic Trasforms for Verifyig Compositios of Sequetial Datapaths Katarzya Radecka ad Zeljko Zilic McGill Uiversity, Motreal, Caada { kasiar,zeljko} @macs.ece.mcgill.ca ABSTRACT this paper, we address
More informationtop() Applications of Stacks
CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22
More information1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole
Page 1 Very Quick Itroductio to MRI The poit of this itroductio is to give the studet a sufficietly accurate metal picture of MRI to help uderstad its impact o image registratio. The two major aspects
More informationAutomatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL
Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationQMDD and Spectral Transformation of Binary and Multiple-Valued Functions *
QMDD ad Spectral Trasformatio of Biary ad Multiple-Valued Fuctios * D. Michael Miller Uiversity of Victoria Victoria, BC, Caada mmiller@uvic.ca Mitchell A. Thorto Souther Methodist Uiversity Dallas, TX,
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationAsymmetrical Load-Balancing for Incremental Fast Fourier Transform on Multi-Core Processors
Asymmetrical Load-Balacig for Icremetal Fast Fourier Trasform o Multi-Core Processors By Todor Padeliev A thesis submitted to The Faculty of Graduate Studies ad Research i partial fulfilmet of the degree
More informationCOMP 558 lecture 6 Sept. 27, 2010
Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout
More informationBOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM
MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationk (check node degree) and j (variable node degree)
A Parallel Turbo Decodig Message Passig Architecture for Array LDPC Codes Kira Guam, Pakaj Bhagawat, Weihuag Wag, Gwa Choi, Mark Yeary * Dept. of Electrical Egieerig, Texas A&M Uiversity, College Statio,
More informationThe Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation
The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat
More information