Multiple Memory Structure Bit Reversal Algorithm Based on Recursive Patterns of Bit Reversal Permutation

Algorithm 2

C++ implementation of new BRA with four arrays for split = 2 (BRM_Split_2_4A).

Void mf_ BRM_Split_2_4DV (unsigned int ui_NS, int ui_log2NS)

  {

   unsigned int ui_N;

   unsigned int ui_EB;

   unsigned int ui_t;

   unsigned int ui_L;

   unsigned int ui_DL;

   ui_N = ui_NS; // Number of samples

   ui_t = ui_log2NS − 2;

   ui_EB = ui_N/4;

   ui_L = 1;

   std::vector<std::vector<unsigned int>> BRP(4,

std::vector<unsigned int>(ui_EB));

BRP[0][0] = 0;

BRP[1][0] = 2;

BRP[2][0] = 1;

BRP[3][0] = 3;

for (unsigned int q = 0; q < ui_t; q++)

 {

  ui_DL = ui_L + ui_L;

  ui_N = ui_N/2;

  for (unsigned int j = ui_L; j < ui_DL; j++)

   {

     BRP[0][j] = BRP[0][j − ui_L] + ui_N;

     BRP[1][j] = BRP[0][j] + 2;

     BRP[2][j] = BRP[0][j] + 1;

     BRP[3][j] = BRP[1][j] + 1;

    }

  ui_L = ui_L + ui_L;

}   }