FIRQ31.cpp 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  1. #include "FIRQ31.h"
  2. #include <stdio.h>
  3. #include "Error.h"
  4. #define SNR_THRESHOLD 100
  5. #define ABS_ERROR_Q31 ((q31_t)2)
  6. #if defined(ARM_MATH_MVEI) && !defined(ARM_MATH_AUTOVECTORIZE)
  7. static __ALIGNED(8) q31_t coeffArray[32];
  8. #endif
  9. static void checkInnerTail(q31_t *b)
  10. {
  11. ASSERT_TRUE(b[0] == 0);
  12. ASSERT_TRUE(b[1] == 0);
  13. ASSERT_TRUE(b[2] == 0);
  14. ASSERT_TRUE(b[3] == 0);
  15. }
  16. // Coef must be padded to a multiple of 4
  17. #define FIRCOEFPADDING 2
  18. void FIRQ31::test_fir_q31()
  19. {
  20. const int16_t *configp = configs.ptr();
  21. q31_t *statep = state.ptr();
  22. const q31_t *orgcoefsp = coefs.ptr();
  23. const q31_t *coefsp;
  24. const q31_t *inputp = inputs.ptr();
  25. q31_t *outp = output.ptr();
  26. unsigned long i;
  27. #if defined(ARM_MATH_MVEI) && !defined(ARM_MATH_AUTOVECTORIZE)
  28. int j;
  29. int round;
  30. #endif
  31. int blockSize;
  32. int numTaps;
  33. int nb=1;
  34. /*
  35. Python script is generating different tests with
  36. different blockSize and numTaps.
  37. We loop on those configs.
  38. */
  39. for(i=0; i < configs.nbSamples() ; i += 2)
  40. {
  41. blockSize = configp[0];
  42. numTaps = configp[1];
  43. #if defined(ARM_MATH_MVEI) && !defined(ARM_MATH_AUTOVECTORIZE)
  44. /* Copy coefficients and pad to zero
  45. */
  46. memset(coeffArray,127,32*sizeof(q31_t));
  47. round = numTaps >> FIRCOEFPADDING;
  48. if ((round << FIRCOEFPADDING) < numTaps)
  49. {
  50. round ++;
  51. }
  52. round = round<<FIRCOEFPADDING;
  53. memset(coeffArray,0,round*sizeof(q31_t));
  54. //printf("blockSize=%d, numTaps=%d, round=%d (%d)\n",blockSize,numTaps,round,round - numTaps);
  55. for(j=0;j < numTaps; j++)
  56. {
  57. coeffArray[j] = orgcoefsp[j];
  58. }
  59. coefsp = coeffArray;
  60. #else
  61. coefsp = orgcoefsp;
  62. #endif
  63. /*
  64. The filter is initialized with the coefs, blockSize and numTaps.
  65. */
  66. arm_fir_init_q31(&this->S,numTaps,coefsp,statep,blockSize);
  67. /*
  68. Input pointer is reset since the same input pattern is used
  69. */
  70. inputp = inputs.ptr();
  71. /*
  72. Python script is filtering a 2*blockSize number of samples.
  73. We do the same filtering in two pass to check (indirectly that
  74. the state management of the fir is working.)
  75. */
  76. arm_fir_q31(&this->S,inputp,outp,blockSize);
  77. outp += blockSize;
  78. checkInnerTail(outp);
  79. inputp += blockSize;
  80. arm_fir_q31(&this->S,inputp,outp,blockSize);
  81. outp += blockSize;
  82. checkInnerTail(outp);
  83. configp += 2;
  84. orgcoefsp += numTaps;
  85. nb += blockSize + blockSize;
  86. }
  87. ASSERT_EMPTY_TAIL(output);
  88. ASSERT_SNR(output,ref,(q31_t)SNR_THRESHOLD);
  89. ASSERT_NEAR_EQ(output,ref,ABS_ERROR_Q31);
  90. }
  91. void FIRQ31::setUp(Testing::testID_t id,std::vector<Testing::param_t>& params,Client::PatternMgr *mgr)
  92. {
  93. (void)params;
  94. switch(id)
  95. {
  96. case FIRQ31::TEST_FIR_Q31_1:
  97. break;
  98. }
  99. inputs.reload(FIRQ31::FIRINPUTS_Q31_ID,mgr);
  100. coefs.reload(FIRQ31::FIRCOEFS_Q31_ID,mgr);
  101. configs.reload(FIRQ31::FIRCONFIGS_S16_ID,mgr);
  102. ref.reload(FIRQ31::FIRREFS_Q31_ID,mgr);
  103. output.create(ref.nbSamples(),FIRQ31::OUT_Q31_ID,mgr);
  104. /* > Max blockSize + numTaps - 1 as generated by Python script */
  105. state.create(47 + 47+47,FIRQ31::OUT_Q31_ID,mgr);
  106. }
  107. void FIRQ31::tearDown(Testing::testID_t id,Client::PatternMgr *mgr)
  108. {
  109. (void)id;
  110. output.dump(mgr);
  111. }