开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 通讯/手机编程 > 3G开发 > 查看源码
berlefac.cpp
资源名称：simulation_wireless_c++.rar　[点击查看]
上传用户：jtjnyq9001
上传日期：2014-11-21
资源大小：3974k
文件大小：3k
源码类别：

3G开发

开发平台：

Visual C++

berlefac.cpp：源码内容
  1. //
  2. // berlefac.cpp
  3. //
  5. #include <iostream>
  6. #include "berlefac.h"
  7. #include "nullspac.h"
  8. #include <fstream>
  9. extern ofstream DebugFile;
  11. //=====================================================
  12. BerlekampFactorization::BerlekampFactorization( 
  13.                                   PolyOvrPrimeField *orig_poly )
  14. {
  16.   int k, r, s;
  17.   int poly_idx;
  18.   int deg = orig_poly->MaxDegree();
  19.   int prime_char = orig_poly->PrimeBase();
  20.   matrix_pf *v;
  21.   PolyOvrPrimeField **polys;
  23.   int num_facs = 1;
  24.   int num_polys;
  26.   Factors = new PolyOvrPrimeField*[1];
  27.   Factors[0] = orig_poly;
  29.   for(int iter=0; iter<1; iter++)
  30.     {
  31.     num_polys = num_facs;
  32.     polys = new PolyOvrPrimeField*[num_polys];
  34.     for( poly_idx=0; poly_idx<num_polys; poly_idx++)
  35.       {
  36.       polys[poly_idx] = Factors[poly_idx];
  37.     int yydeg = (polys[poly_idx])->MaxDegree();
  38.      // delete (Factors[poly_idx]);
  39.       } // end of loop over poly_idx
  40.     delete[] Factors;
  41.     num_facs = 0;
  42.     Factors = new PolyOvrPrimeField*[20];
  44.     for( poly_idx=0; poly_idx<num_polys; poly_idx++)
  45.       {
  46. //int xxdeg = (polys[poly_idx])->MaxDegree();
  47. //if(xxdeg == 7) continue;
  48.       B_Mtx = new BerlekampMatrix( polys[poly_idx] );
  49.       //  Row k corresponds to the term x**(k*p) where p is the
  50.       //  characteristic of the prime field over which the polynomial
  51.       //  is to be factored.
  53.       //-----------------------------------------------------
  54.       //  Compute null space of B matrix
  56.       v = NullSpace(B_Mtx, &r);
  58.       //----------------------------------------------------
  59.       // Find factors
  60.   
  61.       //DebugFile << "rrr = " << r << endl;
  62.       R = r;
  63.       //
  64.       //  The original polynomial should factor into r irreducible
  65.       //  polynomials.  However each iteration of the Berlekamp
  66.       //  factorization will only factor the original polynomial
  67.       //  into p polynomials (which, in general, may be reducible)
  68.       //  where p is the prime characteristic of the field from 
  69.       //  which the coefficients are drawn.  Additional iterations
  70.       //  can be performed until all r irreducible factors are found.
  72.      // Factors = new PolyOvrPrimeField*[r];
  74.       //PolyOvrPrimeField factor_poly;
  75.       //Factors[0] = new PolyOvrPrimeField;
  76.       for(k=1; k<2; k++)
  77.         {
  78.         //--------------------------------------------------------------
  79.         //  Use the row 1 elements of v as coefficients for a polynomial
  81.         PolyOvrPrimeField *work_poly = new PolyOvrPrimeField( prime_char,
  82.                                                               &((*v)[k]));
  83.         //DebugFile << "work_poly:" << endl;
  84.         //work_poly->DumpToStream(&DebugFile);
  85.         //DebugFile << "poly:" << endl;
  86.         //polys[poly_idx]->DumpToStream(&DebugFile);
  88.         for(s=0; s<prime_char; s++)
  89.           {
  90.           Factors[num_facs] = &(EuclideanAlgorithm( polys[poly_idx], work_poly ) );
  91.           //DebugFile << "factor_poly (for k=" << k <<", s=" << s << "):" << endl;
  92.           //(Factors[num_facs])->DumpToStream(&DebugFile);
  93.           (*work_poly) -= PrimeFieldElem( prime_char, 1 );
  94.           num_facs++;
  95.           }
  96.         delete work_poly;
  97.         delete B_Mtx;
  98.         delete v;
  100.         } // end of loop over k
  101.       } // end of loop over poly_idx
  102.   } // end of loop over iter
  103. }
  104. int BerlekampFactorization::GetR(void)
  105. {
  106.   return(R);
  107. }
  108. PolyOvrPrimeField* BerlekampFactorization::GetFactor(int fac_idx)
  109. {
  110.   return(Factors[fac_idx]);
  111. }