"TMS320C55x DSP Library DSPLIB Programmer's Reference"

More documents

Recommendations

Info

Chapter 5DSPLIB Benchmarks and Performance IssuesAll functions in the DSPLIB are provided with execution time and code sizebenchmarks. While developing the included functions, we tried to compromisebetween speed, code size, and ease of use. However, with few exceptions, thehighest priority was given to optimize for speed and ease of use, and last forcode size.Even though DSPLIB can be used as a first estimation of processor performancefor a specific function, you should know that the generic nature ofDSPLIB may add extra cycles not required for customer specific usage.TopicPage5.1 What DSPLIB Benchmarks are Provided . . . . . . . . . . . . . . . . . . . . . . . . 5-25.2 Performance Considerations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5-25-1
What DSPLIB Benchmarks are Provided / Performance Considerations5.1 What DSPLIB Benchmarks are ProvidedDSPLIB documentation includes benchmarks for instruction cycles andmemory consumption. The following benchmarks are typically included:Calling and register initialization overheadNumber of cycles in the kernel code: Typically provided in the form of anequation that is a function of the data size parameters. We consider thekernel (or core) code, the instructions contained between the _start and_end labels that you can see in each of the functions.Memory consumption: Typically program size in bytes is reported. Forfunctions requiring significant internal data allocation, data memory consumptionis also provided. When stack usage for local variables is minimum,that data consumption is not reported.For functions in which it is difficult to determine the number of cycles in the kernelcode as a function of the data size parameters, we have included directcycle count for specific data sizes.5.2 Performance ConsiderationsBenchmark cycles presented assume best case conditions, typically assuming:0 wait-state memory external memory for program and datadata allocation to on-chip DARAMno pipeline hitsA linker command file showing the memory allocation used during testing andbenchmarking in the Code Composer C55x Simulator is included under theexample subdirectory.Remember, execution speed in a system is dependent on where the differentsections of program and data are located in memory. Be sure to account forsuch differences, when trying to explain why a routine is taking more time thatthe reported DSPLIB benchmarks.5-2
Page 1 and 2:
TMS320C55x DSP LibraryProgrammer’
Page 3 and 4:
PrefaceRead This FirstAbout This Ma
Page 5:
Contentsatan16 . . . . . . . . . .
Page 9 and 10:
DSP Routines1.1 DSP RoutinesThe TI
Page 11 and 12:
DSPLIB Content / How to Install DSP
Page 13 and 14:
Chapter 3Using DSPLIBThis chapter d
Page 15 and 16:
Calling a DSPLIB Function from C3.2
Page 17 and 18:
Calling a DSPLIB Function from Asse
Page 19 and 20:
How DSPLIB Deals with Overflow and
Page 21 and 22:
Chapter 4Function DescriptionsThis
Page 23 and 24:
DSPLIB Functions4.2 DSPLIB Function
Page 25 and 26:
DSPLIB FunctionsTable 4-2. Summary
Page 27 and 28:
acorracorrFunctionArgumentsAutocorr
Page 29 and 30:
addCycles †Code size(in bytes)Aub
Page 31 and 32:
atan16Description This function cal
Page 33 and 34:
expbexpFunctionBlock Exponent Imple
Page 35 and 36:
cfftBenchmarks(preliminary)Cycles
Page 37 and 38:
cfirCFFT - NOSCALEFFT Size Cycles
Page 39 and 40:
cfirImplementation Notes The first
Page 41 and 42:
cifftcifftFunctionInverse Complex F
Page 43 and 44:
convolCIFFT - NOSCALEFFT Size Cycle
Page 45 and 46:
convol1Figure 4-6. h Array in Memor
Page 47 and 48:
convol2Figure 4-8. r Array in Memor
Page 49 and 50:
convol2Figure 4-10. x Array in Memo
Page 51 and 52:
dlmsImplementation NotesSpecial deb
Page 53 and 54:
expnImplementation NotesDelayed ver
Page 55 and 56:
firr[nx]Pointer to output vector of
Page 57 and 58:
fir2Figure 4-14. x Array in Memoryo
Page 59 and 60:
fir2Special Requirementsnh must be
Page 61 and 62: firdecr[nx/D]dbuffer[nh+1]nxnhDofla
Page 63 and 64: firinterpIoflagInterpolation factor
Page 65 and 66: firlatpbuffer [nh]nxnhoflagDelay bu
Page 67 and 68: firsnh2oflagHalf the number of coef
Page 69 and 70: fltoq15Figure 4-21. r Array in Memo
Page 71 and 72: hilb16dbuffer[nh + 2] Pointer to de
Page 73 and 74: iir32Figure 4-23. x Array in Memory
Page 75 and 76: iir32In the case of multiple-buffer
Page 77 and 78: iircas4nxoflagNumber of elements of
Page 79 and 80: iircas51This function retains the a
Page 81 and 82: iirlatBenchmarks(preliminary)Cycles
Page 83 and 84: ldiv16ldiv16Function32-bit by 16-bi
Page 85 and 86: log_10Special Requirements noneImpl
Page 87 and 88: lognThe coefficients Bi used in the
Page 89 and 90: maxidxmaxidxFunctionIndex of the Ma
Page 91 and 92: maxvecDescription Returns the maxim
Page 93 and 94: minvecminvalFunctionMinimum Value o
Page 95 and 96: mmulDescriptionAlgorithmThis functi
Page 97 and 98: negr[nx]Pointer to output data vect
Page 99 and 100: powernxoflagNumber of elements of i
Page 101 and 102: and16AlgorithmNot applicableOverflo
Page 103 and 104: and16initBenchmarksCycles Core: 13
Page 105 and 106: fftThe initial estimate can be obta
Page 107 and 108: ifftrifftFunctionInverse Real FFT (
Page 109 and 110: sqrt_16DescriptionComputes the sine
Page 111: subr[nx]nxscaleoflagPointer to outp
Page 115 and 116: DSPLIB Software Updates6.1 DSPLIB S
Page 117 and 118: Q3.12 Format / Q.15 Format / Q.31 F
Page 119 and 120: Calculating the Reciprocal of a Q15
Page 121 and 122: IndexIndex16-bit reciprocal functio
Page 123: Indexmmul 4-74mtrans 4-76mul32 4-76
show all

"TMS320C55x DSP Library DSPLIB Programmer's Reference"

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?