BENCHMARK PROGRAMS
MOTOROLA
BENCHMARK PROGRAMS
B - 19
Real input FFT based on Glenn Bergland algorithm
;
; Normal order input and normal order output.
;
; Since 56001 does not support bergland addressing, extra instruction cycles are needed
; for converting bergland order to normal order. It has been done in the last pass by
; looking at the bergtable.
; The micro ‘bergsincos’ generates SIN and COS table with size of points/4, COS in Y, SIN in X
; The micro ‘bergorder’ generates table for address conversion, the size of twiddle factors is half
; of FFT output’s.
; The micro ‘norm2berg’ converts normal order data to bergland order.
; The micro ‘rfft-56b’ does FFT.
;
; Real input data are split into two parts, the first part is put in X, the second in Y.
; Real output data are in X, imaginary output data are in Y.
; The bergland table for converting berglang order to normal order is stored in output buffer.
; In the last pass the FFT output overwrites this table.
; The first real output plus the first imaginary output is DC value of the spectrum.
; Note that only DC to Nyquist frequency range is calculated by this algorithm.
; After twiddle factors and bergtable are generated, you may overwrite ‘bergorder’,
; ‘norm2berg’ by ‘rfft-56b’ for saving P memory.
;
; Performance
;-----------------------------------------------------------------
; Real input data points Clock cycle
; 64 1686
; 128 3846
; 256 8656
; 512 19296
; 1024 49776
;------------------------------------------------------------------
;
; Memory (word)
;------------------------------------------------------------------
; P memory X memory Y memory
; 87 points/2 (real input) + points/2 (imaginary input)
; points/4 (SIN table) + points/4 (COS table)
; points/2 (real output) + points/2 (imaginary output)
; points/2 (bergtable)
;-------------------------------------------------------------------
;
;
rfft56bt
ident 1,3
page
132,60
opt
nomd,nomex,loc,nocex,mu
include ‘bergsincos’
include ‘bergorder’
include ‘norm2berg’
include ‘rfft-56b’
;
Figure B-5 Real Input FFT Based on Glenn Bergland Algorithm (Sheet 8 of 8)
Summary of Contents for DSP56K
Page 12: ...xii LIST of TABLES MOTOROLA List of Tables Continued Table Page Number Title Number ...
Page 13: ...MOTOROLA DSP56K FAMILY INTRODUCTION 1 1 SECTION 1 DSP56K FAMILY INTRODUCTION ...
Page 31: ...MOTOROLA DATA ARITHMETIC LOGIC UNIT 3 1 SECTION 3 DATA ARITHMETIC LOGIC UNIT ...
Page 50: ...DATA ALU SUMMARY 3 20 DATA ARITHMETIC LOGIC UNIT MOTOROLA ...
Page 51: ...MOTOROLA ADDRESS GENERATION UNIT 4 1 SECTION 4 ADDRESS GENERATION UNIT ...
Page 77: ...MOTOROLA PROGRAM CONTROL UNIT 5 1 SECTION 5 PROGRAM CONTROL UNIT ...
Page 124: ...INSTRUCTION GROUPS 6 30 INSTRUCTION SET INTRODUCTION MOTOROLA ...
Page 125: ...MOTOROLA PROCESSING STATES 7 1 SECTION 7 PROCESSING STATES STOP WAIT EXCEPTION NORMAL RESET ...
Page 167: ...STOP PROCESSING STATE MOTOROLA PROCESSING STATES 7 43 ...
Page 168: ...STOP PROCESSING STATE 7 44 PROCESSING STATES MOTOROLA ...
Page 169: ...MOTOROLA PORT A 8 1 SECTION 8 PORT A ...
Page 176: ...PORT A INTERFACE 8 8 PORT A MOTOROLA ...
Page 177: ...MOTOROLA PLL CLOCK OSCILLATOR 9 1 SECTION 9 PLL CLOCK OSCILLATOR x x d Φ VCO ...
Page 191: ...10 2 ON CHIP EMULATION OnCE MOTOROLA SECTION 10 ON CHIP EMULATION OnCE ...
Page 218: ...USING THE OnCE MOTOROLA ON CHIP EMULATION OnCE 10 29 ...
Page 604: ...INSTRUCTION ENCODING A 338 INSTRUCTION SET DETAILS MOTOROLA ...
Page 605: ...MOTOROLA BENCHMARK PROGRAMS B 1 APPENDIX B BENCHMARK PROGRAMS T T T T T P1 P3 P2 P4 T T T ...
Page 609: ...BENCHMARK PROGRAMS MOTOROLA BENCHMARK PROGRAMS B 5 ...
Page 611: ...BENCHMARK PROGRAMS MOTOROLA BENCHMARK PROGRAMS B 7 ...
Page 613: ...BENCHMARK PROGRAMS MOTOROLA BENCHMARK PROGRAMS B 9 ...
Page 615: ...BENCHMARK PROGRAMS MOTOROLA BENCHMARK PROGRAMS B 11 ...