author
int64
658
755k
date
stringlengths
19
19
timezone
int64
-46,800
43.2k
hash
stringlengths
40
40
message
stringlengths
5
490
mods
list
language
stringclasses
20 values
license
stringclasses
3 values
repo
stringlengths
5
68
original_message
stringlengths
12
491
8,483
18.12.2018 09:17:06
-3,600
b39ad5e58a4954bc27b2765fd52002d9b33cfba6
Add math constants file for PI.
[ { "change_type": "MODIFY", "old_path": "src/Module/Modem/CPM/Modem_CPM.hxx", "new_path": "src/Module/Modem/CPM/Modem_CPM.hxx", "diff": "#include \"Tools/Exception/exception.hpp\"\n#include \"Tools/Math/matrix.h\"\n#include \"Tools/Math/numerical_integration.h\"\n+#include \"Tools/Math/math_constants.h\"\n#include \"Modem_CPM.hpp\"\n@@ -193,7 +194,7 @@ void Modem_CPM<B,R,Q,MAX>\nfor (auto wa = 0; wa < cpm.n_wa; wa++)\n{\nauto allowed_wa = cpm.allowed_wave_forms[wa];\n- auto tilted_phase_part1 = (R)(2 * M_PI * cpm_h * (allowed_wa & p_mask));\n+ auto tilted_phase_part1 = (R)(2 * (R)M_PI * cpm_h * (allowed_wa & p_mask));\nstd::vector<R> tilted_phase_part2(cpm.s_factor, (R)0);\nstd::vector<R> tilted_phase_part3(cpm.s_factor, (R)0);\n@@ -220,10 +221,6 @@ void Modem_CPM<B,R,Q,MAX>\n}\n}\n-#ifndef M_PI\n-#define M_PI 3.1415926535897932384626433832795\n-#endif\n-\ntemplate <typename R>\nclass GMSK\n{\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Constellation/PSK/Constellation_PSK.hxx", "new_path": "src/Tools/Constellation/PSK/Constellation_PSK.hxx", "diff": "#define CONSTELLATION_PSK_HXX__\n#include <cmath>\n+#include \"Tools/Math/math_constants.h\"\n#include \"Constellation_PSK.hpp\"\n@@ -27,8 +28,8 @@ bits_to_symbol(const uint8_t bits[]) const\nfor (unsigned j = 1; j < this->get_n_bits_per_symbol(); j++)\nsymbol = ((R)1.0 - ((R)bits[j] + (R)bits[j])) * ((1 << j) - symbol);\n- return std::complex<R>((R)std::cos((symbol +1) * M_PI / this->get_n_symbols()),\n- (R)std::sin((symbol +1) * M_PI / this->get_n_symbols()));\n+ return std::complex<R>((R)std::cos((symbol +1) * (R)M_PI / this->get_n_symbols()),\n+ (R)std::sin((symbol +1) * (R)M_PI / this->get_n_symbols()));\n}\n}\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Tools/Math/math_constants.h", "diff": "+#ifndef MATH_CONSTANTS_H\n+#define MATH_CONSTANTS_H\n+\n+#include <cmath>\n+\n+#ifndef M_E\n+#define M_E 2.71828182845904523536 // e\n+#endif\n+\n+#ifndef M_LOG2E\n+#define M_LOG2E 1.44269504088896340736 // log2(e)\n+#endif\n+\n+#ifndef M_LOG10E\n+#define M_LOG10E 0.434294481903251827651 // log10(e)\n+#endif\n+\n+#ifndef M_LN2\n+#define M_LN2 0.693147180559945309417 // ln(2)\n+#endif\n+\n+#ifndef M_LN10\n+#define M_LN10 2.30258509299404568402 // ln(10)\n+#endif\n+\n+#ifndef M_PI\n+#define M_PI 3.14159265358979323846 // PI\n+#endif\n+\n+#ifndef M_PI_2\n+#define M_PI_2 1.57079632679489661923 // pi/2\n+#endif\n+\n+#ifndef M_PI_4\n+#define M_PI_4 0.785398163397448309616 // pi/4\n+#endif\n+\n+#ifndef M_1_PI\n+#define M_1_PI 0.318309886183790671538 // 1/pi\n+#endif\n+\n+#ifndef M_2_PI\n+#define M_2_PI 0.636619772367581343076 // 2/pi\n+#endif\n+\n+#ifndef M_2_SQRTPI\n+#define M_2_SQRTPI 1.12837916709551257390 // 2/sqrt(pi)\n+#endif\n+\n+#ifndef M_SQRT2_PI\n+#define M_SQRT2_PI 2.5066282746310004871 // sqrt(2*pi)\n+#endif\n+\n+#ifndef M_1_SQRT2_PI\n+#define M_1_SQRT2_PI 0.3989422804014326803775 // 1/sqrt(2*pi)\n+#endif\n+\n+#ifndef M_SQRT2\n+#define M_SQRT2 1.41421356237309504880 // sqrt(2)\n+#endif\n+\n+#ifndef M_SQRT1_2\n+#define M_SQRT1_2 0.707106781186547524401 // 1/sqrt(2)\n+#endif\n+\n+#endif // MATH_CONSTANTS_H\n\\ No newline at end of file\n" } ]
C++
MIT License
aff3ct/aff3ct
Add math constants file for PI.
8,483
19.12.2018 13:58:55
-3,600
18272ca0830bd744f9dc5dfa8d7cebf246394185
Add the LDPC-PPBF decoder
[ { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Decoder.cpp", "new_path": "src/Factory/Module/Decoder/Decoder.cpp", "diff": "@@ -52,6 +52,9 @@ void Decoder::parameters\ntools::add_arg(args, p, class_name+\"p+flips\",\ntools::Integer(tools::Positive()));\n+\n+ tools::add_arg(args, p, class_name+\"p+seed\",\n+ tools::Integer(tools::Positive()));\n}\nvoid Decoder::parameters\n@@ -63,6 +66,7 @@ void Decoder::parameters\nif(vals.exist({p+\"-cw-size\", \"N\"})) this->N_cw = vals.to_int({p+\"-cw-size\", \"N\"});\nif(vals.exist({p+\"-fra\", \"F\"})) this->n_frames = vals.to_int({p+\"-fra\", \"F\"});\nif(vals.exist({p+\"-flips\" })) this->flips = vals.to_int({p+\"-flips\" });\n+ if(vals.exist({p+\"-seed\" })) this->seed = vals.to_int({p+\"-seed\" });\nif(vals.exist({p+\"-type\", \"D\"})) this->type = vals.at ({p+\"-type\", \"D\"});\nif(vals.exist({p+\"-implem\" })) this->implem = vals.at ({p+\"-implem\" });\nif(vals.exist({p+\"-no-sys\" })) this->systematic = false;\n@@ -87,6 +91,8 @@ void Decoder::parameters\nheaders[p].push_back(std::make_pair(\"Distance\", this->hamming ? \"Hamming\" : \"Euclidean\"));\nif(this->type == \"CHASE\")\nheaders[p].push_back(std::make_pair(\"Max flips\", std::to_string(this->flips)));\n+\n+ if (full) headers[p].push_back(std::make_pair(\"Seed\", std::to_string(this->seed)));\n}\ntemplate <typename B, typename Q>\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Decoder.hpp", "new_path": "src/Factory/Module/Decoder/Decoder.hpp", "diff": "@@ -33,6 +33,7 @@ struct Decoder : Factory\nint n_frames = 1;\nint tail_length = 0;\nint flips = 3;\n+ int seed = 0;\n// deduced parameters\nfloat R = -1.f;\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/LDPC/Decoder_LDPC.cpp", "new_path": "src/Factory/Module/Decoder/LDPC/Decoder_LDPC.cpp", "diff": "#include \"Tools/Exception/exception.hpp\"\n#include \"Tools/Documentation/documentation.h\"\n+#include \"Tools/Arguments/Splitter/Splitter.hpp\"\n#include \"Tools/Math/max.h\"\n#include \"Tools/Code/LDPC/Matrix_handler/LDPC_matrix_handler.hpp\"\n#include \"Module/Decoder/LDPC/BP/Flooding/SPA/Decoder_LDPC_BP_flooding_SPA.hpp\"\n#include \"Module/Decoder/LDPC/BP/Peeling/Decoder_LDPC_BP_peeling.hpp\"\n#include \"Module/Decoder/LDPC/BF/OMWBF/Decoder_LDPC_bit_flipping_OMWBF.hpp\"\n+#include \"Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.hpp\"\n#include \"Decoder_LDPC.hpp\"\n@@ -57,6 +59,18 @@ Decoder_LDPC::parameters* Decoder_LDPC::parameters\nreturn new Decoder_LDPC::parameters(*this);\n}\n+struct Real_splitter\n+{\n+ static std::vector<std::string> split(const std::string& val)\n+ {\n+ const std::string head = \"{([\";\n+ const std::string queue = \"})]\";\n+ const std::string separator = \",\";\n+\n+ return tools::Splitter::split(val, head, queue, separator);\n+ }\n+};\n+\nvoid Decoder_LDPC::parameters\n::get_description(tools::Argument_map_info &args) const\n{\n@@ -77,7 +91,7 @@ void Decoder_LDPC::parameters\n#ifdef __cpp_aligned_new\ntools::add_options(args.at({p+\"-type\", \"D\"}), 0, \"BP_HORIZONTAL_LAYERED_LEGACY\");\n#endif\n- tools::add_options(args.at({p+\"-implem\" }), 0, \"SPA\", \"LSPA\", \"MS\", \"OMS\", \"NMS\", \"AMS\", \"GALA\", \"GALB\", \"GALE\", \"WBF\");\n+ tools::add_options(args.at({p+\"-implem\" }), 0, \"SPA\", \"LSPA\", \"MS\", \"OMS\", \"NMS\", \"AMS\", \"GALA\", \"GALB\", \"GALE\", \"WBF\", \"PPBF\");\ntools::add_arg(args, p, class_name+\"p+ite,i\",\ntools::Integer(tools::Positive()));\n@@ -105,6 +119,9 @@ void Decoder_LDPC::parameters\ntools::add_arg(args, p, class_name+\"p+h-reorder\",\ntools::Text(tools::Including_set(\"NONE\", \"ASC\", \"DSC\")));\n+\n+ tools::add_arg(args, p, class_name+\"p+ppbf-proba\",\n+ tools::List<float,Real_splitter>(tools::Real(), tools::Length(1)));\n}\nvoid Decoder_LDPC::parameters\n@@ -121,6 +138,7 @@ void Decoder_LDPC::parameters\nif(vals.exist({p+\"-off\" })) this->offset = vals.to_float({p+\"-off\" });\nif(vals.exist({p+\"-mwbf\" })) this->mwbf_factor = vals.to_float({p+\"-mwbf\" });\nif(vals.exist({p+\"-norm\" })) this->norm_factor = vals.to_float({p+\"-norm\" });\n+ if(vals.exist({p+\"-ppbf-proba\"})) this->ppbf_proba = vals.to_list<float>({p+\"-ppbf-proba\"});\nif(vals.exist({p+\"-no-synd\" })) this->enable_syndrome = false;\nif (!this->H_path.empty())\n@@ -171,6 +189,17 @@ void Decoder_LDPC::parameters\nif (this->implem == \"AMS\")\nheaders[p].push_back(std::make_pair(\"Min type\", this->min));\n+\n+ if (this->implem == \"PPBF\")\n+ {\n+ std::stringstream bern_str;\n+ bern_str << \"{\";\n+ for (unsigned i = 0; i < this->ppbf_proba.size(); i++)\n+ bern_str << this->ppbf_proba[i] << (i == this->ppbf_proba.size()-1 ?\"\":\", \");\n+ bern_str << \"}\";\n+\n+ headers[p].push_back(std::make_pair(\"Bernouilli probas\", bern_str.str()));\n+ }\n}\n}\n@@ -375,7 +404,10 @@ module::Decoder_SIHO<B,Q>* Decoder_LDPC::parameters\n{\nif (this->implem == \"STD\") return new module::Decoder_LDPC_BP_peeling<B,Q>(this->K, this->N_cw, this->n_ite, H, info_bits_pos, this->enable_syndrome, this->syndrome_depth, this->n_frames);\n}\n-\n+ else if (this->type == \"BIT_FLIPPING\")\n+ {\n+ if (this->implem == \"PPBF\") return new module::Decoder_LDPC_PPBF<B,Q>(this->K, this->N_cw, this->n_ite, H, info_bits_pos, this->ppbf_proba, this->enable_syndrome, this->syndrome_depth, this->seed, this->n_frames);\n+ }\nreturn build_siso<B,Q>(H, info_bits_pos);\n}\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/LDPC/Decoder_LDPC.hpp", "new_path": "src/Factory/Module/Decoder/LDPC/Decoder_LDPC.hpp", "diff": "#ifndef FACTORY_DECODER_LDPC_HPP\n#define FACTORY_DECODER_LDPC_HPP\n+#include <vector>\n#include <string>\n#include \"Tools/Algo/Matrix/Sparse_matrix/Sparse_matrix.hpp\"\n@@ -37,6 +38,8 @@ struct Decoder_LDPC : public Decoder\nint syndrome_depth = 1;\nint n_ite = 10;\n+ std::vector<float> ppbf_proba;\n+\n// ---------------------------------------------------------------------------------------------------- METHODS\nexplicit parameters(const std::string &p = Decoder_LDPC_prefix);\nvirtual ~parameters() = default;\n" }, { "change_type": "MODIFY", "old_path": "src/Launcher/Code/LDPC/LDPC.cpp", "new_path": "src/Launcher/Code/LDPC/LDPC.cpp", "diff": "@@ -41,6 +41,7 @@ void LDPC<L,B,R,Q>\nthis->args.erase({penc+\"-fra\", \"F\"});\nthis->args.erase({penc+\"-seed\", \"S\"});\n+ this->args.erase({pdec+\"-seed\" });\nthis->args.add_link({pdec+\"-h-path\"}, {penc+\"-type\"}, enc_dvb_no_h_matrix);\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Module/Decoder/LDPC/BF/Decoder_LDPC_bit_flipping_hard.cpp", "diff": "+#include <chrono>\n+#include <numeric>\n+#include <limits>\n+#include <sstream>\n+\n+#include \"Tools/Perf/common/hard_decide.h\"\n+#include \"Tools/Exception/exception.hpp\"\n+#include \"Tools/Math/utils.h\"\n+\n+#include \"Decoder_LDPC_bit_flipping_hard.hpp\"\n+\n+using namespace aff3ct;\n+using namespace aff3ct::module;\n+\n+// constexpr int C_to_V_max = 15; // saturation value for the LLRs/extrinsics\n+\n+template <typename B, typename R>\n+Decoder_LDPC_bit_flipping_hard<B,R>\n+::Decoder_LDPC_bit_flipping_hard(const int &K, const int &N, const int& n_ite,\n+ const tools::Sparse_matrix &_H,\n+ const std::vector<unsigned> &info_bits_pos,\n+ const bool enable_syndrome,\n+ const int syndrome_depth,\n+ const int n_frames)\n+: Decoder (K, N, n_frames, 1 ),\n+ Decoder_SIHO_HIHO<B,R>(K, N, n_frames, 1 ),\n+ n_ite (n_ite ),\n+ enable_syndrome (enable_syndrome ),\n+ syndrome_depth (syndrome_depth ),\n+ H (_H.turn(tools::Sparse_matrix::Way::VERTICAL)),\n+ var_nodes (N ),\n+ check_nodes (this->H.get_n_cols()),\n+ YH_N (N ),\n+ info_bits_pos (info_bits_pos )\n+{\n+ const std::string name = \"Decoder_LDPC_bit_flipping_hard\";\n+ this->set_name(name);\n+\n+ if (n_ite <= 0)\n+ {\n+ std::stringstream message;\n+ message << \"'n_ite' has to be greater than 0 ('n_ite' = \" << n_ite << \").\";\n+ throw tools::invalid_argument(__FILE__, __LINE__, __func__, message.str());\n+ }\n+\n+ if (syndrome_depth <= 0)\n+ {\n+ std::stringstream message;\n+ message << \"'syndrome_depth' has to be greater than 0 ('syndrome_depth' = \" << syndrome_depth << \").\";\n+ throw tools::invalid_argument(__FILE__, __LINE__, __func__, message.str());\n+ }\n+\n+ if (N != (int)H.get_n_rows())\n+ {\n+ std::stringstream message;\n+ message << \"'N' is not compatible with the H matrix ('N' = \" << N << \", 'H.get_n_rows()' = \"\n+ << H.get_n_rows() << \").\";\n+ throw tools::invalid_argument(__FILE__, __LINE__, __func__, message.str());\n+ }\n+}\n+\n+template <typename B, typename R>\n+void Decoder_LDPC_bit_flipping_hard<B,R>\n+::_decode_hiho(const B *Y_N, B *V_K, const int frame_id)\n+{\n+// auto t_load = std::chrono::steady_clock::now(); // ---------------------------------------------------------- LOAD\n+ std::copy(Y_N, Y_N + this->N, var_nodes.data());\n+// auto d_load = std::chrono::steady_clock::now() - t_load;\n+\n+// auto t_decod = std::chrono::steady_clock::now(); // -------------------------------------------------------- DECODE\n+ this->decode(Y_N, frame_id);\n+// auto d_decod = std::chrono::steady_clock::now() - t_decod;\n+\n+// auto t_store = std::chrono::steady_clock::now(); // --------------------------------------------------------- STORE\n+ _store(V_K, frame_id);\n+// auto d_store = std::chrono::steady_clock::now() - t_store;\n+\n+// (*this)[dec::tsk::decode_hiho].update_timer(dec::tm::decode_hiho::decode, d_decod);\n+// (*this)[dec::tsk::decode_hiho].update_timer(dec::tm::decode_hiho::store, d_store);\n+}\n+\n+template <typename B, typename R>\n+void Decoder_LDPC_bit_flipping_hard<B,R>\n+::_decode_hiho_cw(const B *Y_N, B *V_N, const int frame_id)\n+{\n+// auto t_load = std::chrono::steady_clock::now(); // ---------------------------------------------------------- LOAD\n+ std::copy(Y_N, Y_N + this->N, var_nodes.data());\n+// auto d_load = std::chrono::steady_clock::now() - t_load;\n+\n+// auto t_decod = std::chrono::steady_clock::now(); // -------------------------------------------------------- DECODE\n+ this->decode(Y_N, frame_id);\n+// auto d_decod = std::chrono::steady_clock::now() - t_decod;\n+\n+// auto t_store = std::chrono::steady_clock::now(); // --------------------------------------------------------- STORE\n+ _store_cw(V_N, frame_id);\n+// auto d_store = std::chrono::steady_clock::now() - t_store;\n+\n+// (*this)[dec::tsk::decode_hiho_cw].update_timer(dec::tm::decode_hiho_cw::decode, d_decod);\n+// (*this)[dec::tsk::decode_hiho_cw].update_timer(dec::tm::decode_hiho_cw::store, d_store);\n+}\n+\n+template <typename B, typename R>\n+void Decoder_LDPC_bit_flipping_hard<B,R>\n+::_decode_siho(const R *Y_N, B *V_K, const int frame_id)\n+{\n+// auto t_load = std::chrono::steady_clock::now(); // ---------------------------------------------------------- LOAD\n+ tools::hard_decide(Y_N, YH_N.data(), this->N);\n+ std::copy(YH_N.begin(), YH_N.end(), var_nodes.begin());\n+// auto d_load = std::chrono::steady_clock::now() - t_load;\n+\n+// auto t_decod = std::chrono::steady_clock::now(); // -------------------------------------------------------- DECODE\n+ this->decode(YH_N.data(), frame_id);\n+// auto d_decod = std::chrono::steady_clock::now() - t_decod;\n+\n+// auto t_store = std::chrono::steady_clock::now(); // --------------------------------------------------------- STORE\n+ _store(V_K, frame_id);\n+// auto d_store = std::chrono::steady_clock::now() - t_store;\n+\n+// (*this)[dec::tsk::decode_siho].update_timer(dec::tm::decode_siho::load, d_load);\n+// (*this)[dec::tsk::decode_siho].update_timer(dec::tm::decode_siho::decode, d_decod);\n+// (*this)[dec::tsk::decode_siho].update_timer(dec::tm::decode_siho::store, d_store);\n+}\n+\n+template <typename B, typename R>\n+void Decoder_LDPC_bit_flipping_hard<B,R>\n+::_decode_siho_cw(const R *Y_N, B *V_N, const int frame_id)\n+{\n+// auto t_load = std::chrono::steady_clock::now(); // ---------------------------------------------------------- LOAD\n+ tools::hard_decide(Y_N, YH_N.data(), this->N);\n+ std::copy(YH_N.begin(), YH_N.end(), var_nodes.begin());\n+// auto d_load = std::chrono::steady_clock::now() - t_load;\n+\n+// auto t_decod = std::chrono::steady_clock::now(); // -------------------------------------------------------- DECODE\n+ this->decode(YH_N.data(), frame_id);\n+// auto d_decod = std::chrono::steady_clock::now() - t_decod;\n+\n+// auto t_store = std::chrono::steady_clock::now(); // --------------------------------------------------------- STORE\n+ _store_cw(V_N, frame_id);\n+// auto d_store = std::chrono::steady_clock::now() - t_store;\n+\n+// (*this)[dec::tsk::decode_siho_cw].update_timer(dec::tm::decode_siho_cw::load, d_load);\n+// (*this)[dec::tsk::decode_siho_cw].update_timer(dec::tm::decode_siho_cw::decode, d_decod);\n+// (*this)[dec::tsk::decode_siho_cw].update_timer(dec::tm::decode_siho_cw::store, d_store);\n+}\n+\n+template<typename B, typename R>\n+void Decoder_LDPC_bit_flipping_hard<B,R>::_store(B *V_K, const int frame_id)\n+{\n+ for (auto i = 0; i < this->K; i++)\n+ V_K[i] = this->var_nodes[this->info_bits_pos[i]];\n+}\n+\n+template<typename B, typename R>\n+void Decoder_LDPC_bit_flipping_hard<B,R>::_store_cw(B *V_N, const int frame_id)\n+{\n+ std::copy(this->var_nodes.begin(), this->var_nodes.end(), V_N);\n+}\n+\n+template <typename B, typename R>\n+bool Decoder_LDPC_bit_flipping_hard<B,R>\n+::decode(const B *Y_N, const int frame_id)\n+{\n+ this->cur_syndrome_depth = 0;\n+ bool synd = false;\n+\n+ auto* CN = this->check_nodes.data();\n+ auto* VN = this->var_nodes .data();\n+\n+ for (auto ite = 0; ite < this->n_ite; ite++)\n+ {\n+ this->cn_process(VN, CN, frame_id);\n+\n+ if (this->enable_syndrome && (synd = check_syndrome()))\n+ {\n+ this->cur_syndrome_depth++;\n+ if (this->cur_syndrome_depth >= this->syndrome_depth)\n+ break;\n+ }\n+ else\n+ this->cur_syndrome_depth = 0;\n+\n+ this->vn_process(Y_N, VN, CN, frame_id);\n+ }\n+\n+ if (!this->enable_syndrome)\n+ synd = check_syndrome();\n+\n+ return synd;\n+}\n+\n+template <typename B, typename R>\n+bool Decoder_LDPC_bit_flipping_hard<B,R>\n+::check_syndrome() const\n+{\n+ auto res = std::accumulate(check_nodes.begin(), check_nodes.end(), (B)0,\n+ [](const B a, B b){return a || b;});\n+\n+ return !res;\n+}\n+\n+\n+// ==================================================================================== explicit template instantiation\n+#include \"Tools/types.h\"\n+#ifdef AFF3CT_MULTI_PREC\n+template class aff3ct::module::Decoder_LDPC_bit_flipping_hard<B_8,Q_8>;\n+template class aff3ct::module::Decoder_LDPC_bit_flipping_hard<B_16,Q_16>;\n+template class aff3ct::module::Decoder_LDPC_bit_flipping_hard<B_32,Q_32>;\n+template class aff3ct::module::Decoder_LDPC_bit_flipping_hard<B_64,Q_64>;\n+#else\n+template class aff3ct::module::Decoder_LDPC_bit_flipping_hard<B,Q>;\n+#endif\n+// ==================================================================================== explicit template instantiation\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Module/Decoder/LDPC/BF/Decoder_LDPC_bit_flipping_hard.hpp", "diff": "+#ifndef DECODER_LDPC_BIT_FLIPPING_HARD_HPP_\n+#define DECODER_LDPC_BIT_FLIPPING_HARD_HPP_\n+\n+#include \"../../Decoder_SIHO_HIHO.hpp\"\n+#include \"Tools/Algo/Matrix/Sparse_matrix/Sparse_matrix.hpp\"\n+\n+namespace aff3ct\n+{\n+namespace module\n+{\n+template <typename B = int, typename R = float>\n+class Decoder_LDPC_bit_flipping_hard : public Decoder_SIHO_HIHO<B,R>\n+{\n+public:\n+ Decoder_LDPC_bit_flipping_hard(const int &K, const int &N, const int& n_ite,\n+ const tools::Sparse_matrix &H,\n+ const std::vector<unsigned> &info_bits_pos,\n+ const bool enable_syndrome = true,\n+ const int syndrome_depth = 1,\n+ const int n_frames = 1);\n+ virtual ~Decoder_LDPC_bit_flipping_hard() = default;\n+\n+protected:\n+ const int n_ite; // number of iterations to perform\n+ const bool enable_syndrome;\n+ const int syndrome_depth;\n+ int cur_syndrome_depth;\n+\n+ const tools::Sparse_matrix H; // In vertical way\n+ // CN are along the columns -> H.get_n_cols() == M (often M=N-K)\n+ // VN are along the rows -> H.get_n_rows() == N\n+ // automatically transpose in the constructor if needed\n+\n+ // data structures for iterative decoding\n+ std::vector<B> var_nodes;\n+ std::vector<B> check_nodes;\n+ std::vector<B> YH_N;\n+\n+ const std::vector<unsigned> &info_bits_pos;\n+\n+\n+ void _store (B *V_K, const int frame_id);\n+ void _store_cw (B *V_N, const int frame_id);\n+\n+ void _decode_siho (const R *Y_N, B *V_K, const int frame_id);\n+ void _decode_siho_cw(const R *Y_N, B *V_N, const int frame_id);\n+\n+ void _decode_hiho (const B *Y_N, B *V_K, const int frame_id);\n+ void _decode_hiho_cw(const B *Y_N, B *V_N, const int frame_id);\n+\n+ // return true if the syndrome is valid\n+ virtual bool decode(const B *Y_N, const int frame_id);\n+ virtual void cn_process(const B *VN, B *CN, const int frame_id) = 0;\n+ virtual void vn_process(const B *Y_N, B *VN, const B *CN, const int frame_id) = 0;\n+\n+ bool check_syndrome() const;\n+};\n+}\n+}\n+\n+#endif /* DECODER_LDPC_BIT_FLIPPING_HARD_HPP_ */\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.cpp", "diff": "+#include <limits>\n+#include <sstream>\n+#include <typeinfo>\n+\n+#include \"Tools/Exception/exception.hpp\"\n+#include \"Tools/Math/utils.h\"\n+\n+#include \"Decoder_LDPC_probabilistic_parallel_bit_flipping.hpp\"\n+\n+using namespace aff3ct;\n+using namespace aff3ct::module;\n+\n+template <typename B, typename R>\n+Decoder_LDPC_probabilistic_parallel_bit_flipping<B,R>\n+::Decoder_LDPC_probabilistic_parallel_bit_flipping(const int &K, const int &N, const int& n_ite,\n+ const tools::Sparse_matrix &H,\n+ const std::vector<unsigned> &info_bits_pos,\n+ const std::vector<float> &bernouilli_probas,\n+ const bool enable_syndrome,\n+ const int syndrome_depth,\n+ const int seed,\n+ const int n_frames)\n+: Decoder(K, N, n_frames, 1),\n+ Decoder_LDPC_bit_flipping_hard<B,R>(K, N, n_ite, H, info_bits_pos, enable_syndrome, syndrome_depth, n_frames),\n+ rd_engine (seed ),\n+ bernouilli_dist (bernouilli_probas.size())\n+{\n+ const std::string name = \"Decoder_LDPC_probabilistic_parallel_bit_flipping\";\n+ this->set_name(name);\n+\n+ if (std::is_same<R, signed char>::value)\n+ {\n+ std::stringstream message;\n+ message << \"This decoder does not work in 8-bit fixed-point (try in 16-bit).\";\n+ throw tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n+ }\n+\n+ if (bernouilli_probas.size() != (this->H.get_rows_max_degree() + 2))\n+ {\n+ std::stringstream message;\n+ message << \"'bernouilli_probas.size()' must be equal to the biggest variable node degree plus 2\"\n+ << \"('bernouilli_probas.size() = '\" << bernouilli_probas.size() << \", 'variable node max degree' = \"\n+ << this->H.get_cols_max_degree() << \").\";\n+ throw tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n+ }\n+\n+ // generate Bernouilli distributions\n+ for (unsigned i = 0; i < bernouilli_dist.size(); i++)\n+ bernouilli_dist[i].reset(new std::bernoulli_distribution(bernouilli_probas[i]));\n+}\n+\n+template <typename B, typename R>\n+void Decoder_LDPC_probabilistic_parallel_bit_flipping<B,R>\n+::cn_process(const B *VN, B *CN, const int frame_id)\n+{\n+ // for each check nodes&&&\n+ const auto n_chk_nodes = (int)this->H.get_n_cols();\n+ for (auto c = 0; c < n_chk_nodes; c++)\n+ {\n+ const auto& chk_node = this->H.get_col_to_rows()[c];\n+ const auto chk_degree = chk_node.size();\n+\n+ CN[c] = 0;\n+ for (unsigned v = 0; v < chk_degree; v++)\n+ CN[c] ^= VN[chk_node[v]];\n+ }\n+}\n+\n+template <typename B, typename R>\n+void Decoder_LDPC_probabilistic_parallel_bit_flipping<B,R>\n+::vn_process(const B *Y_N, B *VN, const B *CN, const int frame_id)\n+{\n+ // for each variable nodes\n+ const auto n_var_nodes = (int)this->H.get_n_rows();\n+ for (auto v = 0; v < n_var_nodes; v++)\n+ {\n+ const auto& var_node = this->H.get_row_to_cols()[v];\n+ const auto var_degree = var_node.size();\n+\n+ auto energy = VN[v] ^ Y_N[v];\n+ for (unsigned c = 0; c < var_degree; c++)\n+ energy += CN[var_node[c]];\n+\n+ VN[v] ^= (*bernouilli_dist[energy])(this->rd_engine);\n+ }\n+}\n+\n+\n+// ==================================================================================== explicit template instantiation\n+#include \"Tools/types.h\"\n+#ifdef AFF3CT_MULTI_PREC\n+template class aff3ct::module::Decoder_LDPC_probabilistic_parallel_bit_flipping<B_8,Q_8>;\n+template class aff3ct::module::Decoder_LDPC_probabilistic_parallel_bit_flipping<B_16,Q_16>;\n+template class aff3ct::module::Decoder_LDPC_probabilistic_parallel_bit_flipping<B_32,Q_32>;\n+template class aff3ct::module::Decoder_LDPC_probabilistic_parallel_bit_flipping<B_64,Q_64>;\n+#else\n+template class aff3ct::module::Decoder_LDPC_probabilistic_parallel_bit_flipping<B,Q>;\n+#endif\n+// ==================================================================================== explicit template instantiation\n+\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.hpp", "diff": "+#ifndef DECODER_LDPC_PROBABILISTIC_PARALLEL_BIT_FLIPPING_HPP_\n+#define DECODER_LDPC_PROBABILISTIC_PARALLEL_BIT_FLIPPING_HPP_\n+\n+#include <random>\n+#include <memory>\n+\n+#include \"../Decoder_LDPC_bit_flipping_hard.hpp\"\n+\n+namespace aff3ct\n+{\n+namespace module\n+{\n+template <typename B = int, typename R = float>\n+class Decoder_LDPC_probabilistic_parallel_bit_flipping : public Decoder_LDPC_bit_flipping_hard<B,R>\n+{\n+//private:\n+// const float normalize_factor;\n+// const R offset;\n+\n+public:\n+ Decoder_LDPC_probabilistic_parallel_bit_flipping(const int &K, const int &N, const int& n_ite,\n+ const tools::Sparse_matrix &H,\n+ const std::vector<unsigned> &info_bits_pos,\n+ const std::vector<float> &bernouilli_probas,\n+ const bool enable_syndrome = true,\n+ const int syndrome_depth = 1,\n+ const int seed = 0,\n+ const int n_frames = 1);\n+ virtual ~Decoder_LDPC_probabilistic_parallel_bit_flipping() = default;\n+\n+protected:\n+ std::mt19937 rd_engine; // Mersenne Twister 19937\n+ std::vector<std::unique_ptr<std::bernoulli_distribution>> bernouilli_dist;\n+\n+ virtual void cn_process(const B *VN, B *CN, const int frame_id);\n+ virtual void vn_process(const B *Y_N, B *VN, const B *CN, const int frame_id);\n+};\n+\n+template <typename B = int, typename R = float>\n+using Decoder_LDPC_PPBF = Decoder_LDPC_probabilistic_parallel_bit_flipping<B,R>;\n+\n+}\n+}\n+\n+#endif /* DECODER_LDPC_PROBABILISTIC_PARALLEL_BIT_FLIPPING_HPP_ */\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BP/Peeling/Decoder_LDPC_BP_peeling.cpp", "new_path": "src/Module/Decoder/LDPC/BP/Peeling/Decoder_LDPC_BP_peeling.cpp", "diff": "@@ -14,7 +14,7 @@ Decoder_LDPC_BP_peeling<B,R>::Decoder_LDPC_BP_peeling(const int K, const int N,\nconst bool enable_syndrome, const int syndrome_depth,\nconst int n_frames)\n: Decoder (K, N, n_frames, 1),\n- Decoder_SISO_SIHO<B,R>(K, N, n_frames, 1),\n+ Decoder_SIHO_HIHO<B,R>(K, N, n_frames, 1),\nDecoder_LDPC_BP (K, N, n_ite, _H, enable_syndrome, syndrome_depth),\ninfo_bits_pos (info_bits_pos ),\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BP/Peeling/Decoder_LDPC_BP_peeling.hpp", "new_path": "src/Module/Decoder/LDPC/BP/Peeling/Decoder_LDPC_BP_peeling.hpp", "diff": "#ifndef DECODER_LDPC_BP_PEELING_HPP\n#define DECODER_LDPC_BP_PEELING_HPP\n-#include \"../../../Decoder_SISO_SIHO.hpp\"\n+#include \"../../../Decoder_SIHO_HIHO.hpp\"\n#include \"../Decoder_LDPC_BP.hpp\"\nnamespace aff3ct\n@@ -10,7 +10,7 @@ namespace module\n{\ntemplate<typename B = int, typename R = float>\n-class Decoder_LDPC_BP_peeling : public Decoder_SISO_SIHO<B,R>, public Decoder_LDPC_BP\n+class Decoder_LDPC_BP_peeling : public Decoder_SIHO_HIHO<B,R>, public Decoder_LDPC_BP\n{\nprotected:\nconst std::vector<unsigned> &info_bits_pos;\n@@ -39,7 +39,6 @@ protected:\n// return true if the syndrome is valid\nvirtual bool _decode( const int frame_id);\n-\n};\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/Iterative/BFER_ite.cpp", "new_path": "src/Simulation/BFER/Iterative/BFER_ite.cpp", "diff": "@@ -150,9 +150,11 @@ std::unique_ptr<module::Codec_SISO_SIHO<B,Q>> BFER_ite<B,R,Q>\n::build_codec(const int tid)\n{\nconst auto seed_enc = rd_engine_seed[tid]();\n+ const auto seed_dec = rd_engine_seed[tid]();\nstd::unique_ptr<factory::Codec::parameters> params_cdc(params_BFER_ite.cdc->clone());\nparams_cdc->enc->seed = seed_enc;\n+ params_cdc->dec->seed = seed_dec;\nauto crc = this->params_BFER_ite.crc->type == \"NO\" ? nullptr : this->crc[tid].get();\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/Standard/BFER_std.cpp", "new_path": "src/Simulation/BFER/Standard/BFER_std.cpp", "diff": "@@ -138,9 +138,11 @@ std::unique_ptr<module::Codec_SIHO<B,Q>> BFER_std<B,R,Q>\n::build_codec(const int tid)\n{\nconst auto seed_enc = rd_engine_seed[tid]();\n+ const auto seed_dec = rd_engine_seed[tid]();\nstd::unique_ptr<factory::Codec::parameters> params_cdc(params_BFER_std.cdc->clone());\nparams_cdc->enc->seed = seed_enc;\n+ params_cdc->dec->seed = seed_dec;\nif (params_cdc->itl != nullptr)\n{\n" }, { "change_type": "MODIFY", "old_path": "src/aff3ct.hpp", "new_path": "src/aff3ct.hpp", "diff": "#ifndef DECODER_MAXIMUM_LIKELIHOOD_STD_HPP_\n#include <Module/Decoder/Generic/ML/Decoder_maximum_likelihood_std.hpp>\n#endif\n+#ifndef DECODER_LDPC_BIT_FLIPPING_HARD_HPP_\n+#include <Module/Decoder/LDPC/BF/Decoder_LDPC_bit_flipping_hard.hpp>\n+#endif\n#ifndef DECODER_LDPC_BIT_FLIPPING_HPP_\n#include <Module/Decoder/LDPC/BF/Decoder_LDPC_bit_flipping.hpp>\n#endif\n#ifndef DECODER_LDPC_BIT_FLIPPING_OMWBF_HPP_\n#include <Module/Decoder/LDPC/BF/OMWBF/Decoder_LDPC_bit_flipping_OMWBF.hpp>\n#endif\n+#ifndef DECODER_LDPC_PROBABILISTIC_PARALLEL_BIT_FLIPPING_HPP_\n+#include <Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.hpp>\n+#endif\n#ifndef DECODER_LDPC_BP_HPP_\n#include <Module/Decoder/LDPC/BP/Decoder_LDPC_BP.hpp>\n#endif\n" } ]
C++
MIT License
aff3ct/aff3ct
Add the LDPC-PPBF decoder
8,483
19.12.2018 13:59:05
-3,600
a9d92d5e894cb0a0c97431be1598d5aea2d4eda3
Doc: add the LDPC-PPBF
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/conf.py", "new_path": "doc/sphinx/source/conf.py", "diff": "@@ -337,6 +337,7 @@ rst_epilog = \"\"\"\n.. |PRNG| replace:: :abbr:`PRNG (Pseudo Random Number Generator)`\n.. |PRNGs| replace:: :abbr:`PRNGs (Pseudo Random Number Generators)`\n.. |PSK| replace:: :abbr:`PSK (Phase-Shift Keying)`\n+.. |PPBF| replace:: :abbr:`PPBF (Probabilistic Parallel Bit-Flipping)`\n.. |PyBER| replace:: PyBER\n.. |QAM| replace:: :abbr:`QAM (Quadrature Amplitude Modulation)`\n.. |QC| replace:: :abbr:`QC (Quasi-Cyclic)`\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/ldpc/decoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/ldpc/decoder.rst", "diff": "@@ -69,8 +69,8 @@ Description of the allowed values:\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n:Type: text\n- :Allowed values: ``STD`` ``GALA`` ``GALB`` ``GALE`` ``WBF`` ``SPA`` ``LSPA``\n- ``AMS`` ``MS`` ``NMS`` ``OMS``\n+ :Allowed values: ``STD`` ``GALA`` ``GALB`` ``GALE`` ``WBF`` ``PPBF`` ``SPA``\n+ ``LSPA`` ``AMS`` ``MS`` ``NMS`` ``OMS``\n:Default: ``SPA``\n:Examples: ``--dec-implem AMS``\n@@ -89,6 +89,8 @@ Description of the allowed values:\n+-----------+------------------------------------------------------------------------+\n| ``GALE`` | Select the |GALE| algorithm :cite:`Declerq2014` with extended alphabet.|\n+-----------+------------------------------------------------------------------------+\n+| ``PPBF`` | Select the |PPBF| algorithm :cite:`LeGhaffari2019`. |\n++-----------+------------------------------------------------------------------------+\n| ``WBF`` | Select the |WBF| algorithm :cite:`Wadayama2010`. |\n+-----------+------------------------------------------------------------------------+\n| ``SPA`` | Select the |SPA| update rules :cite:`MacKay1995`. |\n@@ -316,6 +318,20 @@ only a :math:`\\min` function.\n|factory::Decoder_LDPC::parameters::p+synd-depth|\n+.. _dec-ldpc-dec-ppbf-proba:\n+\n+``--dec-ppbf-proba``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: list of real numbers\n+ :Examples: ``--dec-ppbf-proba \"0,0.001,0.1,0.3,1,1,1\"``\n+\n+|factory::Decoder_LDPC::parameters::p+ppbf-proba|\n+\n+Thus, with a parity matrix that has its largest variable node at 5, you must\n+give 7 values. Each value corresponds to an energy level as described in\n+:cite:`LeGhaffari2019`.\n+\n.. _dec-ldpc-dec-no-synd:\n``--dec-no-synd``\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": ".. |factory::Decoder::parameters::p+flips| replace::\nSet the maximum number of bit flips in the Chase decoder.\n+.. |factory::Decoder::parameters::p+seed| replace::\n+ Specify the seed used to generate random numbers when needed.\n+\n.. --------------------------------------------- factory Decoder_BCH parameters\n.. |factory::Decoder_BCH::parameters::p+corr-pow,T| replace::\nSpecify the order of execution of the |CNs| in the decoding process depending\non their degree.\n+.. |factory::Decoder_LDPC::parameters::p+ppbf-proba| replace::\n+ Give the probabilities of the Bernouilli distribution of the PPBF.\n+ The number of given values must be equal to the biggest variable node degree\n+ plus two.\n+\n.. ---------------------------------------------- factory Decoder_NO parameters\n.. ------------------------------------------- factory Decoder_polar parameters\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: add the LDPC-PPBF
8,490
19.12.2018 15:01:40
-3,600
6f08f2819b9f8dbd5c16e69effd7654af27d1392
Improve the polar nodes parser code.
[ { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.cpp", "new_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.cpp", "diff": "#include \"Tools/Code/Polar/API/API_polar_static_intra_32bit.hpp\"\n#endif\n-#include \"Tools/Code/Polar/nodes_parser.h\"\n+#include \"Tools/Code/Polar/Nodes_parser.h\"\n#include \"Decoder_polar.hpp\"\n@@ -199,7 +199,7 @@ module::Decoder_SIHO<B,Q>* Decoder_polar::parameters\nif (crc == nullptr || crc->get_size() == 0)\n{\nint idx_r0, idx_r1;\n- auto polar_patterns = tools::nodes_parser(this->polar_nodes, idx_r0, idx_r1);\n+ auto polar_patterns = tools::Nodes_parser<>::parse_uptr(this->polar_nodes, idx_r0, idx_r1);\nif (this->type == \"SC\" ) return new module::Decoder_polar_SC_fast_sys<B, Q, API_polar>(this->K, this->N_cw, frozen_bits, std::move(polar_patterns), idx_r0, idx_r1, this->n_frames);\n}\n}\n@@ -213,7 +213,7 @@ module::Decoder_SIHO<B,Q>* Decoder_polar::parameters\n::_build_scl_fast(const std::vector<bool> &frozen_bits, module::CRC<B> *crc, const std::unique_ptr<module::Encoder<B>>& encoder) const\n{\nint idx_r0, idx_r1;\n- auto polar_patterns = tools::nodes_parser(this->polar_nodes, idx_r0, idx_r1);\n+ auto polar_patterns = tools::Nodes_parser<>::parse_uptr(this->polar_nodes, idx_r0, idx_r1);\nif (this->implem == \"FAST\" && this->systematic)\n{\n" }, { "change_type": "RENAME", "old_path": "src/Tools/Code/Polar/nodes_parser.h", "new_path": "src/Tools/Code/Polar/Nodes_parser.h", "diff": "@@ -25,10 +25,25 @@ template <class R0 = Pattern_polar_r0,\nclass REPL = Pattern_polar_rep_left,\nclass SPC = Pattern_polar_spc,\nclass STD = Pattern_polar_std>\n-std::vector<std::unique_ptr<aff3ct::tools::Pattern_polar_i>> nodes_parser(const std::string &str_polar, int &idx_r0, int &idx_r1);\n+struct Nodes_parser\n+{\n+private:\n+ static void push_back_polar_pattern(std::vector<Pattern_polar_i*> *polar_patterns_ptr,\n+ std::vector<std::unique_ptr<Pattern_polar_i>> *polar_patterns_uptr,\n+ Pattern_polar_i* polar_pattern);\n+\n+ static void parse(const std::string &str_polar, int &idx_r0, int &idx_r1,\n+ std::vector<Pattern_polar_i*> *polar_patterns_ptr,\n+ std::vector<std::unique_ptr<Pattern_polar_i>> *polar_patterns_uptr);\n+\n+public:\n+ static std::vector<std::unique_ptr<Pattern_polar_i>> parse_uptr(const std::string &str_polar, int &idx_r0, int &idx_r1);\n+\n+ static std::vector<Pattern_polar_i*> parse_ptr(const std::string &str_polar, int &idx_r0, int &idx_r1);\n+};\n}\n}\n-#include \"nodes_parser.hxx\"\n+#include \"Nodes_parser.hxx\"\n#endif /* NODES_PARSER_HPP */\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Tools/Code/Polar/Nodes_parser.hxx", "diff": "+#include <string>\n+#include <sstream>\n+#include <vector>\n+#include <cmath>\n+\n+#include \"Tools/Display/rang_format/rang_format.h\"\n+\n+#include \"Tools/general_utils.h\"\n+\n+#include \"Nodes_parser.h\"\n+\n+namespace aff3ct\n+{\n+namespace tools\n+{\n+\n+template <class R0, class R0L, class R1, class REP, class REPL, class SPC, class STD>\n+void Nodes_parser<R0,R0L,R1,REP,REPL,SPC,STD>\n+::push_back_polar_pattern(std::vector<Pattern_polar_i*> *polar_patterns_ptr,\n+ std::vector<std::unique_ptr<Pattern_polar_i>> *polar_patterns_uptr,\n+ Pattern_polar_i* polar_pattern)\n+{\n+ if (polar_patterns_ptr != nullptr)\n+ polar_patterns_ptr->push_back(polar_pattern);\n+ if (polar_patterns_uptr != nullptr)\n+ polar_patterns_uptr->push_back(std::unique_ptr<Pattern_polar_i>(polar_pattern));\n+\n+ if (polar_patterns_ptr == nullptr && polar_patterns_uptr == nullptr)\n+ delete polar_pattern;\n+}\n+\n+template <class R0, class R0L, class R1, class REP, class REPL, class SPC, class STD>\n+void Nodes_parser<R0,R0L,R1,REP,REPL,SPC,STD>\n+::parse(const std::string &str_polar, int &idx_r0, int &idx_r1,\n+ std::vector<Pattern_polar_i*> *polar_patterns_ptr,\n+ std::vector<std::unique_ptr<Pattern_polar_i>> *polar_patterns_uptr)\n+{\n+ using namespace aff3ct::tools;\n+ idx_r0 = -1;\n+ idx_r1 = -1;\n+\n+ auto str_polar_bis = str_polar;\n+\n+ str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), ' '), str_polar_bis.end());\n+ str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), '{'), str_polar_bis.end());\n+ str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), '}'), str_polar_bis.end());\n+ str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), '('), str_polar_bis.end());\n+ str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), ')'), str_polar_bis.end());\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new STD);\n+\n+ auto v_polar = split(str_polar_bis, ',');\n+ for (auto i = 0; i < (int)v_polar.size(); i++)\n+ {\n+ auto v_str1 = split(v_polar[i], '_');\n+\n+ if (v_str1.size() >= 1)\n+ {\n+ if (v_str1[0] == \"R0L\")\n+ {\n+ if (v_str1.size() == 1)\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0L);\n+ else\n+ {\n+ auto v_str2 = split(v_str1[1], '-');\n+\n+ if (v_str2.size() > 1)\n+ {\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+ auto max = (int)std::log2(std::stoi(v_str2[1]));\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0L(min, max));\n+ }\n+ else\n+ {\n+ bool plus = v_str2[0].find(\"+\") != std::string::npos;\n+\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+\n+ if (plus) push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0L(min ));\n+ else push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0L(min, min));\n+ }\n+ }\n+ }\n+ else if (v_str1[0] == \"R0\")\n+ {\n+ if (polar_patterns_uptr != nullptr) idx_r0 = (int)polar_patterns_uptr->size();\n+ else if (polar_patterns_ptr != nullptr) idx_r0 = (int)polar_patterns_ptr ->size();\n+\n+ if (v_str1.size() == 1)\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0);\n+ else\n+ {\n+ auto v_str2 = split(v_str1[1], '-');\n+\n+ if (v_str2.size() > 1)\n+ {\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+ auto max = (int)std::log2(std::stoi(v_str2[1]));\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0(min, max));\n+ }\n+ else\n+ {\n+ bool plus = v_str2[0].find(\"+\") != std::string::npos;\n+\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+\n+ if (plus) push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0(min ));\n+ else push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0(min, min));\n+ }\n+ }\n+ }\n+ else if (v_str1[0] == \"R1\")\n+ {\n+ if (polar_patterns_uptr != nullptr) idx_r1 = (int)polar_patterns_uptr->size();\n+ else if (polar_patterns_ptr != nullptr) idx_r1 = (int)polar_patterns_ptr ->size();\n+\n+ if (v_str1.size() == 1)\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R1);\n+ else\n+ {\n+ auto v_str2 = split(v_str1[1], '-');\n+\n+ if (v_str2.size() > 1)\n+ {\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+ auto max = (int)std::log2(std::stoi(v_str2[1]));\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R1(min, max));\n+ }\n+ else\n+ {\n+ bool plus = v_str2[0].find(\"+\") != std::string::npos;\n+\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+\n+ if (plus) push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R1(min ));\n+ else push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R1(min, min));\n+ }\n+ }\n+ }\n+ else if (v_str1[0] == \"REPL\")\n+ {\n+ if (v_str1.size() == 1)\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new REPL);\n+ else\n+ {\n+ auto v_str2 = split(v_str1[1], '-');\n+\n+ if (v_str2.size() > 1)\n+ {\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+ auto max = (int)std::log2(std::stoi(v_str2[1]));\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new REPL(min, max));\n+ }\n+ else\n+ {\n+ bool plus = v_str2[0].find(\"+\") != std::string::npos;\n+\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+\n+ if (plus) push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new REPL(min ));\n+ else push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new REPL(min, min));\n+ }\n+ }\n+ }\n+ else if (v_str1[0] == \"REP\")\n+ {\n+ if (v_str1.size() == 1)\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new REP);\n+ else\n+ {\n+ auto v_str2 = split(v_str1[1], '-');\n+\n+ if (v_str2.size() > 1)\n+ {\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+ auto max = (int)std::log2(std::stoi(v_str2[1]));\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new REP(min, max));\n+ }\n+ else\n+ {\n+ bool plus = v_str2[0].find(\"+\") != std::string::npos;\n+\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+\n+ if (plus) push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new REP(min ));\n+ else push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new REP(min, min));\n+ }\n+ }\n+ }\n+ else if (v_str1[0] == \"SPC\")\n+ {\n+ if (v_str1.size() == 1)\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new SPC);\n+ else\n+ {\n+ auto v_str2 = split(v_str1[1], '-');\n+\n+ if (v_str2.size() > 1)\n+ {\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+ auto max = (int)std::log2(std::stoi(v_str2[1]));\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new SPC(min, max));\n+ }\n+ else\n+ {\n+ bool plus = v_str2[0].find(\"+\") != std::string::npos;\n+\n+ auto min = (int)std::log2(std::stoi(v_str2[0]));\n+\n+ if (plus) push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new SPC(min ));\n+ else push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new SPC(min, min));\n+ }\n+ }\n+ }\n+ else\n+ {\n+ std::clog << rang::tag::warning << \"Unrecognized Polar node type (\" << v_polar[i] << \").\" << std::endl;\n+ }\n+ }\n+ }\n+\n+ if (idx_r0 == -1)\n+ {\n+ if (polar_patterns_uptr != nullptr) idx_r0 = (int)polar_patterns_uptr->size();\n+ else if (polar_patterns_ptr != nullptr) idx_r0 = (int)polar_patterns_ptr ->size();\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R0(0,0));\n+ }\n+\n+ if (idx_r1 == -1)\n+ {\n+ if (polar_patterns_uptr != nullptr) idx_r1 = (int)polar_patterns_uptr->size();\n+ else if (polar_patterns_ptr != nullptr) idx_r1 = (int)polar_patterns_ptr ->size();\n+\n+ push_back_polar_pattern(polar_patterns_ptr, polar_patterns_uptr, new R1(0,0));\n+ }\n+}\n+\n+\n+template <class R0, class R0L, class R1, class REP, class REPL, class SPC, class STD>\n+std::vector<std::unique_ptr<Pattern_polar_i>> Nodes_parser<R0,R0L,R1,REP,REPL,SPC,STD>\n+::parse_uptr(const std::string &str_polar, int &idx_r0, int &idx_r1)\n+{\n+ std::vector<std::unique_ptr<Pattern_polar_i>> polar_patterns_uptr;\n+ Nodes_parser::parse(str_polar, idx_r0, idx_r1, nullptr, &polar_patterns_uptr);\n+ return polar_patterns_uptr;\n+}\n+\n+template <class R0, class R0L, class R1, class REP, class REPL, class SPC, class STD>\n+std::vector<Pattern_polar_i*> Nodes_parser<R0,R0L,R1,REP,REPL,SPC,STD>\n+::parse_ptr(const std::string &str_polar, int &idx_r0, int &idx_r1)\n+{\n+ std::vector<Pattern_polar_i*> polar_patterns_ptr;\n+ Nodes_parser::parse(str_polar, idx_r0, idx_r1, &polar_patterns_ptr, nullptr);\n+ return polar_patterns_ptr;\n+}\n+\n+}\n+}\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Pattern_polar_parser.cpp", "new_path": "src/Tools/Code/Polar/Pattern_polar_parser.cpp", "diff": "using namespace aff3ct;\nusing namespace aff3ct::tools;\n-std::vector<std::unique_ptr<tools::Pattern_polar_i>> convert_initlist_to_vecuniptr(std::initializer_list<tools::Pattern_polar_i*> patterns)\n+std::vector<std::unique_ptr<tools::Pattern_polar_i>>\n+convert_vector_to_vecuniptr(const std::vector<tools::Pattern_polar_i*> patterns)\n{\nstd::vector<std::unique_ptr<tools::Pattern_polar_i>> v;\n@@ -51,20 +52,20 @@ Pattern_polar_parser\nPattern_polar_parser\n::Pattern_polar_parser(const int& N,\nconst std::vector<bool> &frozen_bits,\n- std::initializer_list<tools::Pattern_polar_i*> patterns,\n+ const std::vector<tools::Pattern_polar_i*> patterns,\nconst std::unique_ptr<tools::Pattern_polar_i> &pattern_rate0,\nconst std::unique_ptr<tools::Pattern_polar_i> &pattern_rate1)\n-: Pattern_polar_parser(N, frozen_bits, convert_initlist_to_vecuniptr(patterns), pattern_rate0, pattern_rate1)\n+: Pattern_polar_parser(N, frozen_bits, convert_vector_to_vecuniptr(patterns), pattern_rate0, pattern_rate1)\n{\n}\nPattern_polar_parser\n::Pattern_polar_parser(const int& N,\nconst std::vector<bool>& frozen_bits,\n- std::initializer_list<tools::Pattern_polar_i*> patterns,\n+ const std::vector<tools::Pattern_polar_i*> patterns,\nconst int pattern_rate0_id,\nconst int pattern_rate1_id)\n-: Pattern_polar_parser(N, frozen_bits, convert_initlist_to_vecuniptr(patterns), pattern_rate0_id, pattern_rate1_id)\n+: Pattern_polar_parser(N, frozen_bits, convert_vector_to_vecuniptr(patterns), pattern_rate0_id, pattern_rate1_id)\n{\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Pattern_polar_parser.hpp", "new_path": "src/Tools/Code/Polar/Pattern_polar_parser.hpp", "diff": "@@ -82,7 +82,7 @@ public:\n*/\nPattern_polar_parser(const int& N,\nconst std::vector<bool> &frozen_bits,\n- std::initializer_list<tools::Pattern_polar_i*> patterns,\n+ const std::vector<tools::Pattern_polar_i*> patterns,\nconst std::unique_ptr<tools::Pattern_polar_i> &pattern_rate0,\nconst std::unique_ptr<tools::Pattern_polar_i> &pattern_rate1);\n@@ -97,7 +97,7 @@ public:\n*/\nPattern_polar_parser(const int& N,\nconst std::vector<bool>& frozen_bits,\n- std::initializer_list<tools::Pattern_polar_i*> patterns,\n+ const std::vector<tools::Pattern_polar_i*> patterns,\nconst int pattern_rate0_id,\nconst int pattern_rate1_id);\n" }, { "change_type": "DELETE", "old_path": "src/Tools/Code/Polar/nodes_parser.hxx", "new_path": null, "diff": "-#include <string>\n-#include <sstream>\n-#include <vector>\n-#include <cmath>\n-\n-#include \"Tools/Display/rang_format/rang_format.h\"\n-\n-#include \"Tools/general_utils.h\"\n-\n-#include \"nodes_parser.h\"\n-\n-template <class R0, class R0L, class R1, class REP, class REPL, class SPC, class STD>\n-std::vector<std::unique_ptr<aff3ct::tools::Pattern_polar_i>> aff3ct::tools\n-::nodes_parser(const std::string &str_polar, int &idx_r0, int &idx_r1)\n-{\n- using namespace aff3ct::tools;\n- idx_r0 = -1;\n- idx_r1 = -1;\n-\n- auto str_polar_bis = str_polar;\n-\n- str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), ' '), str_polar_bis.end());\n- str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), '{'), str_polar_bis.end());\n- str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), '}'), str_polar_bis.end());\n- str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), '('), str_polar_bis.end());\n- str_polar_bis.erase(std::remove(str_polar_bis.begin(), str_polar_bis.end(), ')'), str_polar_bis.end());\n-\n- using Pattern_polar_ptr = std::unique_ptr<Pattern_polar_i>;\n-\n- std::vector<Pattern_polar_ptr> polar_patterns;\n-\n- polar_patterns.push_back(Pattern_polar_ptr(Pattern_polar_ptr(new STD)));\n-\n- auto v_polar = split(str_polar_bis, ',');\n- for (auto i = 0; i < (int)v_polar.size(); i++)\n- {\n- auto v_str1 = split(v_polar[i], '_');\n-\n- if (v_str1.size() >= 1)\n- {\n- if (v_str1[0] == \"R0L\")\n- {\n- if (v_str1.size() == 1)\n- polar_patterns.push_back(Pattern_polar_ptr(new R0L));\n- else\n- {\n- auto v_str2 = split(v_str1[1], '-');\n-\n- if (v_str2.size() > 1)\n- {\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n- auto max = (int)std::log2(std::stoi(v_str2[1]));\n-\n- polar_patterns.push_back(Pattern_polar_ptr(new R0L(min, max)));\n- }\n- else\n- {\n- bool plus = v_str2[0].find(\"+\") != std::string::npos;\n-\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n-\n- if (plus) polar_patterns.push_back(Pattern_polar_ptr(new R0L(min )));\n- else polar_patterns.push_back(Pattern_polar_ptr(new R0L(min, min)));\n- }\n- }\n- }\n- else if (v_str1[0] == \"R0\")\n- {\n- idx_r0 = (int)polar_patterns.size();\n-\n- if (v_str1.size() == 1)\n- polar_patterns.push_back(Pattern_polar_ptr(new R0));\n- else\n- {\n- auto v_str2 = split(v_str1[1], '-');\n-\n- if (v_str2.size() > 1)\n- {\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n- auto max = (int)std::log2(std::stoi(v_str2[1]));\n-\n- polar_patterns.push_back(Pattern_polar_ptr(new R0(min, max)));\n- }\n- else\n- {\n- bool plus = v_str2[0].find(\"+\") != std::string::npos;\n-\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n-\n- if (plus) polar_patterns.push_back(Pattern_polar_ptr(new R0(min )));\n- else polar_patterns.push_back(Pattern_polar_ptr(new R0(min, min)));\n- }\n- }\n- }\n- else if (v_str1[0] == \"R1\")\n- {\n- idx_r1 = (int)polar_patterns.size();\n-\n- if (v_str1.size() == 1)\n- polar_patterns.push_back(Pattern_polar_ptr(new R1));\n- else\n- {\n- auto v_str2 = split(v_str1[1], '-');\n-\n- if (v_str2.size() > 1)\n- {\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n- auto max = (int)std::log2(std::stoi(v_str2[1]));\n-\n- polar_patterns.push_back(Pattern_polar_ptr(new R1(min, max)));\n- }\n- else\n- {\n- bool plus = v_str2[0].find(\"+\") != std::string::npos;\n-\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n-\n- if (plus) polar_patterns.push_back(Pattern_polar_ptr(new R1(min )));\n- else polar_patterns.push_back(Pattern_polar_ptr(new R1(min, min)));\n- }\n- }\n- }\n- else if (v_str1[0] == \"REPL\")\n- {\n- if (v_str1.size() == 1)\n- polar_patterns.push_back(Pattern_polar_ptr(new REPL));\n- else\n- {\n- auto v_str2 = split(v_str1[1], '-');\n-\n- if (v_str2.size() > 1)\n- {\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n- auto max = (int)std::log2(std::stoi(v_str2[1]));\n-\n- polar_patterns.push_back(Pattern_polar_ptr(new REPL(min, max)));\n- }\n- else\n- {\n- bool plus = v_str2[0].find(\"+\") != std::string::npos;\n-\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n-\n- if (plus) polar_patterns.push_back(Pattern_polar_ptr(new REPL(min )));\n- else polar_patterns.push_back(Pattern_polar_ptr(new REPL(min, min)));\n- }\n- }\n- }\n- else if (v_str1[0] == \"REP\")\n- {\n- if (v_str1.size() == 1)\n- polar_patterns.push_back(Pattern_polar_ptr(new REP));\n- else\n- {\n- auto v_str2 = split(v_str1[1], '-');\n-\n- if (v_str2.size() > 1)\n- {\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n- auto max = (int)std::log2(std::stoi(v_str2[1]));\n-\n- polar_patterns.push_back(Pattern_polar_ptr(new REP(min, max)));\n- }\n- else\n- {\n- bool plus = v_str2[0].find(\"+\") != std::string::npos;\n-\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n-\n- if (plus) polar_patterns.push_back(Pattern_polar_ptr(new REP(min )));\n- else polar_patterns.push_back(Pattern_polar_ptr(new REP(min, min)));\n- }\n- }\n- }\n- else if (v_str1[0] == \"SPC\")\n- {\n- if (v_str1.size() == 1)\n- polar_patterns.push_back(Pattern_polar_ptr(new SPC));\n- else\n- {\n- auto v_str2 = split(v_str1[1], '-');\n-\n- if (v_str2.size() > 1)\n- {\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n- auto max = (int)std::log2(std::stoi(v_str2[1]));\n-\n- polar_patterns.push_back(Pattern_polar_ptr(new SPC(min, max)));\n- }\n- else\n- {\n- bool plus = v_str2[0].find(\"+\") != std::string::npos;\n-\n- auto min = (int)std::log2(std::stoi(v_str2[0]));\n-\n- if (plus) polar_patterns.push_back(Pattern_polar_ptr(new SPC(min )));\n- else polar_patterns.push_back(Pattern_polar_ptr(new SPC(min, min)));\n- }\n- }\n- }\n- else\n- {\n- std::clog << rang::tag::warning << \"Unrecognized Polar node type (\" << v_polar[i] << \").\" << std::endl;\n- }\n- }\n- }\n-\n- if (idx_r0 == -1)\n- {\n- idx_r0 = (int)polar_patterns.size();\n- polar_patterns.push_back(Pattern_polar_ptr(new R0(0,0)));\n- }\n-\n- if (idx_r1 == -1)\n- {\n- idx_r1 = (int)polar_patterns.size();\n- polar_patterns.push_back(Pattern_polar_ptr(new R1(0,0)));\n- }\n-\n- return polar_patterns;\n-}\n" }, { "change_type": "MODIFY", "old_path": "src/aff3ct.hpp", "new_path": "src/aff3ct.hpp", "diff": "#include <Tools/Code/Polar/Frozenbits_notifier.hpp>\n#endif\n#ifndef NODES_PARSER_HPP\n-#include <Tools/Code/Polar/nodes_parser.h>\n+#include <Tools/Code/Polar/Nodes_parser.h>\n#endif\n#ifndef PATTERN_POLAR_PARSER_HPP\n#include <Tools/Code/Polar/Pattern_polar_parser.hpp>\n" } ]
C++
MIT License
aff3ct/aff3ct
Improve the polar nodes parser code.
8,483
19.12.2018 16:28:37
-3,600
1d45402d21b36e2d339367801249b68aff8e5086
Fix modem display when OOK but not OPTICAL
[ { "change_type": "MODIFY", "old_path": "src/Factory/Module/Modem/Modem.cpp", "new_path": "src/Factory/Module/Modem/Modem.cpp", "diff": "@@ -248,7 +248,7 @@ void Modem::parameters\nif (full) headers[p].push_back(std::make_pair(\"Channel type\", channel_type));\n- if (this->type == \"OOK\")\n+ if (this->type == \"OOK\" && channel_type == \"OPTICAL\")\n{\nstd::string str_est = \"known\";\nif (this->rop_est_bits > 0)\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix modem display when OOK but not OPTICAL
8,483
19.12.2018 16:29:01
-3,600
f053a1f336c89645e2d771ee28ca958482137488
Fix exception message in PPBF
[ { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.cpp", "new_path": "src/Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.cpp", "diff": "@@ -40,7 +40,7 @@ Decoder_LDPC_probabilistic_parallel_bit_flipping<B,R>\nstd::stringstream message;\nmessage << \"'bernouilli_probas.size()' must be equal to the biggest variable node degree plus 2\"\n<< \"('bernouilli_probas.size() = '\" << bernouilli_probas.size() << \", 'variable node max degree' = \"\n- << this->H.get_cols_max_degree() << \").\";\n+ << this->H.get_rows_max_degree() << \").\";\nthrow tools::runtime_error(__FILE__, __LINE__, __func__, message.str());\n}\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix exception message in PPBF
8,483
19.12.2018 17:55:09
-3,600
bf30148d4431acd34dd94ddde0644041afd5cbe6
Update conf and refs submodules
[ { "change_type": "MODIFY", "old_path": "conf", "new_path": "conf", "diff": "-Subproject commit a36cb2fffab1651f65f32fd685cacda718b19e11\n+Subproject commit 79848a60c38a46fa8f3c519dcd8a22130949c4b7\n" }, { "change_type": "MODIFY", "old_path": "refs", "new_path": "refs", "diff": "-Subproject commit 69de8b29dced4ada650ad136121054f35aac5dfd\n+Subproject commit 6b02d5b66fa569a9edbcfa4751cba9a283fc6bd7\n" } ]
C++
MIT License
aff3ct/aff3ct
Update conf and refs submodules
8,483
19.12.2018 19:53:46
-3,600
d9551d848cbcd95c20b7566dd5e3cb8fa14d70eb
Give 10 secondes to the LDPC regression tests
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -368,7 +368,7 @@ test-regression-ldpc:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 5 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 10 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-polar:\nstage: test\n" } ]
C++
MIT License
aff3ct/aff3ct
Give 10 secondes to the LDPC regression tests
8,483
20.12.2018 08:46:23
-3,600
5546f4e04810b8fea0b10a871a5bec87e0c7ef08
Add Key reader in the help reader script
[ { "change_type": "MODIFY", "old_path": "scripts/aff3ct_help_reader.py", "new_path": "scripts/aff3ct_help_reader.py", "diff": "-def __parse_argument(command, declaration, info):\n+import argparse\n+import sys\n+\n+def __parse_argument(command, declaration, key, info):\nargStartSpace = \" \"\nlen_argStartSpace = len(argStartSpace)\n@@ -59,6 +62,7 @@ def __parse_argument(command, declaration, info):\n# command[tags][\"default\" ] = default\n# command[tags][\"needs\" ] = needs\n# command[tags][\"excludes\"] = excludes\n+ command[tags][\"key\" ] = key\ncommand[tags][\"info\" ] = info\n@@ -66,8 +70,7 @@ def help_to_map(stdOutput):\nhelpMap = {}\ni = 2 #first line is Usage and second is empty\n- infoStartSpace = \" \"\n-\n+ space = \" \"\nparameter = \"\"\nwhile i < len(stdOutput):\nif len(stdOutput[i]) == 0 : # empty line\n@@ -75,20 +78,29 @@ def help_to_map(stdOutput):\nelse:\nparPos = stdOutput[i].find(\" parameter(s):\")\n+\nif parPos == -1: # then still in the same parameter type\n# add the argument\nargDecl = stdOutput[i]\n- argInfo = stdOutput[i+1][len(infoStartSpace):]\n- i += 2\n+ i += 1\n+ argKey = stdOutput[i][len(space):]\n+ i += 1\n+ if (argKey[0] == '['):\n+ argKey = argKey[1:len(argKey)-2]\n+ argInfo = stdOutput[i][len(space):]\n+ i += 1\n+ else:\n+ argKey = \"\"\n+ argInfo = argKey\nwhile i < len(stdOutput): # check if there is more doc on several lines\n- if stdOutput[i][:len(infoStartSpace)] == infoStartSpace :\n- argInfo += stdOutput[i][len(infoStartSpace):]\n+ if stdOutput[i][:len(space)] == space :\n+ argInfo += stdOutput[i][len(space):]\ni += 1\nelse :\nbreak\n- __parse_argument(helpMap[parameter], str(argDecl), str(argInfo))\n+ __parse_argument(helpMap[parameter], str(argDecl), str(argKey), str(argInfo))\nelse:\nparameter = stdOutput[i][:parPos]\nhelpMap[parameter] = {\"name\" : parameter + \" parameters\"}\n@@ -98,3 +110,31 @@ def help_to_map(stdOutput):\nraise\nreturn helpMap\n+\n+\n+def print_help_map(help_map):\n+ for k in help_map:\n+ print(k + \":\")\n+\n+ for a in help_map[k]:\n+\n+ if type(help_map[k][a]) == 'dict':\n+ print(\"\\t\" + a + \":\")\n+ for i in help_map[k][a]:\n+ print(\"\\t\\t\" + i + \":\", help_map[k][a][i])\n+ else:\n+ print(\"\\t\" + a + \":\", help_map[k][a])\n+\n+ print()\n+\n+\n+if __name__ == \"__main__\":\n+ parser = argparse.ArgumentParser()\n+ parser.add_argument('input', default=sys.stdin, type=argparse.FileType('r'), nargs='?')\n+ args = parser.parse_args()\n+\n+ data = args.input.read()\n+\n+ helpMap = help_to_map(data.split('\\n'))\n+\n+ print_help_map(helpMap)\n\\ No newline at end of file\n" } ]
C++
MIT License
aff3ct/aff3ct
Add Key reader in the help reader script
8,483
20.12.2018 18:07:04
-3,600
c2303ae21e39319c6fa16101cfca755b6fed6761
Fix the read of the keys
[ { "change_type": "MODIFY", "old_path": "conf", "new_path": "conf", "diff": "-Subproject commit a36cb2fffab1651f65f32fd685cacda718b19e11\n+Subproject commit 79848a60c38a46fa8f3c519dcd8a22130949c4b7\n" }, { "change_type": "MODIFY", "old_path": "refs", "new_path": "refs", "diff": "-Subproject commit 815c70776f05a5dd9b44e5183cf6a21ebe252d0e\n+Subproject commit c54cd8956f08eefbf004033627133c8b102e0be6\n" }, { "change_type": "MODIFY", "old_path": "scripts/aff3ct_help_reader.py", "new_path": "scripts/aff3ct_help_reader.py", "diff": "@@ -86,12 +86,12 @@ def help_to_map(stdOutput):\nargKey = stdOutput[i][len(space):]\ni += 1\nif (argKey[0] == '['):\n- argKey = argKey[1:len(argKey)-2]\n+ argKey = argKey[1:len(argKey)-1]\nargInfo = stdOutput[i][len(space):]\ni += 1\nelse:\n- argKey = \"\"\nargInfo = argKey\n+ argKey = \"\"\nwhile i < len(stdOutput): # check if there is more doc on several lines\nif stdOutput[i][:len(space)] == space :\n@@ -118,7 +118,7 @@ def print_help_map(help_map):\nfor a in help_map[k]:\n- if type(help_map[k][a]) == 'dict':\n+ if type(help_map[k][a]) is dict:\nprint(\"\\t\" + a + \":\")\nfor i in help_map[k][a]:\nprint(\"\\t\\t\" + i + \":\", help_map[k][a][i])\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix the read of the keys
8,483
20.12.2018 19:10:57
-3,600
03e3253a388a2a9999130c58ca02cc5ee3aec009
Auto generate the code and simulation types lists in check_keys_dochelp script
[ { "change_type": "MODIFY", "old_path": "scripts/check_keys_dochelp.py", "new_path": "scripts/check_keys_dochelp.py", "diff": "@@ -63,11 +63,18 @@ def aff3ct_helpmap_to_keys_list(help_map, aff3ct_keys): # fill aff3ct_keys from\ndef get_aff3ct_help_keys(aff3ct_path):\n- aff3ct_keys = []\n- codesList = [\"BCH\", \"LDPC\", \"POLAR\", \"RA\", \"REP\", \"RS\", \"RSC\", \"RSC_DB\", \"TURBO\", \"TURBO_DB\", \"TPC\", \"UNCODED\"]\n- simList = [\"BFER\", \"BFERI\", \"EXIT\"]\n+ # get the available codes and simulation types\n+ args_list = [aff3ct_path, \"-h\"]\n+ std, err = run_aff3ct(args_list)\n+ helpMap = ahr.help_to_map(std)\n+\n+ codesList = helpMap[\"Simulation\"][\"--sim-cde-type, -C\"][\"limits\"] [1:-1].split(\"|\")\n+ simList = helpMap[\"Simulation\"][\"--sim-type\" ][\"limits\"] [1:-1].split(\"|\")\n+\n+ # try to run all codes ans simu to get their helps\n+ aff3ct_keys = []\nfor c in codesList:\nfor s in simList:\nargs_list = [aff3ct_path, \"-C\", c, \"-H\", \"-k\", \"--sim-type\", s]\n" } ]
C++
MIT License
aff3ct/aff3ct
Auto generate the code and simulation types lists in check_keys_dochelp script
8,483
20.12.2018 19:13:25
-3,600
2512d4e3668165599cf2004c8db6bb23bb1e9851
Add default arguments in check_keys_dochelp.py
[ { "change_type": "MODIFY", "old_path": "scripts/check_keys_dochelp.py", "new_path": "scripts/check_keys_dochelp.py", "diff": "@@ -110,8 +110,8 @@ def check_keys(keys_file, aff3ct_path):\nif __name__ == \"__main__\":\nparser = argparse.ArgumentParser()\n- parser.add_argument('--keys', action='store', dest='keys_file', type=str)\n- parser.add_argument('--aff3ct', action='store', dest='aff3ct_path', type=str)\n+ parser.add_argument('--keys', action='store', dest='keys_file', type=str, default='doc/sphinx/strings.rst')\n+ parser.add_argument('--aff3ct', action='store', dest='aff3ct_path', type=str, default='build/bin/aff3ct')\nargs = parser.parse_args()\n" } ]
C++
MIT License
aff3ct/aff3ct
Add default arguments in check_keys_dochelp.py
8,483
21.12.2018 11:40:45
-3,600
4b64d8a83e82d89dd3fe84f3ccad908f29298234
Fix the Reporter noise.
[ { "change_type": "MODIFY", "old_path": "src/Tools/Display/Reporter/Noise/Reporter_noise.cpp", "new_path": "src/Tools/Display/Reporter/Noise/Reporter_noise.cpp", "diff": "@@ -16,15 +16,15 @@ using namespace aff3ct::tools;\ntemplate <typename R>\nstruct Reporter_noise<R>::Noise_ptr\n{\n- explicit Noise_ptr(const Noise<R>* const* n) : noise(nullptr), noise_ptr(n), sh_ptr(nullptr) {}\n- explicit Noise_ptr(const Noise<R>* n) : noise(n), noise_ptr(&noise), sh_ptr(nullptr) {}\n- explicit Noise_ptr(const Noise<R>& n) : noise(&n), noise_ptr(&noise), sh_ptr(nullptr) {}\n+ explicit Noise_ptr(const Noise<R>* const* n) : noise(nullptr), noise_ptr(n), sh_ptr(nullptr), un_ptr(nullptr) {}\n+ explicit Noise_ptr(const Noise<R>* n) : noise(n), noise_ptr(&noise), sh_ptr(nullptr), un_ptr(nullptr) {}\n+ explicit Noise_ptr(const Noise<R>& n) : noise(&n), noise_ptr(&noise), sh_ptr(nullptr), un_ptr(nullptr) {}\n- explicit Noise_ptr(const std::shared_ptr<Noise<R>>* noise) : noise(nullptr), noise_ptr(nullptr), sh_ptr( noise) {}\n- explicit Noise_ptr(const std::shared_ptr<Noise<R>>& noise) : noise(nullptr), noise_ptr(nullptr), sh_ptr(&noise) {}\n+ explicit Noise_ptr(const std::shared_ptr<Noise<R>>* n) : noise(nullptr), noise_ptr(nullptr), sh_ptr( n), un_ptr(nullptr) {}\n+ explicit Noise_ptr(const std::shared_ptr<Noise<R>>& n) : noise(nullptr), noise_ptr(nullptr), sh_ptr(&n), un_ptr(nullptr) {}\n- explicit Noise_ptr(const std::unique_ptr<Noise<R>>* noise) : noise(nullptr), noise_ptr(nullptr), un_ptr( noise) {}\n- explicit Noise_ptr(const std::unique_ptr<Noise<R>>& noise) : noise(nullptr), noise_ptr(nullptr), un_ptr(&noise) {}\n+ explicit Noise_ptr(const std::unique_ptr<Noise<R>>* n) : noise(nullptr), noise_ptr(nullptr), sh_ptr(nullptr), un_ptr( n) {}\n+ explicit Noise_ptr(const std::unique_ptr<Noise<R>>& n) : noise(nullptr), noise_ptr(nullptr), sh_ptr(nullptr), un_ptr(&n) {}\nconst Noise<R>* get_noise_ptr() const\n{\n@@ -157,7 +157,7 @@ Reporter::report_t Reporter_noise<R>\n{\ncase Noise_type::SIGMA :\n{\n- auto sig = dynamic_cast<const tools::Sigma<>*>(get_noise_ptr());\n+ auto sig = dynamic_cast<const tools::Sigma<R>*>(get_noise_ptr());\nstream << std::setprecision(2) << std::fixed << sig->get_esn0();\nnoise_report.push_back(stream.str());\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix the Reporter noise.
8,483
21.12.2018 11:41:34
-3,600
bba449f51f9bbe1facf5cf79c4ee5750c7b02c46
Change conf/ refs/ submodules position
[ { "change_type": "MODIFY", "old_path": "conf", "new_path": "conf", "diff": "-Subproject commit a36cb2fffab1651f65f32fd685cacda718b19e11\n+Subproject commit 79848a60c38a46fa8f3c519dcd8a22130949c4b7\n" }, { "change_type": "MODIFY", "old_path": "refs", "new_path": "refs", "diff": "-Subproject commit 815c70776f05a5dd9b44e5183cf6a21ebe252d0e\n+Subproject commit c54cd8956f08eefbf004033627133c8b102e0be6\n" } ]
C++
MIT License
aff3ct/aff3ct
Change conf/ refs/ submodules position
8,490
21.12.2018 12:00:07
-3,600
73fd12df3758d4ad8a42a343902681c2d5b73a90
Doc: add AList and QC format description.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/ldpc/decoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/ldpc/decoder.rst", "diff": "This argument is not required if the encoder type :ref:`enc-ldpc-enc-type`\nis ``LDPC_DVBS2``.\n+For the AList format, an |ASCII| file composed by positive integers is expected:\n+\n+.. code-block:: bash\n+\n+ # -- Part 1 --\n+ # 'nVN' is the total number of variable nodes and 'nCN' is the total number of check nodes\n+ nVN nCN\n+ # 'dmax_VN' is the higher variable node degree and 'dmax_CN' is the higher check node degree\n+ dmax_VN dmax_CN\n+ # list of the degrees for each variable nodes\n+ d_VN_{1} d_VN_{2} [...] d_VN_{nVN}\n+ # list of the degrees for each check nodes\n+ d_CN_{1} d_CN_{2} [...] d_CN_{nCN}\n+ #\n+ # -- Part 2 --\n+ # each following line describes the check nodes connected to a variable node, the first\n+ # check node index is '1' (and not '0')\n+ # variable node '1'\n+ VN_{1}_CN_{idx_1} [...] VN_{1}_CN_{idx_d_VN_{1}}\n+ # variable node '2'\n+ VN_{2}_CN_{idx_1} [...] VN_{2}_CN_{idx_d_VN_{2}}\n+ [...]\n+ # variable node 'nVN'\n+ VN_{nVN}_CN_{idx_1} [...] VN_{nVN}_CN_{idx_d_VN_{nVN}}\n+ #\n+ # -- Part 3 --\n+ # each following line describes the variables nodes connected to a check node, the first\n+ # variable node index is '1' (and not '0')\n+ # check node '1'\n+ CN_{1}_VN_{idx_1} [...] CN_{1}_VN_{idx_d_CN_{1}}\n+ # check node '2'\n+ CN_{2}_VN_{idx_1} [...] CN_{2}_VN_{idx_d_CN_{2}}\n+ [...]\n+ # check node 'nCN'\n+ CN_{nCN}_VN_{idx_1} [...] CN_{nCN}_VN_{idx_d_CN_{nCN}}\n+\n+In the part 2 and 3, it is possible to pad, at the end of the indexes list, with\n+zeros when the current node degree is smaller than the maximum node degree.\n+|AFF3CT| will be able to read the file even if it is padded with zeros.\n+\n+For the |QC| format, an |ASCII| file composed by integers is expected:\n+\n+.. code-block:: bash\n+\n+ # 'C' is the number of columns (there is 'C * Z' variable nodes)\n+ # 'R' is the number of rows (there is 'R * Z' check nodes)\n+ # 'Z' is the expansion factor\n+ C R Z\n+\n+ # each 'B_r_{y}_c_{x}' is a sub-matrix bloc of size 'Z * Z'\n+ # 'B_r_{y}_c_{x} = -1' means a zero matrix\n+ # 'B_r_{y}_c_{x} = 0' means an identity matrix\n+ # 'B_r_{y}_c_{x} = s' with 's' between '1' and 'Z-1' means an identity matrix shifted 's' times\n+ # to the right\n+ B_r_{1}_c_{1} B_r_{1}_c_{2} [...] B_r_{1}_c_{C}\n+ B_r_{2}_c_{1} B_r_{2}_c_{2} [...] B_r_{2}_c_{C}\n+ [...]\n+ B_r_{R}_c_{1} B_r_{R}_c_{2} [...] B_r_{R}_c_{C}\n+\n+ # puncturing pattern (optional)\n+ # 'T_c_{x}' can be '0' or '1'\n+ # - if 'T_c_{x} = 0', does not transmit the 'Z' consecutive bits\n+ # - if 'T_c_{x} = 1', transmits the 'Z' consecutive bits\n+ T_c_{1} T_c_{2} [...] T_c_{C}\n+\n.. TODO: info bits pos at the end of .alist file puncturer pattern at the end\nof QC file\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: add AList and QC format description.
8,483
21.12.2018 13:21:49
-3,600
b7c9b6c8ae954d241cee0067fe66d9b4a0bc8963
Recompute the syndrome in PPBF after all loops because VN are modified after the last check. Doc add PPBF in implem Tables
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/ldpc/decoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/ldpc/decoder.rst", "diff": "@@ -114,19 +114,19 @@ corresponding available implementations.\n.. table:: |LDPC| decoder types and available implementations.\n:align: center\n- +---------+-----+------+------+------+-----+-----+------+-----+----+-----+-----+\n- | Decoder ||STD|||GALA|||GALB|||GALE|||WBF|||SPA|||LSPA|||AMS|||MS|||NMS|||OMS||\n- +=========+=====+======+======+======+=====+=====+======+=====+====+=====+=====+\n- | |BF| | | | | ||K| | | | | | | |\n- +---------+-----+------+------+------+-----+-----+------+-----+----+-----+-----+\n- | |BP-P| ||K| | | | | | | | | | | |\n- +---------+-----+------+------+------+-----+-----+------+-----+----+-----+-----+\n- | |BP-F| | ||K| ||K| ||K| | ||K3| ||K2| ||K2| ||K2|||K2| ||K2| |\n- +---------+-----+------+------+------+-----+-----+------+-----+----+-----+-----+\n- | |BP-HL| | | | | | ||K2| ||K2| ||K2| ||K1|||K1| ||K1| |\n- +---------+-----+------+------+------+-----+-----+------+-----+----+-----+-----+\n- | |BP-VL| | | | | | ||K2| ||K2| ||K2| ||K2|||K2| ||K2| |\n- +---------+-----+------+------+------+-----+-----+------+-----+----+-----+-----+\n+ +---------+-----+------+------+------+------+-----+-----+------+-----+----+-----+-----+\n+ | Decoder ||STD|||GALA|||GALB|||GALE|||PPBF|||WBF|||SPA|||LSPA|||AMS|||MS|||NMS|||OMS||\n+ +=========+=====+======+======+======+======+=====+=====+======+=====+====+=====+=====+\n+ | |BF| | | | | ||K| ||K| | | | | | | |\n+ +---------+-----+------+------+------+------+-----+-----+------+-----+----+-----+-----+\n+ | |BP-P| ||K| | | | | | | | | | | | |\n+ +---------+-----+------+------+------+------+-----+-----+------+-----+----+-----+-----+\n+ | |BP-F| | ||K| ||K| ||K| | | ||K3| ||K2| ||K2| ||K2|||K2| ||K2| |\n+ +---------+-----+------+------+------+------+-----+-----+------+-----+----+-----+-----+\n+ | |BP-HL| | | | | | | ||K2| ||K2| ||K2| ||K1|||K1| ||K1| |\n+ +---------+-----+------+------+------+------+-----+-----+------+-----+----+-----+-----+\n+ | |BP-VL| | | | | | | ||K2| ||K2| ||K2| ||K2|||K2| ||K2| |\n+ +---------+-----+------+------+------+------+-----+-----+------+-----+----+-----+-----+\n.. |K| replace:: :math:`\\checkmark`\n.. |K1| replace:: :math:`\\checkmark^{*}`\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BF/Decoder_LDPC_bit_flipping_hard.cpp", "new_path": "src/Module/Decoder/LDPC/BF/Decoder_LDPC_bit_flipping_hard.cpp", "diff": "@@ -182,7 +182,7 @@ bool Decoder_LDPC_bit_flipping_hard<B,R>\nthis->vn_process(Y_N, VN, CN, frame_id);\n}\n- if (!this->enable_syndrome)\n+ if (!this->enable_syndrome || !synd)\nsynd = check_syndrome();\nreturn synd;\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.cpp", "new_path": "src/Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.cpp", "diff": "@@ -53,7 +53,7 @@ template <typename B, typename R>\nvoid Decoder_LDPC_probabilistic_parallel_bit_flipping<B,R>\n::cn_process(const B *VN, B *CN, const int frame_id)\n{\n- // for each check nodes&&&\n+ // for each check nodes\nconst auto n_chk_nodes = (int)this->H.get_n_cols();\nfor (auto c = 0; c < n_chk_nodes; c++)\n{\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.hpp", "new_path": "src/Module/Decoder/LDPC/BF/PPBF/Decoder_LDPC_probabilistic_parallel_bit_flipping.hpp", "diff": "@@ -13,10 +13,6 @@ namespace module\ntemplate <typename B = int, typename R = float>\nclass Decoder_LDPC_probabilistic_parallel_bit_flipping : public Decoder_LDPC_bit_flipping_hard<B,R>\n{\n-//private:\n-// const float normalize_factor;\n-// const R offset;\n-\npublic:\nDecoder_LDPC_probabilistic_parallel_bit_flipping(const int &K, const int &N, const int& n_ite,\nconst tools::Sparse_matrix &H,\n" } ]
C++
MIT License
aff3ct/aff3ct
Recompute the syndrome in PPBF after all loops because VN are modified after the last check. Doc add PPBF in implem Tables
8,490
21.12.2018 15:06:03
-3,600
139c16afd4300d30912b461448c6cc6045caf118
Fix wrong argument key.
[ { "change_type": "MODIFY", "old_path": "src/Factory/Tools/Code/Turbo/Flip_and_check.cpp", "new_path": "src/Factory/Tools/Code/Turbo/Flip_and_check.cpp", "diff": "@@ -55,7 +55,7 @@ void Flip_and_check::parameters\ntools::add_arg(args, p, class_name+\"p+ite-s\",\ntools::Integer(tools::Positive(), tools::Non_zero()));\n- tools::add_arg(args, p, class_name+\"p+ite\",\n+ tools::add_arg(args, p, class_name+\"p+ite,i\",\ntools::Integer(tools::Positive(), tools::Non_zero()));\ntools::add_arg(args, p, class_name+\"p+crc-start\",\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix wrong argument key.
8,490
21.12.2018 18:02:43
-3,600
f8e8998ba03753c2a3475164afa6cd82bed688ae
Improve the doc script + add/rm arguments.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/channel/channel.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/channel/channel.rst", "diff": "@@ -244,6 +244,21 @@ experiments is an *Intel(R) Xeon(R) CPU E3-1270 v5 @ 3.60GHz* 8 threads |CPU|.\nsimulator integrated statistics tool (see the :ref:`sim-sim-stats`\nparameter).\n+.. _chn-chn-blk-fad:\n+\n+``--chn-blk-fad``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: text\n+ :Allowed values: ``NO`` ``FRAME`` ``ONETAP``\n+ :Default: 1\n+ :Examples: ``--chn-gain-occur 10``\n+\n+|factory::Channel::parameters::p+blk-fad|\n+\n+.. note:: At this time the ``FRAME`` and ``ONETAP`` block fading are not\n+ implemented.\n+\n.. _chn-chn-gain-occur:\n``--chn-gain-occur``\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/source/source.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/source/source.rst", "diff": "@@ -6,6 +6,19 @@ Source parameters\nThe source generates :math:`K` information bits: it is the simulation starting\npoint.\n+.. _src-src-info-bits:\n+\n+``--src-info-bits, -K`` |image_required_argument|\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: integer\n+ :Examples: ``--src-info-bits 64`` ``-K 128``\n+\n+|factory::Source::parameters::p+info-bits,K|\n+\n+.. warning:: This argument is required only with the ``UNCODED`` simulation code\n+ type (cf. the :ref:`sim-sim-cde-type` parameter).\n+\n.. _src-src-type:\n``--src-type``\n" }, { "change_type": "MODIFY", "old_path": "scripts/check_keys_dochelp.py", "new_path": "scripts/check_keys_dochelp.py", "diff": "@@ -3,6 +3,8 @@ import sys\nimport re\nimport subprocess\nimport os\n+import glob\n+import copy\nimport aff3ct_help_reader as ahr\n@@ -72,12 +74,11 @@ def get_aff3ct_help_keys(aff3ct_path):\ncodesList = helpMap[\"Simulation\"][\"--sim-cde-type, -C\"][\"limits\"] [1:-1].split(\"|\")\nsimList = helpMap[\"Simulation\"][\"--sim-type\" ][\"limits\"] [1:-1].split(\"|\")\n-\n# try to run all codes ans simu to get their helps\naff3ct_keys = []\nfor c in codesList:\nfor s in simList:\n- args_list = [aff3ct_path, \"-C\", c, \"-H\", \"-k\", \"--sim-type\", s]\n+ args_list = [aff3ct_path, \"-C\", c, \"-H\", \"-k\", \"--sim-type\", s, \"-p\", \"8\"]\nstd, err = run_aff3ct(args_list)\nhelpMap = ahr.help_to_map(std)\n@@ -87,13 +88,34 @@ def get_aff3ct_help_keys(aff3ct_path):\nreturn aff3ct_keys\n-def check_keys(keys_file, aff3ct_path):\n+def get_doc_keys(doc_path):\n+\n+ doc_keys = []\n+ for filename in glob.iglob(doc_path + '**/*.rst', recursive=True):\n+ pattern = re.compile(\"\\|(factory::[^ ]*)\\|\")\n+ for i, line in enumerate(open(filename)):\n+ for match in re.finditer(pattern, line):\n+ doc_keys.append(match.group(1))\n+\n+ # remove duplicates\n+ doc_keys = list(set(doc_keys))\n+\n+ return doc_keys\n+\n+\n+def check_keys(keys_file, aff3ct_path, doc_path):\nlist_keys = get_keys(keys_file)\naff3ct_keys = get_aff3ct_help_keys(aff3ct_path)\n+ doc_keys = get_doc_keys(doc_path)\n- not_in_aff3ct_keys = []\n+ list_keys.sort()\n+ aff3ct_keys.sort()\n+ doc_keys.sort()\n+\n+ aff3ct_keys_save = copy.deepcopy(aff3ct_keys)\n+ not_in_aff3ct_keys = []\nfor k in list_keys:\ntry:\nidx = aff3ct_keys.index(k)\n@@ -101,18 +123,34 @@ def check_keys(keys_file, aff3ct_path):\nexcept Exception as e:\nnot_in_aff3ct_keys.append(k)\n- print(\"keys left in aff3ct help:\")\n+ not_in_doc_keys = []\n+ for k in aff3ct_keys_save:\n+ try:\n+ idx = doc_keys.index(k)\n+ del doc_keys[idx]\n+ except Exception as e:\n+ not_in_doc_keys.append(k)\n+\n+ print(\"Keys only used in the AFF3CT help (undocumented keys):\")\nprint(aff3ct_keys)\nprint()\n- print(\"keys not in aff3ct help:\")\n+ print(\"Keys not used in the AFF3CT help:\")\nprint(not_in_aff3ct_keys)\nprint()\n+ print(\"Keys used in the AFF3CT doc but not used in the AFF3CT help:\")\n+ print(doc_keys)\n+ print()\n+ print(\"Keys used in the AFF3CT help but not used in the AFF3CT doc:\")\n+ print(not_in_doc_keys)\n+ print()\n+\nif __name__ == \"__main__\":\nparser = argparse.ArgumentParser()\nparser.add_argument('--keys', action='store', dest='keys_file', type=str, default='doc/sphinx/strings.rst')\nparser.add_argument('--aff3ct', action='store', dest='aff3ct_path', type=str, default='build/bin/aff3ct')\n+ parser.add_argument('--doc', action='store', dest='doc_path', type=str, default='doc/sphinx/source/user/simulation/parameters/')\nargs = parser.parse_args()\n- check_keys(args.keys_file, args.aff3ct_path)\n\\ No newline at end of file\n+ check_keys(args.keys_file, args.aff3ct_path, args.doc_path)\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Turbo/Decoder_turbo.hxx", "new_path": "src/Factory/Module/Decoder/Turbo/Decoder_turbo.hxx", "diff": "@@ -120,6 +120,7 @@ void Decoder_turbo::parameters<D1,D2>\nargs.erase({pfnc+\"-fra\", \"F\"});\nargs.erase({pfnc+\"-ite\", \"i\"});\nargs.erase({pfnc+\"-crc-ite\" });\n+ args.erase({pfnc+\"-crc-start\"});\nsub1->get_description(args);\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Turbo_DB/Decoder_turbo_DB.cpp", "new_path": "src/Factory/Module/Decoder/Turbo_DB/Decoder_turbo_DB.cpp", "diff": "@@ -105,6 +105,7 @@ void Decoder_turbo_DB::parameters\nargs.erase({pfnc+\"-fra\", \"F\"});\nargs.erase({pfnc+\"-ite\", \"i\"});\nargs.erase({pfnc+\"-crc-ite\" });\n+ args.erase({pfnc+\"-crc-start\"});\nsub->get_description(args);\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Module/Encoder/Turbo_product/Encoder_turbo_product.cpp", "new_path": "src/Factory/Module/Encoder/Turbo_product/Encoder_turbo_product.cpp", "diff": "@@ -84,6 +84,7 @@ void Encoder_turbo_product::parameters\nauto ps = sub->get_prefix();\nargs.erase({ps+\"-fra\", \"F\"});\n+ args.erase({ps+\"-seed\", \"S\"});\n}\nvoid Encoder_turbo_product::parameters\n" } ]
C++
MIT License
aff3ct/aff3ct
Improve the doc script + add/rm arguments.
8,490
22.12.2018 14:14:53
-3,600
80455f94a47a23766cf9645d7397169765744fbf
CI: try to limit the sizes when building the builds.
[ { "change_type": "MODIFY", "old_path": "ci/deploy-builds-linux.sh", "new_path": "ci/deploy-builds-linux.sh", "diff": "@@ -93,7 +93,8 @@ do\nzip -r $ZIP_NAME $BUILD\n- cp $ZIP_NAME ${REPO_WEB}/${REPO_RESSOURCES}/aff3ct_builds/\n+ mv $ZIP_NAME ${REPO_WEB}/${REPO_RESSOURCES}/aff3ct_builds/\n+ rm -rf $BUILD\nif [ -z \"$BUILDS_LIST\" ]\nthen\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: try to limit the sizes when building the builds.
8,490
22.12.2018 15:05:38
-3,600
91bce32992b01ce69f880b8bbf5e37ac79f9980f
Improve the documentation-check.py script to manage exceptions.
[ { "change_type": "RENAME", "old_path": "scripts/aff3ct_help_reader.py", "new_path": "ci/aff3ct_help_parser.py", "diff": "@@ -15,7 +15,6 @@ def __parse_argument(command, declaration, key, info):\nelif group.startswith(\"{A}\"):\ngroup = \"advanced\"\n-\n# parse the name\nposspace = declaration.find(\" \", len_argStartSpace)\nposend = posspace\n@@ -45,15 +44,12 @@ def __parse_argument(command, declaration, key, info):\nif pos != -1: # including set\nlimits = limits[pos:]\n-\n-\nif argtype.startswith(\"file\") or argtype.startswith(\"folder\") or argtype.startswith(\"path\"):\npos = argtype.find(\" \")\nif pos != -1:\nlimits = argtype[pos+1:]\nargtype = argtype[:pos]\n-\ncommand[tags] = {}\ncommand[tags][\"group\" ] = group\n@@ -65,7 +61,6 @@ def __parse_argument(command, declaration, key, info):\ncommand[tags][\"key\" ] = key\ncommand[tags][\"info\" ] = info\n-\ndef help_to_map(stdOutput):\nhelpMap = {}\ni = 2 #first line is Usage and second is empty\n@@ -75,7 +70,6 @@ def help_to_map(stdOutput):\nwhile i < len(stdOutput):\nif len(stdOutput[i]) == 0 : # empty line\ni += 1\n-\nelse:\nparPos = stdOutput[i].find(\" parameter(s):\")\n@@ -111,7 +105,6 @@ def help_to_map(stdOutput):\nreturn helpMap\n-\ndef print_help_map(help_map):\nfor k in help_map:\nprint(k + \":\")\n@@ -127,7 +120,6 @@ def print_help_map(help_map):\nprint()\n-\nif __name__ == \"__main__\":\nparser = argparse.ArgumentParser()\nparser.add_argument('input', default=sys.stdin, type=argparse.FileType('r'), nargs='?')\n" } ]
C++
MIT License
aff3ct/aff3ct
Improve the documentation-check.py script to manage exceptions.
8,490
22.12.2018 15:06:09
-3,600
148d762953488812fccd2b7e197e5dc59244ca43
CI: plug the 'documentation-check.py' script.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -38,22 +38,6 @@ analysis-headers:\n- ./scripts/generate_aff3ct_header.sh aff3ct.hpp\n- diff aff3ct.hpp src/aff3ct.hpp\n-documentation-sphinx:\n- stage: documentation\n- artifacts:\n- name: documentation-sphinx\n- when: always\n- paths:\n- - doc/sphinx/build/html\n- - doc/sphinx/build/latex\n- tags:\n- - sphinx\n- - latex\n- script:\n- - cd doc/sphinx\n- - make html\n- - make latexpdf\n-\nbuild-linux-gcc-nointr:\nstage: build\ntags:\n@@ -327,6 +311,35 @@ build-macos-clang-x64-sse4.2:\n- source ./ci/tools/threads.sh\n- ./ci/build-linux-macos.sh\n+documentation-sphinx:\n+ stage: documentation\n+ artifacts:\n+ name: documentation-sphinx\n+ when: always\n+ paths:\n+ - doc/sphinx/build/html\n+ - doc/sphinx/build/latex\n+ tags:\n+ - sphinx\n+ - latex\n+ script:\n+ - cd doc/sphinx\n+ - make html\n+ - make latexpdf\n+\n+documentation-check:\n+ stage: documentation\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - python\n+ script:\n+ - ./ci/documentation-check.py --aff3ct \"build-linux-gcc-x64-sse4.2/bin/aff3ct\"\n+\ntest-regression-bch:\nstage: test\nretry: 1\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: plug the 'documentation-check.py' script.
8,490
22.12.2018 16:27:41
-3,600
b0c8c41bc88b370258cf47dde2dd2cf6fa53fb81
CI: fix wrong path.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -338,7 +338,7 @@ documentation-check:\n- sse4.2\n- python\nscript:\n- - ./ci/documentation-check.py --aff3ct \"build-linux-gcc-x64-sse4.2/bin/aff3ct\"\n+ - ./ci/documentation-check.py --aff3ct \"build_linux_gcc_x64_sse4.2/bin/aff3ct\"\ntest-regression-bch:\nstage: test\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: fix wrong path.
8,490
22.12.2018 17:37:07
-3,600
09cedbdbfb3a6ab021816f6de17dec6df8bfc6e5
Doc: fix the '--dec-seed' missing parameter description.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/common/decoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/common/decoder.rst", "diff": "@@ -78,6 +78,16 @@ Description of the allowed values:\nperformances. The |BFER| performances will be the same as an hard input\ndecoder.\n+.. _dec-common-dec-seed:\n+\n+``--dec-seed``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: integer\n+ :Examples: ``--dec-seed 1``\n+\n+|factory::Decoder::parameters::p+seed|\n+\nReferences\n\"\"\"\"\"\"\"\"\"\"\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": "Set the maximum number of bit flips in the Chase decoder.\n.. |factory::Decoder::parameters::p+seed| replace::\n- Specify the seed used to generate random numbers when needed.\n+ Specify the decoder |PRNG| seed (if the decoder uses one).\n.. --------------------------------------------- factory Decoder_BCH parameters\non their degree.\n.. |factory::Decoder_LDPC::parameters::p+ppbf-proba| replace::\n- Give the probabilities of the Bernouilli distribution of the PPBF.\n+ Give the probabilities of the Bernouilli distribution of the |PPBF|.\nThe number of given values must be equal to the biggest variable node degree\nplus two.\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: fix the '--dec-seed' missing parameter description.
8,490
24.12.2018 10:48:24
-3,600
7a85f94ec6b815ddcaf91072c6226d9e4a3b2f2d
CI: reduce the number of dev. releases to keep to 5 + add error codes return.
[ { "change_type": "MODIFY", "old_path": "ci/deploy-builds-linux.sh", "new_path": "ci/deploy-builds-linux.sh", "diff": "@@ -46,8 +46,10 @@ fi\nREPO_WEB=aff3ct.github.io\nREPO_RESSOURCES=ressources\ngit clone git@github.com:aff3ct/${REPO_WEB}.git\n+rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\ncd ${REPO_WEB}\ngit clone git@github.com:aff3ct/${REPO_RESSOURCES}.git\n+rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\ngit submodule update --init --recursive\nmkdir ressources/aff3ct_builds\ncd ..\n@@ -92,6 +94,7 @@ do\ncp doc/sphinx/build/latex/AFF3CT.pdf $BUILD/share/aff3ct-$GIT_VERSION/doc/pdf\nzip -r $ZIP_NAME $BUILD\n+ rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\nmv $ZIP_NAME ${REPO_WEB}/${REPO_RESSOURCES}/aff3ct_builds/\nrm -rf $BUILD\n@@ -110,7 +113,7 @@ cd ${REPO_WEB}/${REPO_RESSOURCES}\n# git lfs install --local\n# git lfs track aff3ct_builds/*\ngit add -f aff3ct_builds/*\n-git commit -m \"Automatic: add new AFF3CT builds ($GIT_HASH).\"\n+git commit -m \"Automatic: add new AFF3CT builds ($GIT_BRANCH: $GIT_HASH).\"\n#delete old builds\nBUILD_CSV=../download/download_${GIT_BRANCH}.csv\n@@ -118,7 +121,7 @@ N_BUILDS_TO_KEEP=0\nif [ \"${GIT_BRANCH}\" == \"master\" ]; then\nN_BUILDS_TO_KEEP=5\nelse\n- N_BUILDS_TO_KEEP=10\n+ N_BUILDS_TO_KEEP=5\nfi\nN_BUILDS=$(wc -l $BUILD_CSV | cut -d \" \" -f1)\nN_BUILDS=$(($N_BUILDS-1))\n@@ -154,8 +157,10 @@ fi\ngit gc --prune=now\n# git gc --aggressive --prune=now\ngit push origin master --force\n+rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\ncd ..\ngit add -f download/download_${GIT_BRANCH}.csv\n-git commit -m \"Automatic: add new AFF3CT builds ($GIT_HASH).\"\n+git commit -m \"Automatic: add new AFF3CT builds ($GIT_BRANCH: $GIT_HASH).\"\ngit push origin master\n+rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n\\ No newline at end of file\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: reduce the number of dev. releases to keep to 5 + add error codes return.
8,490
07.01.2019 14:57:27
-3,600
8485880a4ce42ca35c383e0654b46e425a6a841e
Fix wrong cmd line example.
[ { "change_type": "MODIFY", "old_path": "README.rst", "new_path": "README.rst", "diff": "@@ -13,7 +13,7 @@ performances of the (2048,1723) Polar code from 1.0 to 4.0 dB:\n.. code-block:: bash\n- aff3ct -C \"POLAR\" -K 1723 -N 2048 -m 1.0 -M 4.0\n+ aff3ct -C \"POLAR\" -K 1723 -N 2048 -m 1.0 -M 4.0 -s 1.0\nAnd the output will be:\n@@ -91,4 +91,3 @@ External Links\n- Official website: https://aff3ct.github.io\n- Documentation: https://aff3ct.readthedocs.io\n-\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix wrong cmd line example.
8,490
07.01.2019 14:59:06
-3,600
30c38acc3df7f5a7edacf604640235d3151af349
Fix the version detection from Git.
[ { "change_type": "MODIFY", "old_path": "CMakeLists.txt", "new_path": "CMakeLists.txt", "diff": "@@ -86,12 +86,10 @@ string(REGEX REPLACE \"-.*\" \"\" GIT_VERSION_MMP ${GIT_VERSION_\nstring(REGEX REPLACE \"^.*-\" \"\" GIT_HASH ${GIT_VERSION_RMV})\nstring( REPLACE \"-\" \"\" GIT_BUILD ${GIT_VERSION_RMV})\nstring( REPLACE \"${GIT_VERSION_MMP}\" \"\" GIT_BUILD ${GIT_BUILD})\n-string(REGEX REPLACE \"[.].*\" \"\" GIT_VERSION_MAJOR ${GIT_VERSION_MMP})\n-string( REPLACE \"${GIT_VERSION_MAJOR}.\" \"\" GIT_VERSION_MINOR ${GIT_VERSION_MMP})\n-string(REGEX REPLACE \"[.].*\" \"\" GIT_VERSION_MINOR ${GIT_VERSION_MINOR})\n-string( REPLACE \"${GIT_VERSION_MAJOR}.\" \"\" GIT_VERSION_PATCH ${GIT_VERSION_MMP})\n-string( REPLACE \"${GIT_VERSION_MINOR}.\" \"\" GIT_VERSION_PATCH ${GIT_VERSION_PATCH})\n-string(REGEX REPLACE \"[.].*\" \"\" GIT_VERSION_PATCH ${GIT_VERSION_PATCH})\n+string(REGEX REPLACE \"(.*)\\\\..*\\\\..*\" \"\\\\1\" GIT_VERSION_MAJOR ${GIT_VERSION_MMP})\n+string(REGEX REPLACE \".*\\\\.(.*)\\\\..*\" \"\\\\1\" GIT_VERSION_MINOR ${GIT_VERSION_MMP})\n+string(REGEX REPLACE \".*\\\\..*\\\\.(.*)\" \"\\\\1\" GIT_VERSION_PATCH ${GIT_VERSION_MMP})\n+\nif (NOT \"${GIT_BUILD}\" STREQUAL \"\")\nstring( REPLACE \"${GIT_HASH}\" \"\" GIT_BUILD ${GIT_BUILD})\nelse()\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix the version detection from Git.
8,490
08.01.2019 09:36:16
-3,600
b1d9a76aa89b9ff8156ab3872b66b24ba477f0b9
CI: add auto push to the AFF3CT GitHub mirror.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -589,6 +589,18 @@ deploy-builds-linux:\n- source ./ci/tools/git-version.sh\n- ./ci/deploy-builds-linux.sh build_linux_gcc_x64_sse4.2 build_linux_gcc_x64_avx2 build_windows_gcc_x86_sse4.2 build_windows_gcc_x64_avx2 build_macos_clang_x64_sse4.2\n+deploy-github-push:\n+ stage: deploy\n+ tags:\n+ - linux\n+ - github\n+ only:\n+ - master\n+ - development\n+ script:\n+ - source ./ci/tools/git-branch.sh\n+ - ./ci/deploy-github-push.sh\n+\npages:\nstage: deploy\ntags:\n" }, { "change_type": "ADD", "old_path": null, "new_path": "ci/deploy-github-push.sh", "diff": "+#!/bin/bash\n+set -x\n+\n+if [ -z \"$GIT_BRANCH\" ]\n+then\n+ echo \"Please define the 'GIT_BRANCH' environment variable.\"\n+ exit 1\n+fi\n+\n+GITHUB=git@github.com:aff3ct\n+\n+REPO_REFS=error_rate_references\n+cd refs\n+git remote add github ${GITHUB}/${REPO_REFS}.git\n+git checkout ${GIT_BRANCH}\n+git pull origin ${GIT_BRANCH}\n+git push github ${GIT_BRANCH}\n+rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n+cd ../\n+\n+REPO_CONF=configuration_files\n+cd conf\n+git remote add github ${GITHUB}/${REPO_CONF}.git\n+git checkout ${GIT_BRANCH}\n+git pull origin ${GIT_BRANCH}\n+git push github ${GIT_BRANCH}\n+rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n+cd ../\n+\n+REPO_AFF3CT=aff3ct\n+git remote add github ${GITHUB}/${REPO_AFF3CT}.git\n+git checkout ${GIT_BRANCH}\n+git pull origin ${GIT_BRANCH}\n+git push github ${GIT_BRANCH}\n+rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n\\ No newline at end of file\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: add auto push to the AFF3CT GitHub mirror.
8,490
08.01.2019 10:02:39
-3,600
2106b4fcdb11652cce4658e1c2776c93eb273e63
CI: check the consistency of the Git submodules.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -38,6 +38,17 @@ analysis-headers:\n- ./scripts/generate_aff3ct_header.sh aff3ct.hpp\n- diff aff3ct.hpp src/aff3ct.hpp\n+analysis-git-submodules:\n+ stage: analysis\n+ tags:\n+ - linux\n+ only:\n+ - master\n+ - development\n+ script:\n+ - source ./ci/tools/git-branch.sh\n+ - ./ci/analysis-git-submodules.sh\n+\nbuild-linux-gcc-nointr:\nstage: build\ntags:\n" }, { "change_type": "ADD", "old_path": null, "new_path": "ci/analysis-git-submodule.sh", "diff": "+#!/bin/bash\n+set -x\n+\n+if [ -z \"$GIT_BRANCH\" ]\n+then\n+ echo \"Please define the 'GIT_BRANCH' environment variable.\"\n+ exit 1\n+fi\n+\n+cd conf\n+HASH_CONF=$(git rev-parse --short HEAD)\n+CONTAIN_COMMIT_CONF=$(git branch ${GIT_BRANCH} --contains ${HASH_CONF})\n+if [ -z \"$CONTAIN_COMMIT_CONF\" ]\n+then\n+ echo \"The '$HASH_CONF' commit of the 'conf' submodule does not exist in the '${GIT_BRANCH}' branch.\"\n+ exit 1\n+fi\n+cd ..\n+\n+cd refs\n+HASH_REFS=$(git rev-parse --short HEAD)\n+CONTAIN_COMMIT_REFS=$(git branch ${GIT_BRANCH} --contains ${HASH_REFS})\n+if [ -z \"$CONTAIN_COMMIT_REFS\" ]\n+then\n+ echo \"The '$HASH_CONF' commit of the 'refs' submodule does not exist in the '${GIT_BRANCH}' branch.\"\n+ exit 1\n+fi\n+cd ..\n+\n+exit 0\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: check the consistency of the Git submodules.
8,490
08.01.2019 10:03:56
-3,600
7fce988eb5fd5dfc3f357245ecaed964a38693e4
CI: fix wrong script name.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -47,7 +47,7 @@ analysis-git-submodules:\n- development\nscript:\n- source ./ci/tools/git-branch.sh\n- - ./ci/analysis-git-submodules.sh\n+ - ./ci/analysis-git-submodule.sh\nbuild-linux-gcc-nointr:\nstage: build\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: fix wrong script name.
8,490
08.01.2019 10:06:12
-3,600
2b0e53711ac3b299bd924d35f001ea8e3742a2b5
CI: try to fix specific branch issue.
[ { "change_type": "MODIFY", "old_path": "ci/analysis-git-submodule.sh", "new_path": "ci/analysis-git-submodule.sh", "diff": "@@ -9,6 +9,8 @@ fi\ncd conf\nHASH_CONF=$(git rev-parse --short HEAD)\n+git checkout ${GIT_BRANCH}\n+git pull origin ${GIT_BRANCH}\nCONTAIN_COMMIT_CONF=$(git branch ${GIT_BRANCH} --contains ${HASH_CONF})\nif [ -z \"$CONTAIN_COMMIT_CONF\" ]\nthen\n@@ -19,6 +21,8 @@ cd ..\ncd refs\nHASH_REFS=$(git rev-parse --short HEAD)\n+git checkout ${GIT_BRANCH}\n+git pull origin ${GIT_BRANCH}\nCONTAIN_COMMIT_REFS=$(git branch ${GIT_BRANCH} --contains ${HASH_REFS})\nif [ -z \"$CONTAIN_COMMIT_REFS\" ]\nthen\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: try to fix specific branch issue.
8,490
08.01.2019 11:20:13
-3,600
2cfc039f061bf9f6441c2800aa5915bd146c5a97
CI: add fake dependencies to reduce the number of downloads.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -51,6 +51,8 @@ analysis-git-submodules:\nbuild-linux-gcc-nointr:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- gcc\n@@ -73,6 +75,8 @@ build-linux-gcc-nointr:\nbuild-linux-gcc-x64-sse4.2:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- gcc\n@@ -96,6 +100,8 @@ build-linux-gcc-x64-sse4.2:\nbuild-linux-gcc-x64-avx2:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- gcc\n@@ -119,6 +125,8 @@ build-linux-gcc-x64-avx2:\nbuild-linux-gcc-8-bit:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- gcc\n@@ -140,6 +148,8 @@ build-linux-gcc-8-bit:\nbuild-linux-gcc-mpi:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- gcc\n@@ -161,6 +171,8 @@ build-linux-gcc-mpi:\nbuild-linux-gcc-systemc:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- gcc\n@@ -183,6 +195,8 @@ build-linux-gcc-systemc:\nbuild-linux-clang:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- clang\n@@ -203,6 +217,8 @@ build-linux-clang:\nbuild-linux-gcc-4.8:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- gcc-4.8\n@@ -223,6 +239,8 @@ build-linux-gcc-4.8:\nbuild-linux-icpc:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- icpc\n@@ -246,6 +264,8 @@ build-linux-icpc:\nbuild-windows-gcc-x86-sse4.2:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- windows\n- gcc\n@@ -266,6 +286,8 @@ build-windows-gcc-x86-sse4.2:\nbuild-windows-gcc-x64-avx2:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- windows\n- 64-bit\n@@ -286,6 +308,8 @@ build-windows-gcc-x64-avx2:\nbuild-windows-msvc-avx:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- windows\n- msvc\n@@ -304,6 +328,8 @@ build-windows-msvc-avx:\nbuild-macos-clang-x64-sse4.2:\nstage: build\n+ dependencies:\n+ - analysis-headers\ntags:\n- macos\n- apple-clang\n@@ -324,6 +350,8 @@ build-macos-clang-x64-sse4.2:\ndocumentation-sphinx:\nstage: documentation\n+ dependencies:\n+ - analysis-headers\nartifacts:\nname: documentation-sphinx\nwhen: always\n@@ -526,6 +554,8 @@ test-regression-uncoded:\ntest-build-coverage-regression:\nstage: test\n+ dependencies:\n+ - analysis-headers\ntags:\n- linux\n- gcc\n@@ -602,6 +632,8 @@ deploy-builds-linux:\ndeploy-github-push:\nstage: deploy\n+ dependencies:\n+ - analysis-git-submodules\ntags:\n- linux\n- github\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: add fake dependencies to reduce the number of downloads.
8,490
08.01.2019 13:09:33
-3,600
ff12a8a9f90b09cdde729ee918c6a848b04c409f
Replace 2018 by 2019.
[ { "change_type": "MODIFY", "old_path": "LICENSE", "new_path": "LICENSE", "diff": "MIT License\n-Copyright (c) 2017-2018 aff3ct\n+Copyright (c) 2017-2019 aff3ct\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/conf.py", "new_path": "doc/sphinx/source/conf.py", "diff": "@@ -21,7 +21,7 @@ import os\n# -- Project information -----------------------------------------------------\nproject = 'AFF3CT'\n-copyright = '2018, AFF3CT team'\n+copyright = '2019, AFF3CT team'\nauthor = 'AFF3CT team'\n# get the AFF3CT version from Git\n" }, { "change_type": "MODIFY", "old_path": "src/main.cpp", "new_path": "src/main.cpp", "diff": "@@ -152,7 +152,7 @@ void print_version()\nstd::cout << \" * GSL: \" << gsl << std::endl;\nstd::cout << \" * MKL: \" << mkl << std::endl;\nstd::cout << \" * SystemC: \" << systemc << std::endl;\n- std::cout << \"Copyright (c) 2016-2018 - MIT license.\" << std::endl;\n+ std::cout << \"Copyright (c) 2016-2019 - MIT license.\" << std::endl;\nstd::cout << \"This is free software; see the source for copying conditions. There is NO\" << std::endl;\nstd::cout << \"warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\" << std::endl;\nexit(EXIT_SUCCESS);\n" } ]
C++
MIT License
aff3ct/aff3ct
Replace 2018 by 2019.
8,490
08.01.2019 14:23:33
-3,600
9dd5eb36052073bd5060b0820fbe8876af0f3b31
Fix rep node.
[ { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/API/functions_polar_seq.h", "new_path": "src/Tools/Code/Polar/API/functions_polar_seq.h", "diff": "@@ -191,7 +191,7 @@ struct rep_seq<B, signed char, H, N_ELMTS>\nsum_l += (int)l_a[i];\n// hardcoded h function\n- B r = ((sum_l <= 0) * bit_init<B>());\n+ B r = ((sum_l < 0) * bit_init<B>());\nfor (auto i = 0; i < N_ELMTS; i++)\ns_a[i] = r;\n}\n@@ -222,7 +222,7 @@ struct rep_seq <B, signed char, H, 0>\nsum_l += (int)l_a[i];\n// hardcoded h function\n- B r = ((sum_l <= 0) * bit_init<B>());\n+ B r = ((sum_l < 0) * bit_init<B>());\nfor (auto i = 0; i < n_elmts; i++)\ns_a[i] = r;\n}\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix rep node.
8,490
08.01.2019 14:47:22
-3,600
f8902f3291426de7571ca11e6ff0e5ebfefade58
CI: add long regression tests when a pipeline is scheduled.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -15,6 +15,8 @@ before_script:\nanalysis-cppcheck:\nstage: analysis\n+ except:\n+ - schedules\nartifacts:\nname: analysis-cppcheck-logs\nwhen: always\n@@ -27,6 +29,8 @@ analysis-cppcheck:\nanalysis-headers:\nstage: analysis\n+ except:\n+ - schedules\nartifacts:\nname: analysis-headers\nwhen: always\n@@ -40,6 +44,8 @@ analysis-headers:\nanalysis-git-submodules:\nstage: analysis\n+ except:\n+ - schedules\ntags:\n- linux\nonly:\n@@ -51,6 +57,8 @@ analysis-git-submodules:\nbuild-linux-gcc-nointr:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -100,6 +108,8 @@ build-linux-gcc-x64-sse4.2:\nbuild-linux-gcc-x64-avx2:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -125,6 +135,8 @@ build-linux-gcc-x64-avx2:\nbuild-linux-gcc-8-bit:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -148,6 +160,8 @@ build-linux-gcc-8-bit:\nbuild-linux-gcc-mpi:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -171,6 +185,8 @@ build-linux-gcc-mpi:\nbuild-linux-gcc-systemc:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -195,6 +211,8 @@ build-linux-gcc-systemc:\nbuild-linux-clang:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -217,6 +235,8 @@ build-linux-clang:\nbuild-linux-gcc-4.8:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -239,6 +259,8 @@ build-linux-gcc-4.8:\nbuild-linux-icpc:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -264,6 +286,8 @@ build-linux-icpc:\nbuild-windows-gcc-x86-sse4.2:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -286,6 +310,8 @@ build-windows-gcc-x86-sse4.2:\nbuild-windows-gcc-x64-avx2:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -308,6 +334,8 @@ build-windows-gcc-x64-avx2:\nbuild-windows-msvc-avx:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -328,6 +356,8 @@ build-windows-msvc-avx:\nbuild-macos-clang-x64-sse4.2:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -350,6 +380,8 @@ build-macos-clang-x64-sse4.2:\ndocumentation-sphinx:\nstage: documentation\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\nartifacts:\n@@ -368,6 +400,8 @@ documentation-sphinx:\ndocumentation-check:\nstage: documentation\n+ except:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -382,6 +416,8 @@ documentation-check:\ntest-regression-bch:\nstage: test\nretry: 1\n+ except:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -398,11 +434,61 @@ test-regression-bch:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 5 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=\"5\"\n+ - ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-bch-long:\n+ stage: test\n+ only:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - python\n+ artifacts:\n+ name: test-regression-results-bch\n+ when: always\n+ paths:\n+ - test-regression-results-bch/\n+ script:\n+ - source ./ci/tools/threads.sh\n+ - source ./ci/tools/git-version.sh\n+ - export TIME_SEC=\"1800\"\n+ - ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-ldpc:\nstage: test\nretry: 1\n+ except:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - powerful\n+ - python\n+ artifacts:\n+ name: test-regression-results-ldpc\n+ when: always\n+ paths:\n+ - test-regression-results-ldpc/\n+ script:\n+ - source ./ci/tools/threads.sh\n+ - source ./ci/tools/git-version.sh\n+ - export TIME_SEC=\"10\"\n+ - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-ldpc-long:\n+ stage: test\n+ only:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -420,11 +506,15 @@ test-regression-ldpc:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 10 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=\"1800\"\n+ - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\ntest-regression-polar:\nstage: test\nretry: 1\n+ except:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -442,11 +532,61 @@ test-regression-polar:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 5 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=\"5\"\n+ - ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-polar-long:\n+ stage: test\n+ only:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - powerful\n+ - python\n+ artifacts:\n+ name: test-regression-results-polar\n+ when: always\n+ paths:\n+ - test-regression-results-polar/\n+ script:\n+ - source ./ci/tools/threads.sh\n+ - source ./ci/tools/git-version.sh\n+ - export TIME_SEC=\"1800\"\n+ - ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-rs:\nstage: test\nretry: 1\n+ except:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - python\n+ artifacts:\n+ name: test-regression-results-rs\n+ when: always\n+ paths:\n+ - test-regression-results-rs/\n+ script:\n+ - source ./ci/tools/threads.sh\n+ - source ./ci/tools/git-version.sh\n+ - export TIME_SEC=\"5\"\n+ - ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-rs-long:\n+ stage: test\n+ only:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -463,11 +603,14 @@ test-regression-rs:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 5 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=\"1800\"\n+ - ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo:\nstage: test\nretry: 1\n+ except:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -485,11 +628,62 @@ test-regression-turbo:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 5 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=\"5\"\n+ - ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-turbo-long:\n+ stage: test\n+ only:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - powerful\n+ - python\n+ artifacts:\n+ name: test-regression-results-turbo\n+ when: always\n+ paths:\n+ - test-regression-results-turbo/\n+ script:\n+ - source ./ci/tools/threads.sh\n+ - source ./ci/tools/git-version.sh\n+ - export TIME_SEC=\"1800\"\n+ - ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo-db:\nstage: test\nretry: 1\n+ except:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - powerful\n+ - python\n+ artifacts:\n+ name: test-regression-results-turbo-db\n+ when: always\n+ paths:\n+ - test-regression-results-turbo-db/\n+ script:\n+ - source ./ci/tools/threads.sh\n+ - source ./ci/tools/git-version.sh\n+ - export TIME_SEC=\"5\"\n+ - ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-turbo-db-long:\n+ stage: test\n+ only:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -507,11 +701,14 @@ test-regression-turbo-db:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 5 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=\"1800\"\n+ - ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo-prod:\nstage: test\nretry: 1\n+ except:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -529,11 +726,61 @@ test-regression-turbo-prod:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 30 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=\"30\"\n+ - ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-turbo-prod-long:\n+ stage: test\n+ only:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - powerful\n+ - python\n+ artifacts:\n+ name: test-regression-results-turbo-prod\n+ when: always\n+ paths:\n+ - test-regression-results-turbo-prod/\n+ script:\n+ - source ./ci/tools/threads.sh\n+ - source ./ci/tools/git-version.sh\n+ - export TIME_SEC=\"1800\"\n+ - ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-uncoded:\nstage: test\nretry: 1\n+ except:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - python\n+ artifacts:\n+ name: test-regression-results-uncoded\n+ when: always\n+ paths:\n+ - test-regression-results-uncoded/\n+ script:\n+ - source ./ci/tools/threads.sh\n+ - source ./ci/tools/git-version.sh\n+ - export TIME_SEC=\"5\"\n+ - ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-uncoded-long:\n+ stage: test\n+ only:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\ntags:\n@@ -550,10 +797,13 @@ test-regression-uncoded:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time 5 --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=\"1800\"\n+ - ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-build-coverage-regression:\nstage: test\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -574,6 +824,8 @@ test-build-coverage-regression:\ncoverage-linux:\nstage: coverage\n+ except:\n+ - schedules\ndependencies:\n- test-build-coverage-regression\ntags:\n@@ -591,6 +843,8 @@ coverage-linux:\ndeploy-sonarqube-linux:\nstage: deploy\n+ except:\n+ - schedules\ndependencies:\n- analysis-cppcheck\n- coverage-linux\n@@ -606,6 +860,8 @@ deploy-sonarqube-linux:\ndeploy-builds-linux:\nstage: deploy\n+ except:\n+ - schedules\ndependencies:\n- build-linux-gcc-x64-sse4.2\n- build-linux-gcc-x64-avx2\n@@ -632,6 +888,8 @@ deploy-builds-linux:\ndeploy-github-push:\nstage: deploy\n+ except:\n+ - schedules\ndependencies:\n- analysis-git-submodules\ntags:\n@@ -646,6 +904,8 @@ deploy-github-push:\npages:\nstage: deploy\n+ except:\n+ - schedules\ntags:\n- linux\ndependencies:\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: add long regression tests when a pipeline is scheduled.
8,490
08.01.2019 15:31:37
-3,600
eda7ea30fa7ce2a0b1f0d45ece86f2a61d197f56
CI: add variables to control the time of the regression tests when scheduled.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -457,7 +457,7 @@ test-regression-bch-long:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=\"1800\"\n+ - export TIME_SEC=$CI_TIME_SEC_BCH\n- ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-ldpc:\n@@ -506,7 +506,7 @@ test-regression-ldpc-long:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=\"1800\"\n+ - export TIME_SEC=$CI_TIME_SEC_LDPC\n- ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n@@ -556,7 +556,7 @@ test-regression-polar-long:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=\"1800\"\n+ - export TIME_SEC=$CI_TIME_SEC_POLAR\n- ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-rs:\n@@ -603,7 +603,7 @@ test-regression-rs-long:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=\"1800\"\n+ - export TIME_SEC=$CI_TIME_SEC_RS\n- ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo:\n@@ -652,7 +652,7 @@ test-regression-turbo-long:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=\"1800\"\n+ - export TIME_SEC=$CI_TIME_SEC_TURBO\n- ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo-db:\n@@ -701,7 +701,7 @@ test-regression-turbo-db-long:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=\"1800\"\n+ - export TIME_SEC=$CI_TIME_SEC_TURBO_DB\n- ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo-prod:\n@@ -750,7 +750,7 @@ test-regression-turbo-prod-long:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=\"1800\"\n+ - export TIME_SEC=$CI_TIME_SEC_TURBO_PROD\n- ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-uncoded:\n@@ -797,7 +797,7 @@ test-regression-uncoded-long:\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=\"1800\"\n+ - export TIME_SEC=$CI_TIME_SEC_UNCODED\n- ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-build-coverage-regression:\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: add variables to control the time of the regression tests when scheduled.
8,488
08.01.2019 17:00:42
-3,600
0d868ec8a52b32c2f08786d563181959702c8308
Update documentation for BEC frozen bits generator.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "diff": "@@ -50,7 +50,7 @@ Description of the allowed values:\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n:Type: text\n- :Allowed values: ``FILE`` ``GA`` ``TV``\n+ :Allowed values: ``FILE`` ``GA`` ``TV`` ``BEC``\n:Examples: ``--enc-fb-gen-method FILE``\n|factory::Frozenbits_generator::parameters::p+gen-method|\n@@ -69,6 +69,9 @@ Description of the allowed values:\n| ``FILE`` | Read the best channels from an external file, to use with the |\n| | :ref:`enc-polar-enc-fb-awgn-path` parameter. |\n+----------+-------------------------------------------------------------------+\n+| ``BEC`` | Generate frozen bits for the |BEC| channel from |\n+| | :cite:`Arikan2009`. |\n++----------+-------------------------------------------------------------------+\n.. note:: By default, when using the |GA| or the |TV| method, the frozen bits\nare optimized for each |SNR| point. To override this behavior you can use\n@@ -77,6 +80,10 @@ Description of the allowed values:\n.. note:: When using the ``FILE`` method, the frozen bits are always the same\nregardless of the |SNR| value.\n+.. note:: When using the ``BEC`` method, the frozen bits are optimized for each\n+ erasure probability.\n+\n+\n.. _enc-polar-enc-fb-awgn-path:\n``--enc-fb-awgn-path``\n" } ]
C++
MIT License
aff3ct/aff3ct
Update documentation for BEC frozen bits generator.
8,488
08.01.2019 17:01:49
-3,600
da37594e3c6e4e74db6609eae506297ad2275de1
Fix segmentation fault caused by noise pointer. Changed to unique pointer.
[ { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator.hpp", "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator.hpp", "diff": "@@ -28,7 +28,7 @@ class Frozenbits_generator\nprotected:\nconst int K; /*!< Number of information bits in the frame. */\nconst int N; /*!< Codeword size (or frame size). */\n- tools::Noise<float>* n; /*!< The current noise to apply to the input signal */\n+ std::unique_ptr<tools::Noise<float>> n;\nstd::vector<uint32_t> best_channels; /*!< The best channels in a codeword sorted by descending order. */\n@@ -64,10 +64,7 @@ public:\n*/\nvoid set_noise(const tools::Noise<float>& noise)\n{\n- if (this->n != nullptr)\n- delete this->n;\n-\n- this->n = tools::cast<float>(noise);\n+ this->n.reset(tools::cast<float>(noise));\n}\n/*!\n@@ -77,11 +74,7 @@ public:\n*/\nvoid set_noise(const tools::Noise<double>& noise)\n{\n- if (this->n != nullptr)\n- delete this->n;\n-\n- this->n = tools::cast<float>(noise);\n- this->check_noise();\n+ this->n.reset(tools::cast<float>(noise));\n}\n/*!\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix segmentation fault caused by noise pointer. Changed to unique pointer.
8,490
08.01.2019 17:12:02
-3,600
52503d6bb07079ce1d7924a0d2b34cb0722c2cc9
Doc: add the Polar MK doc.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/conf.py", "new_path": "doc/sphinx/source/conf.py", "diff": "@@ -317,6 +317,7 @@ rst_epilog = \"\"\"\n.. |MAP| replace:: :abbr:`MAP (Maximum A Posteriori)`\n.. |MATLAB| replace:: MATLAB\n.. |MI| replace:: :abbr:`MI (Mutual Information)`\n+.. |MK| replace:: :abbr:`MK (Multi-Kernel)`\n.. |MKL| replace:: :abbr:`MKL (Intel Math Kernel Library)`\n.. |ML| replace:: :abbr:`ML (Maximum Likelihood)`\n.. |modem| replace:: :abbr:`modem (modulator/demodulator)`\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/codec.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/codec.rst", "diff": "@@ -11,6 +11,7 @@ Codec parameters\nbch/codec\nldpc/codec\npolar/codec\n+ polar_mk/codec\nra/codec\nrep/codec\nrs/codec\n" }, { "change_type": "ADD", "old_path": null, "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar_mk/codec.rst", "diff": "+.. _codec-polar:\n+\n+Codec Polar |MK|\n+****************\n+\n+.. toctree::\n+ :maxdepth: 2\n+ :caption: Contents\n+\n+ encoder.rst\n+ decoder.rst\n" }, { "change_type": "ADD", "old_path": null, "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar_mk/decoder.rst", "diff": "+.. _dec-polar_mk-decoder-parameters:\n+\n+Polar |MK| Decoder parameters\n+-----------------------------\n+\n+.. _dec-polar_mk-dec-type:\n+\n+``--dec-type, -D``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: text\n+ :Allowed values: ``SC`` ``CHASE`` ``ML``\n+ :Default: ``SC``\n+ :Examples: ``--dec-type ML``\n+\n+|factory::Decoder::parameters::p+type,D|\n+\n+Description of the allowed values:\n+\n++--------------+---------------------------------------------------------------+\n+| Value | Description |\n++==============+===============================================================+\n+| ``SC`` | Select the original |SC| algorithm from :cite:`Arikan2009`. |\n++--------------+---------------------------------------------------------------+\n+| ``CHASE`` | See the common :ref:`dec-common-dec-type` parameter. |\n++--------------+---------------------------------------------------------------+\n+| ``ML`` | See the common :ref:`dec-common-dec-type` parameter. |\n++--------------+---------------------------------------------------------------+\n+\n+.. _dec-polar_mk-dec-implem:\n+\n+``--dec-implem``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: text\n+ :Allowed values: ``NAIVE``\n+ :Default: ``NAIVE``\n+ :Examples: ``--dec-implem NAIVE``\n+\n+|factory::Decoder::parameters::p+implem|\n+\n+Description of the allowed values:\n+\n++-----------+--------------------------+\n+| Value | Description |\n++===========+==========================+\n+| ``NAIVE`` | |dec-implem_descr_naive| |\n++-----------+--------------------------+\n+\n+.. |dec-implem_descr_naive| replace:: Select the naive implementation which is\n+ typically slow.\n+\n+References\n+\"\"\"\"\"\"\"\"\"\"\n+\n+.. bibliography:: references_dec.bib\n\\ No newline at end of file\n" }, { "change_type": "ADD", "old_path": null, "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar_mk/encoder.rst", "diff": "+.. _enc-polar_mk-encoder-parameters:\n+\n+Polar |MK| Encoder parameters\n+-----------------------------\n+\n+.. _enc-polar_mk-enc-type:\n+\n+``--enc-type``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: text\n+ :Allowed values: ``POLAR_MK`` ``AZCW`` ``COSET`` ``USER``\n+ :Default: ``POLAR_MK``\n+ :Examples: ``--enc-type AZCW``\n+\n+|factory::Encoder::parameters::p+type|\n+\n+Description of the allowed values:\n+\n++--------------+------------------------+\n+| Value | Description |\n++==============+========================+\n+| ``POLAR_MK`` | |enc-type_descr_polar| |\n++--------------+------------------------+\n+| ``AZCW`` | |enc-type_descr_azcw| |\n++--------------+------------------------+\n+| ``COSET`` | |enc-type_descr_coset| |\n++--------------+------------------------+\n+| ``USER`` | |enc-type_descr_user| |\n++--------------+------------------------+\n+\n+.. |enc-type_descr_polar| replace:: Select the standard Polar |MK| encoder.\n+.. |enc-type_descr_azcw| replace:: See the common :ref:`enc-common-enc-type`\n+ parameter.\n+.. |enc-type_descr_coset| replace:: See the common :ref:`enc-common-enc-type`\n+ parameter.\n+.. |enc-type_descr_user| replace:: See the common :ref:`enc-common-enc-type`\n+ parameter.\n+\n+.. _enc-polar_mk-enc-no-sys:\n+\n+``--enc-sys``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+|factory::Encoder_polar_MK::parameters::p+sys|\n+\n+.. _enc-polar_mk-enc-kernel:\n+\n+``--enc-kernel``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: list of (list of (boolean:including set={0|1}):limited length [1;inf]), elements of same length\n+ :Default: ``\"10,11\"``\n+ :Examples: ``--enc-kernel \"111,101,011\"``\n+\n+|factory::Encoder_polar_MK::parameters::p+kernel|\n+\n+.. _enc-polar_mk-enc-code-path:\n+\n+``--enc-code-path``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: file\n+ :Rights: read only\n+ :Examples: ``--enc-code-path example/path/to/the/right/place/``\n+\n+|factory::Encoder_polar_MK::parameters::p+code-path|\n+\n+An |ASCII| file is expected:\n+\n+.. code-block:: bash\n+\n+ # number of different kernels\n+ 2\n+\n+ # dimension of kernel 0\n+ 2\n+ # kernel 0\n+ 1 0\n+ 1 1\n+\n+ # dimension of kernel 1\n+ 3\n+ # kernel 1\n+ 1 1 1\n+ 1 0 1\n+ 0 1 1\n+\n+ # number of stages\n+ 5\n+ # type of kernel per stage\n+ 0 0 0 0 1\n+\n+The previous file describes a :math:`N = 48` Polar |MK| code with the following\n+construction:\n+:math:`G_{48} = T_2 \\otimes T_2 \\otimes T_2 \\otimes T_2 \\otimes T_3`.\n+\n+.. _enc-polar_mk-enc-fb-gen-method:\n+\n+``--enc-fb-gen-method``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: text\n+ :Allowed values: ``FILE``\n+ :Examples: ``--enc-fb-gen-method FILE``\n+\n+|factory::Frozenbits_generator_MK::parameters::p+gen-method|\n+\n+Description of the allowed values:\n+\n++----------+-------------------------------------------------------------------+\n+| Value | Description |\n++==========+===================================================================+\n+| ``FILE`` | Read the best channels from an external file, to use with the |\n+| | :ref:`enc-polar_mk-enc-fb-awgn-path` parameter. |\n++----------+-------------------------------------------------------------------+\n+\n+.. note:: When using the ``FILE`` method, the frozen bits are always the same\n+ regardless of the |SNR| value.\n+\n+.. _enc-polar_mk-enc-fb-awgn-path:\n+\n+``--enc-fb-awgn-path``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: file\n+ :Rights: read only\n+ :Examples: ``--enc-fb-awgn-path example/path/to/the/right/place/``\n+\n+|factory::Frozenbits_generator_MK::parameters::p+awgn-path|\n+\n+An |ASCII| file is expected, for instance, the following file describes the\n+most reliable channels optimized for a codeword of size :math:`N = 8` and for an\n+|AWGN| channel where the noise variance is :math:`\\sigma = 0.435999`:\n+\n+.. code-block:: bash\n+\n+ 8\n+ awgn\n+ 0.435999\n+ 7 6 5 3 4 2 1 0\n+\n+Given the previous file, if we suppose a Polar code of size :math:`N = 8` with\n+:math:`K = 4` information bits, the frozen bits are at the ``0, 1, 2, 4``\n+positions in the codeword. The strategy is to freeze the less reliable channels.\n+\n+.. warning:: The ``FILE`` frozen bits generator expects a file and not a\n+ directory.\n+\n+.. _enc-polar_mk-enc-fb-sigma:\n+\n+``--enc-fb-sigma``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: real number\n+ :Examples: ``--enc-fb-sigma 1.0``\n+\n+|factory::Frozenbits_generator_MK::parameters::p+sigma|\n" }, { "change_type": "ADD", "old_path": null, "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar_mk/references_dec.bib", "diff": "+@Article{Arikan2009,\n+ author = {E. Arikan},\n+ title = {Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels},\n+ journal = {IEEE Transactions on Information Theory (TIT)},\n+ year = {2009},\n+ volume = {55},\n+ number = {7},\n+ pages = {3051--3073},\n+ month = jul,\n+ issn = {0018-9448},\n+ abstract = {A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. Channel polarization refers to the fact that it is possible to synthesize, out of N independent copies of a given B-DMC W, a second set of N binary-input channels {WN(i)1 les i les N} such that, as N becomes large, the fraction of indices i for which I(WN(i)) is near 1 approaches I(W) and the fraction for which I(WN(i)) is near 0 approaches 1-I(W). The polarized channels {WN(i)} are well-conditioned for channel coding: one need only send data at rate 1 through those with capacity near 1 and at rate 0 through the remaining. Codes constructed on the basis of this idea are called polar codes. The paper proves that, given any B-DMC W with I(W) $>$ 0 and any target rate R$<$ I(W) there exists a sequence of polar codes {Cfrn;nges1} such that Cfrn has block-length N=2n , rate ges R, and probability of block error under successive cancellation decoding bounded as Pe(N,R) les O(N-1/4) independently of the code rate. This performance is achievable by encoders and decoders with complexity O(N logN) for each.},\n+ doi = {10.1109/TIT.2009.2021379},\n+ file = {:pdf/Arikan2009 - Channel Polarization\\: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels.pdf:PDF},\n+ groups = {Polar Codes},\n+ keywords = {binary codes, channel capacity, channel coding, decoding, memoryless systems, probability, channel capacity, channel coding, channel polarization, code sequence, polar codes, probability, successive cancellation decoding algorithm, symmetric binary-input memoryless channel, Capacity planning, Channel capacity, Channel coding, Codes, Councils, Decoding, Information theory, Memoryless systems, Noise cancellation, Polarization, Capacity-achieving codes, Plotkin construction, Reed-- Muller (RM) codes, channel capacity, channel polarization, polar codes, successive cancellation decoding},\n+}\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": ".. --------------------------------------------- factory Codec_polar parameters\n+.. ------------------------------------------ factory Codec_polar_MK parameters\n+\n.. ------------------------------------------------ factory Codec_RA parameters\n.. ---------------------------------------- factory Codec_repetition parameters\n.. |factory::Decoder_polar::parameters::p+no-sys| replace::\nEnable non-systematic encoding.\n+.. ---------------------------------------- factory Decoder_polar_MK parameters\n+\n.. ---------------------------------------------- factory Decoder_RA parameters\n.. |factory::Decoder_RA::parameters::p+ite,i| replace::\nEnable non-systematic encoding. By default the encoding process is\nsystematic.\n+.. ---------------------------------------- factory Encoder_polar_MK parameters\n+\n+.. |factory::Encoder_polar_MK::parameters::p+sys| replace::\n+ Enable systematic encoding. By default the encoding process is\n+ non-systematic.\n+\n+.. |factory::Encoder_polar_MK::parameters::p+kernel| replace::\n+ Set the polar code kernel (squared matrix only).\n+\n+.. |factory::Encoder_polar_MK::parameters::p+code-path| replace::\n+ Set the path to a file containing the polar code description (kernels\n+ definition and stages).\n+\n.. ---------------------------------------------- factory Encoder_RA parameters\n.. -------------------------------------- factory Encoder_repetition parameters\nSet the path of the polar bounds code generator (generates best channels to\nuse).\n+.. --------------------------------- factory Frozenbits_generator_MK parameters\n+\n+.. |factory::Frozenbits_generator_MK::parameters::p+info-bits,K| replace::\n+ Select the number of information bits :math:`K`.\n+\n+.. |factory::Frozenbits_generator_MK::parameters::p+cw-size,N| replace::\n+ Select the codeword size :math:`N`.\n+\n+.. |factory::Frozenbits_generator_MK::parameters::p+sigma| replace::\n+ Selects the noise variance :math:`\\sigma` for which the frozen bits will be\n+ optimized. All the noise points in the simulation will use the same frozen\n+ bits configuration.\n+\n+.. |factory::Frozenbits_generator_MK::parameters::p+gen-method| replace::\n+ Select the frozen bits generation method.\n+\n+.. |factory::Frozenbits_generator_MK::parameters::p+awgn-path| replace::\n+ Set the path to a file or a directory containing the best channels to select\n+ the frozen bits.\n+\n.. ------------------------------------------ factory Flip_and_check parameters\n.. |factory::Flip_and_check::parameters::p+| replace::\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Module/Encoder/Polar_MK/Encoder_polar_MK.cpp", "new_path": "src/Factory/Module/Encoder/Polar_MK/Encoder_polar_MK.cpp", "diff": "#include \"Tools/Exception/exception.hpp\"\n+#include \"Tools/Documentation/documentation.h\"\n#include \"Module/Encoder/Polar_MK/Encoder_polar_MK.hpp\"\n#include \"Module/Encoder/Polar_MK/Encoder_polar_MK_sys.hpp\"\n@@ -42,25 +43,20 @@ void Encoder_polar_MK::parameters\nEncoder::parameters::get_description(args);\nauto p = this->get_prefix();\n+ const std::string class_name = \"factory::Encoder_polar_MK::parameters::\";\ntools::add_options(args.at({p+\"-type\"}), 0, \"POLAR_MK\");\n- args.add(\n- {p+\"-sys\"},\n- tools::None(),\n- \"enable the systematic encoding.\");\n+ tools::add_arg(args, p, class_name+\"p+sys\",\n+ tools::None());\n- args.add(\n- {p+\"-kernel\"},\n+ tools::add_arg(args, p, class_name+\"p+kernel\",\ntools::List2D<bool>(tools::Boolean(),\nstd::make_tuple(tools::Length(1), tools::Function<sub_same_length>(\"elements of same length\")),\n- std::make_tuple(tools::Length(1))),\n- \"kernel of the polar code (squared matrix only) (ex: \\\"111,101,011\\\").\");\n+ std::make_tuple(tools::Length(1))));\n- args.add(\n- {p+\"-code-path\"},\n- tools::File(tools::openmode::read),\n- \"path to a file containing the polar code description (kernels definition and stages).\");\n+ tools::add_arg(args, p, class_name+\"p+code-path\",\n+ tools::File(tools::openmode::read));\n}\nvoid Encoder_polar_MK::parameters\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Tools/Code/Polar_MK/Frozenbits_generator_MK.cpp", "new_path": "src/Factory/Tools/Code/Polar_MK/Frozenbits_generator_MK.cpp", "diff": "#include \"Tools/Exception/exception.hpp\"\n+#include \"Tools/Documentation/documentation.h\"\n+\n#include \"Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_file.hpp\"\n#include \"Frozenbits_generator_MK.hpp\"\n@@ -25,33 +27,24 @@ void Frozenbits_generator_MK::parameters\n::get_description(tools::Argument_map_info &args) const\n{\nauto p = this->get_prefix();\n+ const std::string class_name = \"factory::Frozenbits_generator_MK::parameters::\";\n- args.add(\n- {p+\"-info-bits\", \"K\"},\n+ tools::add_arg(args, p, class_name+\"p+info-bits,K\",\ntools::Integer(tools::Positive(), tools::Non_zero()),\n- \"useful number of bit transmitted (information bits).\",\ntools::arg_rank::REQ);\n- args.add(\n- {p+\"-cw-size\", \"N\"},\n+ tools::add_arg(args, p, class_name+\"p+cw-size,N\",\ntools::Integer(tools::Positive(), tools::Non_zero()),\n- \"the codeword size.\",\ntools::arg_rank::REQ);\n- args.add(\n- {p+\"-sigma\"},\n- tools::Real(tools::Positive(), tools::Non_zero()),\n- \"sigma value for the polar codes generation (adaptive frozen bits if sigma is not set).\");\n+ tools::add_arg(args, p, class_name+\"p+sigma\",\n+ tools::Real(tools::Positive(), tools::Non_zero()));\n- args.add(\n- {p+\"-gen-method\"},\n- tools::Text(tools::Including_set(\"FILE\")),\n- \"select the frozen bits generation method.\");\n+ tools::add_arg(args, p, class_name+\"p+gen-method\",\n+ tools::Text(tools::Including_set(\"FILE\")));\n- args.add(\n- {p+\"-awgn-path\"},\n- tools::Path(tools::openmode::read),\n- \"path to a file or a directory containing the best channels to use for information bits.\");\n+ tools::add_arg(args, p, class_name+\"p+awgn-path\",\n+ tools::Path(tools::openmode::read));\n}\nvoid Frozenbits_generator_MK::parameters\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: add the Polar MK doc.
8,490
09.01.2019 10:05:59
-3,600
27e6682a14bceb927bfddafb9e00f1e8da6ec286
CI: disable push on GitHub and use the specific GitLab feature instead.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -886,21 +886,21 @@ deploy-builds-linux:\n- source ./ci/tools/git-version.sh\n- ./ci/deploy-builds-linux.sh build_linux_gcc_x64_sse4.2 build_linux_gcc_x64_avx2 build_windows_gcc_x86_sse4.2 build_windows_gcc_x64_avx2 build_macos_clang_x64_sse4.2\n-deploy-github-push:\n- stage: deploy\n- except:\n- - schedules\n- dependencies:\n- - analysis-git-submodules\n- tags:\n- - linux\n- - github\n- only:\n- - master\n- - development\n- script:\n- - source ./ci/tools/git-branch.sh\n- - ./ci/deploy-github-push.sh\n+# deploy-github-push:\n+# stage: deploy\n+# except:\n+# - schedules\n+# dependencies:\n+# - analysis-git-submodules\n+# tags:\n+# - linux\n+# - github\n+# only:\n+# - master\n+# - development\n+# script:\n+# - source ./ci/tools/git-branch.sh\n+# - ./ci/deploy-github-push.sh\npages:\nstage: deploy\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: disable push on GitHub and use the specific GitLab feature instead.
8,490
09.01.2019 10:16:51
-3,600
c9210c59c67752b031f82a736c797fb55884935b
CI: update long regression tests to run on very powerful machines.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -83,6 +83,8 @@ build-linux-gcc-nointr:\nbuild-linux-gcc-x64-sse4.2:\nstage: build\n+ except:\n+ - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -108,8 +110,6 @@ build-linux-gcc-x64-sse4.2:\nbuild-linux-gcc-x64-avx2:\nstage: build\n- except:\n- - schedules\ndependencies:\n- analysis-headers\ntags:\n@@ -442,12 +442,14 @@ test-regression-bch-long:\nonly:\n- schedules\ndependencies:\n- - build-linux-gcc-x64-sse4.2\n+ - build-linux-gcc-x64-avx2\ntags:\n- linux\n- x86\n- 64-bit\n- - sse4.2\n+ - avx2\n+ - powerful\n+ - schedules\n- python\nartifacts:\nname: test-regression-results-bch\n@@ -458,7 +460,7 @@ test-regression-bch-long:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- export TIME_SEC=$CI_TIME_SEC_BCH\n- - ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-ldpc:\nstage: test\n@@ -490,13 +492,14 @@ test-regression-ldpc-long:\nonly:\n- schedules\ndependencies:\n- - build-linux-gcc-x64-sse4.2\n+ - build-linux-gcc-x64-avx2\ntags:\n- linux\n- x86\n- 64-bit\n- - sse4.2\n+ - avx2\n- powerful\n+ - schedules\n- python\nartifacts:\nname: test-regression-results-ldpc\n@@ -507,7 +510,7 @@ test-regression-ldpc-long:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- export TIME_SEC=$CI_TIME_SEC_LDPC\n- - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-polar:\n@@ -540,13 +543,14 @@ test-regression-polar-long:\nonly:\n- schedules\ndependencies:\n- - build-linux-gcc-x64-sse4.2\n+ - build-linux-gcc-x64-avx2\ntags:\n- linux\n- x86\n- 64-bit\n- - sse4.2\n+ - avx2\n- powerful\n+ - schedules\n- python\nartifacts:\nname: test-regression-results-polar\n@@ -557,7 +561,7 @@ test-regression-polar-long:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- export TIME_SEC=$CI_TIME_SEC_POLAR\n- - ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-rs:\nstage: test\n@@ -588,12 +592,14 @@ test-regression-rs-long:\nonly:\n- schedules\ndependencies:\n- - build-linux-gcc-x64-sse4.2\n+ - build-linux-gcc-x64-avx2\ntags:\n- linux\n- x86\n- 64-bit\n- - sse4.2\n+ - avx2\n+ - powerful\n+ - schedules\n- python\nartifacts:\nname: test-regression-results-rs\n@@ -604,7 +610,7 @@ test-regression-rs-long:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- export TIME_SEC=$CI_TIME_SEC_RS\n- - ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo:\nstage: test\n@@ -636,13 +642,14 @@ test-regression-turbo-long:\nonly:\n- schedules\ndependencies:\n- - build-linux-gcc-x64-sse4.2\n+ - build-linux-gcc-x64-avx2\ntags:\n- linux\n- x86\n- 64-bit\n- - sse4.2\n+ - avx2\n- powerful\n+ - schedules\n- python\nartifacts:\nname: test-regression-results-turbo\n@@ -653,7 +660,7 @@ test-regression-turbo-long:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- export TIME_SEC=$CI_TIME_SEC_TURBO\n- - ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo-db:\nstage: test\n@@ -685,13 +692,14 @@ test-regression-turbo-db-long:\nonly:\n- schedules\ndependencies:\n- - build-linux-gcc-x64-sse4.2\n+ - build-linux-gcc-x64-avx2\ntags:\n- linux\n- x86\n- 64-bit\n- - sse4.2\n+ - avx2\n- powerful\n+ - schedules\n- python\nartifacts:\nname: test-regression-results-turbo-db\n@@ -702,7 +710,7 @@ test-regression-turbo-db-long:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- export TIME_SEC=$CI_TIME_SEC_TURBO_DB\n- - ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo-prod:\nstage: test\n@@ -734,13 +742,14 @@ test-regression-turbo-prod-long:\nonly:\n- schedules\ndependencies:\n- - build-linux-gcc-x64-sse4.2\n+ - build-linux-gcc-x64-avx2\ntags:\n- linux\n- x86\n- 64-bit\n- - sse4.2\n+ - avx2\n- powerful\n+ - schedules\n- python\nartifacts:\nname: test-regression-results-turbo-prod\n@@ -751,7 +760,7 @@ test-regression-turbo-prod-long:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- export TIME_SEC=$CI_TIME_SEC_TURBO_PROD\n- - ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-uncoded:\nstage: test\n@@ -782,12 +791,14 @@ test-regression-uncoded-long:\nonly:\n- schedules\ndependencies:\n- - build-linux-gcc-x64-sse4.2\n+ - build-linux-gcc-x64-avx2\ntags:\n- linux\n- x86\n- 64-bit\n- - sse4.2\n+ - avx2\n+ - powerful\n+ - schedules\n- python\nartifacts:\nname: test-regression-results-uncoded\n@@ -798,7 +809,7 @@ test-regression-uncoded-long:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- export TIME_SEC=$CI_TIME_SEC_UNCODED\n- - ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-build-coverage-regression:\nstage: test\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: update long regression tests to run on very powerful machines.
8,490
09.01.2019 11:29:52
-3,600
1a0f6d6a0d06962480604625e83be79ec578f22b
CI: update deprecated submodule management.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "+GIT_SUBMODULE_STRATEGY: recursive\n+\nstages:\n- analysis\n- build\n@@ -10,8 +12,6 @@ before_script:\n- hostname\n- whoami\n# - pwd\n- - git submodule sync --recursive\n- - git submodule update --init --recursive\nanalysis-cppcheck:\nstage: analysis\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: update deprecated submodule management.
8,490
09.01.2019 11:57:20
-3,600
e2ad786098a8764fdcfbe8134db0dd8a91f8b83c
CI: set the default git submodule strategy to none and only enables it when necessary.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "variables:\n- GIT_SUBMODULE_STRATEGY: recursive\n+ GIT_SUBMODULE_STRATEGY: none\nstages:\n- analysis\n@@ -45,6 +45,8 @@ analysis-headers:\nanalysis-git-submodules:\nstage: analysis\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ntags:\n@@ -58,6 +60,8 @@ analysis-git-submodules:\nbuild-linux-gcc-nointr:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -84,6 +88,8 @@ build-linux-gcc-nointr:\nbuild-linux-gcc-x64-sse4.2:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -111,6 +117,8 @@ build-linux-gcc-x64-sse4.2:\nbuild-linux-gcc-x64-avx2:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\ndependencies:\n- analysis-headers\ntags:\n@@ -136,6 +144,8 @@ build-linux-gcc-x64-avx2:\nbuild-linux-gcc-8-bit:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -161,6 +171,8 @@ build-linux-gcc-8-bit:\nbuild-linux-gcc-mpi:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -186,6 +198,8 @@ build-linux-gcc-mpi:\nbuild-linux-gcc-systemc:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -212,6 +226,8 @@ build-linux-gcc-systemc:\nbuild-linux-clang:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -236,6 +252,8 @@ build-linux-clang:\nbuild-linux-gcc-4.8:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -260,6 +278,8 @@ build-linux-gcc-4.8:\nbuild-linux-icpc:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -287,6 +307,8 @@ build-linux-icpc:\nbuild-windows-gcc-x86-sse4.2:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -311,6 +333,8 @@ build-windows-gcc-x86-sse4.2:\nbuild-windows-gcc-x64-avx2:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -335,6 +359,8 @@ build-windows-gcc-x64-avx2:\nbuild-windows-msvc-avx:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -357,6 +383,8 @@ build-windows-msvc-avx:\nbuild-macos-clang-x64-sse4.2:\nstage: build\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n@@ -872,6 +900,8 @@ deploy-sonarqube-linux:\ndeploy-builds-linux:\nstage: deploy\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nexcept:\n- schedules\ndependencies:\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: set the default git submodule strategy to none and only enables it when necessary.
8,490
09.01.2019 12:07:54
-3,600
a63adc7417f14db2a2886bf94eac97c1448b2895
CI: fix previous commit.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -444,6 +444,8 @@ documentation-check:\ntest-regression-bch:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nretry: 1\nexcept:\n- schedules\n@@ -468,6 +470,8 @@ test-regression-bch:\ntest-regression-bch-long:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nonly:\n- schedules\ndependencies:\n@@ -493,6 +497,8 @@ test-regression-bch-long:\ntest-regression-ldpc:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nretry: 1\nexcept:\n- schedules\n@@ -518,6 +524,8 @@ test-regression-ldpc:\ntest-regression-ldpc-long:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nonly:\n- schedules\ndependencies:\n@@ -544,6 +552,8 @@ test-regression-ldpc-long:\ntest-regression-polar:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nretry: 1\nexcept:\n- schedules\n@@ -569,6 +579,8 @@ test-regression-polar:\ntest-regression-polar-long:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nonly:\n- schedules\ndependencies:\n@@ -594,6 +606,8 @@ test-regression-polar-long:\ntest-regression-rs:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nretry: 1\nexcept:\n- schedules\n@@ -618,6 +632,8 @@ test-regression-rs:\ntest-regression-rs-long:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nonly:\n- schedules\ndependencies:\n@@ -643,6 +659,8 @@ test-regression-rs-long:\ntest-regression-turbo:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nretry: 1\nexcept:\n- schedules\n@@ -668,6 +686,8 @@ test-regression-turbo:\ntest-regression-turbo-long:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nonly:\n- schedules\ndependencies:\n@@ -693,6 +713,8 @@ test-regression-turbo-long:\ntest-regression-turbo-db:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nretry: 1\nexcept:\n- schedules\n@@ -718,6 +740,8 @@ test-regression-turbo-db:\ntest-regression-turbo-db-long:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nonly:\n- schedules\ndependencies:\n@@ -743,6 +767,8 @@ test-regression-turbo-db-long:\ntest-regression-turbo-prod:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nretry: 1\nexcept:\n- schedules\n@@ -768,6 +794,8 @@ test-regression-turbo-prod:\ntest-regression-turbo-prod-long:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nonly:\n- schedules\ndependencies:\n@@ -793,6 +821,8 @@ test-regression-turbo-prod-long:\ntest-regression-uncoded:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nretry: 1\nexcept:\n- schedules\n@@ -817,6 +847,8 @@ test-regression-uncoded:\ntest-regression-uncoded-long:\nstage: test\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\nonly:\n- schedules\ndependencies:\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: fix previous commit.
8,490
09.01.2019 13:42:42
-3,600
b31f1ac4b40d632b7a81b22d33c9503e6e3bcb0e
CI: be more precise on Python versions.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -438,7 +438,7 @@ documentation-check:\n- x86\n- 64-bit\n- sse4.2\n- - python\n+ - python3.5\nscript:\n- ./ci/documentation-check.py --aff3ct \"build_linux_gcc_x64_sse4.2/bin/aff3ct\"\n@@ -456,7 +456,7 @@ test-regression-bch:\n- x86\n- 64-bit\n- sse4.2\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-bch\nwhen: always\n@@ -483,7 +483,7 @@ test-regression-bch-long:\n- avx2\n- powerful\n- schedules\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-bch\nwhen: always\n@@ -510,7 +510,7 @@ test-regression-ldpc:\n- 64-bit\n- sse4.2\n- powerful\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-ldpc\nwhen: always\n@@ -537,7 +537,7 @@ test-regression-ldpc-long:\n- avx2\n- powerful\n- schedules\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-ldpc\nwhen: always\n@@ -565,7 +565,7 @@ test-regression-polar:\n- 64-bit\n- sse4.2\n- powerful\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-polar\nwhen: always\n@@ -592,7 +592,7 @@ test-regression-polar-long:\n- avx2\n- powerful\n- schedules\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-polar\nwhen: always\n@@ -618,7 +618,7 @@ test-regression-rs:\n- x86\n- 64-bit\n- sse4.2\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-rs\nwhen: always\n@@ -645,7 +645,7 @@ test-regression-rs-long:\n- avx2\n- powerful\n- schedules\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-rs\nwhen: always\n@@ -672,7 +672,7 @@ test-regression-turbo:\n- 64-bit\n- sse4.2\n- powerful\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-turbo\nwhen: always\n@@ -699,7 +699,7 @@ test-regression-turbo-long:\n- avx2\n- powerful\n- schedules\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-turbo\nwhen: always\n@@ -726,7 +726,7 @@ test-regression-turbo-db:\n- 64-bit\n- sse4.2\n- powerful\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-turbo-db\nwhen: always\n@@ -753,7 +753,7 @@ test-regression-turbo-db-long:\n- avx2\n- powerful\n- schedules\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-turbo-db\nwhen: always\n@@ -780,7 +780,7 @@ test-regression-turbo-prod:\n- 64-bit\n- sse4.2\n- powerful\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-turbo-prod\nwhen: always\n@@ -807,7 +807,7 @@ test-regression-turbo-prod-long:\n- avx2\n- powerful\n- schedules\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-turbo-prod\nwhen: always\n@@ -833,7 +833,7 @@ test-regression-uncoded:\n- x86\n- 64-bit\n- sse4.2\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-uncoded\nwhen: always\n@@ -860,7 +860,7 @@ test-regression-uncoded-long:\n- avx2\n- powerful\n- schedules\n- - python\n+ - python3.4\nartifacts:\nname: test-regression-results-uncoded\nwhen: always\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: be more precise on Python versions.
8,490
09.01.2019 15:40:12
-3,600
335d87124801fdd6294bcf18583c010811e0f404
Doc: improve the '--enc-kernel' and '--enc-code-path' descriptions.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar_mk/encoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar_mk/encoder.rst", "diff": "@@ -55,6 +55,10 @@ Description of the allowed values:\n|factory::Encoder_polar_MK::parameters::p+kernel|\n+The Kronecker powers of the kernel matrix :math:`T_s` defines the :math:`G`\n+generator matrix. The frame size :math:`N` can only be a power of the matrix\n+size :math:`s`. For traditional Polar codes :math:`s = 2`.\n+\n.. _enc-polar_mk-enc-code-path:\n``--enc-code-path``\n@@ -91,9 +95,13 @@ An |ASCII| file is expected:\n# type of kernel per stage\n0 0 0 0 1\n-The previous file describes a :math:`N = 48` Polar |MK| code with the following\n-construction:\n-:math:`G_{48} = T_2 \\otimes T_2 \\otimes T_2 \\otimes T_2 \\otimes T_3`.\n+The previous file describes a Polar |MK| code which is build from the following\n+Kronecker product:\n+:math:`G_{48} = T_2 \\otimes T_2 \\otimes T_2 \\otimes T_2 \\otimes T_3` with\n+:math:`N = 2 \\times 2 \\times 2 \\times 2 \\times 3 = 48.`\n+\n+.. note:: When this parameter is used it overrides the\n+ :ref:`enc-polar_mk-enc-kernel` parameter.\n.. _enc-polar_mk-enc-fb-gen-method:\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: improve the '--enc-kernel' and '--enc-code-path' descriptions.
8,490
09.01.2019 15:41:11
-3,600
164efd60b28b6c141583b3a74b1fd95777691a23
Smooth compiler options display.
[ { "change_type": "MODIFY", "old_path": "src/main.cpp", "new_path": "src/main.cpp", "diff": "@@ -142,16 +142,16 @@ void print_version()\nstd::cout << \"aff3ct (\" << os << prec << \", \" << compiler << \"-\" << compiler_version << \", \"\n<< mipp::InstructionFullType << \") \" << affect_version << std::endl;\nstd::cout << \"Compilation options:\" << std::endl;\n- std::cout << \" * Precision: \" << precision << std::endl;\n- std::cout << \" * Polar bit packing: \" << bit_packing << std::endl;\n- std::cout << \" * Polar bounds: \" << polar_bounds << std::endl;\n- std::cout << \" * Terminal colors: \" << terminal_colors << std::endl;\n- std::cout << \" * Backtrace: \" << backtrace << std::endl;\n- std::cout << \" * External strings: \" << ext_strings << std::endl;\n- std::cout << \" * MPI: \" << mpi << std::endl;\n- std::cout << \" * GSL: \" << gsl << std::endl;\n- std::cout << \" * MKL: \" << mkl << std::endl;\n- std::cout << \" * SystemC: \" << systemc << std::endl;\n+ std::cout << \" - Precision: \" << precision << std::endl;\n+ std::cout << \" - Polar bit packing: \" << bit_packing << std::endl;\n+ std::cout << \" - Polar bounds: \" << polar_bounds << std::endl;\n+ std::cout << \" - Terminal colors: \" << terminal_colors << std::endl;\n+ std::cout << \" - Backtrace: \" << backtrace << std::endl;\n+ std::cout << \" - External strings: \" << ext_strings << std::endl;\n+ std::cout << \" - MPI: \" << mpi << std::endl;\n+ std::cout << \" - GSL: \" << gsl << std::endl;\n+ std::cout << \" - MKL: \" << mkl << std::endl;\n+ std::cout << \" - SystemC: \" << systemc << std::endl;\nstd::cout << \"Copyright (c) 2016-2019 - MIT license.\" << std::endl;\nstd::cout << \"This is free software; see the source for copying conditions. There is NO\" << std::endl;\nstd::cout << \"warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\" << std::endl;\n" } ]
C++
MIT License
aff3ct/aff3ct
Smooth compiler options display.
8,490
09.01.2019 16:02:34
-3,600
b5e7fd3068694b96216f0ff91bbd0db5bae597c7
Quiet find_package.
[ { "change_type": "MODIFY", "old_path": "CMakeLists.txt", "new_path": "CMakeLists.txt", "diff": "@@ -350,14 +350,14 @@ if (AFF3CT_SYSTEMC_SIMU OR AFF3CT_SYSTEMC_MODULE)\naff3ct_add_definitions (\"-DAFF3CT_SYSTEMC_MODULE\")\nendif ()\n- find_package (SystemC REQUIRED)\n+ find_package (SystemC REQUIRED QUIET)\nif (SystemC_FOUND)\nmessage(STATUS \"AFF3CT - Library found: SystemC\")\naff3ct_include_directories (${SystemC_INCLUDE_DIRS})\naff3ct_link_libraries (\"${SystemC_LIBRARIES}\")\nendif (SystemC_FOUND)\n- find_package (TLM REQUIRED)\n+ find_package (TLM REQUIRED QUIET)\nif (TLM_FOUND)\nmessage(STATUS \"AFF3CT - Library found: TLM\")\naff3ct_include_directories (${TLM_INCLUDE_DIRS})\n@@ -368,7 +368,7 @@ endif ()\nif (AFF3CT_LINK_GSL)\naff3ct_add_definitions(\"-DAFF3CT_CHANNEL_GSL\")\n- find_package (GSL REQUIRED)\n+ find_package (GSL REQUIRED QUIET)\nif (GSL_FOUND)\nmessage(STATUS \"AFF3CT - Library found: GSL\")\naff3ct_include_directories (${GSL_INCLUDE_DIRS})\n@@ -381,7 +381,7 @@ if (AFF3CT_LINK_MKL)\naff3ct_add_definitions(\"-DAFF3CT_CHANNEL_MKL\")\n# set (MKL_STATIC ON)\n- find_package (MKL REQUIRED)\n+ find_package (MKL REQUIRED QUIET)\nif (MKL_FOUND)\nmessage(STATUS \"AFF3CT - Library found: MKL\")\naff3ct_include_directories (${MKL_INCLUDE_DIRS})\n@@ -393,7 +393,7 @@ endif (AFF3CT_LINK_MKL)\nif (AFF3CT_MPI)\naff3ct_add_definitions (\"-DAFF3CT_ENABLE_MPI\")\n- find_package (MPI REQUIRED)\n+ find_package (MPI REQUIRED QUIET)\nif (MPI_CXX_FOUND)\nmessage(STATUS \"AFF3CT - Library found: MPI\")\n" }, { "change_type": "MODIFY", "old_path": "cmake/Modules/FindGSL.cmake", "new_path": "cmake/Modules/FindGSL.cmake", "diff": "@@ -113,7 +113,9 @@ else( WIN32 AND NOT CYGWIN AND NOT MSYS )\nMARK_AS_ADVANCED(\nGSL_CFLAGS\n)\n+ if( NOT GSL_FIND_QUIETLY )\nmessage( STATUS \"Using GSL from ${GSL_PREFIX}\" )\n+ endif()\nelse( GSL_CONFIG_EXECUTABLE )\nmessage( STATUS \"FindGSL: gsl-config not found.\")\nendif( GSL_CONFIG_EXECUTABLE )\n" } ]
C++
MIT License
aff3ct/aff3ct
Quiet find_package.
8,490
12.01.2019 09:52:56
-3,600
c725bd5cc9b1211a910611395237f8bb7ea784e2
CI: replace multiple long regression tests by one big job.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -468,32 +468,32 @@ test-regression-bch:\n- export TIME_SEC=\"5\"\n- ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-test-regression-bch-long:\n- stage: test\n- variables:\n- GIT_SUBMODULE_STRATEGY: recursive\n- only:\n- - schedules\n- dependencies:\n- - build-linux-gcc-x64-avx2\n- tags:\n- - linux\n- - x86\n- - 64-bit\n- - avx2\n- - powerful\n- - schedules\n- - python3.4\n- artifacts:\n- name: test-regression-results-bch\n- when: always\n- paths:\n- - test-regression-results-bch/\n- script:\n- - source ./ci/tools/threads.sh\n- - source ./ci/tools/git-version.sh\n- - export TIME_SEC=$CI_TIME_SEC_BCH\n- - ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+# test-regression-bch-long:\n+# stage: test\n+# variables:\n+# GIT_SUBMODULE_STRATEGY: recursive\n+# only:\n+# - schedules\n+# dependencies:\n+# - build-linux-gcc-x64-avx2\n+# tags:\n+# - linux\n+# - x86\n+# - 64-bit\n+# - avx2\n+# - powerful\n+# - schedules\n+# - python3.4\n+# artifacts:\n+# name: test-regression-results-bch\n+# when: always\n+# paths:\n+# - test-regression-results-bch/\n+# script:\n+# - source ./ci/tools/threads.sh\n+# - source ./ci/tools/git-version.sh\n+# - export TIME_SEC=$CI_TIME_SEC_TEST_LONG_BCH\n+# - ./ci/test-regression.py --refs-path refs/BCH --results-path test-regression-results-bch --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-ldpc:\nstage: test\n@@ -522,33 +522,32 @@ test-regression-ldpc:\n- export TIME_SEC=\"10\"\n- ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-test-regression-ldpc-long:\n- stage: test\n- variables:\n- GIT_SUBMODULE_STRATEGY: recursive\n- only:\n- - schedules\n- dependencies:\n- - build-linux-gcc-x64-avx2\n- tags:\n- - linux\n- - x86\n- - 64-bit\n- - avx2\n- - powerful\n- - schedules\n- - python3.4\n- artifacts:\n- name: test-regression-results-ldpc\n- when: always\n- paths:\n- - test-regression-results-ldpc/\n- script:\n- - source ./ci/tools/threads.sh\n- - source ./ci/tools/git-version.sh\n- - export TIME_SEC=$CI_TIME_SEC_LDPC\n- - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-\n+# test-regression-ldpc-long:\n+# stage: test\n+# variables:\n+# GIT_SUBMODULE_STRATEGY: recursive\n+# only:\n+# - schedules\n+# dependencies:\n+# - build-linux-gcc-x64-avx2\n+# tags:\n+# - linux\n+# - x86\n+# - 64-bit\n+# - avx2\n+# - powerful\n+# - schedules\n+# - python3.4\n+# artifacts:\n+# name: test-regression-results-ldpc\n+# when: always\n+# paths:\n+# - test-regression-results-ldpc/\n+# script:\n+# - source ./ci/tools/threads.sh\n+# - source ./ci/tools/git-version.sh\n+# - export TIME_SEC=$CI_TIME_SEC_TEST_LONG_LDPC\n+# - ./ci/test-regression.py --refs-path refs/LDPC --results-path test-regression-results-ldpc --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-polar:\nstage: test\n@@ -577,32 +576,32 @@ test-regression-polar:\n- export TIME_SEC=\"5\"\n- ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-test-regression-polar-long:\n- stage: test\n- variables:\n- GIT_SUBMODULE_STRATEGY: recursive\n- only:\n- - schedules\n- dependencies:\n- - build-linux-gcc-x64-avx2\n- tags:\n- - linux\n- - x86\n- - 64-bit\n- - avx2\n- - powerful\n- - schedules\n- - python3.4\n- artifacts:\n- name: test-regression-results-polar\n- when: always\n- paths:\n- - test-regression-results-polar/\n- script:\n- - source ./ci/tools/threads.sh\n- - source ./ci/tools/git-version.sh\n- - export TIME_SEC=$CI_TIME_SEC_POLAR\n- - ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+# test-regression-polar-long:\n+# stage: test\n+# variables:\n+# GIT_SUBMODULE_STRATEGY: recursive\n+# only:\n+# - schedules\n+# dependencies:\n+# - build-linux-gcc-x64-avx2\n+# tags:\n+# - linux\n+# - x86\n+# - 64-bit\n+# - avx2\n+# - powerful\n+# - schedules\n+# - python3.4\n+# artifacts:\n+# name: test-regression-results-polar\n+# when: always\n+# paths:\n+# - test-regression-results-polar/\n+# script:\n+# - source ./ci/tools/threads.sh\n+# - source ./ci/tools/git-version.sh\n+# - export TIME_SEC=$CI_TIME_SEC_TEST_LONG_POLAR\n+# - ./ci/test-regression.py --refs-path refs/POLAR --results-path test-regression-results-polar --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-rs:\nstage: test\n@@ -630,32 +629,32 @@ test-regression-rs:\n- export TIME_SEC=\"5\"\n- ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-test-regression-rs-long:\n- stage: test\n- variables:\n- GIT_SUBMODULE_STRATEGY: recursive\n- only:\n- - schedules\n- dependencies:\n- - build-linux-gcc-x64-avx2\n- tags:\n- - linux\n- - x86\n- - 64-bit\n- - avx2\n- - powerful\n- - schedules\n- - python3.4\n- artifacts:\n- name: test-regression-results-rs\n- when: always\n- paths:\n- - test-regression-results-rs/\n- script:\n- - source ./ci/tools/threads.sh\n- - source ./ci/tools/git-version.sh\n- - export TIME_SEC=$CI_TIME_SEC_RS\n- - ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+# test-regression-rs-long:\n+# stage: test\n+# variables:\n+# GIT_SUBMODULE_STRATEGY: recursive\n+# only:\n+# - schedules\n+# dependencies:\n+# - build-linux-gcc-x64-avx2\n+# tags:\n+# - linux\n+# - x86\n+# - 64-bit\n+# - avx2\n+# - powerful\n+# - schedules\n+# - python3.4\n+# artifacts:\n+# name: test-regression-results-rs\n+# when: always\n+# paths:\n+# - test-regression-results-rs/\n+# script:\n+# - source ./ci/tools/threads.sh\n+# - source ./ci/tools/git-version.sh\n+# - export TIME_SEC=$CI_TIME_SEC_TEST_LONG_RS\n+# - ./ci/test-regression.py --refs-path refs/RS --results-path test-regression-results-rs --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo:\nstage: test\n@@ -684,32 +683,32 @@ test-regression-turbo:\n- export TIME_SEC=\"5\"\n- ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-test-regression-turbo-long:\n- stage: test\n- variables:\n- GIT_SUBMODULE_STRATEGY: recursive\n- only:\n- - schedules\n- dependencies:\n- - build-linux-gcc-x64-avx2\n- tags:\n- - linux\n- - x86\n- - 64-bit\n- - avx2\n- - powerful\n- - schedules\n- - python3.4\n- artifacts:\n- name: test-regression-results-turbo\n- when: always\n- paths:\n- - test-regression-results-turbo/\n- script:\n- - source ./ci/tools/threads.sh\n- - source ./ci/tools/git-version.sh\n- - export TIME_SEC=$CI_TIME_SEC_TURBO\n- - ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+# test-regression-turbo-long:\n+# stage: test\n+# variables:\n+# GIT_SUBMODULE_STRATEGY: recursive\n+# only:\n+# - schedules\n+# dependencies:\n+# - build-linux-gcc-x64-avx2\n+# tags:\n+# - linux\n+# - x86\n+# - 64-bit\n+# - avx2\n+# - powerful\n+# - schedules\n+# - python3.4\n+# artifacts:\n+# name: test-regression-results-turbo\n+# when: always\n+# paths:\n+# - test-regression-results-turbo/\n+# script:\n+# - source ./ci/tools/threads.sh\n+# - source ./ci/tools/git-version.sh\n+# - export TIME_SEC=$CI_TIME_SEC_TEST_LONG_TURBO\n+# - ./ci/test-regression.py --refs-path refs/TURBO --results-path test-regression-results-turbo --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo-db:\nstage: test\n@@ -738,32 +737,32 @@ test-regression-turbo-db:\n- export TIME_SEC=\"5\"\n- ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-test-regression-turbo-db-long:\n- stage: test\n- variables:\n- GIT_SUBMODULE_STRATEGY: recursive\n- only:\n- - schedules\n- dependencies:\n- - build-linux-gcc-x64-avx2\n- tags:\n- - linux\n- - x86\n- - 64-bit\n- - avx2\n- - powerful\n- - schedules\n- - python3.4\n- artifacts:\n- name: test-regression-results-turbo-db\n- when: always\n- paths:\n- - test-regression-results-turbo-db/\n- script:\n- - source ./ci/tools/threads.sh\n- - source ./ci/tools/git-version.sh\n- - export TIME_SEC=$CI_TIME_SEC_TURBO_DB\n- - ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+# test-regression-turbo-db-long:\n+# stage: test\n+# variables:\n+# GIT_SUBMODULE_STRATEGY: recursive\n+# only:\n+# - schedules\n+# dependencies:\n+# - build-linux-gcc-x64-avx2\n+# tags:\n+# - linux\n+# - x86\n+# - 64-bit\n+# - avx2\n+# - powerful\n+# - schedules\n+# - python3.4\n+# artifacts:\n+# name: test-regression-results-turbo-db\n+# when: always\n+# paths:\n+# - test-regression-results-turbo-db/\n+# script:\n+# - source ./ci/tools/threads.sh\n+# - source ./ci/tools/git-version.sh\n+# - export TIME_SEC=$CI_TIME_SEC_TEST_LONG_TURBO_DB\n+# - ./ci/test-regression.py --refs-path refs/TURBO_DB --results-path test-regression-results-turbo-db --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-turbo-prod:\nstage: test\n@@ -792,32 +791,32 @@ test-regression-turbo-prod:\n- export TIME_SEC=\"30\"\n- ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-test-regression-turbo-prod-long:\n- stage: test\n- variables:\n- GIT_SUBMODULE_STRATEGY: recursive\n- only:\n- - schedules\n- dependencies:\n- - build-linux-gcc-x64-avx2\n- tags:\n- - linux\n- - x86\n- - 64-bit\n- - avx2\n- - powerful\n- - schedules\n- - python3.4\n- artifacts:\n- name: test-regression-results-turbo-prod\n- when: always\n- paths:\n- - test-regression-results-turbo-prod/\n- script:\n- - source ./ci/tools/threads.sh\n- - source ./ci/tools/git-version.sh\n- - export TIME_SEC=$CI_TIME_SEC_TURBO_PROD\n- - ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+# test-regression-turbo-prod-long:\n+# stage: test\n+# variables:\n+# GIT_SUBMODULE_STRATEGY: recursive\n+# only:\n+# - schedules\n+# dependencies:\n+# - build-linux-gcc-x64-avx2\n+# tags:\n+# - linux\n+# - x86\n+# - 64-bit\n+# - avx2\n+# - powerful\n+# - schedules\n+# - python3.4\n+# artifacts:\n+# name: test-regression-results-turbo-prod\n+# when: always\n+# paths:\n+# - test-regression-results-turbo-prod/\n+# script:\n+# - source ./ci/tools/threads.sh\n+# - source ./ci/tools/git-version.sh\n+# - export TIME_SEC=$CI_TIME_SEC_TEST_LONG_TURBO_PROD\n+# - ./ci/test-regression.py --refs-path refs/TURBO_PROD --results-path test-regression-results-turbo-prod --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-regression-uncoded:\nstage: test\n@@ -845,7 +844,34 @@ test-regression-uncoded:\n- export TIME_SEC=\"5\"\n- ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_sse4.2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n-test-regression-uncoded-long:\n+# test-regression-uncoded-long:\n+# stage: test\n+# variables:\n+# GIT_SUBMODULE_STRATEGY: recursive\n+# only:\n+# - schedules\n+# dependencies:\n+# - build-linux-gcc-x64-avx2\n+# tags:\n+# - linux\n+# - x86\n+# - 64-bit\n+# - avx2\n+# - powerful\n+# - schedules\n+# - python3.4\n+# artifacts:\n+# name: test-regression-results-uncoded\n+# when: always\n+# paths:\n+# - test-regression-results-uncoded/\n+# script:\n+# - source ./ci/tools/threads.sh\n+# - source ./ci/tools/git-version.sh\n+# - export TIME_SEC=$CI_TIME_SEC_TEST_LONG_UNCODED\n+# - ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+\n+test-regression-long:\nstage: test\nvariables:\nGIT_SUBMODULE_STRATEGY: recursive\n@@ -862,15 +888,15 @@ test-regression-uncoded-long:\n- schedules\n- python3.4\nartifacts:\n- name: test-regression-results-uncoded\n+ name: test-regression-long-results\nwhen: always\npaths:\n- - test-regression-results-uncoded/\n+ - test-regression-long-results/\nscript:\n- source ./ci/tools/threads.sh\n- source ./ci/tools/git-version.sh\n- - export TIME_SEC=$CI_TIME_SEC_UNCODED\n- - ./ci/test-regression.py --refs-path refs/UNCODED --results-path test-regression-results-uncoded --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\n+ - export TIME_SEC=$CI_TIME_SEC_TEST_LONG\n+ - ./ci/test-regression.py --refs-path refs --results-path test-regression-long-results --build-path build_linux_gcc_x64_avx2 --binary-path bin/aff3ct-$GIT_VERSION --max-snr-time $TIME_SEC --sensibility 2.5 --weak-rate 0.9 --verbose 1 --n-threads $THREADS\ntest-build-coverage-regression:\nstage: test\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: replace multiple long regression tests by one big job.
8,490
14.01.2019 17:05:48
-3,600
59f57941cb0f03adae599f60df66052f3c3910f9
CI: run deploy jobs only on the public Gitlab CI.
[ { "change_type": "MODIFY", "old_path": "ci/deploy-builds-linux.sh", "new_path": "ci/deploy-builds-linux.sh", "diff": "#!/bin/bash\nset -x\n+if [ \"$CI_PROJECT_URL\" == \"https://gitlab.com/aff3ct/aff3ct\" ]\n+then\n+\nif [ -z \"$GIT_BRANCH\" ]\nthen\necho \"Please define the 'GIT_BRANCH' environment variable.\"\n@@ -164,3 +167,7 @@ git add -f download/download_${GIT_BRANCH}.csv\ngit commit -m \"Automatic: add new AFF3CT builds ($GIT_BRANCH: $GIT_HASH).\"\ngit push origin master\nrc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n+\n+else\n+ echo \"This job is done only on the public CI: https://gitlab.com/aff3ct/aff3ct/pipelines.\"\n+fi\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "ci/deploy-sonarqube-linux.sh", "new_path": "ci/deploy-sonarqube-linux.sh", "diff": "#!/bin/bash\nset -x\n+if [ \"$CI_PROJECT_URL\" == \"https://gitlab.com/aff3ct/aff3ct\" ]\n+then\n+\nif [ -z \"$SONARQUBE_TOKEN\" ]\nthen\necho \"The SONARQUBE_TOKEN environment variable is not defined!\"\n@@ -29,10 +32,14 @@ echo \"sonar.sources=./src/\" >> sona\necho \"sonar.exclusions=**/date.h, **/dirent.h\" >> sonar-project.properties\necho \"sonar.links.homepage=https://aff3ct.github.io/\" >> sonar-project.properties\necho \"sonar.links.scm=https://github.com/aff3ct/aff3ct/tree/$GIT_BRANCH\" >> sonar-project.properties\n-echo \"sonar.links.ci=https://gitlab.inria.fr/fec/aff3ct/pipelines\" >> sonar-project.properties\n+ echo \"sonar.links.ci=https://gitlab.com/aff3ct/aff3ct/pipelines\" >> sonar-project.properties\necho \"sonar.links.issue=https://github.com/aff3ct/aff3ct/issues\" >> sonar-project.properties\necho \"sonar.language=c++\" >> sonar-project.properties\necho \"sonar.cxx.cppcheck.reportPath=cppcheck/cppcheck.xml\" >> sonar-project.properties\necho \"sonar.cxx.coverage.reportPath=code_coverage_report/aff3ct.xml\" >> sonar-project.properties\nsonar-scanner\n+\n+else\n+ echo \"This job is done only on the public CI: https://gitlab.com/aff3ct/aff3ct/pipelines.\"\n+fi\n\\ No newline at end of file\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: run deploy jobs only on the public Gitlab CI.
8,490
14.01.2019 22:07:36
-3,600
bae0b03ae86268f7dbc6c7879a9b165dac868e0d
Update the coverage link.
[ { "change_type": "MODIFY", "old_path": "README.rst", "new_path": "README.rst", "diff": "@@ -100,7 +100,7 @@ External Links\n.. _PipelineBadge: https://gitlab.com/aff3ct/aff3ct/pipelines\n.. |CoverageBadge| image:: https://gitlab.com/aff3ct/aff3ct/badges/master/coverage.svg\n-.. _CoverageBadge: https://gitlab.com/aff3ct/aff3ct/pipelines\n+.. _CoverageBadge: https://sonarqube.bordeaux.inria.fr/sonarqube/dashboard?id=storm%3Aaff3ct%3Agitlab%3Amaster\n.. |DocBadge| image:: https://img.shields.io/readthedocs/aff3ct.svg\n.. _DocBadge: https://readthedocs.org/projects/aff3ct/\n" } ]
C++
MIT License
aff3ct/aff3ct
Update the coverage link.
8,490
15.01.2019 10:19:52
-3,600
1bdb52667f771b54d861f4d060fa0c2a7f5e1374
Doc: do not show the README in the doc anymore as there is svg images.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/index.rst", "new_path": "doc/sphinx/source/index.rst", "diff": "@@ -25,9 +25,9 @@ AFF3CT Documentation\n:maxdepth: 1\n:numbered:\n- others/readme/readme\nothers/tips/tips\nothers/license/license\n+.. others/readme/readme\n.. Indices and tables\n.. ==================\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: do not show the README in the doc anymore as there is svg images.
8,490
15.01.2019 10:22:03
-3,600
0887ab48ec40d76d5eb853cc723f563ffc664200
Add SonarQube badges.
[ { "change_type": "MODIFY", "old_path": "README.rst", "new_path": "README.rst", "diff": "AFF3CT: A Fast Forward Error Correction Toolbox!\n================================================\n-|PipelineBadge|_ |CoverageBadge|_ |DocBadge|_ |ReleaseBadge|_ |LicenseBadge|_ |DOIBadge|_\n+|PipelineBadge|_ |DocBadge|_ |QualityGateBadge|_ |CoverageBadge|_ |CodeLinesBadge|_ |ReleaseBadge|_ |DOIBadge|_ |LicenseBadge|_\n**AFF3CT** is a simulator dedicated to the Forward Error Correction (FEC or\n**channel coding**). It is written in **C++** and it supports a large range of\n@@ -99,17 +99,23 @@ External Links\n.. |PipelineBadge| image:: https://img.shields.io/gitlab/pipeline/aff3ct/aff3ct.svg\n.. _PipelineBadge: https://gitlab.com/aff3ct/aff3ct/pipelines\n-.. |CoverageBadge| image:: https://gitlab.com/aff3ct/aff3ct/badges/master/coverage.svg\n-.. _CoverageBadge: https://sonarqube.bordeaux.inria.fr/sonarqube/dashboard?id=storm%3Aaff3ct%3Agitlab%3Amaster\n-\n.. |DocBadge| image:: https://img.shields.io/readthedocs/aff3ct.svg\n.. _DocBadge: https://readthedocs.org/projects/aff3ct/\n+.. |QualityGateBadge| image:: https://sonarqube.bordeaux.inria.fr/sonarqube/api/badges/gate?key=storm%3Aaff3ct%3Agitlab%3Amaster\n+.. _QualityGateBadge: https://sonarqube.bordeaux.inria.fr/sonarqube/dashboard?id=storm%3Aaff3ct%3Agitlab%3Amaster\n+\n+.. |CoverageBadge| image:: https://sonarqube.bordeaux.inria.fr/sonarqube/api/badges/measure?key=storm%3Aaff3ct%3Agitlab%3Amaster&metric=coverage\n+.. _CoverageBadge: https://sonarqube.bordeaux.inria.fr/sonarqube/dashboard?id=storm%3Aaff3ct%3Agitlab%3Amaster\n+\n+.. |CodeLinesBadge| image:: https://sonarqube.bordeaux.inria.fr/sonarqube/api/badges/measure?key=storm%3Aaff3ct%3Agitlab%3Amaster&metric=ncloc\n+.. _CodeLinesBadge: https://sonarqube.bordeaux.inria.fr/sonarqube/dashboard?id=storm%3Aaff3ct%3Agitlab%3Amaster\n+\n.. |ReleaseBadge| image:: https://img.shields.io/github/release/aff3ct/aff3ct.svg\n.. _ReleaseBadge: https://github.com/aff3ct/aff3ct/releases\n-.. |LicenseBadge| image:: https://img.shields.io/github/license/aff3ct/aff3ct.svg\n-.. _LicenseBadge: ./LICENSE\n-\n.. |DOIBadge| image:: https://zenodo.org/badge/60615913.svg\n.. _DOIBadge: https://zenodo.org/badge/latestdoi/60615913\n+\n+.. |LicenseBadge| image:: https://img.shields.io/github/license/aff3ct/aff3ct.svg\n+.. _LicenseBadge: ./LICENSE\n" } ]
C++
MIT License
aff3ct/aff3ct
Add SonarQube badges.
8,490
15.01.2019 10:37:14
-3,600
ca47d7bba81fb1d5ee2352e5948417f31ccc0931
Doc: compile the 'Others' section only for html.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/index.rst", "new_path": "doc/sphinx/source/index.rst", "diff": "@@ -20,14 +20,16 @@ AFF3CT Documentation\ndeveloper/classes/classes\ndeveloper/contributing/contributing\n+.. only:: html\n+\n.. toctree::\n:caption: Others\n:maxdepth: 1\n:numbered:\n+ others/readme/readme\nothers/tips/tips\nothers/license/license\n-.. others/readme/readme\n.. Indices and tables\n.. ==================\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: compile the 'Others' section only for html.
8,490
15.01.2019 14:24:26
-3,600
1511f140c8a28d74fded6f45957768319b06c909
Rm SonarQube badges as there are incompatible with GitHub README display.
[ { "change_type": "MODIFY", "old_path": "README.rst", "new_path": "README.rst", "diff": "AFF3CT: A Fast Forward Error Correction Toolbox!\n================================================\n-|PipelineBadge|_ |DocBadge|_ |QualityGateBadge|_ |CoverageBadge|_ |CodeLinesBadge|_ |ReleaseBadge|_ |DOIBadge|_ |LicenseBadge|_\n+|PipelineBadge|_ |CoverageBadge|_ |DocBadge|_ |ReleaseBadge|_ |DOIBadge|_ |LicenseBadge|_\n**AFF3CT** is a simulator dedicated to the Forward Error Correction (FEC or\n**channel coding**). It is written in **C++** and it supports a large range of\n@@ -99,17 +99,11 @@ External Links\n.. |PipelineBadge| image:: https://img.shields.io/gitlab/pipeline/aff3ct/aff3ct.svg\n.. _PipelineBadge: https://gitlab.com/aff3ct/aff3ct/pipelines\n-.. |DocBadge| image:: https://img.shields.io/readthedocs/aff3ct.svg\n-.. _DocBadge: https://readthedocs.org/projects/aff3ct/\n-\n-.. |QualityGateBadge| image:: https://sonarqube.bordeaux.inria.fr/sonarqube/api/badges/gate?key=storm%3Aaff3ct%3Agitlab%3Amaster\n-.. _QualityGateBadge: https://sonarqube.bordeaux.inria.fr/sonarqube/dashboard?id=storm%3Aaff3ct%3Agitlab%3Amaster\n-\n-.. |CoverageBadge| image:: https://sonarqube.bordeaux.inria.fr/sonarqube/api/badges/measure?key=storm%3Aaff3ct%3Agitlab%3Amaster&metric=coverage\n+.. |CoverageBadge| image:: https://gitlab.com/aff3ct/aff3ct/badges/master/coverage.svg\n.. _CoverageBadge: https://sonarqube.bordeaux.inria.fr/sonarqube/dashboard?id=storm%3Aaff3ct%3Agitlab%3Amaster\n-.. |CodeLinesBadge| image:: https://sonarqube.bordeaux.inria.fr/sonarqube/api/badges/measure?key=storm%3Aaff3ct%3Agitlab%3Amaster&metric=ncloc\n-.. _CodeLinesBadge: https://sonarqube.bordeaux.inria.fr/sonarqube/dashboard?id=storm%3Aaff3ct%3Agitlab%3Amaster\n+.. |DocBadge| image:: https://img.shields.io/readthedocs/aff3ct.svg\n+.. _DocBadge: https://readthedocs.org/projects/aff3ct/\n.. |ReleaseBadge| image:: https://img.shields.io/github/release/aff3ct/aff3ct.svg\n.. _ReleaseBadge: https://github.com/aff3ct/aff3ct/releases\n" } ]
C++
MIT License
aff3ct/aff3ct
Rm SonarQube badges as there are incompatible with GitHub README display.
8,488
15.01.2019 15:22:49
-3,600
9ff1c646d06ba7672188ffd0de051d0300c76fe0
CI: fix display of WRONG test points in result files.
[ { "change_type": "MODIFY", "old_path": "ci/test-regression.py", "new_path": "ci/test-regression.py", "diff": "@@ -54,10 +54,12 @@ def format_e(n):\na = '%.2e' % n\nreturn a\n+\ndef splitFloat(n):\ns = format_e(n).split('e')\nreturn [float(s[0]), int(s[1])]\n+\ndef getFileNames(currentPath, fileNames):\nif os.path.isdir(currentPath):\nif not os.path.exists(currentPath.replace(args.refsPath, args.resultsPath)):\n@@ -453,20 +455,27 @@ for fn in fileNames:\n# print the parameters directly and add to the wrong data the ref values\nidxNoise = 0\ni = 0\n- while( i < len(stdOutput)):\n- l = stdOutput[i]\n- if l.startswith(\"#\"):\n- if \"# End of the simulation.\" not in l:\n- fRes.write(l + \"\\n\")\n+\n+ while \"[trace]\" not in stdOutput[i]:\n+ fRes.write(stdOutput[i] + \"\\n\")\n+ i += 1\n+\n+ fRes.write(stdOutput[i] + \"\\n\")\n+ i += 1\n+\n+ while i < len(stdOutput):\n+ line = stdOutput[i]\n+ if line.startswith(\"#\"):\n+ if \"# End of the simulation.\" not in line:\n+ fRes.write(line + \"\\n\")\nelse:\nem = comp.errorMessage(idxNoise)\n- fRes.write(l + em + \"\\n\")\n+ fRes.write(line + em + \"\\n\")\nidxNoise += 1\ni += 1 # to next line\n-\nfRes.flush()\nprint(\" - %.2f\" %elapsedTime, \"sec\", end=\"\")\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: fix display of WRONG test points in result files.
8,488
15.01.2019 15:38:43
-3,600
506216d745c4ee7837e68af202c07c29bcf6f37c
CI: fix --min-fe argument behaviour.
[ { "change_type": "MODIFY", "old_path": "ci/test-regression.py", "new_path": "ci/test-regression.py", "diff": "@@ -166,16 +166,15 @@ class tableStats:\nreturn float(self.valid) / float(self.nData)\n+\nclass compStats:\n- def __init__(self, dataCur, dataRef, sensibility, asked_n_fe):\n+ def __init__(self, dataCur, dataRef, sensibility, minFE):\nif not isinstance(dataCur, atr.aff3ctTraceReader) or not isinstance(dataRef, atr.aff3ctTraceReader) :\nraise TypeError\n- self.nValidData = len(dataCur.getTrace(\"n_fe\"))\n- for d in range(len(dataCur.getTrace(\"n_fe\"))) :\n- if dataCur.getTrace(\"n_fe\")[d] < asked_n_fe :\n- self.nValidData = d\n-\n+ self.nValidData = 0\n+ while self.nValidData < len(dataCur.getTrace(\"n_fe\")) and dataCur.getTrace(\"n_fe\")[self.nValidData] > minFE:\n+ self.nValidData += 1\nself.dataCur = dataCur\nself.dataRef = dataRef\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: fix --min-fe argument behaviour.
8,488
16.01.2019 17:47:53
-3,600
1ea6d833c8495f821c2b1d8964e8bcbbe77d8155
Modify error detection behaviour with unknown symbols.
[ { "change_type": "MODIFY", "old_path": "src/Tools/Perf/distance/Boolean_diff.hxx", "new_path": "src/Tools/Perf/distance/Boolean_diff.hxx", "diff": "@@ -102,7 +102,7 @@ template<typename B, bool cus>\nB Boolean_diff<B,cus>\n::apply(const B& in1, const B& in2)\n{\n- return (!in1 != !in2) ? (B)1 : (B)0;\n+ return ((in1 != (B)0) ^ (in2 != (B)0)) ? (B)1 : (B)0;\n}\ntemplate<typename B, bool cus>\n@@ -121,9 +121,10 @@ struct Boolean_diff<B,true>\nstatic inline mipp::Reg<B> apply(const mipp::Reg<B>& in1, const mipp::Reg<B>& in2)\n{\nconst mipp::Reg<B> zeros = (B)0, ones = (B)1;\n- auto m_in = in1 != in2;\n- m_in |= is_unknown_symbol<B>(in1) | is_unknown_symbol<B>(in2);\n- return mipp::blend(ones, zeros, m_in);\n+ const auto m_in1 = in1 != zeros;\n+ const auto m_in2 = in2 != zeros;\n+ const auto m_unk = is_unknown_symbol<B>(in1) | is_unknown_symbol<B>(in2);\n+ return mipp::blend(ones, zeros, m_in1 ^ m_in2 | m_unk);\n}\nstatic inline mipp::Reg<B> apply(const mipp::Reg<B>& in)\n@@ -135,7 +136,7 @@ struct Boolean_diff<B,true>\nstatic inline B apply(const B& in1, const B& in2)\n{\n- return (!in1 != !in2) || is_unknown_symbol<B>(in1) || is_unknown_symbol<B>(in2) ? (B)1 : (B)0;\n+ return ((in1 != (B)0) ^ (in2 != (B)0)) || is_unknown_symbol<B>(in1) || is_unknown_symbol<B>(in2) ? (B)1 : (B)0;\n}\nstatic inline B apply(const B& in)\n" } ]
C++
MIT License
aff3ct/aff3ct
Modify error detection behaviour with unknown symbols.
8,490
17.01.2019 16:55:17
-3,600
8474f7e07cc9d14633bfeb2a73fee057b1027c9b
Speedup the monitor reduction process.
[ { "change_type": "MODIFY", "old_path": "src/Module/Monitor/Monitor_reduction.hpp", "new_path": "src/Module/Monitor/Monitor_reduction.hpp", "diff": "@@ -118,6 +118,7 @@ class Monitor_reduction_M : public Monitor_reduction, public M\nprivate:\nconst std::vector<std::unique_ptr<M>>& monitors;\n+ M collecter;\npublic:\n/*\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Monitor/Monitor_reduction.hxx", "new_path": "src/Module/Monitor/Monitor_reduction.hxx", "diff": "@@ -19,7 +19,8 @@ Monitor_reduction_M<M>\nM((_monitors.size() && _monitors.front()) ? *_monitors.front() : M(),\nstd::accumulate(_monitors.begin(), _monitors.end(), 0,\n[](int tot, const std::unique_ptr<M>& m) { return tot + m->get_n_frames(); })),\n- monitors(_monitors)\n+ monitors(_monitors),\n+ collecter(*this)\n{\nif (this->monitors.size() == 0)\n{\n@@ -98,7 +99,16 @@ template <class M>\nvoid Monitor_reduction_M<M>\n::_reduce(bool fully)\n{\n- M collecter(*this);\n+ // Old slow way to collect data (with object allocation)\n+ // M collecter(*this);\n+\n+ // for (auto& m : this->monitors)\n+ // collecter.collect(*m, fully);\n+\n+ // M::copy(collecter, fully);\n+\n+ // New way to collect data (without object allocation)\n+ collecter.reset();\nfor (auto& m : this->monitors)\ncollecter.collect(*m, fully);\n" } ]
C++
MIT License
aff3ct/aff3ct
Speedup the monitor reduction process.
8,490
17.01.2019 22:42:47
-3,600
a375d54d4ce73dbd8f6b3af5f98a017c04c726d3
Fix AFF3CT with MPI which was broken.
[ { "change_type": "MODIFY", "old_path": "CMakeLists.txt", "new_path": "CMakeLists.txt", "diff": "@@ -391,7 +391,7 @@ endif (AFF3CT_LINK_MKL)\n# MPI\nif (AFF3CT_MPI)\n- aff3ct_add_definitions (\"-DAFF3CT_ENABLE_MPI\")\n+ aff3ct_add_definitions (\"-DAFF3CT_MPI\")\nfind_package (MPI REQUIRED QUIET)\nif (MPI_CXX_FOUND)\n" }, { "change_type": "MODIFY", "old_path": "src/main.cpp", "new_path": "src/main.cpp", "diff": "@@ -115,7 +115,7 @@ void print_version()\nstd::string ext_strings = \"off\";\n#endif\n-#if defined(AFF3CT_ENABLE_MPI)\n+#if defined(AFF3CT_MPI)\nstd::string mpi = \"on\";\n#else\nstd::string mpi = \"off\";\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix AFF3CT with MPI which was broken.
8,490
18.01.2019 09:33:35
-3,600
14c58e24edeae5f2008331e088ac054cdb7751a3
Fix the 'aff3ct_include_directories' macro usage with double quotes.
[ { "change_type": "MODIFY", "old_path": "CMakeLists.txt", "new_path": "CMakeLists.txt", "diff": "@@ -353,14 +353,14 @@ if (AFF3CT_SYSTEMC_SIMU OR AFF3CT_SYSTEMC_MODULE)\nfind_package (SystemC REQUIRED QUIET)\nif (SystemC_FOUND)\nmessage(STATUS \"AFF3CT - Library found: SystemC\")\n- aff3ct_include_directories (${SystemC_INCLUDE_DIRS})\n+ aff3ct_include_directories (\"${SystemC_INCLUDE_DIRS}\")\naff3ct_link_libraries (\"${SystemC_LIBRARIES}\")\nendif (SystemC_FOUND)\nfind_package (TLM REQUIRED QUIET)\nif (TLM_FOUND)\nmessage(STATUS \"AFF3CT - Library found: TLM\")\n- aff3ct_include_directories (${TLM_INCLUDE_DIRS})\n+ aff3ct_include_directories (\"${TLM_INCLUDE_DIRS}\")\nendif (TLM_FOUND)\nendif ()\n@@ -371,7 +371,7 @@ if (AFF3CT_LINK_GSL)\nfind_package (GSL REQUIRED QUIET)\nif (GSL_FOUND)\nmessage(STATUS \"AFF3CT - Library found: GSL\")\n- aff3ct_include_directories (${GSL_INCLUDE_DIRS})\n+ aff3ct_include_directories (\"${GSL_INCLUDE_DIRS}\")\naff3ct_link_libraries (\"${GSL_LIBRARIES}\")\nendif (GSL_FOUND)\nendif (AFF3CT_LINK_GSL)\n@@ -384,7 +384,7 @@ if (AFF3CT_LINK_MKL)\nfind_package (MKL REQUIRED QUIET)\nif (MKL_FOUND)\nmessage(STATUS \"AFF3CT - Library found: MKL\")\n- aff3ct_include_directories (${MKL_INCLUDE_DIRS})\n+ aff3ct_include_directories (\"${MKL_INCLUDE_DIRS}\")\naff3ct_link_libraries (\"${MKL_MINIMAL_LIBRARIES}\")\nendif (MKL_FOUND)\nendif (AFF3CT_LINK_MKL)\n@@ -397,7 +397,7 @@ if (AFF3CT_MPI)\nif (MPI_CXX_FOUND)\nmessage(STATUS \"AFF3CT - Library found: MPI\")\n- aff3ct_include_directories (${MPI_CXX_INCLUDE_PATH})\n+ aff3ct_include_directories (\"${MPI_CXX_INCLUDE_PATH}\")\naff3ct_link_libraries (\"${MPI_CXX_LIBRARIES}\")\nif (MPI_CXX_COMPILE_FLAGS)\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix the 'aff3ct_include_directories' macro usage with double quotes.
8,490
18.01.2019 10:44:40
-3,600
0ea9c7cb9a00965be2aff985da0f0c3b2fbeb57b
Reduce the number of reductions in multi-threaded mode.
[ { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/BFER.cpp", "new_path": "src/Simulation/BFER/BFER.cpp", "diff": "@@ -347,12 +347,14 @@ void BFER<B,R,Q>\n#ifdef AFF3CT_MPI\nmodule::Monitor_reduction::set_reduce_frequency(params_BFER.mpi_comm_freq);\n#else\n- module::Monitor_reduction::set_reduce_frequency(std::chrono::milliseconds(0));\n+ auto freq = std::chrono::milliseconds(1000);\n+ if (params_BFER.ter.get() != nullptr && params_BFER.ter->frequency != std::chrono::milliseconds(0))\n+ freq = params_BFER.ter.get()->frequency;\n+ module::Monitor_reduction::set_reduce_frequency(freq);\n#endif\nmodule::Monitor_reduction::reset_all();\nmodule::Monitor_reduction::check_reducible();\n-\n}\ntemplate <typename B, typename R, typename Q>\n" } ]
C++
MIT License
aff3ct/aff3ct
Reduce the number of reductions in multi-threaded mode.
8,490
18.01.2019 11:21:54
-3,600
c8e77160186c1e34e53a17b8007bea5bd3519882
Clean the simulations code.
[ { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/BFER.cpp", "new_path": "src/Simulation/BFER/BFER.cpp", "diff": "@@ -158,7 +158,8 @@ void BFER<B,R,Q>\nif (params_BFER.mpi_rank == 0)\n#endif\n// start the terminal to display BER/FER results\n- if (!params_BFER.ter->disabled && params_BFER.ter->frequency != std::chrono::nanoseconds(0) && !params_BFER.debug)\n+ if (!params_BFER.ter->disabled && params_BFER.ter->frequency != std::chrono::nanoseconds(0) &&\n+ !params_BFER.debug)\nterminal->start_temp_report(params_BFER.ter->frequency);\nthis->t_start_noise_point = std::chrono::steady_clock::now();\n@@ -172,15 +173,14 @@ void BFER<B,R,Q>\n{\nmodule::Monitor_reduction::is_done_all(true, true); // final reduction\n- terminal->final_report(std::cout); // display final report to not lost last line overwritten by the error messages\n-\n+ terminal->final_report(std::cout); // display final report to not lost last line overwritten by the error\n+ // messages\nrang::format_on_each_line(std::cerr, std::string(e.what()) + \"\\n\", rang::tag::error);\nthis->simu_error = true;\ntools::Terminal::stop();\n}\n-\n#ifdef AFF3CT_MPI\nif (params_BFER.mpi_rank == 0)\n#endif\n@@ -285,7 +285,8 @@ std::unique_ptr<typename BFER<B,R,Q>::Monitor_BFER_type> BFER<B,R,Q>\n{\nbool count_unknown_values = params_BFER.noise->type == \"EP\";\n- auto mnt = std::unique_ptr<typename BFER<B,R,Q>::Monitor_BFER_type>(params_BFER.mnt_er->build<B>(count_unknown_values));\n+ auto mnt_tmp = params_BFER.mnt_er->build<B>(count_unknown_values);\n+ auto mnt = std::unique_ptr<typename BFER<B,R,Q>::Monitor_BFER_type>(mnt_tmp);\nmnt->activate_err_histogram(params_BFER.mnt_er->err_hist != -1);\nreturn mnt;\n@@ -303,15 +304,20 @@ void BFER<B,R,Q>\n::build_reporters()\n{\nthis->noise.reset(params_BFER.noise->template build<R>(0));\n- this->reporters.push_back(std::unique_ptr<tools::Reporter_noise<R>>(new tools::Reporter_noise<R>(this->noise)));\n+\n+ auto reporter_noise = new tools::Reporter_noise<R>(this->noise);\n+ this->reporters.push_back(std::unique_ptr<tools::Reporter_noise<R>>(reporter_noise));\nif (params_BFER.mutinfo)\n{\n- this->reporters.push_back(std::unique_ptr<tools::Reporter_MI<B,R>>(new tools::Reporter_MI<B,R>(*this->monitor_mi_red)));\n+ auto reporter_MI = new tools::Reporter_MI<B,R>(*this->monitor_mi_red);\n+ this->reporters.push_back(std::unique_ptr<tools::Reporter_MI<B,R>>(reporter_MI));\n}\n- this->reporters.push_back(std::unique_ptr<tools::Reporter_BFER<B>>(new tools::Reporter_BFER<B>(*this->monitor_er_red)));\n- this->reporters.push_back(std::unique_ptr<tools::Reporter_throughput<uint64_t>>(new tools::Reporter_throughput<uint64_t>(*this->monitor_er_red)));\n+ auto reporter_BFER = new tools::Reporter_BFER<B>(*this->monitor_er_red);\n+ this->reporters.push_back(std::unique_ptr<tools::Reporter_BFER<B>>(reporter_BFER));\n+ auto reporter_thr = new tools::Reporter_throughput<uint64_t>(*this->monitor_er_red);\n+ this->reporters.push_back(std::unique_ptr<tools::Reporter_throughput<uint64_t>>(reporter_thr));\n}\ntemplate <typename B, typename R, typename Q>\n@@ -366,7 +372,10 @@ void BFER<B,R,Q>\nsimu->__build_communication_chain(tid);\nif (simu->params_BFER.err_track_enable)\n- simu->monitor_er[tid]->add_handler_fe(std::bind(&tools::Dumper::add, simu->dumper[tid].get(), std::placeholders::_1, std::placeholders::_2));\n+ simu->monitor_er[tid]->add_handler_fe(std::bind(&tools::Dumper::add,\n+ simu->dumper[tid].get(),\n+ std::placeholders::_1,\n+ std::placeholders::_2));\n}\ncatch (std::exception const& e)\n{\n@@ -380,12 +389,13 @@ void BFER<B,R,Q>\nstd::string msg = e.what(); // get only the function signature\ntools::exception::no_backtrace = save;\n- if (std::find(simu->prev_err_messages.begin(), simu->prev_err_messages.end(), msg) == simu->prev_err_messages.end())\n+ if (std::find(simu->prev_err_messages.begin(), simu->prev_err_messages.end(), msg) ==\n+ simu->prev_err_messages.end())\n{\n// with backtrace if debug mode\nrang::format_on_each_line(std::cerr, std::string(e.what()) + \"\\n\", rang::tag::error);\n-\n- simu->prev_err_messages.push_back(msg); // save only the function signature\n+ // save only the function signature\n+ simu->prev_err_messages.push_back(msg);\n}\nsimu->mutex_exception.unlock();\n}\n@@ -406,7 +416,8 @@ bool BFER<B,R,Q>\n::stop_time_reached()\n{\nusing namespace std::chrono;\n- return params_BFER.stop_time != seconds(0) && (steady_clock::now() - this->t_start_noise_point) >= params_BFER.stop_time;\n+ return params_BFER.stop_time != seconds(0) && (steady_clock::now() - this->t_start_noise_point) >=\n+ params_BFER.stop_time;\n}\n// ==================================================================================== explicit template instantiation\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/BFER.hpp", "new_path": "src/Simulation/BFER/BFER.hpp", "diff": "@@ -54,8 +54,7 @@ protected:\n// code specifications\nconst float bit_rate;\n- std::unique_ptr<tools::Noise<R>> noise; // current noise simulated\n-\n+ std::unique_ptr<tools::Noise<R>> noise; // current simulated noise\n// the monitors of the the BFER simulation\nusing Monitor_BFER_type = module::Monitor_BFER<B>;\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/Iterative/BFER_ite.cpp", "new_path": "src/Simulation/BFER/Iterative/BFER_ite.cpp", "diff": "@@ -97,19 +97,42 @@ void BFER_ite<B,R,Q>\nsource[src::tsk::generate].set_autoalloc(true);\nauto src_data = (B*)(source[src::sck::generate::U_K].get_dataptr());\n- auto src_size = (source[src::sck::generate::U_K].get_databytes() / sizeof(B)) / this->params_BFER_ite.src->n_frames;\n- this->dumper[tid]->register_data(src_data, (unsigned int)src_size, this->params_BFER_ite.err_track_threshold, \"src\", false, this->params_BFER_ite.src->n_frames, {});\n+ auto src_bytes = source[src::sck::generate::U_K].get_databytes();\n+ auto src_size = (src_bytes / sizeof(B)) / this->params_BFER_ite.src->n_frames;\n+ this->dumper[tid]->register_data(src_data,\n+ (unsigned int)src_size,\n+ this->params_BFER_ite.err_track_threshold,\n+ \"src\",\n+ false,\n+ this->params_BFER_ite.src->n_frames,\n+ {});\nencoder[enc::tsk::encode].set_autoalloc(true);\nauto enc_data = (B*)(encoder[enc::sck::encode::X_N].get_dataptr());\n- auto enc_size = (encoder[enc::sck::encode::X_N].get_databytes() / sizeof(B)) / this->params_BFER_ite.src->n_frames;\n- this->dumper[tid]->register_data(enc_data, (unsigned int)enc_size, this->params_BFER_ite.err_track_threshold, \"enc\", false, this->params_BFER_ite.src->n_frames,\n+ auto enc_bytes = encoder[enc::sck::encode::X_N].get_databytes();\n+ auto enc_size = (enc_bytes / sizeof(B)) / this->params_BFER_ite.src->n_frames;\n+ this->dumper[tid]->register_data(enc_data,\n+ (unsigned int)enc_size,\n+ this->params_BFER_ite.err_track_threshold,\n+ \"enc\",\n+ false,\n+ this->params_BFER_ite.src->n_frames,\n{(unsigned)this->params_BFER_ite.cdc->enc->K});\n- this->dumper[tid]->register_data(channel.get_noise(), this->params_BFER_ite.err_track_threshold, \"chn\", true, this->params_BFER_ite.src->n_frames, {});\n+ this->dumper[tid]->register_data(channel.get_noise(),\n+ this->params_BFER_ite.err_track_threshold,\n+ \"chn\",\n+ true,\n+ this->params_BFER_ite.src->n_frames,\n+ {});\nif (interleaver_core[tid]->is_uniform())\n- this->dumper[tid]->register_data(interleaver.get_lut(), this->params_BFER_ite.err_track_threshold, \"itl\", false, this->params_BFER_ite.src->n_frames, {});\n+ this->dumper[tid]->register_data(interleaver.get_lut(),\n+ this->params_BFER_ite.err_track_threshold,\n+ \"itl\",\n+ false,\n+ this->params_BFER_ite.src->n_frames,\n+ {});\n}\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/Standard/BFER_std.cpp", "new_path": "src/Simulation/BFER/Standard/BFER_std.cpp", "diff": "@@ -74,7 +74,12 @@ void BFER_std<B,R,Q>\nthis->monitor_er[tid]->add_handler_check(std::bind(&tools::Interleaver_core<>::refresh, interleaver.get()));\nif (this->params_BFER_std.err_track_enable && interleaver->is_uniform())\n- this->dumper[tid]->register_data(interleaver->get_lut(), this->params_BFER_std.err_track_threshold, \"itl\", false, this->params_BFER_std.src->n_frames, {});\n+ this->dumper[tid]->register_data(interleaver->get_lut(),\n+ this->params_BFER_std.err_track_threshold,\n+ \"itl\",\n+ false,\n+ this->params_BFER_std.src->n_frames,\n+ {});\n}\ncatch (const std::exception&) { /* do nothing if there is no interleaver */ }\n@@ -88,16 +93,34 @@ void BFER_std<B,R,Q>\nsource[src::tsk::generate].set_autoalloc(true);\nauto src_data = (B*)(source[src::sck::generate::U_K].get_dataptr());\n- auto src_size = (source[src::sck::generate::U_K].get_databytes() / sizeof(B)) / this->params_BFER_std.src->n_frames;\n- this->dumper[tid]->register_data(src_data, (unsigned int)src_size, this->params_BFER_std.err_track_threshold, \"src\", false, this->params_BFER_std.src->n_frames, {});\n+ auto src_bytes = source[src::sck::generate::U_K].get_databytes();\n+ auto src_size = (src_bytes / sizeof(B)) / this->params_BFER_std.src->n_frames;\n+ this->dumper[tid]->register_data(src_data,\n+ (unsigned int)src_size,\n+ this->params_BFER_std.err_track_threshold,\n+ \"src\",\n+ false,\n+ this->params_BFER_std.src->n_frames,\n+ {});\nencoder[enc::tsk::encode].set_autoalloc(true);\nauto enc_data = (B*)(encoder[enc::sck::encode::X_N].get_dataptr());\n- auto enc_size = (encoder[enc::sck::encode::X_N].get_databytes() / sizeof(B)) / this->params_BFER_std.src->n_frames;\n- this->dumper[tid]->register_data(enc_data, (unsigned int)enc_size, this->params_BFER_std.err_track_threshold, \"enc\", false, this->params_BFER_std.src->n_frames,\n+ auto enc_bytes = encoder[enc::sck::encode::X_N].get_databytes();\n+ auto enc_size = (enc_bytes / sizeof(B)) / this->params_BFER_std.src->n_frames;\n+ this->dumper[tid]->register_data(enc_data,\n+ (unsigned int)enc_size,\n+ this->params_BFER_std.err_track_threshold,\n+ \"enc\",\n+ false,\n+ this->params_BFER_std.src->n_frames,\n{(unsigned)this->params_BFER_std.cdc->enc->K});\n- this->dumper[tid]->register_data(channel.get_noise(), this->params_BFER_std.err_track_threshold, \"chn\", true, this->params_BFER_std.src->n_frames, {});\n+ this->dumper[tid]->register_data(channel.get_noise(),\n+ this->params_BFER_std.err_track_threshold,\n+ \"chn\",\n+ true,\n+ this->params_BFER_std.src->n_frames,\n+ {});\n}\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/Standard/SystemC/SC_BFER_std.cpp", "new_path": "src/Simulation/BFER/Standard/SystemC/SC_BFER_std.cpp", "diff": "@@ -20,12 +20,12 @@ SC_BFER_std<B,R,Q>\n\"multi-threading.\");\nif (params_BFER_std.coded_monitoring)\n- throw tools::invalid_argument(__FILE__, __LINE__, __func__, \"BFER SystemC simulation does not support the coded \"\n- \"monitoring.\");\n+ throw tools::invalid_argument(__FILE__, __LINE__, __func__, \"BFER SystemC simulation does not support the \"\n+ \"coded monitoring.\");\nif (params_BFER_std.mutinfo)\n- throw tools::invalid_argument(__FILE__, __LINE__, __func__, \"BFER SystemC simulation does not support the mututal\"\n- \"information computation.\");\n+ throw tools::invalid_argument(__FILE__, __LINE__, __func__, \"BFER SystemC simulation does not support the \"\n+ \"mututal information computation.\");\n}\ntemplate <typename B, typename R, typename Q>\n" } ]
C++
MIT License
aff3ct/aff3ct
Clean the simulations code.
8,490
18.01.2019 15:47:37
-3,600
fcd41ffd04238e314b48ec5d391265e1407975a8
Add new params and rename other. Add two params to enable and configure the monitor lazy reductions ('--mnt-red-lazy' and '--mnt-red-lazy-freq'). Rename the '--sim-mpi-comm' argument in '--mnt-mpi-comm-freq'. Clean code.
[ { "change_type": "MODIFY", "old_path": "ci/documentation-check.py", "new_path": "ci/documentation-check.py", "diff": "@@ -138,7 +138,7 @@ def check_keys(keys_file, aff3ct_path, doc_path):\n# manages special key exceptions\nexceptions_not_in_doc_keys = [\"factory::Frozenbits_generator::parameters::p+pb-path\"]\n- exceptions_doc_keys = [\"factory::Simulation::parameters::p+mpi-comm\", \"factory::Launcher::parameters::except-a2l\"]\n+ exceptions_doc_keys = [\"factory::BFER::parameters::p+mpi-comm-freq\", \"factory::Launcher::parameters::except-a2l\"]\nfor e in exceptions_not_in_doc_keys:\nif e in not_in_doc_keys: not_in_doc_keys.remove(e)\nfor e in exceptions_doc_keys:\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/monitor/monitor.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/monitor/monitor.rst", "diff": "@@ -71,3 +71,60 @@ display the histogram with the following command:\n.. note:: Only available on ``BFER`` simulation types (see the\n:ref:`sim-sim-type` parameter for more details).\n+\n+.. _mnt-mnt-red-lazy:\n+\n+``--mnt-red-lazy``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+|factory::BFER::parameters::p+red-lazy|\n+\n+Using this parameter can significantly reduce the simulation time, especially\n+for short frame sizes when the monitor synchronizations happen very often.\n+\n+.. note:: This parameter is not available if the code has been compiled with\n+ |MPI|.\n+\n+.. note:: By default, if the :ref:`mnt-mnt-red-lazy-freq` parameter is not\n+ specified, the interval/frequency is set to the same value than the\n+ :ref:`ter-ter-freq` parameter.\n+\n+.. warning:: Be careful, this parameter is known to alter the behavior of the\n+ :ref:`sim-sim-max-fra` parameter.\n+\n+.. _mnt-mnt-red-lazy-freq:\n+\n+``--mnt-red-lazy-freq``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: integer\n+ :Default: 1000\n+ :Examples: ``--mnt-red-lazy-freq 200``\n+\n+|factory::BFER::parameters::p+red-lazy-freq|\n+\n+.. note:: This parameter automatically enables the :ref:`mnt-mnt-red-lazy`\n+ parameter.\n+\n+.. note:: This parameter is not available if the code has been compiled with\n+ |MPI|.\n+\n+.. _mnt-mnt-mpi-comm-freq:\n+\n+``--mnt-mpi-comm-freq``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: integer\n+ :Default: 1000\n+ :Examples: ``--mnt-mpi-comm-freq 1``\n+\n+|factory::BFER::parameters::p+mpi-comm-freq|\n+\n+.. note:: Available only when compiling with the |MPI| support\n+ :ref:`compilation_cmake_options`.\n+\n+.. note:: When this parameter is specified, the :ref:`ter-ter-freq` parameter\n+ is automatically set to the same value except if the :ref:`ter-ter-freq` is\n+ explicitly defined.\n+\n+.. TODO: add link to MPI use\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/simulation/simulation.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/simulation/simulation.rst", "diff": "@@ -748,22 +748,6 @@ For the above example, the dumped or read files will be:\n|factory::BFER::parameters::p+err-trk-thold|\n-.. _sim-sim-mpi-comm:\n-\n-``--sim-mpi-comm``\n-\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n-\n- :Type: integer\n- :Default: 1000\n- :Examples: ``--sim-mpi-comm 1``\n-\n-|factory::Simulation::parameters::p+mpi-comm|\n-\n-.. note:: Available only when compiling with the |MPI| support\n- :ref:`compilation_cmake_options`.\n-\n-.. TODO: add link to MPI use\n-\nReferences\n\"\"\"\"\"\"\"\"\"\"\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/terminal/terminal.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/terminal/terminal.rst", "diff": "@@ -48,7 +48,7 @@ Description of the allowed values:\n|factory::Terminal::parameters::p+freq|\n.. note:: When |MPI| is enabled, this value is by default set to the same value\n- than the :ref:`sim-sim-mpi-comm` parameter.\n+ than the :ref:`mnt-mnt-mpi-comm-freq` parameter.\n.. _ter-ter-no:\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": ".. |factory::Simulation::parameters::p+seed,S| replace::\nSet the |PRNG| seed used in the Monte Carlo simulation.\n-.. |factory::Simulation::parameters::p+mpi-comm| replace::\n- Set the time interval (in milliseconds) between the |MPI| communications.\n- Increase this interval will reduce the |MPI| communication overhead.\n-\n.. ---------------------------------------------------- factory BFER parameters\n.. |factory::BFER::parameters::p+coset,c| replace::\n.. |factory::BFER::parameters::p+mutinfo| replace::\nEnable the computation of the mutual information (|MI|).\n+.. |factory::BFER::parameters::p+red-lazy| replace::\n+ Enable the lazy synchronization between the various monitor threads.\n+\n+.. |factory::BFER::parameters::p+red-lazy-freq| replace::\n+ Set the time interval (in milliseconds) between the synchronizations of the\n+ monitor threads.\n+\n+.. |factory::BFER::parameters::p+mpi-comm-freq| replace::\n+ Set the time interval (in milliseconds) between the |MPI| communications.\n+ Increase this interval will reduce the |MPI| communications overhead.\n+\n.. ------------------------------------------------ factory BFER_ite parameters\n.. |factory::BFER_ite::parameters::p+ite,I| replace::\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Simulation/BFER/BFER.cpp", "new_path": "src/Factory/Simulation/BFER/BFER.cpp", "diff": "@@ -113,15 +113,28 @@ void BFER::parameters\ntools::add_arg(args, p, class_name+\"p+coded\",\ntools::None());\n- auto pmon = mnt_er->get_prefix();\n+ auto pmnt = mnt_er->get_prefix();\n- tools::add_arg(args, pmon, class_name+\"p+mutinfo\",\n+ tools::add_arg(args, pmnt, class_name+\"p+mutinfo\",\ntools::None());\n+\n+#ifdef AFF3CT_MPI\n+ tools::add_arg(args, pmnt, class_name+\"p+mpi-comm-freq\",\n+ tools::Integer(tools::Positive(), tools::Non_zero()));\n+#else\n+ tools::add_arg(args, pmnt, class_name+\"p+red-lazy\",\n+ tools::None());\n+\n+ tools::add_arg(args, pmnt, class_name+\"p+red-lazy-freq\",\n+ tools::Integer(tools::Positive(), tools::Non_zero()));\n+#endif\n}\nvoid BFER::parameters\n::store(const tools::Argument_map_value &vals)\n{\n+ using namespace std::chrono;\n+\n#if !defined(AFF3CT_SYSTEMC_SIMU)\nthis->n_threads = std::thread::hardware_concurrency() ? std::thread::hardware_concurrency() : 1;\n#endif\n@@ -143,9 +156,20 @@ void BFER::parameters\nthis->n_threads = 1;\n}\n- auto pmon = mnt_er->get_prefix();\n+ auto pmnt = mnt_er->get_prefix();\n+\n+ if(vals.exist({pmnt+\"-mutinfo\"})) this->mnt_mutinfo = true;\n- if(vals.exist({pmon+\"-mutinfo\"})) this->mutinfo = true;\n+#ifdef AFF3CT_MPI\n+ if(vals.exist({pmnt+\"-mpi-comm-freq\"})) this->mnt_mpi_comm_freq = milliseconds(vals.to_int({pmnt+\"-mpi-comm-freq\"}));\n+#else\n+ if(vals.exist({pmnt+\"-red-lazy\"})) this->mnt_red_lazy = true;\n+ if(vals.exist({pmnt+\"-red-lazy-freq\"}))\n+ {\n+ this->mnt_red_lazy = true;\n+ this->mnt_red_lazy_freq = milliseconds(vals.to_int({pmnt+\"-red-lazy-freq\"}));\n+ }\n+#endif\n}\nvoid BFER::parameters\n@@ -155,6 +179,16 @@ void BFER::parameters\nauto p = this->get_prefix();\n+ std::string pmnt = mnt_er->get_prefix();\n+#ifdef AFF3CT_MPI\n+ headers[pmnt].push_back(std::make_pair(\"MPI comm. freq. (ms)\", std::to_string(this->mnt_mpi_comm_freq.count())));\n+#else\n+ headers[pmnt].push_back(std::make_pair(\"Lazy reduction\", this->mnt_red_lazy ? \"on\" : \"off\"));\n+ if (this->mnt_red_lazy)\n+ headers[pmnt].push_back(std::make_pair(\"Lazy reduction freq. (ms)\",\n+ std::to_string(this->mnt_red_lazy_freq.count())));\n+#endif\n+\nheaders[p].push_back(std::make_pair(\"Coset approach (c)\", this->coset ? \"yes\" : \"no\"));\nheaders[p].push_back(std::make_pair(\"Coded monitoring\", this->coded_monitoring ? \"yes\" : \"no\"));\n@@ -196,8 +230,9 @@ void BFER::parameters\nif (this->mnt_er != nullptr) { this->mnt_er->get_headers(headers, full); }\n- headers[this->mnt_er->get_prefix()].push_back(std::make_pair(\"Compute mutual info\", this->mutinfo ? \"yes\" : \"no\"));\n- if (this->mutinfo)\n+ headers[this->mnt_er->get_prefix()].push_back(std::make_pair(\"Compute mutual info\",\n+ this->mnt_mutinfo ? \"yes\" : \"no\"));\n+ if (this->mnt_mutinfo)\nif (this->mnt_er != nullptr) { this->mnt_er->get_headers(headers, full); }\nif (this->ter != nullptr) { this->ter->get_headers(headers, full); }\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Simulation/BFER/BFER.hpp", "new_path": "src/Factory/Simulation/BFER/BFER.hpp", "diff": "@@ -34,7 +34,14 @@ struct BFER : Simulation\nbool err_track_enable = false;\nbool coset = false;\nbool coded_monitoring = false;\n- bool mutinfo = false;\n+ bool mnt_mutinfo = false;\n+\n+#ifdef AFF3CT_MPI\n+ std::chrono::milliseconds mnt_mpi_comm_freq = std::chrono::milliseconds(1000);\n+#else\n+ std::chrono::milliseconds mnt_red_lazy_freq = std::chrono::milliseconds(0);\n+ bool mnt_red_lazy = false;\n+#endif\n// module parameters\ntools::auto_cloned_unique_ptr<Source ::parameters> src;\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Simulation/BFER/BFER_ite.cpp", "new_path": "src/Factory/Simulation/BFER/BFER_ite.cpp", "diff": "@@ -115,7 +115,7 @@ void BFER_ite::parameters\nif(vals.exist({p+\"-ite\", \"I\"})) this->n_ite = vals.to_int({p+\"-ite\", \"I\"});\nif(vals.exist({p+\"-crc-start\"})) this->crc_start = vals.to_int({p+\"-crc-start\"});\n- this->mutinfo = false;\n+ this->mnt_mutinfo = false;\n}\nvoid BFER_ite::parameters\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Simulation/Simulation.cpp", "new_path": "src/Factory/Simulation/Simulation.cpp", "diff": "#include <algorithm>\n#include <rang.hpp>\n+#ifdef AFF3CT_MPI\n+#include <mpi.h>\n+#endif\n+\n#include \"Tools/Exception/exception.hpp\"\n#include \"Tools/Documentation/documentation.h\"\n@@ -78,11 +82,6 @@ void Simulation::parameters\ntools::add_arg(args, p, class_name+\"p+seed,S\",\ntools::Integer(tools::Positive()));\n-\n-#ifdef AFF3CT_MPI\n- tools::add_arg(args, p, class_name+\"p+mpi-comm\",\n- tools::Integer(tools::Positive(), tools::Non_zero()));\n-#endif\n}\nvoid Simulation::parameters\n@@ -131,8 +130,6 @@ void Simulation::parameters\nMPI_Comm_size(MPI_COMM_WORLD, &this->mpi_size);\nMPI_Comm_rank(MPI_COMM_WORLD, &this->mpi_rank);\n- if(vals.exist({p+\"-mpi-comm\"})) this->mpi_comm_freq = milliseconds(vals.to_int({p+\"-mpi-comm\"}));\n-\nint max_n_threads_global;\nint max_n_threads_local = this->n_threads;\n@@ -180,14 +177,13 @@ void Simulation::parameters\nheaders[p].push_back(std::make_pair(\"Debug limit\", std::to_string(this->debug_limit)));\n}\n-#ifdef AFF3CT_MPI\n- headers[p].push_back(std::make_pair(\"MPI comm. freq. (ms)\", std::to_string(this->mpi_comm_freq.count())));\n- headers[p].push_back(std::make_pair(\"MPI size\", std::to_string(this->mpi_size )));\n-#endif\n-\nstd::string threads = \"unused\";\nif (this->n_threads)\nthreads = std::to_string(this->n_threads) + \" thread(s)\";\nheaders[p].push_back(std::make_pair(\"Multi-threading (t)\", threads));\n+\n+#ifdef AFF3CT_MPI\n+ headers[p].push_back(std::make_pair(\"MPI size\", std::to_string(this->mpi_size)));\n+#endif\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Simulation/Simulation.hpp", "new_path": "src/Factory/Simulation/Simulation.hpp", "diff": "#ifndef FACTORY_SIMULATION_HPP\n#define FACTORY_SIMULATION_HPP\n-#ifdef AFF3CT_MPI\n-#include <mpi.h>\n-#endif\n#include <chrono>\n#include <string>\n#include <sstream>\n@@ -29,11 +26,6 @@ struct Simulation : Launcher\ntools::auto_cloned_unique_ptr<Noise::parameters> noise;\n// optional parameters\n-#ifdef AFF3CT_MPI\n- std::chrono::milliseconds mpi_comm_freq = std::chrono::milliseconds(1000);\n- int mpi_rank = 0;\n- int mpi_size = 1;\n-#endif\nstd::chrono::seconds stop_time = std::chrono::seconds(0);\nstd::string meta = \"\";\nunsigned max_frame = 0;\n@@ -47,7 +39,10 @@ struct Simulation : Launcher\nint debug_limit = 0;\nint debug_precision = 2;\nint debug_frame_max = 0;\n-\n+#ifdef AFF3CT_MPI\n+ int mpi_rank = 0;\n+ int mpi_size = 1;\n+#endif\n// ---------------------------------------------------------------------------------------------------- METHODS\nvirtual ~parameters() = default;\n" }, { "change_type": "MODIFY", "old_path": "src/Launcher/Simulation/BFER_ite.cpp", "new_path": "src/Launcher/Simulation/BFER_ite.cpp", "diff": "@@ -198,7 +198,12 @@ void BFER_ite<B,R,Q>\n#ifdef AFF3CT_MPI\nauto pter = params.ter->get_prefix();\nif (!this->arg_vals.exist({pter+\"-freq\"}))\n- params.ter->frequency = params.mpi_comm_freq;\n+ params.ter->frequency = params.mnt_mpi_comm_freq;\n+#else\n+ auto pter = params.ter->get_prefix();\n+ auto pmnt = params.mnt_er->get_prefix();\n+ if (!this->arg_vals.exist({pmnt+\"-red-lazy-freq\"}))\n+ params.mnt_red_lazy_freq = params.ter->frequency;\n#endif\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Launcher/Simulation/BFER_std.cpp", "new_path": "src/Launcher/Simulation/BFER_std.cpp", "diff": "@@ -190,7 +190,6 @@ void BFER_std<B,R,Q>\nparams.cdc->enc->seed = params.local_seed;\n-\nif (!this->arg_vals.exist({psrc+\"-fra\", \"F\"}) && params.mdm->type == \"SCMA\")\nparams.src->n_frames = params.mdm->n_frames;\n@@ -207,9 +206,13 @@ void BFER_std<B,R,Q>\n#ifdef AFF3CT_MPI\nauto pter = params.ter->get_prefix();\nif (!this->arg_vals.exist({pter+\"-freq\"}))\n- params.ter->frequency = params.mpi_comm_freq;\n+ params.ter->frequency = params.mnt_mpi_comm_freq;\n+#else\n+ auto pter = params.ter->get_prefix();\n+ auto pmnt = params.mnt_er->get_prefix();\n+ if (!this->arg_vals.exist({pmnt+\"-red-lazy-freq\"}))\n+ params.mnt_red_lazy_freq = params.ter->frequency;\n#endif\n-\n}\ntemplate <typename B, typename R, typename Q>\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/BFER.cpp", "new_path": "src/Simulation/BFER/BFER.cpp", "diff": "@@ -308,7 +308,7 @@ void BFER<B,R,Q>\nauto reporter_noise = new tools::Reporter_noise<R>(this->noise);\nthis->reporters.push_back(std::unique_ptr<tools::Reporter_noise<R>>(reporter_noise));\n- if (params_BFER.mutinfo)\n+ if (params_BFER.mnt_mutinfo)\n{\nauto reporter_MI = new tools::Reporter_MI<B,R>(*this->monitor_mi_red);\nthis->reporters.push_back(std::unique_ptr<tools::Reporter_MI<B,R>>(reporter_MI));\n@@ -335,7 +335,7 @@ void BFER<B,R,Q>\n// build a monitor to reduce BER/FER from the other monitors\nthis->monitor_er_red.reset(new Monitor_BFER_reduction_type(this->monitor_er));\n- if (params_BFER.mutinfo)\n+ if (params_BFER.mnt_mutinfo)\n{\n// build a monitor to compute MIon each thread\nthis->add_module(\"monitor_mi\", params_BFER.n_threads);\n@@ -351,11 +351,16 @@ void BFER<B,R,Q>\nmodule::Monitor_reduction::set_master_thread_id(std::this_thread::get_id());\n#ifdef AFF3CT_MPI\n- module::Monitor_reduction::set_reduce_frequency(params_BFER.mpi_comm_freq);\n+ module::Monitor_reduction::set_reduce_frequency(params_BFER.mnt_mpi_comm_freq);\n#else\n- auto freq = std::chrono::milliseconds(1000);\n- if (params_BFER.ter.get() != nullptr && params_BFER.ter->frequency != std::chrono::milliseconds(0))\n- freq = params_BFER.ter.get()->frequency;\n+ auto freq = std::chrono::milliseconds(0);\n+ if (params_BFER.mnt_red_lazy)\n+ {\n+ if (params_BFER.mnt_red_lazy_freq.count())\n+ freq = params_BFER.mnt_red_lazy_freq;\n+ else\n+ freq = std::chrono::milliseconds(1000); // default value when lazy reduction and no terminal refresh\n+ }\nmodule::Monitor_reduction::set_reduce_frequency(freq);\n#endif\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/Standard/SystemC/SC_BFER_std.cpp", "new_path": "src/Simulation/BFER/Standard/SystemC/SC_BFER_std.cpp", "diff": "@@ -23,7 +23,7 @@ SC_BFER_std<B,R,Q>\nthrow tools::invalid_argument(__FILE__, __LINE__, __func__, \"BFER SystemC simulation does not support the \"\n\"coded monitoring.\");\n- if (params_BFER_std.mutinfo)\n+ if (params_BFER_std.mnt_mutinfo)\nthrow tools::invalid_argument(__FILE__, __LINE__, __func__, \"BFER SystemC simulation does not support the \"\n\"mututal information computation.\");\n}\n@@ -75,7 +75,7 @@ void SC_BFER_std<B,R,Q>\nthis->quantizer [tid] ->sc.create_module(+qnt::tsk::process );\nthis->codec [tid]->get_decoder_siho()->sc.create_module(+dec::tsk::decode_siho );\nthis->monitor_er[tid] ->sc.create_module(+mnt::tsk::check_errors );\n- if (this->params_BFER_std.mutinfo) // this->monitor_mi[tid] != nullptr\n+ if (this->params_BFER_std.mnt_mutinfo) // this->monitor_mi[tid] != nullptr\nthis->monitor_mi[tid] ->sc.create_module(+mnt::tsk::get_mutual_info);\nif (this->params_BFER_std.coset)\n{\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/Standard/Threads/BFER_std_threads.cpp", "new_path": "src/Simulation/BFER/Standard/Threads/BFER_std_threads.cpp", "diff": "@@ -244,7 +244,7 @@ void BFER_std_threads<B,R,Q>\nmnt[mnt::sck::check_errors::V](crc[crc::sck::extract ::V_K2]);\n}\n- if (this->params_BFER_std.mutinfo) // this->monitor_mi[tid] != nullptr\n+ if (this->params_BFER_std.mnt_mutinfo) // this->monitor_mi[tid] != nullptr\n{\nauto &mnt = *this->monitor_mi[tid];\n@@ -369,7 +369,7 @@ void BFER_std_threads<B,R,Q>\nmonitor[mnt::tsk::check_errors].exec();\n- if (this->params_BFER_std.mutinfo)\n+ if (this->params_BFER_std.mnt_mutinfo)\n{\nauto &monitor = *this->monitor_mi[tid];\n" } ]
C++
MIT License
aff3ct/aff3ct
Add new params and rename other. - Add two params to enable and configure the monitor lazy reductions ('--mnt-red-lazy' and '--mnt-red-lazy-freq'). - Rename the '--sim-mpi-comm' argument in '--mnt-mpi-comm-freq'. - Clean code.
8,490
19.01.2019 23:19:14
-3,600
282e16317358167b8156b70fb8e1ae04487aa566
Rm useless script.
[ { "change_type": "DELETE", "old_path": "ci/deploy-github-push.sh", "new_path": null, "diff": "-#!/bin/bash\n-set -x\n-\n-if [ -z \"$GIT_BRANCH\" ]\n-then\n- echo \"Please define the 'GIT_BRANCH' environment variable.\"\n- exit 1\n-fi\n-\n-GITHUB=git@github.com:aff3ct\n-\n-REPO_REFS=error_rate_references\n-cd refs\n-git remote add github ${GITHUB}/${REPO_REFS}.git\n-git checkout ${GIT_BRANCH}\n-git pull origin ${GIT_BRANCH}\n-git push github ${GIT_BRANCH}\n-rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n-cd ../\n-\n-REPO_CONF=configuration_files\n-cd conf\n-git remote add github ${GITHUB}/${REPO_CONF}.git\n-git checkout ${GIT_BRANCH}\n-git pull origin ${GIT_BRANCH}\n-git push github ${GIT_BRANCH}\n-rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n-cd ../\n-\n-REPO_AFF3CT=aff3ct\n-git remote add github ${GITHUB}/${REPO_AFF3CT}.git\n-git checkout ${GIT_BRANCH}\n-git pull origin ${GIT_BRANCH}\n-git push github ${GIT_BRANCH}\n-rc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n\\ No newline at end of file\n" } ]
C++
MIT License
aff3ct/aff3ct
Rm useless script.
8,490
19.01.2019 23:21:18
-3,600
43d086880a2f2aa573b0ae6f80a5fe5d873931cb
CI: check if CSV entry exists + fail if not on gitlab.com.
[ { "change_type": "MODIFY", "old_path": "ci/deploy-builds-linux.sh", "new_path": "ci/deploy-builds-linux.sh", "diff": "#!/bin/bash\nset -x\n-if [ \"$CI_PROJECT_URL\" == \"https://gitlab.com/aff3ct/aff3ct\" ]\n+if [ \"$CI_PROJECT_URL\" != \"https://gitlab.com/aff3ct/aff3ct\" ]\nthen\n+ echo \"This job can only be done from the public CI: https://gitlab.com/aff3ct/aff3ct/pipelines.\"\n+ exit 1\n+fi\nif [ -z \"$GIT_BRANCH\" ]\nthen\n@@ -110,7 +113,12 @@ then\nfi\ndone\n+cat ${REPO_WEB}/download/download_${GIT_BRANCH}.csv | grep \"$GIT_TAG\" | grep \"$GIT_HASH\" | grep \"$GIT_DATE\" | grep \"$GIT_MESSAGE\" | grep \"$GIT_AUTHOR\" | grep \"$BUILDS_LIST\" > /dev/null 2>&1\n+rc=$?;\n+# if the entry does not exist, add the entry to the CSV file\n+if [[ $rc != 0 ]]; then\necho \"\\\"$GIT_TAG\\\";\\\"$GIT_HASH\\\";\\\"$GIT_DATE\\\";\\\"$GIT_MESSAGE\\\";\\\"$GIT_AUTHOR\\\";\\\"$BUILDS_LIST\\\"\" >> ${REPO_WEB}/download/download_${GIT_BRANCH}.csv\n+fi\ncd ${REPO_WEB}/${REPO_RESSOURCES}\n# git lfs install --local\n@@ -167,7 +175,3 @@ then\ngit commit -m \"Automatic: add new AFF3CT builds ($GIT_BRANCH: $GIT_HASH).\"\ngit push origin master\nrc=$?; if [[ $rc != 0 ]]; then exit $rc; fi\n\\ No newline at end of file\n-\n-else\n- echo \"This job is done only on the public CI: https://gitlab.com/aff3ct/aff3ct/pipelines.\"\n-fi\n\\ No newline at end of file\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: check if CSV entry exists + fail if not on gitlab.com.
8,490
19.01.2019 23:21:50
-3,600
128fdcbb10cc54e7964d49427d8d274c83c37081
Fail if not on gitlab.com.
[ { "change_type": "MODIFY", "old_path": "ci/deploy-sonarqube-linux.sh", "new_path": "ci/deploy-sonarqube-linux.sh", "diff": "#!/bin/bash\nset -x\n-if [ \"$CI_PROJECT_URL\" == \"https://gitlab.com/aff3ct/aff3ct\" ]\n+if [ \"$CI_PROJECT_URL\" != \"https://gitlab.com/aff3ct/aff3ct\" ]\nthen\n+ echo \"This job can only be done from the public CI: https://gitlab.com/aff3ct/aff3ct/pipelines.\"\n+ exit 1\n+fi\nif [ -z \"$SONARQUBE_TOKEN\" ]\nthen\n@@ -39,7 +42,3 @@ then\necho \"sonar.cxx.coverage.reportPath=code_coverage_report/aff3ct.xml\" >> sonar-project.properties\nsonar-scanner\n\\ No newline at end of file\n-\n-else\n- echo \"This job is done only on the public CI: https://gitlab.com/aff3ct/aff3ct/pipelines.\"\n-fi\n\\ No newline at end of file\n" } ]
C++
MIT License
aff3ct/aff3ct
Fail if not on gitlab.com.
8,490
19.01.2019 23:22:27
-3,600
a60e033e363c92ea16f944232110bc6a4703c6eb
Put deploy scripts in the 'production' environment.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -953,6 +953,9 @@ deploy-sonarqube-linux:\nonly:\n- master\n- development\n+ environment:\n+ name: production\n+ allow_failure: true\nscript:\n- source ./ci/tools/git-tag.sh\n- source ./ci/tools/git-branch.sh\n@@ -974,10 +977,13 @@ deploy-builds-linux:\ntags:\n- linux\n- github\n- - git-lfs\n+# - git-lfs\nonly:\n- master\n- development\n+ environment:\n+ name: production\n+ allow_failure: true\nscript:\n- source ./ci/tools/git-branch.sh\n- source ./ci/tools/git-tag.sh\n@@ -988,22 +994,6 @@ deploy-builds-linux:\n- source ./ci/tools/git-version.sh\n- ./ci/deploy-builds-linux.sh build_linux_gcc_x64_sse4.2 build_linux_gcc_x64_avx2 build_windows_gcc_x86_sse4.2 build_windows_gcc_x64_avx2 build_macos_clang_x64_sse4.2\n-# deploy-github-push:\n-# stage: deploy\n-# except:\n-# - schedules\n-# dependencies:\n-# - analysis-git-submodules\n-# tags:\n-# - linux\n-# - github\n-# only:\n-# - master\n-# - development\n-# script:\n-# - source ./ci/tools/git-branch.sh\n-# - ./ci/deploy-github-push.sh\n-\npages:\nstage: deploy\nexcept:\n@@ -1012,6 +1002,9 @@ pages:\n- linux\ndependencies:\n- coverage-linux\n+ environment:\n+ name: production\n+ allow_failure: true\nscript:\n- mv code_coverage_report/ public/\nartifacts:\n" } ]
C++
MIT License
aff3ct/aff3ct
Put deploy scripts in the 'production' environment.
8,490
20.01.2019 11:34:25
-3,600
b1ac067cb1b3192ad6cc109aafbc29a855b6f2fc
CI: rm bad usage of environment.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -953,8 +953,6 @@ deploy-sonarqube-linux:\nonly:\n- master\n- development\n- environment:\n- name: production\nallow_failure: true\nscript:\n- source ./ci/tools/git-tag.sh\n@@ -981,8 +979,6 @@ deploy-builds-linux:\nonly:\n- master\n- development\n- environment:\n- name: production\nallow_failure: true\nscript:\n- source ./ci/tools/git-branch.sh\n@@ -1002,8 +998,6 @@ pages:\n- linux\ndependencies:\n- coverage-linux\n- environment:\n- name: production\nallow_failure: true\nscript:\n- mv code_coverage_report/ public/\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: rm bad usage of environment.
8,490
20.01.2019 11:35:38
-3,600
e4f1e3ed6bd7ff9283eb06dae4201584551acba7
CI: enable/disable deploy scripts from an environment variable ('CI_AFF3CT_DEPLOY').
[ { "change_type": "MODIFY", "old_path": "ci/deploy-builds-linux.sh", "new_path": "ci/deploy-builds-linux.sh", "diff": "#!/bin/bash\nset -x\n-if [ \"$CI_PROJECT_URL\" != \"https://gitlab.com/aff3ct/aff3ct\" ]\n+if [[ ( -z \"$CI_AFF3CT_DEPLOY\" ) || ( \"$CI_AFF3CT_DEPLOY\" != \"ON\" ) ]]\nthen\n- echo \"This job can only be done from the public CI: https://gitlab.com/aff3ct/aff3ct/pipelines.\"\n+ echo \"This job is disabled, try to set the CI_AFF3CT_DEPLOY environment variable to 'ON' to enable it.\"\nexit 1\nfi\n" }, { "change_type": "MODIFY", "old_path": "ci/deploy-sonarqube-linux.sh", "new_path": "ci/deploy-sonarqube-linux.sh", "diff": "#!/bin/bash\nset -x\n-if [ \"$CI_PROJECT_URL\" != \"https://gitlab.com/aff3ct/aff3ct\" ]\n+if [[ ( -z \"$CI_AFF3CT_DEPLOY\" ) || ( \"$CI_AFF3CT_DEPLOY\" != \"ON\" ) ]]\nthen\n- echo \"This job can only be done from the public CI: https://gitlab.com/aff3ct/aff3ct/pipelines.\"\n+ echo \"This job is disabled, try to set the CI_AFF3CT_DEPLOY environment variable to 'ON' to enable it.\"\nexit 1\nfi\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: enable/disable deploy scripts from an environment variable ('CI_AFF3CT_DEPLOY').
8,490
20.01.2019 11:57:01
-3,600
bfe7ac8bf4d5ea04fb25d091806d4e1364304ff6
CI: improve the deploy script when redeploying same commit.
[ { "change_type": "MODIFY", "old_path": "ci/deploy-builds-linux.sh", "new_path": "ci/deploy-builds-linux.sh", "diff": "@@ -60,6 +60,33 @@ git submodule update --init --recursive\nmkdir ressources/aff3ct_builds\ncd ..\n+CSV_ENTRY=$(cat ${REPO_WEB}/download/download_${GIT_BRANCH}.csv | grep \"$GIT_TAG\" | grep \"$GIT_HASH\" | grep \"$GIT_DATE\" | grep \"$GIT_MESSAGE\" | grep \"$GIT_AUTHOR\" | grep \"$BUILDS_LIST\")\n+# if the entry does not exist, add the entry to the CSV file\n+if [ -z \"$CSV_ENTRY\" ]; then\n+ echo \"\\\"$GIT_TAG\\\";\\\"$GIT_HASH\\\";\\\"$GIT_DATE\\\";\\\"$GIT_MESSAGE\\\";\\\"$GIT_AUTHOR\\\";\\\"$BUILDS_LIST\\\"\" >> ${REPO_WEB}/download/download_${GIT_BRANCH}.csv\n+fi\n+\n+# delete the build if it exists\n+if [ -n \"$CSV_ENTRY\" ]; then\n+ cd ${REPO_WEB}/${REPO_RESSOURCES}\n+ FILES=$(echo $CSV_ENTRY | cut -d \";\" -f6)\n+ s1=\"\\\"\"\n+ s2=\"\"\n+ FILES=$(echo \"${FILES//$s1/$s2}\")\n+ N_FILES=$(echo $FILES | sed 's/,/\\n/g' | wc -l)\n+ for (( F=1; F<=N_FILES; F++ ))\n+ do\n+ FILE=$(echo $FILES | cut -d \",\" -f$F)\n+ FILE_PATH=aff3ct_builds/$FILE;\n+ if [ -f $FILE_PATH ]; then\n+ git filter-branch --force --index-filter \"git rm --cached --ignore-unmatch ${FILE_PATH}\" --prune-empty --tag-name-filter cat -- --all\n+ rm -rf .git/refs/original/\n+ git reflog expire --expire=now --all\n+ fi\n+ done\n+ cd ../../\n+fi\n+\nfor BUILD in \"$@\"\ndo\nPREFIX=aff3ct_${GIT_BRANCH}\n@@ -113,13 +140,6 @@ do\nfi\ndone\n-cat ${REPO_WEB}/download/download_${GIT_BRANCH}.csv | grep \"$GIT_TAG\" | grep \"$GIT_HASH\" | grep \"$GIT_DATE\" | grep \"$GIT_MESSAGE\" | grep \"$GIT_AUTHOR\" | grep \"$BUILDS_LIST\" > /dev/null 2>&1\n-rc=$?;\n-# if the entry does not exist, add the entry to the CSV file\n-if [[ $rc != 0 ]]; then\n- echo \"\\\"$GIT_TAG\\\";\\\"$GIT_HASH\\\";\\\"$GIT_DATE\\\";\\\"$GIT_MESSAGE\\\";\\\"$GIT_AUTHOR\\\";\\\"$BUILDS_LIST\\\"\" >> ${REPO_WEB}/download/download_${GIT_BRANCH}.csv\n-fi\n-\ncd ${REPO_WEB}/${REPO_RESSOURCES}\n# git lfs install --local\n# git lfs track aff3ct_builds/*\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: improve the deploy script when redeploying same commit.
8,490
20.01.2019 19:02:13
-3,600
64f837aeede31d7e00684b00b0228aac8970bedc
CI: fix bug introduced in prev. commit.
[ { "change_type": "MODIFY", "old_path": "ci/deploy-builds-linux.sh", "new_path": "ci/deploy-builds-linux.sh", "diff": "@@ -61,10 +61,6 @@ mkdir ressources/aff3ct_builds\ncd ..\nCSV_ENTRY=$(cat ${REPO_WEB}/download/download_${GIT_BRANCH}.csv | grep \"$GIT_TAG\" | grep \"$GIT_HASH\" | grep \"$GIT_DATE\" | grep \"$GIT_MESSAGE\" | grep \"$GIT_AUTHOR\" | grep \"$BUILDS_LIST\")\n-# if the entry does not exist, add the entry to the CSV file\n-if [ -z \"$CSV_ENTRY\" ]; then\n- echo \"\\\"$GIT_TAG\\\";\\\"$GIT_HASH\\\";\\\"$GIT_DATE\\\";\\\"$GIT_MESSAGE\\\";\\\"$GIT_AUTHOR\\\";\\\"$BUILDS_LIST\\\"\" >> ${REPO_WEB}/download/download_${GIT_BRANCH}.csv\n-fi\n# delete the build if it exists\nif [ -n \"$CSV_ENTRY\" ]; then\n@@ -140,6 +136,11 @@ do\nfi\ndone\n+# if the entry does not exist, add the entry to the CSV file\n+if [ -z \"$CSV_ENTRY\" ]; then\n+ echo \"\\\"$GIT_TAG\\\";\\\"$GIT_HASH\\\";\\\"$GIT_DATE\\\";\\\"$GIT_MESSAGE\\\";\\\"$GIT_AUTHOR\\\";\\\"$BUILDS_LIST\\\"\" >> ${REPO_WEB}/download/download_${GIT_BRANCH}.csv\n+fi\n+\ncd ${REPO_WEB}/${REPO_RESSOURCES}\n# git lfs install --local\n# git lfs track aff3ct_builds/*\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: fix bug introduced in prev. commit.
8,482
21.01.2019 18:07:32
-10,800
a11d1cbffcd4e8542f5044542111c5d18dfd0cf0
Bugfix: get_codebook_size() instead of get_number_of_resources() in user to resource messaging loop For codebooks with 4 resources and 4 codewords (the same values), we have no errors.
[ { "change_type": "MODIFY", "old_path": "src/Module/Modem/SCMA/Modem_SCMA.hpp", "new_path": "src/Module/Modem/SCMA/Modem_SCMA.hpp", "diff": "@@ -69,7 +69,7 @@ private:\nQ phi(const Q* Y_N1, int i, int j, int k, int re, int batch);\nQ phi(const Q* Y_N1, int i, int j, int k, int re, int batch, const R* H_N);\nvoid demodulate_batch(Q* Y_N2, int batch);\n- Q normalize_prob_msg_res_user(int user, int resource_ind, int resource);\n+ Q normalize_prob_msg_res_user(int user, int resource_ind, int codeword);\n};\n}\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Modem/SCMA/Modem_SCMA.hxx", "new_path": "src/Module/Modem/SCMA/Modem_SCMA.hxx", "diff": "@@ -240,7 +240,7 @@ void Modem_SCMA<B,R,Q,PSI>\n// user to resource messaging\n- for (auto i = 0; i < CB.get_number_of_resources(); i++)\n+ for (auto i = 0; i < CB.get_codebook_size(); i++) //codeword index\n{\nfor (auto j = 0; j < CB.get_number_of_users(); j++) //user index\n{\n@@ -295,7 +295,7 @@ Q Modem_SCMA<B,R,Q,PSI>\ntemplate <typename B, typename R, typename Q, tools::proto_psi<Q> PSI>\nQ Modem_SCMA<B,R,Q,PSI>\n-::normalize_prob_msg_res_user(int user, int resource_ind, int resource)\n+::normalize_prob_msg_res_user(int user, int resource_ind, int codeword)\n{\nQ sum = 0;\n@@ -304,7 +304,7 @@ Q Modem_SCMA<B,R,Q,PSI>\nsum += msg_res_user(CB.get_user_to_resource(user, resource_ind), user, i);\n}\n- auto norm_prob = msg_res_user(CB.get_user_to_resource(user, resource_ind), user, resource) / sum;\n+ auto norm_prob = msg_res_user(CB.get_user_to_resource(user, resource_ind), user, codeword) / sum;\nreturn norm_prob;\n}\n" } ]
C++
MIT License
aff3ct/aff3ct
Bugfix: get_codebook_size() instead of get_number_of_resources() in user to resource messaging loop For codebooks with 4 resources and 4 codewords (the same values), we have no errors.
8,490
22.01.2019 16:56:15
-3,600
f77bb56337a2427b7379f17e5e1a46e68217600a
Add/update template default values in the reporters.
[ { "change_type": "MODIFY", "old_path": "src/Tools/Display/Reporter/BFER/Reporter_BFER.hpp", "new_path": "src/Tools/Display/Reporter/BFER/Reporter_BFER.hpp", "diff": "@@ -11,7 +11,7 @@ namespace aff3ct\n{\nnamespace tools\n{\n-template <typename B = int>\n+template <typename B = int32_t>\nclass Reporter_BFER : public Reporter_monitor<module::Monitor_BFER<B>>\n{\npublic:\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Display/Reporter/EXIT/Reporter_EXIT.hpp", "new_path": "src/Tools/Display/Reporter/EXIT/Reporter_EXIT.hpp", "diff": "@@ -13,7 +13,7 @@ namespace aff3ct\n{\nnamespace tools\n{\n-template <typename B = int, typename R = float>\n+template <typename B = int32_t, typename R = float>\nclass Reporter_EXIT : public Reporter_monitor<module::Monitor_EXIT<B,R>>\n{\npublic:\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Display/Reporter/MI/Reporter_MI.hpp", "new_path": "src/Tools/Display/Reporter/MI/Reporter_MI.hpp", "diff": "@@ -11,7 +11,7 @@ namespace aff3ct\n{\nnamespace tools\n{\n-template <typename B = int, typename R = float>\n+template <typename B = int32_t, typename R = float>\nclass Reporter_MI : public Reporter_monitor<module::Monitor_MI<B,R>>\n{\npublic:\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Display/Reporter/Throughput/Reporter_throughput.hpp", "new_path": "src/Tools/Display/Reporter/Throughput/Reporter_throughput.hpp", "diff": "@@ -17,7 +17,7 @@ namespace aff3ct\n{\nnamespace tools\n{\n-template <typename T>\n+template <typename T = uint64_t>\nclass Reporter_throughput : public Reporter\n{\nstatic_assert(std::is_convertible<T, double>::value, \"T type must be convertible to a double.\");\n" } ]
C++
MIT License
aff3ct/aff3ct
Add/update template default values in the reporters.
8,490
23.01.2019 22:09:49
-3,600
9033181a9984e504ab34830f93c87165cebd449d
Add a new cmd param '--ter-sigma' to show the Gaussian variance sigma.
[ { "change_type": "MODIFY", "old_path": "src/Factory/Simulation/BFER/BFER.cpp", "new_path": "src/Factory/Simulation/BFER/BFER.cpp", "diff": "@@ -113,6 +113,11 @@ void BFER::parameters\ntools::add_arg(args, p, class_name+\"p+coded\",\ntools::None());\n+ auto pter = ter->get_prefix();\n+\n+ tools::add_arg(args, pter, class_name+\"p+sigma\",\n+ tools::None());\n+\nauto pmnt = mnt_er->get_prefix();\ntools::add_arg(args, pmnt, class_name+\"p+mutinfo\",\n@@ -156,6 +161,10 @@ void BFER::parameters\nthis->n_threads = 1;\n}\n+ auto pter = ter->get_prefix();\n+\n+ if(vals.exist({pter+\"-sigma\"})) this->ter_sigma = true;\n+\nauto pmnt = mnt_er->get_prefix();\nif(vals.exist({pmnt+\"-mutinfo\"})) this->mnt_mutinfo = true;\n@@ -179,6 +188,12 @@ void BFER::parameters\nauto p = this->get_prefix();\n+ if (this->noise.get() != nullptr && (this->noise.get()->type == \"EBN0\" || this->noise.get()->type == \"ESN0\"))\n+ {\n+ std::string pter = ter->get_prefix();\n+ headers[pter].push_back(std::make_pair(\"Show Sigma\", this->ter_sigma ? \"on\" : \"off\"));\n+ }\n+\nstd::string pmnt = mnt_er->get_prefix();\n#ifdef AFF3CT_MPI\nheaders[pmnt].push_back(std::make_pair(\"MPI comm. freq. (ms)\", std::to_string(this->mnt_mpi_comm_freq.count())));\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Simulation/BFER/BFER.hpp", "new_path": "src/Factory/Simulation/BFER/BFER.hpp", "diff": "@@ -34,6 +34,7 @@ struct BFER : Simulation\nbool err_track_enable = false;\nbool coset = false;\nbool coded_monitoring = false;\n+ bool ter_sigma = false;\nbool mnt_mutinfo = false;\n#ifdef AFF3CT_MPI\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Tools/Noise/Noise.cpp", "new_path": "src/Factory/Tools/Noise/Noise.cpp", "diff": "@@ -58,7 +58,6 @@ void Noise::parameters\ntools::add_arg(args, p, class_name+\"p+noise-type,E\",\ntools::Text(tools::Including_set(\"ESN0\", \"EBN0\", \"ROP\", \"EP\")));\n-\n}\nvoid Noise::parameters\n" }, { "change_type": "MODIFY", "old_path": "src/Simulation/BFER/BFER.cpp", "new_path": "src/Simulation/BFER/BFER.cpp", "diff": "@@ -305,7 +305,7 @@ void BFER<B,R,Q>\n{\nthis->noise.reset(params_BFER.noise->template build<R>(0));\n- auto reporter_noise = new tools::Reporter_noise<R>(this->noise);\n+ auto reporter_noise = new tools::Reporter_noise<R>(this->noise, this->params_BFER.ter_sigma);\nthis->reporters.push_back(std::unique_ptr<tools::Reporter_noise<R>>(reporter_noise));\nif (params_BFER.mnt_mutinfo)\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Display/Reporter/Noise/Reporter_noise.cpp", "new_path": "src/Tools/Display/Reporter/Noise/Reporter_noise.cpp", "diff": "@@ -44,50 +44,50 @@ private:\ntemplate <typename R>\nReporter_noise<R>\n-::Reporter_noise(const Noise<R>* const* _noise)\n-: Reporter_noise(new Noise_ptr(_noise))\n+::Reporter_noise(const Noise<R>* const* _noise, const bool show_sigma)\n+: Reporter_noise(new Noise_ptr(_noise), show_sigma)\n{\n}\ntemplate <typename R>\nReporter_noise<R>\n-::Reporter_noise(const Noise<R>* _noise)\n-: Reporter_noise(new Noise_ptr(_noise))\n+::Reporter_noise(const Noise<R>* _noise, const bool show_sigma)\n+: Reporter_noise(new Noise_ptr(_noise), show_sigma)\n{\n}\ntemplate <typename R>\nReporter_noise<R>\n-::Reporter_noise(const Noise<R>& _noise)\n-: Reporter_noise(new Noise_ptr(_noise))\n+::Reporter_noise(const Noise<R>& _noise, const bool show_sigma)\n+: Reporter_noise(new Noise_ptr(_noise), show_sigma)\n{\n}\ntemplate <typename R>\nReporter_noise<R>\n-::Reporter_noise(const std::shared_ptr<Noise<R>>* _noise)\n-: Reporter_noise(new Noise_ptr(_noise))\n+::Reporter_noise(const std::shared_ptr<Noise<R>>* _noise, const bool show_sigma)\n+: Reporter_noise(new Noise_ptr(_noise), show_sigma)\n{\n}\ntemplate <typename R>\nReporter_noise<R>\n-::Reporter_noise(const std::shared_ptr<Noise<R>>& _noise)\n-: Reporter_noise(new Noise_ptr(_noise))\n+::Reporter_noise(const std::shared_ptr<Noise<R>>& _noise, const bool show_sigma)\n+: Reporter_noise(new Noise_ptr(_noise), show_sigma)\n{\n}\ntemplate <typename R>\nReporter_noise<R>\n-::Reporter_noise(const std::unique_ptr<Noise<R>>* _noise)\n-: Reporter_noise(new Noise_ptr(_noise))\n+::Reporter_noise(const std::unique_ptr<Noise<R>>* _noise, const bool show_sigma)\n+: Reporter_noise(new Noise_ptr(_noise), show_sigma)\n{\n}\ntemplate <typename R>\nReporter_noise<R>\n-::Reporter_noise(const std::unique_ptr<Noise<R>>& _noise)\n-: Reporter_noise(new Noise_ptr(_noise))\n+::Reporter_noise(const std::unique_ptr<Noise<R>>& _noise, const bool show_sigma)\n+: Reporter_noise(new Noise_ptr(_noise), show_sigma)\n{\n}\n@@ -101,10 +101,11 @@ Reporter_noise<R>\ntemplate <typename R>\nReporter_noise<R>\n-::Reporter_noise(Noise_ptr* noise_ptr)\n+::Reporter_noise(Noise_ptr* noise_ptr, const bool show_sigma)\n: Reporter(),\nnoise_ptr(noise_ptr),\n- saved_noise_type(get_noise_ptr() != nullptr ? get_noise_ptr()->get_type() : Noise_type::SIGMA)\n+ saved_noise_type(get_noise_ptr() != nullptr ? get_noise_ptr()->get_type() : Noise_type::SIGMA),\n+ show_sigma(show_sigma)\n{\nif (get_noise_ptr() == nullptr)\nthrow invalid_argument(__FILE__, __LINE__, __func__, \"'noise' is a null pointer.\");\n@@ -117,6 +118,8 @@ Reporter_noise<R>\n{\ncase Noise_type::SIGMA :\nNoise_title = {\"Signal Noise Ratio\", \"(SNR)\"};\n+ if (show_sigma)\n+ Noise_cols.push_back(std::make_pair(\"Sigma\", \"\"));\nNoise_cols.push_back(std::make_pair(\"Es/N0\", \"(dB)\"));\nNoise_cols.push_back(std::make_pair(\"Eb/N0\", \"(dB)\"));\nbreak;\n@@ -159,6 +162,13 @@ Reporter::report_t Reporter_noise<R>\n{\nauto sig = dynamic_cast<const tools::Sigma<R>*>(get_noise_ptr());\n+ if (show_sigma)\n+ {\n+ stream << std::setprecision(4) << std::fixed << sig->get_noise();\n+ noise_report.push_back(stream.str());\n+ stream.str(\"\");\n+ }\n+\nstream << std::setprecision(2) << std::fixed << sig->get_esn0();\nnoise_report.push_back(stream.str());\nstream.str(\"\");\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Display/Reporter/Noise/Reporter_noise.hpp", "new_path": "src/Tools/Display/Reporter/Noise/Reporter_noise.hpp", "diff": "@@ -17,14 +17,14 @@ template <typename R = float>\nclass Reporter_noise : public Reporter\n{\npublic:\n- explicit Reporter_noise(const Noise<R>* const* noise);\n- explicit Reporter_noise(const Noise<R>* noise);\n- explicit Reporter_noise(const Noise<R>& noise);\n+ explicit Reporter_noise(const Noise<R>* const* noise, const bool show_sigma = false);\n+ explicit Reporter_noise(const Noise<R>* noise, const bool show_sigma = false);\n+ explicit Reporter_noise(const Noise<R>& noise, const bool show_sigma = false);\n- explicit Reporter_noise(const std::shared_ptr<Noise<R>>* noise);\n- explicit Reporter_noise(const std::shared_ptr<Noise<R>>& noise);\n- explicit Reporter_noise(const std::unique_ptr<Noise<R>>* noise);\n- explicit Reporter_noise(const std::unique_ptr<Noise<R>>& noise);\n+ explicit Reporter_noise(const std::shared_ptr<Noise<R>>* noise, const bool show_sigma = false);\n+ explicit Reporter_noise(const std::shared_ptr<Noise<R>>& noise, const bool show_sigma = false);\n+ explicit Reporter_noise(const std::unique_ptr<Noise<R>>* noise, const bool show_sigma = false);\n+ explicit Reporter_noise(const std::unique_ptr<Noise<R>>& noise, const bool show_sigma = false);\nvirtual ~Reporter_noise();\n@@ -33,12 +33,13 @@ public:\nprivate:\nstruct Noise_ptr;\n- explicit Reporter_noise(Noise_ptr* noise_ptr);\n+ explicit Reporter_noise(Noise_ptr* noise_ptr, const bool show_sigma = false);\nNoise_ptr* noise_ptr;\nprotected:\nconst Noise_type saved_noise_type;\ngroup_t noise_group;\n+ const bool show_sigma;\nprotected:\nconst Noise<R>* get_noise_ptr() const;\n" } ]
C++
MIT License
aff3ct/aff3ct
Add a new cmd param '--ter-sigma' to show the Gaussian variance sigma.
8,490
23.01.2019 22:10:31
-3,600
fe991109a13797877c5de612e494a0b78cf2c0f1
Doc: add the doc for the '--ter-sigma' parameter.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/terminal/terminal.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/terminal/terminal.rst", "diff": "@@ -56,3 +56,13 @@ Description of the allowed values:\n\"\"\"\"\"\"\"\"\"\"\"\"\n|factory::Terminal::parameters::p+no|\n+\n+.. _ter-ter-sigma:\n+\n+``--ter-sigma``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+|factory::BFER::parameters::p+sigma|\n+\n+.. note:: Work only if the :ref:`sim-sim-noise-type` parameter is set to\n+ ``EBN0`` or ``ESNO``.\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": ".. |factory::BFER::parameters::p+coded| replace::\nEnable the coded monitoring.\n+.. |factory::BFER::parameters::p+sigma| replace::\n+ Show the variance :math:`\\sigma` of the Gaussian noise in the terminal.\n+\n.. |factory::BFER::parameters::p+mutinfo| replace::\nEnable the computation of the mutual information (|MI|).\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: add the doc for the '--ter-sigma' parameter.
8,490
24.01.2019 10:09:51
-3,600
4d14567865c91f571dd91cfc7504f38d998bf6ab
Doc: update the description of the '--ter-sigma' parameter.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": "Enable the coded monitoring.\n.. |factory::BFER::parameters::p+sigma| replace::\n- Show the variance :math:`\\sigma` of the Gaussian noise in the terminal.\n+ Show the standard deviation (:math:`\\sigma`) of the Gaussian/Normal\n+ distribution in the terminal.\n.. |factory::BFER::parameters::p+mutinfo| replace::\nEnable the computation of the mutual information (|MI|).\n" } ]
C++
MIT License
aff3ct/aff3ct
Doc: update the description of the '--ter-sigma' parameter.
8,488
30.01.2019 11:26:47
-3,600
7a678e88a2b0ad0e87db5d2aa21f991340b9fb3e
Change fb generator sigma value to noise to support BEC.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": ".. |factory::Frozenbits_generator::parameters::p+cw-size,N| replace::\nSelect the codeword size :math:`N`.\n-.. |factory::Frozenbits_generator::parameters::p+sigma| replace::\n- Selects the noise variance :math:`\\sigma` for which the frozen bits will be\n- optimized. All the noise points in the simulation will use the same frozen\n+.. |factory::Frozenbits_generator::parameters::p+noise| replace::\n+ Selects the noise for which the frozen bits will be optimized. Can be\n+ a variance value :math:`\\sigma` for AWGN channel, or an event probability\n+ for BEC channels. All the noise points in the simulation will use the same frozen\nbits configuration.\n+.. |factory::Frozenbits_generator::parameters::p+noise-type| replace::\n+ Selects the noise type for the frozen bits generator (SIGMA or EP)\n+\n.. |factory::Frozenbits_generator::parameters::p+gen-method| replace::\nSelect the frozen bits generation method.\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.cpp", "new_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.cpp", "diff": "@@ -46,7 +46,10 @@ void Frozenbits_generator::parameters\ntools::Integer(tools::Positive(), tools::Non_zero()),\ntools::arg_rank::REQ);\n- tools::add_arg(args, p, class_name+\"p+sigma\",\n+ tools::add_arg(args, p, class_name+\"p+noise-type\",\n+ tools::Text(tools::Including_set(\"SIGMA\", \"EP\")));\n+\n+ tools::add_arg(args, p, class_name+\"p+noise\",\ntools::Real(tools::Positive(), tools::Non_zero()));\ntools::add_arg(args, p, class_name+\"p+gen-method\",\n@@ -68,7 +71,8 @@ void Frozenbits_generator::parameters\nif(vals.exist({p+\"-info-bits\", \"K\"})) this->K = vals.to_int ({p+\"-info-bits\", \"K\"});\nif(vals.exist({p+\"-cw-size\", \"N\"})) this->N_cw = vals.to_int ({p+\"-cw-size\", \"N\"});\n- if(vals.exist({p+\"-sigma\" })) this->sigma = vals.to_float({p+\"-sigma\" });\n+ if(vals.exist({p+\"-noise-type\" })) this->noise_type = vals.at ({p+\"-noise-type\" });\n+ if(vals.exist({p+\"-noise\" })) this->noise = vals.to_float({p+\"-noise\" });\nif(vals.exist({p+\"-awgn-path\" })) this->path_fb = vals.to_path ({p+\"-awgn-path\" });\nif(vals.exist({p+\"-gen-method\" })) this->type = vals.at ({p+\"-gen-method\" });\n@@ -85,7 +89,7 @@ void Frozenbits_generator::parameters\nheaders[p].push_back(std::make_pair(\"Type\", this->type));\nif (full) headers[p].push_back(std::make_pair(\"Info. bits (K)\", std::to_string(this->K)));\nif (full) headers[p].push_back(std::make_pair(\"Codeword size (N)\", std::to_string(this->N_cw)));\n- headers[p].push_back(std::make_pair(\"Sigma\", this->sigma == -1.0f ? \"adaptive\" : std::to_string(this->sigma)));\n+ headers[p].push_back(std::make_pair(\"Noise\", this->noise == -1.0f ? \"adaptive\" : std::to_string(this->noise)));\n#ifdef AFF3CT_POLAR_BOUNDS\nif (this->type == \"TV\")\nheaders[p].push_back(std::make_pair(\"PB path\", this->path_pb));\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.hpp", "new_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.hpp", "diff": "@@ -25,7 +25,8 @@ struct Frozenbits_generator : public Factory\nstd::string type = \"GA\";\nstd::string path_fb = \"conf/cde/awgn_polar_codes/TV\";\nstd::string path_pb = \"../lib/polar_bounds/bin/polar_bounds\";\n- float sigma = -1.f;\n+ std::string noise_type = \"SIGMA\";\n+ float noise = -1.f;\n// ---------------------------------------------------------------------------------------------------- METHODS\nexplicit parameters(const std::string &p = Frozenbits_generator_prefix);\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Codec/Polar/Codec_polar.cpp", "new_path": "src/Module/Codec/Polar/Codec_polar.cpp", "diff": "@@ -16,7 +16,7 @@ Codec_polar<B,Q>\nCRC<B>* crc)\n: Codec <B,Q>(enc_params.K, enc_params.N_cw, pct_params ? pct_params->N : enc_params.N_cw, enc_params.tail_length, enc_params.n_frames),\nCodec_SISO_SIHO<B,Q>(enc_params.K, enc_params.N_cw, pct_params ? pct_params->N : enc_params.N_cw, enc_params.tail_length, enc_params.n_frames),\n- adaptive_fb(fb_params.sigma == -1.f),\n+ adaptive_fb(fb_params.noise == -1.f),\nfrozen_bits(fb_params.N_cw, true),\ngenerated_decoder((dec_params.implem.find(\"_SNR\") != std::string::npos)),\npuncturer_shortlast(nullptr),\n@@ -122,6 +122,23 @@ Codec_polar<B,Q>\n{\nif (!adaptive_fb)\n{\n+ tools::Noise<float> * noise;\n+ if(fb_params.noise_type == \"SIGMA\")\n+ {\n+ auto sigma = tools::Sigma<float>(fb_params.noise);\n+ noise = &sigma;\n+ }\n+ else if (fb_params.noise_type == \"EP\")\n+ {\n+ auto ep = tools::Event_probability<float>(fb_params.noise);\n+ noise = &ep;\n+ }\n+ else\n+ {\n+ throw tools::runtime_error(__FILE__, __LINE__, __func__, \"Unsupported noise type for fb generation.\");\n+ }\n+\n+ fb_generator->set_noise(*noise);\nfb_generator->generate(frozen_bits);\nthis->notify_frozenbits_update();\n}\n" } ]
C++
MIT License
aff3ct/aff3ct
Change fb generator sigma value to noise to support BEC.
8,488
30.01.2019 11:36:53
-3,600
a1e304b3ed87eb5e64a2624a717ec1027e7c06d3
Fix dead pointer usage.
[ { "change_type": "MODIFY", "old_path": "src/Module/Codec/Polar/Codec_polar.cpp", "new_path": "src/Module/Codec/Polar/Codec_polar.cpp", "diff": "@@ -122,23 +122,21 @@ Codec_polar<B,Q>\n{\nif (!adaptive_fb)\n{\n- tools::Noise<float> * noise;\nif(fb_params.noise_type == \"SIGMA\")\n{\nauto sigma = tools::Sigma<float>(fb_params.noise);\n- noise = &sigma;\n+ fb_generator->set_noise(sigma);\n}\nelse if (fb_params.noise_type == \"EP\")\n{\nauto ep = tools::Event_probability<float>(fb_params.noise);\n- noise = &ep;\n+ fb_generator->set_noise(ep);\n}\nelse\n{\nthrow tools::runtime_error(__FILE__, __LINE__, __func__, \"Unsupported noise type for fb generation.\");\n}\n- fb_generator->set_noise(*noise);\nfb_generator->generate(frozen_bits);\nthis->notify_frozenbits_update();\n}\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix dead pointer usage.
8,488
30.01.2019 12:49:17
-3,600
6fbf11d163c7d790e2b1637241bc443ba56d584c
Add doc for fb generator noise and noise type.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "diff": "@@ -75,7 +75,7 @@ Description of the allowed values:\n.. note:: By default, when using the |GA| or the |TV| method, the frozen bits\nare optimized for each |SNR| point. To override this behavior you can use\n- the :ref:`enc-polar-enc-fb-sigma` parameter.\n+ the :ref:`enc-polar-enc-fb-noise` parameter.\n.. note:: When using the ``FILE`` method, the frozen bits are always the same\nregardless of the |SNR| value.\n@@ -118,15 +118,25 @@ positions in the codeword. The strategy is to freeze the less reliable channels.\nconfiguration files are a set of best channels pre-generated with the |TV|\nmethod (see ``conf/cde/awgn_polar_codes/TV/``).\n-.. _enc-polar-enc-fb-sigma:\n+.. _enc-polar-enc-fb-noise:\n-``--enc-fb-sigma``\n+``--enc-fb-noise``\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n:Type: real number\n- :Examples: ``--enc-fb-sigma 1.0``\n+ :Examples: ``--enc-fb-noise 1.0``\n-|factory::Frozenbits_generator::parameters::p+sigma|\n+|factory::Frozenbits_generator::parameters::p+noise|\n+\n+.. _enc-polar-enc-fb-noise-type:\n+\n+``--enc-fb-noise-type``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: text\n+ :Examples: ``--enc-fb-noise SIGMA``\n+\n+|factory::Frozenbits_generator::parameters::p+noise-type|\nReferences\n\"\"\"\"\"\"\"\"\"\"\n" } ]
C++
MIT License
aff3ct/aff3ct
Add doc for fb generator noise and noise type.
8,488
30.01.2019 14:11:21
-3,600
d9c3786afa782bf345ca9a9c138bba09808db110
Add return code to test.sh.
[ { "change_type": "MODIFY", "old_path": "scripts/debug_parser/test/test.sh", "new_path": "scripts/debug_parser/test/test.sh", "diff": "@@ -21,21 +21,19 @@ $AFF3CT_PATH --sim-type \"BFER\" -p \"8\" --sim-cde-type \"UNCODED\" -K \"12\" -m \"5\" \\\n--mdm-codebook \"conf/mod/SCMA/CS1.cb\" \\\n> dump_debug_gold4.txt\n-\n+rc=0\n# Test 1...\nrm -f Y_N.txt V_K.txt Y_N.bin V_K.bin Y_N.h V_K.h\npython3 ../aff3ct_debug_parser.py ./dump_debug_gold.txt \\\n--mod Decoder_polar_SC_fast_sys --tsk decode_siho --src --txt --bin --mat\n-cmp Y_N.txt refs/Y_N_gold.txt\n-cmp V_K.txt refs/V_K_gold.txt\n-cmp Y_N.bin refs/Y_N_gold.bin\n-cmp V_K.bin refs/V_K_gold.bin\n-cmp Y_N.h refs/Y_N_gold.h\n-cmp V_K.h refs/V_K_gold.h\n-cmp Y_N.h refs/Y_N_gold.h\n-cmp V_K.h refs/V_K_gold.h\n-cmp Y_N.mat refs/Y_N_gold.mat -i 70\n-cmp V_K.mat refs/V_K_gold.mat -i 70\n+cmp Y_N.txt refs/Y_N_gold.txt ;rc=$(($?+$rc))\n+cmp V_K.txt refs/V_K_gold.txt ;rc=$(($?+$rc))\n+cmp Y_N.bin refs/Y_N_gold.bin ;rc=$(($?+$rc))\n+cmp V_K.bin refs/V_K_gold.bin ;rc=$(($?+$rc))\n+cmp Y_N.h refs/Y_N_gold.h ;rc=$(($?+$rc))\n+cmp V_K.h refs/V_K_gold.h ;rc=$(($?+$rc))\n+cmp Y_N.mat refs/Y_N_gold.mat -i 70 ;rc=$(($?+$rc))\n+cmp V_K.mat refs/V_K_gold.mat -i 70 ;rc=$(($?+$rc))\nrm -f Y_N.txt V_K.txt Y_N.bin V_K.bin Y_N.h V_K.h\nrm -f Y_N.mat V_K.mat\n# Test 1 Done.\n@@ -44,18 +42,18 @@ rm -f Y_N.mat V_K.mat\nrm -f Y_N.txt X_N.txt H_N.txt Y_N.bin X_N.bin H_N.bin Y_N.h X_N.h H_N.h\npython3 ../aff3ct_debug_parser.py ./dump_debug_gold2.txt \\\n--mod Channel_Rayleigh_LLR --tsk add_noise_wg --src --txt --bin --mat\n-cmp Y_N.txt refs/Y_N_gold2.txt\n-cmp X_N.txt refs/X_N_gold2.txt\n-cmp H_N.txt refs/H_N_gold2.txt\n-cmp Y_N.bin refs/Y_N_gold2.bin\n-cmp X_N.bin refs/X_N_gold2.bin\n-cmp H_N.bin refs/H_N_gold2.bin\n-cmp Y_N.h refs/Y_N_gold2.h\n-cmp X_N.h refs/X_N_gold2.h\n-cmp H_N.h refs/H_N_gold2.h\n-cmp Y_N.mat refs/Y_N_gold2.mat -i 70\n-cmp X_N.mat refs/X_N_gold2.mat -i 70\n-cmp H_N.mat refs/H_N_gold2.mat -i 70\n+cmp Y_N.txt refs/Y_N_gold2.txt ;rc=$(($?+$rc))\n+cmp X_N.txt refs/X_N_gold2.txt ;rc=$(($?+$rc))\n+cmp H_N.txt refs/H_N_gold2.txt ;rc=$(($?+$rc))\n+cmp Y_N.bin refs/Y_N_gold2.bin ;rc=$(($?+$rc))\n+cmp X_N.bin refs/X_N_gold2.bin ;rc=$(($?+$rc))\n+cmp H_N.bin refs/H_N_gold2.bin ;rc=$(($?+$rc))\n+cmp Y_N.h refs/Y_N_gold2.h ;rc=$(($?+$rc))\n+cmp X_N.h refs/X_N_gold2.h ;rc=$(($?+$rc))\n+cmp H_N.h refs/H_N_gold2.h ;rc=$(($?+$rc))\n+cmp Y_N.mat refs/Y_N_gold2.mat -i 70 ;rc=$(($?+$rc))\n+cmp X_N.mat refs/X_N_gold2.mat -i 70 ;rc=$(($?+$rc))\n+cmp H_N.mat refs/H_N_gold2.mat -i 70 ;rc=$(($?+$rc))\nrm -f Y_N.txt X_N.txt H_N.txt Y_N.bin X_N.bin H_N.bin Y_N.h X_N.h H_N.h\nrm -f Y_N.mat X_N.mat H_N.mat\n# Test 2 Done.\n@@ -64,14 +62,14 @@ rm -f Y_N.mat X_N.mat H_N.mat\nrm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\npython3 ../aff3ct_debug_parser.py ./dump_debug_gold.txt \\\n--mod Quantizer_pow2 --tsk process --src --txt --bin --mat\n-cmp Y_N1.txt refs/Y_N1_gold3.txt\n-cmp Y_N2.txt refs/Y_N2_gold3.txt\n-cmp Y_N1.bin refs/Y_N1_gold3.bin\n-cmp Y_N2.bin refs/Y_N2_gold3.bin\n-cmp Y_N1.h refs/Y_N1_gold3.h\n-cmp Y_N2.h refs/Y_N2_gold3.h\n-cmp Y_N1.mat refs/Y_N1_gold3.mat -i 70\n-cmp Y_N2.mat refs/Y_N2_gold3.mat -i 70\n+cmp Y_N1.txt refs/Y_N1_gold3.txt ;rc=$(($?+$rc))\n+cmp Y_N2.txt refs/Y_N2_gold3.txt ;rc=$(($?+$rc))\n+cmp Y_N1.bin refs/Y_N1_gold3.bin ;rc=$(($?+$rc))\n+cmp Y_N2.bin refs/Y_N2_gold3.bin ;rc=$(($?+$rc))\n+cmp Y_N1.h refs/Y_N1_gold3.h ;rc=$(($?+$rc))\n+cmp Y_N2.h refs/Y_N2_gold3.h ;rc=$(($?+$rc))\n+cmp Y_N1.mat refs/Y_N1_gold3.mat -i 70 ;rc=$(($?+$rc))\n+cmp Y_N2.mat refs/Y_N2_gold3.mat -i 70 ;rc=$(($?+$rc))\nrm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\nrm -f Y_N1.mat Y_N2.mat\n# Test 3 Done.\n@@ -80,14 +78,14 @@ rm -f Y_N1.mat Y_N2.mat\nrm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\npython3 ../aff3ct_debug_parser.py ./dump_debug_gold4.txt \\\n--mod Quantizer_pow2 --tsk process --src --txt --bin --mat --fra 3\n-cmp Y_N1.txt refs/Y_N1_gold4.txt\n-cmp Y_N2.txt refs/Y_N2_gold4.txt\n-cmp Y_N1.bin refs/Y_N1_gold4.bin\n-cmp Y_N2.bin refs/Y_N2_gold4.bin\n-cmp Y_N1.h refs/Y_N1_gold4.h\n-cmp Y_N2.h refs/Y_N2_gold4.h\n-cmp Y_N1.mat refs/Y_N1_gold4.mat -i 70\n-cmp Y_N2.mat refs/Y_N2_gold4.mat -i 70\n+cmp Y_N1.txt refs/Y_N1_gold4.txt ;rc=$(($?+$rc))\n+cmp Y_N2.txt refs/Y_N2_gold4.txt ;rc=$(($?+$rc))\n+cmp Y_N1.bin refs/Y_N1_gold4.bin ;rc=$(($?+$rc))\n+cmp Y_N2.bin refs/Y_N2_gold4.bin ;rc=$(($?+$rc))\n+cmp Y_N1.h refs/Y_N1_gold4.h ;rc=$(($?+$rc))\n+cmp Y_N2.h refs/Y_N2_gold4.h ;rc=$(($?+$rc))\n+cmp Y_N1.mat refs/Y_N1_gold4.mat -i 70 ;rc=$(($?+$rc))\n+cmp Y_N2.mat refs/Y_N2_gold4.mat -i 70 ;rc=$(($?+$rc))\nrm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\nrm -f Y_N1.mat Y_N2.mat\n# Test 4 Done.\n@@ -95,3 +93,5 @@ rm -f Y_N1.mat Y_N2.mat\nrm dump_debug_gold.txt dump_debug_gold2.txt dump_debug_gold4.txt\ncd - > /dev/null\n+\n+exit $rc\n" } ]
C++
MIT License
aff3ct/aff3ct
Add return code to test.sh.
8,488
01.02.2019 10:50:04
-3,600
fbb749102d0a6db5a09e37b63e65f0082b4af596
CI: Integrate debug parser test in ci.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -4,6 +4,7 @@ variables:\nstages:\n- analysis\n- build\n+ - parser\n- documentation\n- test\n- coverage\n@@ -407,6 +408,27 @@ build-macos-clang-x64-sse4.2:\n- source ./ci/tools/threads.sh\n- ./ci/build-linux-macos.sh\n+parser-check:\n+ stage: parser\n+ variables:\n+ GIT_SUBMODULE_STRATEGY: recursive\n+ except:\n+ - schedules\n+ dependencies:\n+ - build-linux-gcc-x64-sse4.2\n+ tags:\n+ - linux\n+ - x86\n+ - 64-bit\n+ - sse4.2\n+ - python3.5\n+ - mat4py\n+ script:\n+ - source ./ci/tools/git-version.sh\n+ - cd ../scripts/debug_parser/\n+ - export AFF3CT_PATH=\"../../../build_linux_gcc_x64_sse4.2/bin/aff3ct-$GIT_VERSION\"\n+ - ./test/test.sh\n+\ndocumentation-sphinx:\nstage: documentation\nexcept:\n" }, { "change_type": "RENAME", "old_path": "scripts/debug_parser/README.MD", "new_path": "scripts/debug_parser/README.md", "diff": "" }, { "change_type": "MODIFY", "old_path": "scripts/debug_parser/aff3ct_debug_parser.py", "new_path": "scripts/debug_parser/aff3ct_debug_parser.py", "diff": "-#!/usr/bin/python3\n+#!/usr/bin/env python3.5\nimport argparse\nimport struct\n" }, { "change_type": "MODIFY", "old_path": "scripts/debug_parser/test/test.sh", "new_path": "scripts/debug_parser/test/test.sh", "diff": "#!/bin/bash\ncd test\n+if [ -z \"$AFF3CT_PATH\" ]\n+then\nAFF3CT_PATH=../../../build/bin/aff3ct\n+fi\n$AFF3CT_PATH -p \"8\" --sim-type \"BFER\" -C \"POLAR\" -K \"32\" -N \"64\" -m \"2.81\" \\\n-M \"2.81\" -e \"2\" --enc-fb-gen-method \"GA\" --dec-type \"SC\" \\\n@@ -24,7 +27,7 @@ $AFF3CT_PATH --sim-type \"BFER\" -p \"8\" --sim-cde-type \"UNCODED\" -K \"12\" -m \"5\" \\\nrc=0\n# Test 1...\nrm -f Y_N.txt V_K.txt Y_N.bin V_K.bin Y_N.h V_K.h\n-python3 ../aff3ct_debug_parser.py ./dump_debug_gold.txt \\\n+../aff3ct_debug_parser.py ./dump_debug_gold.txt \\\n--mod Decoder_polar_SC_fast_sys --tsk decode_siho --src --txt --bin --mat\ncmp Y_N.txt refs/Y_N_gold.txt ;rc=$(($?+$rc))\ncmp V_K.txt refs/V_K_gold.txt ;rc=$(($?+$rc))\n@@ -40,7 +43,7 @@ rm -f Y_N.mat V_K.mat\n# Test 2...\nrm -f Y_N.txt X_N.txt H_N.txt Y_N.bin X_N.bin H_N.bin Y_N.h X_N.h H_N.h\n-python3 ../aff3ct_debug_parser.py ./dump_debug_gold2.txt \\\n+../aff3ct_debug_parser.py ./dump_debug_gold2.txt \\\n--mod Channel_Rayleigh_LLR --tsk add_noise_wg --src --txt --bin --mat\ncmp Y_N.txt refs/Y_N_gold2.txt ;rc=$(($?+$rc))\ncmp X_N.txt refs/X_N_gold2.txt ;rc=$(($?+$rc))\n@@ -60,7 +63,7 @@ rm -f Y_N.mat X_N.mat H_N.mat\n# Test 3...\nrm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\n-python3 ../aff3ct_debug_parser.py ./dump_debug_gold.txt \\\n+../aff3ct_debug_parser.py ./dump_debug_gold.txt \\\n--mod Quantizer_pow2 --tsk process --src --txt --bin --mat\ncmp Y_N1.txt refs/Y_N1_gold3.txt ;rc=$(($?+$rc))\ncmp Y_N2.txt refs/Y_N2_gold3.txt ;rc=$(($?+$rc))\n@@ -76,7 +79,7 @@ rm -f Y_N1.mat Y_N2.mat\n# Test 4...\nrm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\n-python3 ../aff3ct_debug_parser.py ./dump_debug_gold4.txt \\\n+../aff3ct_debug_parser.py ./dump_debug_gold4.txt \\\n--mod Quantizer_pow2 --tsk process --src --txt --bin --mat --fra 3\ncmp Y_N1.txt refs/Y_N1_gold4.txt ;rc=$(($?+$rc))\ncmp Y_N2.txt refs/Y_N2_gold4.txt ;rc=$(($?+$rc))\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: Integrate debug parser test in ci.
8,488
01.02.2019 11:00:44
-3,600
3aeb0d6d12a62fbf64d16101b715bd03f4c5476b
CI: Add artifacts to debug_parser.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -423,6 +423,10 @@ parser-check:\n- sse4.2\n- python3.5\n- mat4py\n+ artifacts:\n+ name: debug-parser-output\n+ paths:\n+ - scripts/debug_parser/test/data\nscript:\n- source ./ci/tools/git-version.sh\n- cd ../scripts/debug_parser/\n" }, { "change_type": "MODIFY", "old_path": "scripts/debug_parser/test/test.sh", "new_path": "scripts/debug_parser/test/test.sh", "diff": "#!/bin/bash\n+\ncd test\n+rm -rf data\n+mkdir data/\n+mkdir data/test1/\n+mkdir data/test2/\n+mkdir data/test3/\n+mkdir data/test4/\nif [ -z \"$AFF3CT_PATH\" ]\nthen\n@@ -26,7 +33,6 @@ $AFF3CT_PATH --sim-type \"BFER\" -p \"8\" --sim-cde-type \"UNCODED\" -K \"12\" -m \"5\" \\\nrc=0\n# Test 1...\n-rm -f Y_N.txt V_K.txt Y_N.bin V_K.bin Y_N.h V_K.h\n../aff3ct_debug_parser.py ./dump_debug_gold.txt \\\n--mod Decoder_polar_SC_fast_sys --tsk decode_siho --src --txt --bin --mat\ncmp Y_N.txt refs/Y_N_gold.txt ;rc=$(($?+$rc))\n@@ -37,12 +43,11 @@ cmp Y_N.h refs/Y_N_gold.h ;rc=$(($?+$rc))\ncmp V_K.h refs/V_K_gold.h ;rc=$(($?+$rc))\ncmp Y_N.mat refs/Y_N_gold.mat -i 70 ;rc=$(($?+$rc))\ncmp V_K.mat refs/V_K_gold.mat -i 70 ;rc=$(($?+$rc))\n-rm -f Y_N.txt V_K.txt Y_N.bin V_K.bin Y_N.h V_K.h\n-rm -f Y_N.mat V_K.mat\n+mv Y_N.txt V_K.txt Y_N.bin V_K.bin Y_N.h V_K.h data/test1\n+mv Y_N.mat V_K.mat data/test1\n# Test 1 Done.\n# Test 2...\n-rm -f Y_N.txt X_N.txt H_N.txt Y_N.bin X_N.bin H_N.bin Y_N.h X_N.h H_N.h\n../aff3ct_debug_parser.py ./dump_debug_gold2.txt \\\n--mod Channel_Rayleigh_LLR --tsk add_noise_wg --src --txt --bin --mat\ncmp Y_N.txt refs/Y_N_gold2.txt ;rc=$(($?+$rc))\n@@ -57,12 +62,11 @@ cmp H_N.h refs/H_N_gold2.h ;rc=$(($?+$rc))\ncmp Y_N.mat refs/Y_N_gold2.mat -i 70 ;rc=$(($?+$rc))\ncmp X_N.mat refs/X_N_gold2.mat -i 70 ;rc=$(($?+$rc))\ncmp H_N.mat refs/H_N_gold2.mat -i 70 ;rc=$(($?+$rc))\n-rm -f Y_N.txt X_N.txt H_N.txt Y_N.bin X_N.bin H_N.bin Y_N.h X_N.h H_N.h\n-rm -f Y_N.mat X_N.mat H_N.mat\n+mv Y_N.txt X_N.txt H_N.txt Y_N.bin X_N.bin H_N.bin data/test2\n+mv Y_N.h X_N.h H_N.h Y_N.mat X_N.mat H_N.mat data/test2\n# Test 2 Done.\n# Test 3...\n-rm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\n../aff3ct_debug_parser.py ./dump_debug_gold.txt \\\n--mod Quantizer_pow2 --tsk process --src --txt --bin --mat\ncmp Y_N1.txt refs/Y_N1_gold3.txt ;rc=$(($?+$rc))\n@@ -73,12 +77,11 @@ cmp Y_N1.h refs/Y_N1_gold3.h ;rc=$(($?+$rc))\ncmp Y_N2.h refs/Y_N2_gold3.h ;rc=$(($?+$rc))\ncmp Y_N1.mat refs/Y_N1_gold3.mat -i 70 ;rc=$(($?+$rc))\ncmp Y_N2.mat refs/Y_N2_gold3.mat -i 70 ;rc=$(($?+$rc))\n-rm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\n-rm -f Y_N1.mat Y_N2.mat\n+mv Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin data/test3\n+mv Y_N1.h Y_N2.h Y_N1.mat Y_N2.mat data/test3\n# Test 3 Done.\n# Test 4...\n-rm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\n../aff3ct_debug_parser.py ./dump_debug_gold4.txt \\\n--mod Quantizer_pow2 --tsk process --src --txt --bin --mat --fra 3\ncmp Y_N1.txt refs/Y_N1_gold4.txt ;rc=$(($?+$rc))\n@@ -89,12 +92,12 @@ cmp Y_N1.h refs/Y_N1_gold4.h ;rc=$(($?+$rc))\ncmp Y_N2.h refs/Y_N2_gold4.h ;rc=$(($?+$rc))\ncmp Y_N1.mat refs/Y_N1_gold4.mat -i 70 ;rc=$(($?+$rc))\ncmp Y_N2.mat refs/Y_N2_gold4.mat -i 70 ;rc=$(($?+$rc))\n-rm -f Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin Y_N1.h Y_N2.h\n-rm -f Y_N1.mat Y_N2.mat\n+mv Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin data/test4\n+mv Y_N1.h Y_N2.h Y_N1.mat Y_N2.mat data/test4\n# Test 4 Done.\nrm dump_debug_gold.txt dump_debug_gold2.txt dump_debug_gold4.txt\n-cd - > /dev/null\n+cd .. > /dev/null\nexit $rc\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: Add artifacts to debug_parser.
8,488
01.02.2019 13:05:52
-3,600
fa3d36be7ca11e5566626d4a5739208230d59e37
CI: Fix debug_parser path in CI.
[ { "change_type": "MODIFY", "old_path": ".gitlab-ci.yml", "new_path": ".gitlab-ci.yml", "diff": "@@ -429,7 +429,7 @@ parser-check:\n- scripts/debug_parser/test/data\nscript:\n- source ./ci/tools/git-version.sh\n- - cd ../scripts/debug_parser/\n+ - cd ./scripts/debug_parser/\n- export AFF3CT_PATH=\"../../../build_linux_gcc_x64_sse4.2/bin/aff3ct-$GIT_VERSION\"\n- ./test/test.sh\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: Fix debug_parser path in CI.
8,490
01.02.2019 19:31:19
-3,600
c150eaeb23cf0c061508bf4334c6b0c1b67b6e03
Fix hardcoded aff3ct bin name.
[ { "change_type": "MODIFY", "old_path": "scripts/debug_parser/test/test.sh", "new_path": "scripts/debug_parser/test/test.sh", "diff": "@@ -10,7 +10,7 @@ mkdir data/test4/\nif [ -z \"$AFF3CT_PATH\" ]\nthen\n- AFF3CT_PATH=../../../build/bin/aff3ct-2.2.2-20-g9de7e78\n+ AFF3CT_PATH=../../../build/bin/aff3ct\nfi\n$AFF3CT_PATH -p \"8\" --sim-type \"BFER\" -C \"POLAR\" -K \"32\" -N \"64\" -m \"2.81\" \\\n@@ -26,9 +26,9 @@ $AFF3CT_PATH --sim-type \"BFER\" -p \"8\" --sim-cde-type \"UNCODED\" -K \"12\" -m \"5\" \\\n> dump_debug_gold2.txt\n$AFF3CT_PATH --sim-type \"BFER\" -p \"8\" --sim-cde-type \"UNCODED\" -K \"12\" -m \"5\" \\\n--M \"5\" -s \"0.5\" --chn-type \"USER\" --chn-path \"./refs/error_tracker_0.23.chn\" -t \"1\" --mdm-type \"SCMA\" --mdm-ite \"4\" \\\n---mnt-max-fe \"100\" -F \"6\" --sim-dbg-hex --sim-meta \"Dump Test\" \\\n---mdm-codebook \"conf/mod/SCMA/CS1.cb\" \\\n+-M \"5\" -s \"0.5\" --chn-type \"USER\" --chn-path \"./refs/error_tracker_0.23.chn\" \\\n+-t \"1\" --mdm-type \"SCMA\" --mdm-ite \"4\" --mnt-max-fe \"100\" -F \"6\" --sim-dbg-hex \\\n+--sim-meta \"Dump Test\" --mdm-codebook \"conf/mod/SCMA/CS1.cb\" \\\n> dump_debug_gold4.txt\nrc=0\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix hardcoded aff3ct bin name.
8,488
04.02.2019 09:32:57
-3,600
1c2a9fa0789589e7b86aa309530ff17055c19571
CI: Save dump debug files in artifacts.
[ { "change_type": "MODIFY", "old_path": "scripts/debug_parser/test/test.sh", "new_path": "scripts/debug_parser/test/test.sh", "diff": "@@ -47,7 +47,7 @@ mv Y_N.txt V_K.txt Y_N.bin V_K.bin Y_N.h V_K.h data/test1\nmv Y_N.mat V_K.mat data/test1\necho \"Test 1 Done.\"\n-echo \"Test 2: inter frames, int & float values.\"\n+echo \"Test 2: inter frames, float values.\"\n../aff3ct_debug_parser.py ./dump_debug_gold2.txt \\\n--mod Channel_Rayleigh_LLR --tsk add_noise_wg --src --txt --bin --mat\ncmp Y_N.txt refs/Y_N_gold2.txt ;rc=$(($?+$rc))\n@@ -81,7 +81,7 @@ mv Y_N1.txt Y_N2.txt Y_N1.bin Y_N2.bin data/test3\nmv Y_N1.h Y_N2.h Y_N1.mat Y_N2.mat data/test3\necho \"Test 3 Done.\"\n-echo \"Test 4: extract one frame (0) from inter frame, float hex values.\"\n+echo \"Test 4: extract one frame (0), inter frame, float hex values.\"\n../aff3ct_debug_parser.py ./dump_debug_gold4.txt \\\n--mod Channel_user --tsk add_noise --src --txt --bin --mat --fra 0\ncmp X_N.txt refs/X_N_gold4.txt ;rc=$(($?+$rc))\n@@ -96,7 +96,7 @@ mv X_N.txt Y_N.txt X_N.bin Y_N.bin data/test4\nmv X_N.h Y_N.h X_N.mat Y_N.mat data/test4\necho \"Test 4 Done.\"\n-# rm dump_debug_gold.txt dump_debug_gold2.txt dump_debug_gold4.txt\n+mv dump_debug_gold.txt dump_debug_gold2.txt dump_debug_gold4.txt data\ncd .. > /dev/null\n" } ]
C++
MIT License
aff3ct/aff3ct
CI: Save dump debug files in artifacts.
8,488
04.02.2019 10:12:44
-3,600
7c835bde2313c274d6b0796832c4983d62b7cf14
Check noise types in frozen bits generators.
[ { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_BEC.cpp", "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_BEC.cpp", "diff": "@@ -27,6 +27,8 @@ Frozenbits_generator_BEC\nvoid Frozenbits_generator_BEC\n::evaluate()\n{\n+ this->check_noise();\n+\nfor (unsigned i = 0; i != this->best_channels.size(); i++)\nthis->best_channels[i] = i;\n@@ -49,9 +51,6 @@ void Frozenbits_generator_BEC\n}\nstd::sort(this->best_channels.begin(), this->best_channels.end(), [this](int i1, int i2) { return z[i1] > z[i2]; });\n- // for (auto chan : this->best_channels)\n- // std::cout << chan << \" \";\n- // std::cout << std::endl;\n}\nvoid Frozenbits_generator_BEC\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_GA.cpp", "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_GA.cpp", "diff": "@@ -21,6 +21,8 @@ Frozenbits_generator_GA\nvoid Frozenbits_generator_GA\n::evaluate()\n{\n+ this-> check_noise();\n+\nfor (unsigned i = 0; i != this->best_channels.size(); i++)\nthis->best_channels[i] = i;\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_TV.cpp", "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_TV.cpp", "diff": "@@ -32,6 +32,8 @@ Frozenbits_generator_TV\nvoid Frozenbits_generator_TV\n::evaluate()\n{\n+ this-> check_noise();\n+\nstd::ostringstream s_stream;\ns_stream << std::setiosflags(std::ios::fixed) << std::setprecision(3) << this->n->get_noise();\nauto str_sigma = s_stream.str();\n" } ]
C++
MIT License
aff3ct/aff3ct
Check noise types in frozen bits generators.
8,488
04.02.2019 11:42:57
-3,600
ab6af5b8250d73d4f4a711d29d5d39f5436c8826
Simplify frozen bits generation parameters. Update doc.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "diff": "@@ -128,16 +128,6 @@ positions in the codeword. The strategy is to freeze the less reliable channels.\n|factory::Frozenbits_generator::parameters::p+noise|\n-.. _enc-polar-enc-fb-noise-type:\n-\n-``--enc-fb-noise-type``\n-\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n-\n- :Type: text\n- :Examples: ``--enc-fb-noise SIGMA``\n-\n-|factory::Frozenbits_generator::parameters::p+noise-type|\n-\nReferences\n\"\"\"\"\"\"\"\"\"\"\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": ".. |factory::Frozenbits_generator::parameters::p+noise| replace::\nSelects the noise for which the frozen bits will be optimized. Can be\n- a variance value :math:`\\sigma` for AWGN channel, or an event probability\n- for BEC channels. All the noise points in the simulation will use the same frozen\n- bits configuration.\n-\n-.. |factory::Frozenbits_generator::parameters::p+noise-type| replace::\n- Selects the noise type for the frozen bits generator (SIGMA or EP)\n+ a gaussian noise variance :math:`\\sigma` for an |AWGN| channel, or an event\n+ probability for a |BEC| channel. All the noise points in the simulation will\n+ use the same frozen bits configuration.\n.. |factory::Frozenbits_generator::parameters::p+gen-method| replace::\nSelect the frozen bits generation method.\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.cpp", "new_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.cpp", "diff": "@@ -46,9 +46,6 @@ void Frozenbits_generator::parameters\ntools::Integer(tools::Positive(), tools::Non_zero()),\ntools::arg_rank::REQ);\n- tools::add_arg(args, p, class_name+\"p+noise-type\",\n- tools::Text(tools::Including_set(\"SIGMA\", \"EP\")));\n-\ntools::add_arg(args, p, class_name+\"p+noise\",\ntools::Real(tools::Positive(), tools::Non_zero()));\n@@ -71,7 +68,6 @@ void Frozenbits_generator::parameters\nif(vals.exist({p+\"-info-bits\", \"K\"})) this->K = vals.to_int ({p+\"-info-bits\", \"K\"});\nif(vals.exist({p+\"-cw-size\", \"N\"})) this->N_cw = vals.to_int ({p+\"-cw-size\", \"N\"});\n- if(vals.exist({p+\"-noise-type\" })) this->noise_type = vals.at ({p+\"-noise-type\" });\nif(vals.exist({p+\"-noise\" })) this->noise = vals.to_float({p+\"-noise\" });\nif(vals.exist({p+\"-awgn-path\" })) this->path_fb = vals.to_path ({p+\"-awgn-path\" });\nif(vals.exist({p+\"-gen-method\" })) this->type = vals.at ({p+\"-gen-method\" });\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.hpp", "new_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.hpp", "diff": "@@ -25,7 +25,6 @@ struct Frozenbits_generator : public Factory\nstd::string type = \"GA\";\nstd::string path_fb = \"conf/cde/awgn_polar_codes/TV\";\nstd::string path_pb = \"../lib/polar_bounds/bin/polar_bounds\";\n- std::string noise_type = \"SIGMA\";\nfloat noise = -1.f;\n// ---------------------------------------------------------------------------------------------------- METHODS\n" }, { "change_type": "MODIFY", "old_path": "src/Launcher/Code/Polar/Polar.cpp", "new_path": "src/Launcher/Code/Polar/Polar.cpp", "diff": "@@ -61,6 +61,12 @@ void Polar<L,B,R,Q>\nL::store_args();\n+ auto pfbg = this->params_cdc->fbg->get_prefix();\n+\n+ if (!this->arg_vals.exist({pfbg+\"-gen-method\"}))\n+ if (this->params.chn->type == \"BEC\")\n+ this->params_cdc->fbg->type = \"BEC\";\n+\nparams_cdc->enc->n_frames = this->params.src->n_frames;\nif (params_cdc->pct != nullptr)\nparams_cdc->pct->n_frames = this->params.src->n_frames;\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Codec/Polar/Codec_polar.cpp", "new_path": "src/Module/Codec/Polar/Codec_polar.cpp", "diff": "@@ -122,19 +122,15 @@ Codec_polar<B,Q>\n{\nif (!adaptive_fb)\n{\n- if(fb_params.noise_type == \"SIGMA\")\n- {\n- auto sigma = tools::Sigma<float>(fb_params.noise);\n- fb_generator->set_noise(sigma);\n- }\n- else if (fb_params.noise_type == \"EP\")\n+ if(fb_params.type == \"BEC\")\n{\nauto ep = tools::Event_probability<float>(fb_params.noise);\nfb_generator->set_noise(ep);\n}\n- else\n+ else /* type = GA, TV or FILE */\n{\n- throw tools::runtime_error(__FILE__, __LINE__, __func__, \"Unsupported noise type for fb generation.\");\n+ auto sigma = tools::Sigma<float>(fb_params.noise);\n+ fb_generator->set_noise(sigma);\n}\nfb_generator->generate(frozen_bits);\n" } ]
C++
MIT License
aff3ct/aff3ct
Simplify frozen bits generation parameters. Update doc.
8,488
04.02.2019 16:27:25
-3,600
ff876d38ae1b3f75c2ebb507f2f8fa197502a1fe
Add 5G frozen bits generator.
[ { "change_type": "MODIFY", "old_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.cpp", "new_path": "src/Factory/Tools/Code/Polar/Frozenbits_generator.cpp", "diff": "#include \"Tools/Documentation/documentation.h\"\n#include \"Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_file.hpp\"\n+#include \"Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_5G.hpp\"\n#include \"Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_TV.hpp\"\n#include \"Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_GA.hpp\"\n#include \"Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_BEC.hpp\"\n@@ -50,7 +51,7 @@ void Frozenbits_generator::parameters\ntools::Real(tools::Positive(), tools::Non_zero()));\ntools::add_arg(args, p, class_name+\"p+gen-method\",\n- tools::Text(tools::Including_set(\"GA\", \"FILE\", \"TV\", \"BEC\")));\n+ tools::Text(tools::Including_set(\"GA\", \"FILE\", \"5G\", \"TV\", \"BEC\")));\ntools::add_arg(args, p, class_name+\"p+awgn-path\",\ntools::Path(tools::openmode::read));\n@@ -100,6 +101,7 @@ tools::Frozenbits_generator* Frozenbits_generator::parameters\nif (this->type == \"GA\" ) return new tools::Frozenbits_generator_GA (this->K, this->N_cw );\nif (this->type == \"TV\" ) return new tools::Frozenbits_generator_TV (this->K, this->N_cw, this->path_fb, this->path_pb);\nif (this->type == \"FILE\") return new tools::Frozenbits_generator_file(this->K, this->N_cw, this->path_fb );\n+ if (this->type == \"5G\") return new tools::Frozenbits_generator_5G (this->K, this->N_cw );\nif (this->type == \"BEC\") return new tools::Frozenbits_generator_BEC (this->K, this->N_cw );\nthrow tools::cannot_allocate(__FILE__, __LINE__, __func__);\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_5G.cpp", "diff": "+#ifndef _USE_MATH_DEFINES\n+#define _USE_MATH_DEFINES\n+#endif\n+\n+#include <cmath>\n+#include <limits>\n+#include <fstream>\n+#include <iostream>\n+#include <algorithm>\n+\n+#include \"Frozenbits_generator_5G.hpp\"\n+#include <Tools/Arguments/Types/File_system/File_system.hpp>\n+\n+using namespace aff3ct::tools;\n+\n+Frozenbits_generator_5G\n+::Frozenbits_generator_5G(const int K, const int N)\n+: Frozenbits_generator_file(K, N,\n+ tools::modify_path<tools::Is_file>(\"conf/cde/awgn_polar_codes/5G/N_1024.pc\")),\n+ m((int)std::log2(N))\n+{\n+ std::string message = \"5G frozen bits generation undefined for N > \" + std::to_string(N_max);\n+ if (N > N_max)\n+ throw invalid_argument(__FILE__, __LINE__, __func__, message.c_str());\n+}\n+\n+Frozenbits_generator_5G\n+::~Frozenbits_generator_5G()\n+{\n+}\n+\n+void Frozenbits_generator_5G\n+::evaluate()\n+{\n+ std::vector<uint32_t> best_channels_mother(N_max);\n+\n+ if(!load_channels_file(filename, best_channels_mother))\n+ throw invalid_argument(__FILE__, __LINE__, __func__, \"'\" + filename + \"' file does not exist.\");\n+\n+ int j = 0;\n+\n+ for (unsigned i = 0; i != best_channels_mother.size(); i++)\n+ if(best_channels_mother[i] < (unsigned) this->N)\n+ this->best_channels[j++] = best_channels_mother[i];\n+\n+ if (j != this->N)\n+ throw runtime_error(__FILE__, __LINE__, __func__, \"Wrong size.\");\n+}\n+\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_5G.hpp", "diff": "+#ifndef FROZENBITS_GENERATOR_5G_HPP_\n+#define FROZENBITS_GENERATOR_5G_HPP_\n+\n+#include <limits>\n+#include <vector>\n+\n+#include \"Frozenbits_generator_file.hpp\"\n+\n+namespace aff3ct\n+{\n+namespace tools\n+{\n+class Frozenbits_generator_5G : public Frozenbits_generator_file\n+{\n+private:\n+ const int m;\n+ const int N_max = 1024;\n+\n+public:\n+ Frozenbits_generator_5G(const int K, const int N);\n+\n+ ~Frozenbits_generator_5G();\n+\n+private:\n+ void evaluate();\n+\n+};\n+}\n+}\n+\n+#endif /* FROZENBITS_GENERATOR_5G_HPP_ */\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_TV.cpp", "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_TV.cpp", "diff": "@@ -82,12 +82,12 @@ void Frozenbits_generator_TV\nauto filename = sub_folder + \"/N\" + str_N + \"_awgn_s\" + str_sigma + \".pc\";\n- if (!this->load_channels_file(filename))\n+ if (!this->load_channels_file(filename, this->best_channels))\n{\n#ifdef AFF3CT_POLAR_BOUNDS\nstatic std::mutex mutex_write_file;\nmutex_write_file.lock();\n- if (!this->load_channels_file(filename))\n+ if (!this->load_channels_file(filename, this->best_channels))\n{\nauto cmd = bin_pb_path;\ncmd += \" --no-print\"; // do not display anything\n@@ -102,7 +102,7 @@ void Frozenbits_generator_TV\nif (system(cmd.c_str()) == 0)\n{\n- if (!this->load_channels_file(filename))\n+ if (!this->load_channels_file(filename, this->best_channels))\n{\nmutex_write_file.unlock();\nstd::stringstream message;\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_file.cpp", "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_file.cpp", "diff": "@@ -28,12 +28,12 @@ Frozenbits_generator_file\nvoid Frozenbits_generator_file\n::evaluate()\n{\n- if(!load_channels_file(filename))\n+ if(!load_channels_file(this->filename, this->best_channels))\nthrow invalid_argument(__FILE__, __LINE__, __func__, \"'\" + filename + \"' file does not exist.\");\n}\nbool Frozenbits_generator_file\n-::load_channels_file(const std::string& filename)\n+::load_channels_file(const std::string& filename, std::vector<uint32_t>& best_channels)\n{\nstd::ifstream in_code(filename.c_str());\n@@ -42,7 +42,7 @@ bool Frozenbits_generator_file\nstd::string trash;\nin_code >> trash; // N\n- if (std::stoi(trash) != this->N)\n+ if (std::stoi(trash) != best_channels.size())\n{\nstd::stringstream message;\nmessage << \"'trash' has to be equal to 'N' ('trash' = \" << trash << \", 'N' = \" << this->N << \").\";\n@@ -52,8 +52,8 @@ bool Frozenbits_generator_file\nin_code >> trash; // type\nin_code >> trash; // sigma\n- for (unsigned i = 0; i < this->best_channels.size(); i++)\n- in_code >> this->best_channels[i];\n+ for (unsigned i = 0; i < best_channels.size(); i++)\n+ in_code >> best_channels[i];\nin_code.close();\nreturn true;\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_file.hpp", "new_path": "src/Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_file.hpp", "diff": "@@ -12,7 +12,7 @@ namespace tools\n{\nclass Frozenbits_generator_file : public Frozenbits_generator\n{\n-private:\n+protected:\nconst std::string filename;\nprotected:\n@@ -25,7 +25,7 @@ public:\nprotected:\nvoid evaluate();\n- bool load_channels_file(const std::string& filename);\n+ bool load_channels_file(const std::string& filename, std::vector<uint32_t>& best_channels);\nvirtual void check_noise();\n};\n}\n" }, { "change_type": "MODIFY", "old_path": "src/aff3ct.hpp", "new_path": "src/aff3ct.hpp", "diff": "#ifndef FB_EXTRACT_HPP\n#include <Tools/Code/Polar/fb_extract.h>\n#endif\n+#ifndef FROZENBITS_GENERATOR_5G_HPP_\n+#include <Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_5G.hpp>\n+#endif\n#ifndef FROZENBITS_GENERATOR_BEC_HPP_\n#include <Tools/Code/Polar/Frozenbits_generator/Frozenbits_generator_BEC.hpp>\n#endif\n" } ]
C++
MIT License
aff3ct/aff3ct
Add 5G frozen bits generator.
8,488
05.02.2019 09:03:02
-3,600
3140bef235745525f466c4103596a48aa19a1f91
Add 5G CRCs.
[ { "change_type": "MODIFY", "old_path": "src/Module/CRC/Polynomial/CRC_polynomial.hpp", "new_path": "src/Module/CRC/Polynomial/CRC_polynomial.hpp", "diff": "@@ -50,6 +50,9 @@ const std::map<std::string, std::tuple<unsigned, int>> CRC_polynomial<B>::known_\n{\"24-LTEA\" , std::make_tuple(0x864CFB , 24)},\n{\"24-RADIX-64\" , std::make_tuple(0x864CFB , 24)},\n{\"24-FLEXRAY\" , std::make_tuple(0x5D6DCB , 24)},\n+ {\"24-5GA\" , std::make_tuple(0x864CFB , 24)},\n+ {\"24-5GB\" , std::make_tuple(0x800063 , 24)},\n+ {\"24-5GC\" , std::make_tuple(0xB2B117 , 24)},\n{\"21-CAN\" , std::make_tuple(0x102899 , 21)},\n{\"17-CAN\" , std::make_tuple(0x1685B , 17)},\n{\"16-IBM\" , std::make_tuple(0x8005 , 16)},\n@@ -62,6 +65,7 @@ const std::map<std::string, std::tuple<unsigned, int>> CRC_polynomial<B>::known_\n{\"16-DECT\" , std::make_tuple(0x0589 , 16)},\n{\"16-CDMA2000\" , std::make_tuple(0xC867 , 16)},\n{\"16-ARINC\" , std::make_tuple(0xA02B , 16)},\n+ {\"16-5G\" , std::make_tuple(0x1023 , 16)},\n{\"16-CHAKRAVARTY\" , std::make_tuple(0x2F15 , 16)},\n{\"15-MPT1327\" , std::make_tuple(0x6815 , 15)},\n{\"15-CAN\" , std::make_tuple(0x4599 , 15)},\n@@ -70,6 +74,7 @@ const std::map<std::string, std::tuple<unsigned, int>> CRC_polynomial<B>::known_\n{\"12-CDMA2000\" , std::make_tuple(0xF13 , 12)},\n{\"12-TELECOM\" , std::make_tuple(0x80F , 12)},\n{\"11-FLEXRAY\" , std::make_tuple(0x385 , 11)},\n+ {\"11-5G\" , std::make_tuple(0x621 , 11)},\n{\"10-CDMA2000\" , std::make_tuple(0x3D9 , 10)},\n{\"10-ATM\" , std::make_tuple(0x233 , 10)},\n{\"8-WCDMA\" , std::make_tuple(0x9B , 8)},\n@@ -94,3 +99,7 @@ const std::map<std::string, std::tuple<unsigned, int>> CRC_polynomial<B>::known_\n}\n#endif /* CRC_POLYNOMIAL_HPP_ */\n+\n+\n+\n+\n" } ]
C++
MIT License
aff3ct/aff3ct
Add 5G CRCs.
8,488
05.02.2019 11:07:28
-3,600
802ab8c0dca67f3c2f687ccb1dc7580e0f09fd7f
Add 5G CRCs in doc.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/crc/crc_polynomials.csv", "new_path": "doc/sphinx/source/user/simulation/parameters/crc/crc_polynomials.csv", "diff": "@@ -7,6 +7,9 @@ Type ; Polynomial ; Size\n24-LTEA ; 0x864CFB ; 24\n24-RADIX-64 ; 0x864CFB ; 24\n24-FLEXRAY ; 0x5D6DCB ; 24\n+24-5GA ; 0x864CFB ; 24\n+24-5GB ; 0x800063 ; 24\n+24-5GC ; 0xB2B117 ; 24\n21-CAN ; 0x102899 ; 21\n17-CAN ; 0x1685B ; 17\n16-IBM ; 0x8005 ; 16\n@@ -20,6 +23,7 @@ Type ; Polynomial ; Size\n16-CDMA2000 ; 0xC867 ; 16\n16-ARINC ; 0xA02B ; 16\n16-CHAKRAVARTY ; 0x2F15 ; 16\n+16-5G ; 0x1023 ; 16\n15-MPT1327 ; 0x6815 ; 15\n15-CAN ; 0x4599 ; 15\n14-DARC ; 0x0805 ; 14\n@@ -27,6 +31,7 @@ Type ; Polynomial ; Size\n12-CDMA2000 ; 0xF13 ; 12\n12-TELECOM ; 0x80F ; 12\n11-FLEXRAY ; 0x385 ; 11\n+11-5G ; 0x621 ; 11\n10-CDMA2000 ; 0x3D9 ; 10\n10-ATM ; 0x233 ; 10\n8-WCDMA ; 0x9B ; 8\n" }, { "change_type": "MODIFY", "old_path": "src/Module/CRC/Polynomial/CRC_polynomial.hpp", "new_path": "src/Module/CRC/Polynomial/CRC_polynomial.hpp", "diff": "@@ -99,7 +99,3 @@ const std::map<std::string, std::tuple<unsigned, int>> CRC_polynomial<B>::known_\n}\n#endif /* CRC_POLYNOMIAL_HPP_ */\n-\n-\n-\n-\n" } ]
C++
MIT License
aff3ct/aff3ct
Add 5G CRCs in doc.
8,488
05.02.2019 18:13:12
-3,600
b69a3da1bfebe667749dbfc2dc4e45e530005693
Split doc for enc-fb-noise.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "diff": "@@ -128,6 +128,10 @@ positions in the codeword. The strategy is to freeze the less reliable channels.\n|factory::Frozenbits_generator::parameters::p+noise|\n+Can be a gaussian noise variance :math:`\\sigma` for |GA| and |TV| generation\n+methods, or an event probability for the |BEC| generation method. All the noise\n+points in the simulation will use the same frozen bits configuration.\n+\nReferences\n\"\"\"\"\"\"\"\"\"\"\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": "Select the codeword size :math:`N`.\n.. |factory::Frozenbits_generator::parameters::p+noise| replace::\n- Selects the noise for which the frozen bits will be optimized. Can be\n- a gaussian noise variance :math:`\\sigma` for an |AWGN| channel, or an event\n- probability for a |BEC| channel. All the noise points in the simulation will\n- use the same frozen bits configuration.\n+ Select the noise for which the frozen bits will be optimized.\n.. |factory::Frozenbits_generator::parameters::p+gen-method| replace::\nSelect the frozen bits generation method.\n" } ]
C++
MIT License
aff3ct/aff3ct
Split doc for enc-fb-noise.
8,488
05.02.2019 18:27:58
-3,600
b0972bd0bba61506b0fff83e8fa7f04f6b6180fd
Update doc for 5G fb generator.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "diff": "@@ -72,6 +72,9 @@ Description of the allowed values:\n| ``BEC`` | Generate frozen bits for the |BEC| channel from |\n| | :cite:`Arikan2009`. |\n+----------+-------------------------------------------------------------------+\n+| ``5G`` | Generate the frozen bits as described in the 5G standard |\n+| | :cite:`3GPP2017`. |\n++----------+-------------------------------------------------------------------+\n.. note:: By default, when using the |GA| or the |TV| method, the frozen bits\nare optimized for each |SNR| point. To override this behavior you can use\n@@ -83,6 +86,8 @@ Description of the allowed values:\n.. note:: When using the ``BEC`` method, the frozen bits are optimized for each\nerasure probability.\n+.. note:: When using the ``5G`` method, the codeword size must be inferior\n+ to 1024.\n.. _enc-polar-enc-fb-awgn-path:\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/references_enc.bib", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/references_enc.bib", "diff": "groups = {Polar Codes},\nkeywords = {approximation theory, codes, alphabet size, approximation methods, channel capacity, construction algorithms, polar bit-channels, polar codes, Approximation algorithms, Approximation methods, Complexity theory, Convolutional codes, Decoding, Kernel, Quantization (signal), Channel degrading and upgrading, channel polarization, construction algorithms, polar codes},\n}\n+\n+\n+@misc{3GPP2017,\n+ title = {{TS} 38.212, {Multiplexing} and {Channel} {Coding} ({Release} 15)},\n+ author = {{3GPP}},\n+ url = {http://www.3gpp.org/ftp//Specs/archive/38_series/38.212/},\n+}\n" } ]
C++
MIT License
aff3ct/aff3ct
Update doc for 5G fb generator.
8,490
06.02.2019 11:13:16
-3,600
0ae46a11af1fb84b5cb93306d492cba1915de7c8
Add maccros to avoid to compile some LDPC code when the compiler does not support 'aligned new' feature.
[ { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BP/Flooding/Decoder_LDPC_BP_flooding_inter.hpp", "new_path": "src/Module/Decoder/LDPC/BP/Flooding/Decoder_LDPC_BP_flooding_inter.hpp", "diff": "#ifndef DECODER_LDPC_BP_FLOODING_INTER_HPP_\n+#ifdef __cpp_aligned_new\n#define DECODER_LDPC_BP_FLOODING_INTER_HPP_\n#include <mipp.h>\n@@ -64,4 +65,5 @@ protected:\n#include \"Decoder_LDPC_BP_flooding_inter.hxx\"\n+#endif\n#endif /* DECODER_LDPC_BP_FLOODING_INTER_HPP_ */\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BP/Horizontal_layered/Decoder_LDPC_BP_horizontal_layered_inter.hpp", "new_path": "src/Module/Decoder/LDPC/BP/Horizontal_layered/Decoder_LDPC_BP_horizontal_layered_inter.hpp", "diff": "#ifndef DECODER_LDPC_BP_HORIZONTAL_LAYERED_INTER_HPP_\n+#ifdef __cpp_aligned_new\n#define DECODER_LDPC_BP_HORIZONTAL_LAYERED_INTER_HPP_\n#include <mipp.h>\n@@ -58,4 +59,5 @@ protected:\n#include \"Decoder_LDPC_BP_horizontal_layered_inter.hxx\"\n+#endif\n#endif /* DECODER_LDPC_BP_HORIZONTAL_LAYERED_INTER_HPP_ */\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/LDPC/BP/Vertical_layered/Decoder_LDPC_BP_vertical_layered_inter.hpp", "new_path": "src/Module/Decoder/LDPC/BP/Vertical_layered/Decoder_LDPC_BP_vertical_layered_inter.hpp", "diff": "#ifndef DECODER_LDPC_BP_VERTICAL_LAYERED_INTER_HPP_\n+#ifdef __cpp_aligned_new\n#define DECODER_LDPC_BP_VERTICAL_LAYERED_INTER_HPP_\n#include <mipp.h>\n@@ -59,4 +60,5 @@ protected:\n#include \"Decoder_LDPC_BP_vertical_layered_inter.hxx\"\n+#endif\n#endif /* DECODER_LDPC_BP_VERTICAL_LAYERED_INTER_HPP_ */\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/LDPC/Update_rule/AMS/Update_rule_AMS_simd.hpp", "new_path": "src/Tools/Code/LDPC/Update_rule/AMS/Update_rule_AMS_simd.hpp", "diff": "#ifndef UPDATE_RULE_AMS_SIMD_HPP\n+#ifdef __cpp_aligned_new\n#define UPDATE_RULE_AMS_SIMD_HPP\n#include <vector>\n@@ -111,4 +112,5 @@ public:\n}\n}\n+#endif\n#endif /* UPDATE_RULE_AMS_SIMD_HPP */\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/LDPC/Update_rule/LSPA/Update_rule_LSPA_simd.hpp", "new_path": "src/Tools/Code/LDPC/Update_rule/LSPA/Update_rule_LSPA_simd.hpp", "diff": "#ifndef UPDATE_RULE_LSPA_SIMD_HPP\n+#ifdef __cpp_aligned_new\n#define UPDATE_RULE_LSPA_SIMD_HPP\n#include <sstream>\n@@ -130,4 +131,5 @@ public:\n}\n}\n+#endif\n#endif /* UPDATE_RULE_LSPA_SIMD_HPP */\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/LDPC/Update_rule/MS/Update_rule_MS_simd.hpp", "new_path": "src/Tools/Code/LDPC/Update_rule/MS/Update_rule_MS_simd.hpp", "diff": "#ifndef UPDATE_RULE_MS_SIMD_HPP\n+#ifdef __cpp_aligned_new\n#define UPDATE_RULE_MS_SIMD_HPP\n#include <limits>\n@@ -122,4 +123,5 @@ public:\n}\n}\n+#endif\n#endif /* UPDATE_RULE_MS_SIMD_HPP */\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/LDPC/Update_rule/NMS/Update_rule_NMS_simd.hpp", "new_path": "src/Tools/Code/LDPC/Update_rule/NMS/Update_rule_NMS_simd.hpp", "diff": "#ifndef UPDATE_RULE_NMS_SIMD_HPP\n+#ifdef __cpp_aligned_new\n#define UPDATE_RULE_NMS_SIMD_HPP\n#include <cassert>\n@@ -149,4 +150,5 @@ public:\n}\n}\n+#endif\n#endif /* UPDATE_RULE_NMS_SIMD_HPP */\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/LDPC/Update_rule/OMS/Update_rule_OMS_simd.hpp", "new_path": "src/Tools/Code/LDPC/Update_rule/OMS/Update_rule_OMS_simd.hpp", "diff": "#ifndef UPDATE_RULE_OMS_SIMD_HPP\n+#ifdef __cpp_aligned_new\n#define UPDATE_RULE_OMS_SIMD_HPP\n#include <cassert>\n@@ -94,4 +95,5 @@ public:\n}\n}\n+#endif\n#endif /* UPDATE_RULE_OMS_SIMD_HPP */\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "src/Tools/Code/LDPC/Update_rule/SPA/Update_rule_SPA_simd.hpp", "new_path": "src/Tools/Code/LDPC/Update_rule/SPA/Update_rule_SPA_simd.hpp", "diff": "#ifndef UPDATE_RULE_SPA_SIMD_HPP\n+#ifdef __cpp_aligned_new\n#define UPDATE_RULE_SPA_SIMD_HPP\n#include <sstream>\n@@ -128,4 +129,5 @@ public:\n}\n}\n+#endif\n#endif /* UPDATE_RULE_SPA_SIMD_HPP */\n" } ]
C++
MIT License
aff3ct/aff3ct
Add maccros to avoid to compile some LDPC code when the compiler does not support 'aligned new' feature.
8,488
07.02.2019 17:08:16
-3,600
2ad75f447869d03e065c6bcbdfa84b18791bc336
Add forgotten 5G in parameters list for enc-fb-gen-method.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/encoder.rst", "diff": "@@ -50,7 +50,7 @@ Description of the allowed values:\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n:Type: text\n- :Allowed values: ``FILE`` ``GA`` ``TV`` ``BEC``\n+ :Allowed values: ``FILE`` ``GA`` ``TV`` ``BEC`` ``5G``\n:Examples: ``--enc-fb-gen-method FILE``\n|factory::Frozenbits_generator::parameters::p+gen-method|\n" } ]
C++
MIT License
aff3ct/aff3ct
Add forgotten 5G in parameters list for enc-fb-gen-method.
8,488
07.02.2019 18:02:51
-3,600
e0b3ca51c590e2596f0d37e3ee7f500bd8580dfe
Add Naive SCF decoder files.
[ { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.cpp", "new_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.cpp", "diff": "#include \"Module/Decoder/Polar/SC/Decoder_polar_SC_fast_sys.hpp\"\n#include \"Module/Decoder/Polar/SCAN/Decoder_polar_SCAN_naive.hpp\"\n#include \"Module/Decoder/Polar/SCAN/Decoder_polar_SCAN_naive_sys.hpp\"\n+#include \"Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hpp\"\n#include \"Module/Decoder/Polar/SCL/Decoder_polar_SCL_naive.hpp\"\n#include \"Module/Decoder/Polar/SCL/Decoder_polar_SCL_naive_sys.hpp\"\n#include \"Module/Decoder/Polar/SCL/Decoder_polar_SCL_fast_sys.hpp\"\n@@ -73,7 +74,7 @@ void Decoder_polar::parameters\nauto p = this->get_prefix();\nconst std::string class_name = \"factory::Decoder_polar::parameters::\";\n- tools::add_options(args.at({p+\"-type\", \"D\"}), 0, \"SC\", \"SCL\", \"SCL_MEM\", \"ASCL\", \"ASCL_MEM\", \"SCAN\");\n+ tools::add_options(args.at({p+\"-type\", \"D\"}), 0, \"SC\", \"SCL\", \"SCL_MEM\", \"ASCL\", \"ASCL_MEM\", \"SCAN\", \"SCF\");\nargs.at({p+\"-implem\"})->change_type(tools::Text(tools::Example_set(\"FAST\", \"NAIVE\")));\n@@ -174,6 +175,7 @@ module::Decoder_SIHO<B,Q>* Decoder_polar::parameters\nif (crc == nullptr || crc->get_size() == 0)\n{\nif (this->type == \"SC\" ) return new module::Decoder_polar_SC_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, frozen_bits, this->n_frames);\n+ if (this->type == \"SCF\" ) return new module::Decoder_polar_SCF_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, frozen_bits, this->n_frames);\nif (this->type == \"SCAN\") return new module::Decoder_polar_SCAN_naive <B,Q,tools::f_LLR<Q>,tools::v_LLR< Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, this->n_ite, frozen_bits, this->n_frames);\nif (this->type == \"SCL\" ) return new module::Decoder_polar_SCL_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q> >(this->K, this->N_cw, this->L, frozen_bits, this->n_frames);\n}\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hpp", "diff": "+#ifndef DECODER_POLAR_SCF_NAIVE_\n+#define DECODER_POLAR_SCF_NAIVE_\n+\n+#include <vector>\n+\n+#include \"Tools/Algo/Tree/Binary_tree.hpp\"\n+#include \"Tools/Code/Polar/decoder_polar_functions.h\"\n+\n+#include \"../SC/Decoder_polar_SC_naive.hpp\"\n+\n+namespace aff3ct\n+{\n+namespace module\n+{\n+template <typename B = int, typename R = float, tools::proto_f< R> F = tools::f_LLR,\n+ tools::proto_g<B,R> G = tools::g_LLR,\n+ tools::proto_h<B,R> H = tools::h_LLR>\n+class Decoder_polar_SCF_naive : public Decoder_polar_SC_naive<B,R,F,G,H>\n+{\n+public:\n+ Decoder_polar_SCF_naive(const int& K, const int& N, const std::vector<bool>& frozen_bits,\n+ const int n_frames = 1);\n+ virtual ~Decoder_polar_SCF_naive() = default;\n+};\n+}\n+}\n+\n+#include \"Decoder_polar_SCF_naive.hxx\"\n+\n+#endif /* DECODER_POLAR_SCF_NAIVE_ */\n" }, { "change_type": "ADD", "old_path": null, "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "diff": "+#include \"Decoder_polar_SCF_naive.hpp\"\n+\n+namespace aff3ct\n+{\n+namespace module\n+{\n+template <typename B, typename R, tools::proto_f<R> F, tools::proto_g<B,R> G, tools::proto_h<B,R> H>\n+Decoder_polar_SCF_naive<B,R,F,G,H>\n+::Decoder_polar_SCF_naive(const int& K, const int& N, const std::vector<bool>& frozen_bits, const int n_frames)\n+: Decoder(K, N, n_frames, 1),\n+ Decoder_polar_SC_naive<B,R,F,G,H>(K, N, frozen_bits, n_frames)\n+{\n+ const std::string name = \"Decoder_polar_SCF_naive\";\n+ this->set_name(name);\n+}\n+}\n+}\n" } ]
C++
MIT License
aff3ct/aff3ct
Add Naive SCF decoder files.
8,488
07.02.2019 18:24:55
-3,600
8dda40e32176bb97c7800ab53a1a2359accb0e7e
Add CRC to SCF.
[ { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.cpp", "new_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.cpp", "diff": "@@ -175,14 +175,16 @@ module::Decoder_SIHO<B,Q>* Decoder_polar::parameters\nif (crc == nullptr || crc->get_size() == 0)\n{\nif (this->type == \"SC\" ) return new module::Decoder_polar_SC_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, frozen_bits, this->n_frames);\n- if (this->type == \"SCF\" ) return new module::Decoder_polar_SCF_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, frozen_bits, this->n_frames);\nif (this->type == \"SCAN\") return new module::Decoder_polar_SCAN_naive <B,Q,tools::f_LLR<Q>,tools::v_LLR< Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, this->n_ite, frozen_bits, this->n_frames);\nif (this->type == \"SCL\" ) return new module::Decoder_polar_SCL_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q> >(this->K, this->N_cw, this->L, frozen_bits, this->n_frames);\n}\nelse\n+ {\n+ if (this->type == \"SCF\" ) return new module::Decoder_polar_SCF_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, frozen_bits, *crc, this->n_frames);\nif (this->type == \"SCL\" ) return new module::Decoder_polar_SCL_naive_CA <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q> >(this->K, this->N_cw, this->L, frozen_bits, *crc, this->n_frames);\n}\n}\n+ }\nelse // systematic encoding\n{\nif (this->implem == \"NAIVE\")\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SC/Decoder_polar_SC_naive.hpp", "new_path": "src/Module/Decoder/Polar/SC/Decoder_polar_SC_naive.hpp", "diff": "@@ -47,11 +47,11 @@ protected:\nvoid _decode_siho (const R *Y_N, B *V_K, const int frame_id );\nvoid _decode_siho_cw (const R *Y_N, B *V_N, const int frame_id );\nvirtual void _store ( B *V, bool coded = false ) const;\n+ virtual void recursive_decode(const tools::Binary_node<Contents_SC<B,R>>* node_curr);\nprivate:\nvoid recursive_allocate_nodes_contents ( tools::Binary_node<Contents_SC<B,R>>* node_curr, const int vector_size );\nvoid recursive_initialize_frozen_bits (const tools::Binary_node<Contents_SC<B,R>>* node_curr, const std::vector<bool> &frozen_bits);\n- void recursive_decode (const tools::Binary_node<Contents_SC<B,R>>* node_curr );\nvoid recursive_store (const tools::Binary_node<Contents_SC<B,R>>* node_curr, B *V_K, int &k ) const;\nvoid recursive_deallocate_nodes_contents( tools::Binary_node<Contents_SC<B,R>>* node_curr );\n};\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hpp", "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hpp", "diff": "#include \"Tools/Algo/Tree/Binary_tree.hpp\"\n#include \"Tools/Code/Polar/decoder_polar_functions.h\"\n+#include \"Module/CRC/CRC.hpp\"\n+\n#include \"../SC/Decoder_polar_SC_naive.hpp\"\n@@ -17,10 +19,17 @@ template <typename B = int, typename R = float, tools::proto_f< R> F = tools::f\ntools::proto_h<B,R> H = tools::h_LLR>\nclass Decoder_polar_SCF_naive : public Decoder_polar_SC_naive<B,R,F,G,H>\n{\n+protected:\n+ CRC<B>& crc;\n+\npublic:\nDecoder_polar_SCF_naive(const int& K, const int& N, const std::vector<bool>& frozen_bits,\n- const int n_frames = 1);\n+ CRC<B>& crc, const int n_frames = 1);\nvirtual ~Decoder_polar_SCF_naive() = default;\n+\n+protected:\n+ void recursive_decode(const tools::Binary_node<Contents_SC<B,R>>* node_curr);\n+\n};\n}\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "diff": "@@ -6,12 +6,65 @@ namespace module\n{\ntemplate <typename B, typename R, tools::proto_f<R> F, tools::proto_g<B,R> G, tools::proto_h<B,R> H>\nDecoder_polar_SCF_naive<B,R,F,G,H>\n-::Decoder_polar_SCF_naive(const int& K, const int& N, const std::vector<bool>& frozen_bits, const int n_frames)\n+::Decoder_polar_SCF_naive(const int& K, const int& N, const std::vector<bool>& frozen_bits,\n+ CRC<B>& crc, const int n_frames)\n: Decoder(K, N, n_frames, 1),\n- Decoder_polar_SC_naive<B,R,F,G,H>(K, N, frozen_bits, n_frames)\n+ Decoder_polar_SC_naive<B,R,F,G,H>(K, N, frozen_bits, n_frames),\n+ crc(crc)\n{\nconst std::string name = \"Decoder_polar_SCF_naive\";\nthis->set_name(name);\n+\n+ if (crc.get_size() > K)\n+ {\n+ std::stringstream message;\n+ message << \"'crc.get_size()' has to be equal or smaller than 'K' ('crc.get_size()' = \" << crc.get_size()\n+ << \", 'K' = \" << K << \").\";\n+ throw tools::invalid_argument(__FILE__, __LINE__, __func__, message.str());\n+ }\n}\n+\n+\n+\n+template <typename B, typename R, tools::proto_f<R> F, tools::proto_g<B,R> G, tools::proto_h<B,R> H>\n+void Decoder_polar_SCF_naive<B,R,F,G,H>\n+::recursive_decode(const tools::Binary_node<Contents_SC<B,R>>* node_curr)\n+{\n+ if (!node_curr->is_leaf()) // stop condition\n+ {\n+ const auto size = (int)node_curr->get_c()->lambda.size();\n+ const auto size_2 = size / 2;\n+\n+ const auto *node_left = node_curr->get_left(); // get left node\n+ const auto *node_right = node_curr->get_right(); // get right node\n+\n+ for (auto i = 0; i < size_2; i++)\n+ node_left->get_c()->lambda[i] = F(node_curr->get_c()->lambda[ i], // apply f()\n+ node_curr->get_c()->lambda[size_2 +i]);\n+\n+ this->recursive_decode(node_left); // recursive call\n+\n+ for (auto i = 0; i < size_2; i++)\n+ node_right->get_c()->lambda[i] = G(node_curr->get_c()->lambda[ i], // apply g()\n+ node_curr->get_c()->lambda[size_2 +i],\n+ node_left->get_c()->s [ i]);\n+\n+ this->recursive_decode(node_right); // recursive call\n+\n+ for (auto i = 0; i < size_2; i++)\n+ node_curr->get_c()->s[i] = node_left ->get_c()->s[i] ^ node_right->get_c()->s[i]; // bit xor\n+\n+ for (auto i = 0; i < size_2; i++)\n+ node_curr->get_c()->s[size_2 +i] = node_right->get_c()->s[i]; // bit eq\n+ }\n+ else // specific leaf treatment\n+ {\n+ node_curr->get_c()->s[0] = (!node_curr->get_c()->is_frozen_bit && // if this is a frozen bit then s == 0\n+ H(node_curr->get_c()->lambda[0])); // apply h()\n+ }\n+}\n+\n+\n+\n}\n}\n" } ]
C++
MIT License
aff3ct/aff3ct
Add CRC to SCF.
8,488
08.02.2019 11:29:38
-3,600
2488f698b26acd4666374b0321e883bfae77f9c6
Add first functional SCF NAIVE. Hardcoded T param.
[ { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SC/Decoder_polar_SC_naive.hpp", "new_path": "src/Module/Decoder/Polar/SC/Decoder_polar_SC_naive.hpp", "diff": "@@ -44,8 +44,8 @@ public:\nprotected:\nvoid _load (const R *Y_N );\n- void _decode_siho (const R *Y_N, B *V_K, const int frame_id );\n- void _decode_siho_cw (const R *Y_N, B *V_N, const int frame_id );\n+ virtual void _decode_siho (const R *Y_N, B *V_K, const int frame_id );\n+ virtual void _decode_siho_cw (const R *Y_N, B *V_N, const int frame_id );\nvirtual void _store ( B *V, bool coded = false ) const;\nvirtual void recursive_decode(const tools::Binary_node<Contents_SC<B,R>>* node_curr);\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hpp", "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hpp", "diff": "@@ -22,14 +22,19 @@ class Decoder_polar_SCF_naive : public Decoder_polar_SC_naive<B,R,F,G,H>\nprotected:\nCRC<B>& crc;\n+ int param_t;\n+ std::vector<int> index;\n+ int current_flip_index;\n+\npublic:\nDecoder_polar_SCF_naive(const int& K, const int& N, const std::vector<bool>& frozen_bits,\nCRC<B>& crc, const int n_frames = 1);\nvirtual ~Decoder_polar_SCF_naive() = default;\nprotected:\n+ void _decode_siho (const R *Y_N, B *V_K, const int frame_id );\n+ void _decode_siho_cw (const R *Y_N, B *V_N, const int frame_id );\nvoid recursive_decode(const tools::Binary_node<Contents_SC<B,R>>* node_curr);\n-\n};\n}\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "diff": "@@ -10,6 +10,8 @@ Decoder_polar_SCF_naive<B,R,F,G,H>\nCRC<B>& crc, const int n_frames)\n: Decoder(K, N, n_frames, 1),\nDecoder_polar_SC_naive<B,R,F,G,H>(K, N, frozen_bits, n_frames),\n+ param_t(8),\n+ index(K),\ncrc(crc)\n{\nconst std::string name = \"Decoder_polar_SCF_naive\";\n@@ -30,6 +32,7 @@ template <typename B, typename R, tools::proto_f<R> F, tools::proto_g<B,R> G, to\nvoid Decoder_polar_SCF_naive<B,R,F,G,H>\n::recursive_decode(const tools::Binary_node<Contents_SC<B,R>>* node_curr)\n{\n+\nif (!node_curr->is_leaf()) // stop condition\n{\nconst auto size = (int)node_curr->get_c()->lambda.size();\n@@ -61,10 +64,142 @@ void Decoder_polar_SCF_naive<B,R,F,G,H>\n{\nnode_curr->get_c()->s[0] = (!node_curr->get_c()->is_frozen_bit && // if this is a frozen bit then s == 0\nH(node_curr->get_c()->lambda[0])); // apply h()\n+\n+ if (current_flip_index == node_curr->get_lane_id())\n+ node_curr->get_c()->s[0] = !node_curr->get_c()->s[0];\n+ }\n+\n+}\n+\n+template <typename B, typename R, tools::proto_f<R> F, tools::proto_g<B,R> G, tools::proto_h<B,R> H>\n+void Decoder_polar_SCF_naive<B,R,F,G,H>\n+::_decode_siho(const R *Y_N, B *V_K, const int frame_id)\n+{\n+ // initialization\n+ bool decode_result = false;\n+ int n_ite = 0;\n+\n+ // initialize indices with inf bits indices\n+ // TODO: move to notify_frozen ?\n+ auto j = 0;\n+ for (auto i = 0; i < this->N; i++)\n+ if (!this->frozen_bits[i])\n+ index[j++] = i;\n+\n+ // get tree leaves\n+ auto leaves = this->polar_tree.get_leaves();\n+\n+// auto t_load = std::chrono::steady_clock::now(); // ----------------------------------------------------------- LOAD\n+ this->_load(Y_N);\n+// auto d_load = std::chrono::steady_clock::now() - t_load;\n+\n+// auto t_decod = std::chrono::steady_clock::now(); // -------------------------------------------------------- DECODE\n+ // initialize current_flip_index\n+ current_flip_index = -1;\n+\n+ // decode\n+ this->recursive_decode(this->polar_tree.get_root());\n+\n+ // identify the param_t weakest llrs\n+ std::partial_sort(index.begin(), index.begin() + param_t, index.end(),\n+ [leaves](const int& a, const int& b)\n+ {return std::abs(leaves[a]->get_c()->lambda[0]) < std::abs(leaves[b]->get_c()->lambda[0]);}\n+ );\n+\n+ // test crc\n+ std::vector<B> U_test;\n+ U_test.clear();\n+ for (auto leaf = 0 ; leaf < this->N ; leaf++)\n+ if (!this->frozen_bits[leaf])\n+ U_test.push_back(leaves[leaf]->get_c()->s[0]);\n+ decode_result = this->crc.check(U_test, this->get_simd_inter_frame_level());\n+\n+ while ((n_ite < param_t) && (!decode_result))\n+ {\n+ current_flip_index = index[n_ite];\n+\n+ // decode\n+ this->recursive_decode(this->polar_tree.get_root());\n+\n+ // test crc\n+ std::vector<B> U_test;\n+ U_test.clear();\n+ for (auto leaf = 0 ; leaf < this->N ; leaf++)\n+ if (!this->frozen_bits[leaf])\n+ U_test.push_back(leaves[leaf]->get_c()->s[0]);\n+ decode_result = this->crc.check(U_test, this->get_simd_inter_frame_level());\n+\n+ n_ite ++;\n}\n+// auto d_decod = std::chrono::steady_clock::now() - t_decod;\n+\n+// auto t_store = std::chrono::steady_clock::now(); // --------------------------------------------------------- STORE\n+ this->_store(V_K);\n+// auto d_store = std::chrono::steady_clock::now() - t_store;\n+\n+// (*this)[dec::tsk::decode_siho].update_timer(dec::tm::decode_siho::load, d_load);\n+// (*this)[dec::tsk::decode_siho].update_timer(dec::tm::decode_siho::decode, d_decod);\n+// (*this)[dec::tsk::decode_siho].update_timer(dec::tm::decode_siho::store, d_store);\n+}\n+\n+template <typename B, typename R, tools::proto_f<R> F, tools::proto_g<B,R> G, tools::proto_h<B,R> H>\n+void Decoder_polar_SCF_naive<B,R,F,G,H>\n+::_decode_siho_cw(const R *Y_N, B *V_N, const int frame_id)\n+{\n+// auto t_load = std::chrono::steady_clock::now(); // ----------------------------------------------------------- LOAD\n+ this->_load(Y_N);\n+// auto d_load = std::chrono::steady_clock::now() - t_load;\n+\n+// auto t_decod = std::chrono::steady_clock::now(); // -------------------------------------------------------- DECODE\n+ // initialize current_flip_index\n+ current_flip_index = -1;\n+\n+ // decode\n+ this->recursive_decode(this->polar_tree.get_root());\n+\n+ // identify the param_t weakest llrs\n+ std::partial_sort(index.begin(), index.begin() + param_t, index.end(),\n+ [leaves](const int& a, const int& b)\n+ {return std::abs(leaves[a]->get_c()->lambda[0]) < std::abs(leaves[b]->get_c()->lambda[0]);}\n+ );\n+\n+ // test crc\n+ std::vector<B> U_test;\n+ U_test.clear();\n+ for (auto leaf = 0 ; leaf < this->N ; leaf++)\n+ if (!this->frozen_bits[leaf])\n+ U_test.push_back(leaves[leaf]->get_c()->s[0]);\n+ decode_result = this->crc.check(U_test, this->get_simd_inter_frame_level());\n+\n+ while ((n_ite < param_t) && (!decode_result))\n+ {\n+ current_flip_index = index[n_ite];\n+\n+ // decode\n+ this->recursive_decode(this->polar_tree.get_root());\n+\n+ // test crc\n+ std::vector<B> U_test;\n+ U_test.clear();\n+ for (auto leaf = 0 ; leaf < this->N ; leaf++)\n+ if (!this->frozen_bits[leaf])\n+ U_test.push_back(leaves[leaf]->get_c()->s[0]);\n+ decode_result = this->crc.check(U_test, this->get_simd_inter_frame_level());\n+\n+ n_ite ++;\n}\n+// auto d_decod = std::chrono::steady_clock::now() - t_decod;\n+// auto t_store = std::chrono::steady_clock::now(); // --------------------------------------------------------- STORE\n+ this->_store(V_N, true);\n+// auto d_store = std::chrono::steady_clock::now() - t_store;\n+\n+// (*this)[dec::tsk::decode_siho_cw].update_timer(dec::tm::decode_siho_cw::load, d_load);\n+// (*this)[dec::tsk::decode_siho_cw].update_timer(dec::tm::decode_siho_cw::decode, d_decod);\n+// (*this)[dec::tsk::decode_siho_cw].update_timer(dec::tm::decode_siho_cw::store, d_store);\n+}\n}\n}\n+\n" } ]
C++
MIT License
aff3ct/aff3ct
Add first functional SCF NAIVE. Hardcoded T param.
8,488
08.02.2019 11:44:14
-3,600
919a2746edfc865d3d92b27737d3d5d28fe893ac
Fix build errors and warnings.
[ { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "diff": "@@ -10,9 +10,9 @@ Decoder_polar_SCF_naive<B,R,F,G,H>\nCRC<B>& crc, const int n_frames)\n: Decoder(K, N, n_frames, 1),\nDecoder_polar_SC_naive<B,R,F,G,H>(K, N, frozen_bits, n_frames),\n+ crc(crc),\nparam_t(8),\n- index(K),\n- crc(crc)\n+ index(K)\n{\nconst std::string name = \"Decoder_polar_SCF_naive\";\nthis->set_name(name);\n@@ -94,6 +94,7 @@ void Decoder_polar_SCF_naive<B,R,F,G,H>\n// auto d_load = std::chrono::steady_clock::now() - t_load;\n// auto t_decod = std::chrono::steady_clock::now(); // -------------------------------------------------------- DECODE\n+\n// initialize current_flip_index\ncurrent_flip_index = -1;\n@@ -146,11 +147,26 @@ template <typename B, typename R, tools::proto_f<R> F, tools::proto_g<B,R> G, to\nvoid Decoder_polar_SCF_naive<B,R,F,G,H>\n::_decode_siho_cw(const R *Y_N, B *V_N, const int frame_id)\n{\n+ // initialization\n+ bool decode_result = false;\n+ int n_ite = 0;\n+\n+ // initialize indices with inf bits indices\n+ // TODO: move to notify_frozen ?\n+ auto j = 0;\n+ for (auto i = 0; i < this->N; i++)\n+ if (!this->frozen_bits[i])\n+ index[j++] = i;\n+\n+ // get tree leaves\n+ auto leaves = this->polar_tree.get_leaves();\n+\n// auto t_load = std::chrono::steady_clock::now(); // ----------------------------------------------------------- LOAD\nthis->_load(Y_N);\n// auto d_load = std::chrono::steady_clock::now() - t_load;\n// auto t_decod = std::chrono::steady_clock::now(); // -------------------------------------------------------- DECODE\n+\n// initialize current_flip_index\ncurrent_flip_index = -1;\n" } ]
C++
MIT License
aff3ct/aff3ct
Fix build errors and warnings.
8,488
08.02.2019 13:11:48
-3,600
512dde99fa097ece1a072c25e24ca06b099f232c
Use param --dec-flips in SCF.
[ { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.cpp", "new_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.cpp", "diff": "@@ -129,6 +129,9 @@ void Decoder_polar::parameters\nif (this->type == \"SCAN\")\nheaders[p].push_back(std::make_pair(\"Num. of iterations (i)\", std::to_string(this->n_ite)));\n+ if (this->type == \"SCF\")\n+ headers[p].push_back(std::make_pair(\"Num. of flips\", std::to_string(this->flips)));\n+\nif (this->type == \"SCL\" || this->type == \"SCL_MEM\")\nheaders[p].push_back(std::make_pair(\"Num. of lists (L)\", std::to_string(this->L)));\n@@ -180,7 +183,7 @@ module::Decoder_SIHO<B,Q>* Decoder_polar::parameters\n}\nelse\n{\n- if (this->type == \"SCF\" ) return new module::Decoder_polar_SCF_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, frozen_bits, *crc, this->n_frames);\n+ if (this->type == \"SCF\" ) return new module::Decoder_polar_SCF_naive <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q>,tools::h_LLR<B,Q>>(this->K, this->N_cw, frozen_bits, *crc, this->flips, this->n_frames);\nif (this->type == \"SCL\" ) return new module::Decoder_polar_SCL_naive_CA <B,Q,tools::f_LLR<Q>,tools::g_LLR<B,Q> >(this->K, this->N_cw, this->L, frozen_bits, *crc, this->n_frames);\n}\n}\n" }, { "change_type": "MODIFY", "old_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.hpp", "new_path": "src/Factory/Module/Decoder/Polar/Decoder_polar.hpp", "diff": "@@ -30,6 +30,7 @@ struct Decoder_polar : public Decoder\nbool full_adaptive = true;\nint n_ite = 1;\nint L = 8;\n+ int T = 8;\n// ---------------------------------------------------------------------------------------------------- METHODS\nexplicit parameters(const std::string &p = Decoder_polar_prefix);\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hpp", "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hpp", "diff": "@@ -22,13 +22,13 @@ class Decoder_polar_SCF_naive : public Decoder_polar_SC_naive<B,R,F,G,H>\nprotected:\nCRC<B>& crc;\n- int param_t;\n+ const int n_flips;\nstd::vector<int> index;\nint current_flip_index;\npublic:\nDecoder_polar_SCF_naive(const int& K, const int& N, const std::vector<bool>& frozen_bits,\n- CRC<B>& crc, const int n_frames = 1);\n+ CRC<B>& crc, const int n_flips, const int n_frames = 1);\nvirtual ~Decoder_polar_SCF_naive() = default;\nprotected:\n" }, { "change_type": "MODIFY", "old_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "new_path": "src/Module/Decoder/Polar/SCF/Decoder_polar_SCF_naive.hxx", "diff": "@@ -7,11 +7,11 @@ namespace module\ntemplate <typename B, typename R, tools::proto_f<R> F, tools::proto_g<B,R> G, tools::proto_h<B,R> H>\nDecoder_polar_SCF_naive<B,R,F,G,H>\n::Decoder_polar_SCF_naive(const int& K, const int& N, const std::vector<bool>& frozen_bits,\n- CRC<B>& crc, const int n_frames)\n+ CRC<B>& crc, const int n_flips, const int n_frames)\n: Decoder(K, N, n_frames, 1),\nDecoder_polar_SC_naive<B,R,F,G,H>(K, N, frozen_bits, n_frames),\ncrc(crc),\n- param_t(8),\n+ n_flips(n_flips),\nindex(K)\n{\nconst std::string name = \"Decoder_polar_SCF_naive\";\n@@ -101,8 +101,8 @@ void Decoder_polar_SCF_naive<B,R,F,G,H>\n// decode\nthis->recursive_decode(this->polar_tree.get_root());\n- // identify the param_t weakest llrs\n- std::partial_sort(index.begin(), index.begin() + param_t, index.end(),\n+ // identify the n_flips weakest llrs\n+ std::partial_sort(index.begin(), index.begin() + n_flips, index.end(),\n[leaves](const int& a, const int& b)\n{return std::abs(leaves[a]->get_c()->lambda[0]) < std::abs(leaves[b]->get_c()->lambda[0]);}\n);\n@@ -115,7 +115,7 @@ void Decoder_polar_SCF_naive<B,R,F,G,H>\nU_test.push_back(leaves[leaf]->get_c()->s[0]);\ndecode_result = this->crc.check(U_test, this->get_simd_inter_frame_level());\n- while ((n_ite < param_t) && (!decode_result))\n+ while ((n_ite < n_flips) && (!decode_result))\n{\ncurrent_flip_index = index[n_ite];\n@@ -173,8 +173,8 @@ void Decoder_polar_SCF_naive<B,R,F,G,H>\n// decode\nthis->recursive_decode(this->polar_tree.get_root());\n- // identify the param_t weakest llrs\n- std::partial_sort(index.begin(), index.begin() + param_t, index.end(),\n+ // identify the n_flips weakest llrs\n+ std::partial_sort(index.begin(), index.begin() + n_flips, index.end(),\n[leaves](const int& a, const int& b)\n{return std::abs(leaves[a]->get_c()->lambda[0]) < std::abs(leaves[b]->get_c()->lambda[0]);}\n);\n@@ -187,7 +187,7 @@ void Decoder_polar_SCF_naive<B,R,F,G,H>\nU_test.push_back(leaves[leaf]->get_c()->s[0]);\ndecode_result = this->crc.check(U_test, this->get_simd_inter_frame_level());\n- while ((n_ite < param_t) && (!decode_result))\n+ while ((n_ite < n_flips) && (!decode_result))\n{\ncurrent_flip_index = index[n_ite];\n" } ]
C++
MIT License
aff3ct/aff3ct
Use param --dec-flips in SCF.
8,488
08.02.2019 13:41:35
-3,600
9dc92cc8679a8e1fd3f8e755b1d68dc7bd7295db
Update doc for SCF algorithm.
[ { "change_type": "MODIFY", "old_path": "doc/sphinx/source/conf.py", "new_path": "doc/sphinx/source/conf.py", "diff": "@@ -347,10 +347,11 @@ rst_epilog = \"\"\"\n.. |ROP| replace:: :abbr:`ROP (Received Optical Power)`\n.. |RSC| replace:: :abbr:`RSC (Recursive Systematic Convolutional)`\n.. |RS| replace:: :abbr:`RS (Reed-Solomon)`\n+.. |SC| replace:: :abbr:`SC (Successive Cancellation)`\n.. |SCAN| replace:: :abbr:`SCAN (Soft CANcellation)`\n+.. |SCF| replace:: :abbr:`SCF (Successive Cancellation Flip)`\n.. |SCL| replace:: :abbr:`SCL (Successive Cancellation List)`\n.. |SCMA| replace:: :abbr:`SCMA (Sparse Code Multiple Access)`\n-.. |SC| replace:: :abbr:`SC (Successive Cancellation)`\n.. |SCo| replace:: :abbr:`SC (Self-Corrected)`\n.. |SDR| replace:: :abbr:`SDR (Software-Defined Radio)`\n.. |SF| replace:: :abbr:`SF (Scaling Factor)`\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/common/decoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/common/decoder.rst", "diff": "@@ -64,6 +64,10 @@ Description of the allowed values:\n|factory::Decoder::parameters::p+flips|\n+.. note:: Used in the Chase decoding algorithm and in the |SCF| polar decoding\n+ algorithm.\n+\n+\n.. _dec-common-dec-hamming:\n``--dec-hamming``\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/decoder.rst", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/decoder.rst", "diff": "@@ -10,7 +10,7 @@ Polar Decoder parameters\n:Type: text\n:Allowed values: ``SC`` ``SCAN`` ``SCL`` ``SCL_MEM`` ``ASCL`` ``ASCL_MEM``\n- ``CHASE`` ``ML``\n+ ``CHASE`` ``ML`` ``SCF``\n:Default: ``SC``\n:Examples: ``--dec-type ASCL``\n@@ -25,6 +25,8 @@ Description of the allowed values:\n+--------------+---------------------------------------------------------------+\n| ``SCAN`` | Select the |SCAN| algorithm from :cite:`Fayyaz2014`. |\n+--------------+---------------------------------------------------------------+\n+| ``SCF`` | Select the |SCF| algorithm from :cite:`Afisiadis2014`. |\n++--------------+---------------------------------------------------------------+\n| ``SCL`` | Select the |SCL| algorithm from :cite:`Tal2011`, also support |\n| | the improved |CA|-|SCL| algorithm. |\n+--------------+---------------------------------------------------------------+\n@@ -133,6 +135,18 @@ Description of the allowed values:\n|factory::Decoder_polar::parameters::p+ite,i|\n+.. _dec-polar-dec-flips:\n+\n+``--dec-flips``\n+\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n+\n+ :Type: integer\n+ :Examples: ``--dec-flips 1``\n+\n+|factory::Decoder::parameters::p+flips|\n+\n+Corresponds to the ``T`` parameter in :cite:`Afisiadis2014`.\n+\n.. _dec-polar-dec-lists:\n``--dec-lists, -L``\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/references_dec.bib", "new_path": "doc/sphinx/source/user/simulation/parameters/codec/polar/references_dec.bib", "diff": "groups = {Polar Codes, Hardware Decoders},\nkeywords = {block codes, decoding, error correction codes, field programmable gate arrays, linear codes, FPGA implementation, fast polar decoders, flexible polar decoder, gigabit-per-second polar decoder, polar codes, polar decoding hardware throughput, successive-cancellation decoders, symmetric memoryless channel capacity, Complexity theory, Maximum likelihood decoding, Parity check codes, Reliability, Systematics, Throughput, polar codes, storage systems, successive-cancellation decoding, node, nodes, spc, rep},\n}\n+\n+@InProceedings{Afisiadis2014,\n+ author = {O. Afisiadis and A. Balatsoukas-Stimming and A. Burg},\n+ title = {A Low-Complexity Improved Successive Cancellation Decoder for Polar Codes},\n+ booktitle = {Asilomar Conference on Signals, Systems, and Computers (ACSSC)},\n+ year = {2014},\n+ pages = {2116--2120},\n+ month = nov,\n+ publisher = {IEEE},\n+ abstract = {Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorithms such as list- or stack-decoding partially mitigate this performance loss, they suffer from an increase in complexity. In this paper, we describe a new flavor of the SC decoder, called the SC flip decoder. Our algorithm preserves the low memory requirements of the basic SC decoder and adjusts the required decoding effort to the signal quality. In the waterfall region, its average computational complexity is almost as low as that of the SC decoder.},\n+ doi = {10.1109/ACSSC.2014.7094848},\n+ file = {:pdf/Afisiadis2014 - A Low-Complexity Improved Successive Cancellation Decoder for Polar Codes.pdf:PDF},\n+ groups = {Polar Codes},\n+ keywords = {computational complexity, decoding, error statistics, signal processing, average computational complexity, frame error rate, low-complexity improved SC flip decoder, polar codes, signal quality, successive cancellation decoding, Computational complexity, Decoding, Error analysis, Memory management, Signal to noise ratio, SCFlip},\n+}\n\\ No newline at end of file\n" }, { "change_type": "MODIFY", "old_path": "doc/sphinx/strings.rst", "new_path": "doc/sphinx/strings.rst", "diff": "|ML| and Chase decoders.\n.. |factory::Decoder::parameters::p+flips| replace::\n- Set the maximum number of bit flips in the Chase decoder.\n+ Set the maximum number of bit flips in the decoding algorithm.\n.. |factory::Decoder::parameters::p+seed| replace::\nSpecify the decoder |PRNG| seed (if the decoder uses one).\n" } ]
C++
MIT License
aff3ct/aff3ct
Update doc for SCF algorithm.