UnaryTestsQ31.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  1. #include "UnaryTestsQ31.h"
  2. #include <stdio.h>
  3. #include "Error.h"
  4. #define SNR_THRESHOLD 100
  5. /*
  6. Reference patterns are generated with
  7. a double precision computation.
  8. */
  9. #define ABS_ERROR_Q31 ((q31_t)2)
  10. #define ABS_ERROR_Q63 ((q63_t)(1<<16))
  11. #define ONEHALF 0x40000000
  12. /* Upper bound of maximum matrix dimension used by Python */
  13. #define MAXMATRIXDIM 40
  14. static void checkInnerTail(q31_t *b)
  15. {
  16. ASSERT_TRUE(b[0] == 0);
  17. ASSERT_TRUE(b[1] == 0);
  18. ASSERT_TRUE(b[2] == 0);
  19. ASSERT_TRUE(b[3] == 0);
  20. }
  21. #define LOADDATA2() \
  22. const q31_t *inp1=input1.ptr(); \
  23. const q31_t *inp2=input2.ptr(); \
  24. \
  25. q31_t *ap=a.ptr(); \
  26. q31_t *bp=b.ptr(); \
  27. \
  28. q31_t *outp=output.ptr(); \
  29. int16_t *dimsp = dims.ptr(); \
  30. int nbMatrixes = dims.nbSamples() >> 1;\
  31. int rows,columns; \
  32. int i;
  33. #define LOADDATA1() \
  34. const q31_t *inp1=input1.ptr(); \
  35. \
  36. q31_t *ap=a.ptr(); \
  37. \
  38. q31_t *outp=output.ptr(); \
  39. int16_t *dimsp = dims.ptr(); \
  40. int nbMatrixes = dims.nbSamples() >> 1;\
  41. int rows,columns; \
  42. int i;
  43. #define PREPAREDATA2() \
  44. in1.numRows=rows; \
  45. in1.numCols=columns; \
  46. memcpy((void*)ap,(const void*)inp1,sizeof(q31_t)*rows*columns);\
  47. in1.pData = ap; \
  48. \
  49. in2.numRows=rows; \
  50. in2.numCols=columns; \
  51. memcpy((void*)bp,(const void*)inp2,sizeof(q31_t)*rows*columns);\
  52. in2.pData = bp; \
  53. \
  54. out.numRows=rows; \
  55. out.numCols=columns; \
  56. out.pData = outp;
  57. #define PREPAREDATA1(TRANSPOSED) \
  58. in1.numRows=rows; \
  59. in1.numCols=columns; \
  60. memcpy((void*)ap,(const void*)inp1,sizeof(q31_t)*rows*columns);\
  61. in1.pData = ap; \
  62. \
  63. if (TRANSPOSED) \
  64. { \
  65. out.numRows=columns; \
  66. out.numCols=rows; \
  67. } \
  68. else \
  69. { \
  70. out.numRows=rows; \
  71. out.numCols=columns; \
  72. } \
  73. out.pData = outp;
  74. #define PREPAREDATA1C(TRANSPOSED) \
  75. in1.numRows=rows; \
  76. in1.numCols=columns; \
  77. memcpy((void*)ap,(const void*)inp1,2*sizeof(q31_t)*rows*columns);\
  78. in1.pData = ap; \
  79. \
  80. if (TRANSPOSED) \
  81. { \
  82. out.numRows=columns; \
  83. out.numCols=rows; \
  84. } \
  85. else \
  86. { \
  87. out.numRows=rows; \
  88. out.numCols=columns; \
  89. } \
  90. out.pData = outp;
  91. #define LOADVECDATA2() \
  92. const q31_t *inp1=input1.ptr(); \
  93. const q31_t *inp2=input2.ptr(); \
  94. \
  95. q31_t *ap=a.ptr(); \
  96. q31_t *bp=b.ptr(); \
  97. \
  98. q31_t *outp=output.ptr(); \
  99. int16_t *dimsp = dims.ptr(); \
  100. int nbMatrixes = dims.nbSamples() / 2;\
  101. int rows,internal; \
  102. int i;
  103. #define PREPAREVECDATA2() \
  104. in1.numRows=rows; \
  105. in1.numCols=internal; \
  106. memcpy((void*)ap,(const void*)inp1,sizeof(q31_t)*rows*internal);\
  107. in1.pData = ap; \
  108. \
  109. memcpy((void*)bp,(const void*)inp2,sizeof(q31_t)*internal);
  110. void UnaryTestsQ31::test_mat_vec_mult_q31()
  111. {
  112. LOADVECDATA2();
  113. for(i=0;i < nbMatrixes ; i ++)
  114. {
  115. rows = *dimsp++;
  116. internal = *dimsp++;
  117. PREPAREVECDATA2();
  118. arm_mat_vec_mult_q31(&this->in1, bp, outp);
  119. outp += rows ;
  120. checkInnerTail(outp);
  121. }
  122. ASSERT_EMPTY_TAIL(output);
  123. ASSERT_SNR(output,ref,(q31_t)SNR_THRESHOLD);
  124. ASSERT_NEAR_EQ(output,ref,ABS_ERROR_Q31);
  125. }
  126. void UnaryTestsQ31::test_mat_add_q31()
  127. {
  128. LOADDATA2();
  129. arm_status status;
  130. for(i=0;i < nbMatrixes ; i ++)
  131. {
  132. rows = *dimsp++;
  133. columns = *dimsp++;
  134. PREPAREDATA2();
  135. status=arm_mat_add_q31(&this->in1,&this->in2,&this->out);
  136. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  137. outp += (rows * columns);
  138. checkInnerTail(outp);
  139. }
  140. ASSERT_EMPTY_TAIL(output);
  141. ASSERT_SNR(output,ref,(q31_t)SNR_THRESHOLD);
  142. ASSERT_NEAR_EQ(output,ref,ABS_ERROR_Q31);
  143. }
  144. void UnaryTestsQ31::test_mat_sub_q31()
  145. {
  146. LOADDATA2();
  147. arm_status status;
  148. for(i=0;i < nbMatrixes ; i ++)
  149. {
  150. rows = *dimsp++;
  151. columns = *dimsp++;
  152. PREPAREDATA2();
  153. status=arm_mat_sub_q31(&this->in1,&this->in2,&this->out);
  154. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  155. outp += (rows * columns);
  156. checkInnerTail(outp);
  157. }
  158. ASSERT_EMPTY_TAIL(output);
  159. ASSERT_SNR(output,ref,(q31_t)SNR_THRESHOLD);
  160. ASSERT_NEAR_EQ(output,ref,ABS_ERROR_Q31);
  161. }
  162. void UnaryTestsQ31::test_mat_scale_q31()
  163. {
  164. LOADDATA1();
  165. arm_status status;
  166. for(i=0;i < nbMatrixes ; i ++)
  167. {
  168. rows = *dimsp++;
  169. columns = *dimsp++;
  170. PREPAREDATA1(false);
  171. status=arm_mat_scale_q31(&this->in1,ONEHALF,0,&this->out);
  172. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  173. outp += (rows * columns);
  174. checkInnerTail(outp);
  175. }
  176. ASSERT_EMPTY_TAIL(output);
  177. ASSERT_SNR(output,ref,(q31_t)SNR_THRESHOLD);
  178. ASSERT_NEAR_EQ(output,ref,ABS_ERROR_Q31);
  179. }
  180. void UnaryTestsQ31::test_mat_trans_q31()
  181. {
  182. LOADDATA1();
  183. arm_status status;
  184. for(i=0;i < nbMatrixes ; i ++)
  185. {
  186. rows = *dimsp++;
  187. columns = *dimsp++;
  188. PREPAREDATA1(true);
  189. status=arm_mat_trans_q31(&this->in1,&this->out);
  190. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  191. outp += (rows * columns);
  192. checkInnerTail(outp);
  193. }
  194. ASSERT_EMPTY_TAIL(output);
  195. ASSERT_SNR(output,ref,(q31_t)SNR_THRESHOLD);
  196. ASSERT_NEAR_EQ(output,ref,ABS_ERROR_Q31);
  197. }
  198. void UnaryTestsQ31::test_mat_cmplx_trans_q31()
  199. {
  200. LOADDATA1();
  201. arm_status status;
  202. for(i=0;i < nbMatrixes ; i ++)
  203. {
  204. rows = *dimsp++;
  205. columns = *dimsp++;
  206. PREPAREDATA1C(true);
  207. status=arm_mat_cmplx_trans_q31(&this->in1,&this->out);
  208. ASSERT_TRUE(status==ARM_MATH_SUCCESS);
  209. outp += 2*(rows * columns);
  210. checkInnerTail(outp);
  211. }
  212. ASSERT_EMPTY_TAIL(output);
  213. ASSERT_SNR(output,ref,(q31_t)SNR_THRESHOLD);
  214. ASSERT_NEAR_EQ(output,ref,ABS_ERROR_Q31);
  215. }
  216. void UnaryTestsQ31::setUp(Testing::testID_t id,std::vector<Testing::param_t>& params,Client::PatternMgr *mgr)
  217. {
  218. (void)params;
  219. switch(id)
  220. {
  221. case TEST_MAT_ADD_Q31_1:
  222. input1.reload(UnaryTestsQ31::INPUTS1_Q31_ID,mgr);
  223. input2.reload(UnaryTestsQ31::INPUTS2_Q31_ID,mgr);
  224. dims.reload(UnaryTestsQ31::DIMSUNARY1_S16_ID,mgr);
  225. ref.reload(UnaryTestsQ31::REFADD1_Q31_ID,mgr);
  226. output.create(ref.nbSamples(),UnaryTestsQ31::OUT_Q31_ID,mgr);
  227. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsQ31::TMPA_Q31_ID,mgr);
  228. b.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsQ31::TMPB_Q31_ID,mgr);
  229. break;
  230. case TEST_MAT_SUB_Q31_2:
  231. input1.reload(UnaryTestsQ31::INPUTS1_Q31_ID,mgr);
  232. input2.reload(UnaryTestsQ31::INPUTS2_Q31_ID,mgr);
  233. dims.reload(UnaryTestsQ31::DIMSUNARY1_S16_ID,mgr);
  234. ref.reload(UnaryTestsQ31::REFSUB1_Q31_ID,mgr);
  235. output.create(ref.nbSamples(),UnaryTestsQ31::OUT_Q31_ID,mgr);
  236. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsQ31::TMPA_Q31_ID,mgr);
  237. b.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsQ31::TMPB_Q31_ID,mgr);
  238. break;
  239. case TEST_MAT_SCALE_Q31_3:
  240. input1.reload(UnaryTestsQ31::INPUTS1_Q31_ID,mgr);
  241. dims.reload(UnaryTestsQ31::DIMSUNARY1_S16_ID,mgr);
  242. ref.reload(UnaryTestsQ31::REFSCALE1_Q31_ID,mgr);
  243. output.create(ref.nbSamples(),UnaryTestsQ31::OUT_Q31_ID,mgr);
  244. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsQ31::TMPA_Q31_ID,mgr);
  245. break;
  246. case TEST_MAT_TRANS_Q31_4:
  247. input1.reload(UnaryTestsQ31::INPUTS1_Q31_ID,mgr);
  248. dims.reload(UnaryTestsQ31::DIMSUNARY1_S16_ID,mgr);
  249. ref.reload(UnaryTestsQ31::REFTRANS1_Q31_ID,mgr);
  250. output.create(ref.nbSamples(),UnaryTestsQ31::OUT_Q31_ID,mgr);
  251. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsQ31::TMPA_Q31_ID,mgr);
  252. break;
  253. case TEST_MAT_VEC_MULT_Q31_5:
  254. input1.reload(UnaryTestsQ31::INPUTS1_Q31_ID,mgr);
  255. input2.reload(UnaryTestsQ31::INPUTVEC1_Q31_ID,mgr);
  256. dims.reload(UnaryTestsQ31::DIMSUNARY1_S16_ID,mgr);
  257. ref.reload(UnaryTestsQ31::REFVECMUL1_Q31_ID,mgr);
  258. output.create(ref.nbSamples(),UnaryTestsQ31::OUT_Q31_ID,mgr);
  259. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsQ31::TMPA_Q31_ID,mgr);
  260. b.create(MAXMATRIXDIM,UnaryTestsQ31::TMPB_Q31_ID,mgr);
  261. break;
  262. case TEST_MAT_CMPLX_TRANS_Q31_6:
  263. input1.reload(UnaryTestsQ31::INPUTSC1_Q31_ID,mgr);
  264. dims.reload(UnaryTestsQ31::DIMSUNARY1_S16_ID,mgr);
  265. ref.reload(UnaryTestsQ31::REFTRANSC1_Q31_ID,mgr);
  266. output.create(ref.nbSamples(),UnaryTestsQ31::OUT_Q31_ID,mgr);
  267. a.create(MAXMATRIXDIM*MAXMATRIXDIM,UnaryTestsQ31::TMPA_Q31_ID,mgr);
  268. break;
  269. }
  270. }
  271. void UnaryTestsQ31::tearDown(Testing::testID_t id,Client::PatternMgr *mgr)
  272. {
  273. (void)id;
  274. output.dump(mgr);
  275. }