{"id":"W3049056399","doi":"10.1109/tcomm.2020.3016648","title":"A Distributed Low-Complexity Coding Solution for Large-Scale Distributed FFT","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Fast Fourier transform; Computer science; Computational complexity theory; Coding (social sciences); Decoding methods; Distributed algorithm; Distributed computing; Node (physics); Computation; Distributed data store; Parallel computing; Computer engineering; Algorithm; Mathematics; Engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003047068,0.0004233113,0.0003603079,0.000302959,0.0003681768,0.0004226384,0.0007779351,0.0007397759,0.002892762],"category_scores_gemma":[0.001451302,0.000148403,0.0002611766,0.0004416232,0.0004734915,0.000790631,0.000646584,0.0008478784,0.0007237404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004288044,"about_ca_system_score_gemma":0.0008302651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009897504,"about_ca_topic_score_gemma":0.00201676,"domain_scores_codex":[0.9998195,0.00003671061,0.000006374185,0.0000249405,0.00009049263,0.00002212275],"domain_scores_gemma":[0.9995918,0.0001820924,0.00003148301,0.0000734696,0.00009702798,0.00002419653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000160747,0.00008999951,0.0003896663,0.0001357537,0.00002658118,0.0002489659,0.0001719737,0.6540633,0.03002641,0.120031,0.004917409,0.1897382],"study_design_scores_gemma":[0.00001628684,0.00002895529,0.00002952168,0.000005993993,0.000003508303,0.00004883855,0.00001016559,0.9887871,0.002049316,0.007599672,0.001416183,0.000004431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00547507,0.00006982669,0.9922094,0.00007908168,0.00002683774,0.00001872727,0.00001350566,0.0001592107,0.001948327],"genre_scores_gemma":[0.3092557,0.0001841701,0.6845298,0.00009432511,0.00007991752,0.0001397907,0.00006830911,0.00006944639,0.005578427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002892762,"threshold_uncertainty_score":0.009677231,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08301009275867412,"score_gpt":0.3140323364942881,"score_spread":0.231022243735614,"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."}}