"TMS320C55x DSP Library DSPLIB Programmer's Reference"

More documents

Recommendations

Info

convol2nrNumber of elements in vector r. Must be an even number.nh Number of elements in vector h.oflagOverflow error flag (returned value) If oflag = 1, a 32-bit data overflow has occurred in anintermediate or final result.If oflag = 0, a 32-bit overflow has not occurred.DescriptionComputes the real convolution of two real vectors x and h, and places theresults in vector r. This function utilizes the dual-MAC capability of the C55xto process in parallel two output samples for each iteration of the inner functionloop. It is, therefore, roughly twice as fast as CONVOL, which implements onlya single-MAC approach. However, the number of output samples (nr) must beeven. In addition, this function offers a small performance improvement overCONVOL1 at the expense of requiring the r array to be 32-bit aligned in memory.Typically used for block FIR filter computation when there is no need toretain an input delay buffer. This function can also be used to implement singlesampleFIR filters (nr = 1) provided the input delay history for the filter is maintainedexternal to this function. In-place computation (r = x) is allowed, but beaware that the r output vector is shorter in length than the x input vector; therefore,r will only overwrite the first nr elements of the x.Algorithmnh1r[j] h[k] x[j k]k00 j nrOverflow Handling MethodologyNo scaling implemented for overflow prevention.Special Requirementsnr must be an even value.The vector h[nh] must be located in internal memory since it is accessedusing the C55x coefficient bus, and that bus does not have access to externalmemory.The vector r[nr] must be 32-bit aligned in memory.Implementation Notes Figure 4–10, Figure 4–11, and Figure 4–12 show the x, r, and h arrays as theyappear in memory.4-28
convol2Figure 4–10. x Array in Memoryx(0)x(1)•x(nr+nh–2)x(nr+nh–1)lowest memory addresshighest memory addressFigure 4–11.r Array in Memoryr(0)r(1)•r(nr–2)r(nr–1)lowest memory addresshighest memory addressFigure 4–12. h Array in Memoryh(0)h(1)•h(nh–2)h(nh–1)lowest memory addresshighest memory addressExampleBenchmarksSee examples/convol2 subdirectory(preliminary)Cycles † Core: nr/2 * (1 + nh)Overhead: 24Code size(in bytes)100† Assumes all data is in on-chip dual-access RAM and that there is no bus conflict due to twiddletable reads and instruction fetches (provided linker command file reflects those conditions).Function Descriptions4-29
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: convol2Figure 4-8. r Array in Memor
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 and 112:
subr[nx]nxscaleoflagPointer to outp
Page 113 and 114:
What DSPLIB Benchmarks are Provided
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?