{"id":"W2099409206","doi":"10.1109/iccd.1994.331982","title":"Optimal datapath synthesis of partitioned signal processing algorithm for multiple FPGAs","year":2002,"lang":"en","type":"article","venue":"","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Datapath; Computer science; Field-programmable gate array; Discrete cosine transform; Integer programming; Scheduling (production processes); Algorithm; High-level synthesis; Signal processing; Parallel computing; Digital signal processing; Computer hardware; Mathematics; Mathematical optimization; Artificial intelligence","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.0004088474,0.0001320772,0.0002327981,0.0001059994,0.0001011912,0.00009355573,0.0006908359,0.0000691657,0.00005012023],"category_scores_gemma":[0.00006323065,0.0001171217,0.00007506365,0.0002277744,0.00004473862,0.0007219875,0.0001049126,0.00005142453,0.0000141618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002785497,"about_ca_system_score_gemma":0.00002443761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001864682,"about_ca_topic_score_gemma":0.000002008794,"domain_scores_codex":[0.9987053,0.00006031652,0.0003675951,0.0003535261,0.0002542714,0.0002589951],"domain_scores_gemma":[0.9988682,0.0003074158,0.0001661861,0.0004226844,0.00016847,0.00006709413],"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.000004663865,0.0002808711,0.00005762576,0.0001479201,0.00002797874,0.000007076868,0.0008049713,0.0002016279,0.0119801,0.002709404,0.008476859,0.9753009],"study_design_scores_gemma":[0.0001216043,0.00007496476,0.000005013303,0.00005587519,0.000005847633,0.000009584821,0.00003149075,0.7550654,0.2437828,0.0002412757,0.0004849834,0.0001210803],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003062089,0.00009229096,0.997485,0.00009151165,0.00003104837,0.0004028649,0.00002105638,0.0004251507,0.001144866],"genre_scores_gemma":[0.4179825,0.000002628647,0.5816376,0.00002815708,0.00003267486,0.0001500608,0.000001579937,0.000008504981,0.0001561909],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9751798,"threshold_uncertainty_score":0.4776086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04299750790805436,"score_gpt":0.2616403468215937,"score_spread":0.2186428389135394,"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."}}