A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
On the trade-off between performance and rate for finite alphabet mimo systems
IEEE International Symposium on Information Theory, 2003. Proceedings.
Abstracl -We prove that the Singleton bound of a generalized version on rate-diversity trade-off can be achieved asymptotically for arbitrary finite alphabet MIMO systems. An efficient clique-based algorithm is proposed to design space-time block codes, and simulations show that, the rank criterion can be relaxed to increase the data rate while still maintaining good performance.doi:10.1109/isit.2003.1228339 fatcat:7dkhyu424rhonimoa7t4sp4ria