{"id":"W2549776980","doi":"10.1109/tsp.2019.2929944","title":"Hardware-Based Linear Program Decoding With the Alternating Direction Method of Multipliers","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal Processing","topic":"Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Cisco Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; CMC Microsystems; National Science Foundation","keywords":"Decoding methods; Computer science; List decoding; Belief propagation; Field-programmable gate array; Sequential decoding; Linear programming; Algorithm; Low-density parity-check code; Verilog; Parallel computing; Computer hardware; Computer engineering; Concatenated error correction code","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000340082,0.0004087089,0.0004425225,0.0002621047,0.0001989915,0.0001218121,0.0003977399,0.0003595706,0.00001204417],"category_scores_gemma":[0.000006814064,0.0003053202,0.0001719504,0.0004313854,0.0001364109,0.0001249992,0.000006227493,0.001646798,0.000004925107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000169686,"about_ca_system_score_gemma":0.0000986724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001517849,"about_ca_topic_score_gemma":0.00001437767,"domain_scores_codex":[0.9983379,0.00005883545,0.000401222,0.0004364791,0.0003981401,0.0003673786],"domain_scores_gemma":[0.9988816,0.0003432013,0.0001921415,0.0003755592,0.0001571641,0.00005032725],"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.00003455583,0.00004532248,0.00000823341,0.0005357158,0.00007927388,0.000001365732,0.00008108235,0.6292069,0.00108194,0.000001426664,0.000004514037,0.3689197],"study_design_scores_gemma":[0.0002807752,0.0001199488,0.000008445926,0.00111544,0.0001434903,0.000004051368,0.0001350019,0.8943273,0.1034369,0.00002743893,0.00008978601,0.0003113305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02191141,0.000189084,0.9744633,0.00009539496,0.000329993,0.0008408038,0.00001608996,0.00174696,0.0004069915],"genre_scores_gemma":[0.7218163,0.00001765576,0.2777754,0.00001365233,0.00005306365,0.0002161391,0.000003226904,0.00008459525,0.00001997347],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6999049,"threshold_uncertainty_score":0.9999399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02195017892605147,"score_gpt":0.2852741907957871,"score_spread":0.2633240118697356,"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."}}