共 50 条
- [1] A tight lower bound for the bit error ratio of space-time block codes [J]. VTC2004-SPRING: 2004 IEEE 59TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, PROCEEDINGS, 2004, : 728 - 732
- [2] Union bound on error probability of linear space-time block codes [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-VI, PROCEEDINGS: VOL I: SPEECH PROCESSING 1; VOL II: SPEECH PROCESSING 2 IND TECHNOL TRACK DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS NEURALNETWORKS FOR SIGNAL PROCESSING; VOL III: IMAGE & MULTIDIMENSIONAL SIGNAL PROCESSING MULTIMEDIA SIGNAL PROCESSING - VOL IV: SIGNAL PROCESSING FOR COMMUNICATIONS; VOL V: SIGNAL PROCESSING EDUCATION SENSOR ARRAY & MULTICHANNEL SIGNAL PROCESSING AUDIO & ELECTROACOUSTICS; VOL VI: SIGNAL PROCESSING THEORY & METHODS STUDENT FORUM, 2001, : 2473 - 2476
- [3] A tight bound on the error probability of space-time codes for rapid fading channels [J]. WCNC: 2000 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-3, 2000, : 1086 - 1089
- [4] Bit error probability for orthogonal space-time block codes with differential detection [J]. GLOBECOM '05: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: DISCOVERY PAST AND FUTURE, 2005, : 1636 - 1639
- [5] Exact bit error probability of orthogonal space-time block codes with QAM [J]. 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 63 - 63
- [6] Upper bound on the error probability for space-time codes in fast fading channels [J]. IEEE 56TH VEHICULAR TECHNOLOGY CONFERENCE, VTC FALL 2002, VOLS 1-4, PROCEEDINGS, 2002, : 243 - 246
- [7] Combining ideal beamforming and Alamouti space-time block codes [J]. ELECTRONICS LETTERS, 2003, 39 (17) : 1258 - 1259