Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 22:35:44 +00:00
Code Issues Projects Releases Packages Wiki Activity

use a rank map instead of a frozen bit array

Browse source
This commit is contained in:
Ahmet Inan 2026-02-01 22:07:15 +01:00
commit 9c55719f85
3 changed files with 53 additions and 177 deletions
Download patch file Download diff file Expand all files Collapse all files

16
tests/pac_list_regression_test.cc
View file

@ -46,15 +46,12 @@ int main()
typedef std::default_random_engine generator;
typedef std::uniform_int_distribution<int> distribution;
auto data = std::bind(distribution(0, 1), generator(rd()));
auto frozen = new uint32_t[N/32];
auto codeword = new code_type[N];
double erasure_probability = 0.5;
int K = (1 - erasure_probability) * N;
double design_SNR = 10 * std::log10(-std::log(erasure_probability));
std::cerr << "design SNR: " << design_SNR << std::endl;
for (int i = 0; i < N / 32; ++i)
frozen[i] = 0;
const int *reliability_sequence;
if (1) {
auto construct = new CODE::ReedMullerSequence<10>;
@ -66,12 +63,11 @@ int main()
} else {
reliability_sequence = sequence;
}
for (int i = 0, j = 0; i < 1024 && j < N - K; ++i) {
auto rank_map = new int[N];
for (int i = 0, j = 0; i < 1024 && j < N; ++i) {
int index = reliability_sequence[i];
if (index < N) {
frozen[index/32] |= 1 << (index%32);
++j;
}
if (index < N)
rank_map[index] = j++;
}
std::cerr << "Polar(" << N << ", " << K << ")" << std::endl;
auto message = new code_type[K];
@ -121,7 +117,7 @@ int main()
}
CODE::PACEncoder<code_type> encode;
encode(codeword, message, frozen, M);
encode(codeword, message, rank_map, K, M);
for (int i = 0; i < N; ++i)
orig[i] = codeword[i];
@ -144,7 +140,7 @@ int main()
int rank[L];
auto start = std::chrono::system_clock::now();
(*decode)(rank, decoded, codeword, frozen, M);
(*decode)(rank, decoded, codeword, rank_map, K, M);
auto end = std::chrono::system_clock::now();
auto usec = std::chrono::duration_cast<std::chrono::microseconds>(end - start);
double mbs = (double)K / usec.count();