{"id":"W2122914962","doi":"10.1109/asap.2005.6","title":"A Fault-Tolerant Modulus Replication Complex FIR Filter","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Residue number system; Fault tolerance; Replication (statistics); Computer science; Computation; Overhead (engineering); Finite impulse response; Throughput; Parallel computing; Wireless; Algorithm; Distributed computing; Mathematics; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001847135,0.00008256613,0.00008037251,0.00006759365,0.0001116422,0.0001071769,0.0005170803,0.00002831577,0.0001184158],"category_scores_gemma":[0.000005793176,0.00007010207,0.00006954352,0.0003088692,0.00002883052,0.0002024554,0.0001057797,0.00004887113,0.0001019345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009751586,"about_ca_system_score_gemma":0.000007820168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006873301,"about_ca_topic_score_gemma":0.00001459353,"domain_scores_codex":[0.9991738,0.0000370409,0.0001488136,0.000345336,0.0001283631,0.0001666828],"domain_scores_gemma":[0.9989449,0.00003217156,0.00003996203,0.0009084895,0.00004041942,0.00003410517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005304593,0.00007578748,0.0003193146,0.000003816927,0.000004747792,0.000002968637,0.00007725112,0.0001493495,0.005986253,0.9352515,0.02774131,0.03038244],"study_design_scores_gemma":[0.0004835541,0.00009424489,0.04391481,0.00001243288,0.00000588512,0.0000219056,0.00001324165,0.3696433,0.006861271,0.4632026,0.1153521,0.0003945916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0385575,0.00002589131,0.9093204,0.001813771,0.0001156698,0.0001020868,0.000001451913,0.0004217619,0.04964153],"genre_scores_gemma":[0.9622472,8.714474e-7,0.03544552,0.0009139198,0.0000611225,0.00001509873,0.000006345108,0.000004165771,0.001305786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9236897,"threshold_uncertainty_score":0.2858679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0213062162291494,"score_gpt":0.238544440937397,"score_spread":0.2172382247082476,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}