{"id":"W2127309005","doi":"10.1109/tvlsi.2008.2008188","title":"Using the Minimum Set of Input Combinations to Minimize the Area of Local Routing Networks in Logic Clusters Containing Logically Equivalent I/Os in FPGAs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multiplexer; Routing (electronic design automation); Field-programmable gate array; Computer science; Logic synthesis; Lookup table; Set (abstract data type); Flexibility (engineering); Logic optimization; Logic family; Logic gate; Arithmetic; Parallel computing; Algorithm; Mathematics; Embedded system; Multiplexing; Programming language; 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.001060941,0.0002630616,0.0004679839,0.0003517363,0.0001287112,0.00005333611,0.0003109279,0.0002250483,0.00001153868],"category_scores_gemma":[0.00002006202,0.0001849114,0.0001559748,0.0007903241,0.0000781088,0.0001782765,0.000003498993,0.000524006,0.000001539056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003064076,"about_ca_system_score_gemma":0.00003653455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001607145,"about_ca_topic_score_gemma":0.0004454573,"domain_scores_codex":[0.9977317,0.0003235438,0.001018182,0.0002473634,0.0003131928,0.0003659578],"domain_scores_gemma":[0.9989001,0.0003912441,0.0001584192,0.0003586328,0.0001321768,0.00005948785],"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.0000734766,0.0001582575,0.00008515019,0.00002934026,0.0000252231,0.000003679874,0.002239778,0.988837,0.004764372,0.0003947743,0.00005161563,0.003337311],"study_design_scores_gemma":[0.0006869075,0.0002347607,0.0004016767,0.0007283564,0.00003148869,0.00001413888,0.00792475,0.9819468,0.007729927,0.00008374156,0.00001624677,0.0002012234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07688279,0.0001101182,0.9209853,0.0001690947,0.0004082043,0.0009029731,0.00003927735,0.0001088353,0.0003933629],"genre_scores_gemma":[0.9989775,0.00002871082,0.0006827551,0.0001217826,0.0000327479,0.0001027426,0.00000822654,0.00002262967,0.00002285805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9220948,"threshold_uncertainty_score":0.7540469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03961955450728494,"score_gpt":0.2720311911488703,"score_spread":0.2324116366415854,"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."}}