{"id":"W2056426543","doi":"10.1109/lsp.2013.2295919","title":"Optimal Non-regenerative Linear MIMO Relay for Orthogonal Space Time Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"MIMO; Relay; Computer science; Block code; Node (physics); Algorithm; Transmission (telecommunications); Constraint (computer-aided design); Decoding methods; Mathematical optimization; Power (physics); Mathematics; Telecommunications; Beamforming; Engineering","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.0004553719,0.0005298607,0.0004615645,0.0001697696,0.0002422063,0.0006130624,0.0004227782,0.0005353969,0.001508361],"category_scores_gemma":[0.001093411,0.0002147638,0.0003311129,0.0002981707,0.0006470577,0.0005501217,0.0004509567,0.0004340372,0.0003331285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007483827,"about_ca_system_score_gemma":0.0008932729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001840577,"about_ca_topic_score_gemma":0.002813132,"domain_scores_codex":[0.9996766,0.0001458884,0.000009537028,0.00004044639,0.00009141285,0.00003615053],"domain_scores_gemma":[0.9996223,0.0002338476,0.00005744816,0.00002591649,0.00004752579,0.00001288295],"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.00008330548,0.00002617077,0.0001783086,0.00009372147,0.00001995247,0.0001838221,0.00009487526,0.9155568,0.01065423,0.06415382,0.0004166239,0.008538298],"study_design_scores_gemma":[0.000009682007,0.00002431856,0.00003791519,0.000003828459,0.000005375277,0.00003449614,0.00001555827,0.9919313,0.001370067,0.00635298,0.0002092769,0.000005200118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07651384,0.0006370152,0.9139556,0.0003002809,0.00002972061,0.00004480054,0.00005940464,0.0001229369,0.008336449],"genre_scores_gemma":[0.9309997,0.0004817373,0.06490149,0.00005674193,0.00002198137,0.00005101364,0.00004110574,0.00002114119,0.003425083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001840577,"threshold_uncertainty_score":0.005429924,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02374428059142661,"score_gpt":0.2689385654107109,"score_spread":0.2451942848192843,"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."}}