{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006452153,0.0008689587,0.000459556,0.0004961092,0.0003612903,0.0009585475,0.001174265,0.0008430046,0.004335407],"category_scores_gemma":[0.001933286,0.0003105113,0.0004465354,0.0006360048,0.0005602025,0.0007735098,0.0006120612,0.001486657,0.001703383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005261244,"about_ca_system_score_gemma":0.001319984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001476965,"about_ca_topic_score_gemma":0.002608379,"domain_scores_codex":[0.999436,0.0001670515,0.00003413822,0.00007709883,0.0002369856,0.00004872924],"domain_scores_gemma":[0.9993684,0.0002455888,0.00006510136,0.000120389,0.0001761514,0.00002440323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002905223,0.0002240134,0.0007135479,0.0003755926,0.0001297593,0.0002967899,0.000208015,0.3397053,0.05005419,0.1125989,0.008129959,0.4872734],"study_design_scores_gemma":[0.00004846427,0.0001332305,0.00005367925,0.00001897606,0.00001289604,0.00009768062,0.00001171544,0.9650819,0.01720568,0.009073829,0.008246041,0.00001590387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002936882,0.00007952207,0.9936385,0.0001039661,0.00004804783,0.00003990423,0.00002519519,0.0008644491,0.002263564],"genre_scores_gemma":[0.07143507,0.000102767,0.9253791,0.00007847539,0.00003425368,0.0001402625,0.00009313168,0.000116719,0.002620142],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004335407,"threshold_uncertainty_score":0.01450336,"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."}}