{"id":"W2133033435","doi":"10.1109/iscas.2009.5117678","title":"A low-complexity high-speed QR decomposition implementation for MIMO receivers","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"QR decomposition; Computer science; MIMO; CORDIC; Matrix decomposition; Throughput; Parallel computing; Signal processing; Computational complexity theory; Algorithm; Channel (broadcasting); Field-programmable gate array; Computer hardware; Digital signal processing; Wireless; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002837267,0.0005699269,0.0003188006,0.0003142504,0.0003122417,0.0004902294,0.0006063484,0.0003902741,0.006824698],"category_scores_gemma":[0.0008638687,0.0002898976,0.0003148973,0.0004670617,0.0002375084,0.0005076192,0.0003273471,0.0005538804,0.002828541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003964349,"about_ca_system_score_gemma":0.0007454274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001114624,"about_ca_topic_score_gemma":0.002353188,"domain_scores_codex":[0.9997633,0.0000488431,0.00001958467,0.00003998597,0.0001049893,0.00002337859],"domain_scores_gemma":[0.9997481,0.00005368122,0.00003302215,0.00006189026,0.00009125911,0.00001211992],"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.0004065613,0.0001176699,0.0007406186,0.0004138052,0.00006573401,0.0003732839,0.0002095104,0.06793146,0.3356302,0.05257019,0.01124554,0.5302954],"study_design_scores_gemma":[0.0001302215,0.00065687,0.0006335657,0.00005560296,0.00004689737,0.0007703229,0.00005496826,0.788546,0.1634018,0.006314735,0.03933341,0.0000556489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005766112,0.0001233228,0.9903729,0.00008279057,0.00004619835,0.00005488408,0.00004975938,0.001284839,0.002219328],"genre_scores_gemma":[0.1134185,0.0001800173,0.8828183,0.0001008196,0.00004076583,0.00008192124,0.000153281,0.0000631116,0.003143312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006824698,"threshold_uncertainty_score":0.0228309,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02256350010887241,"score_gpt":0.329357205724765,"score_spread":0.3067937056158925,"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."}}