Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Full diversity sets of unitary matrices from orthogonal sets of idempotents (1612.02202v2)

Published 7 Dec 2016 in cs.IT and math.IT

Abstract: Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary matrices in general are derived from orthogonal sets of idempotents reducing the design problem to a construction problem of unitary matrices from such sets. The quality of the constellations constructed in this way and the actual differences between the unitary matrices can be determined algebraically from the idempotents used. This has applications to the design of unitary space time constellations.

Citations (3)

Summary

We haven't generated a summary for this paper yet.