An equiangular tight frame (ETF) is a set of unit vectors in a Euclidean space whose coherence is as small as possible, equaling the Welch bound. Also known as Welch-boundequality sequences, such frames arise in various applications, such as waveform design and compressed sensing. At the moment, there are only two known flexible methods for constructing ETFs: harmonic ETFs are formed by carefully extracting rows from a discrete Fourier transform; Steiner ETFs arise from a tensor-like combination of a combinatorial design and a regular simplex. These two classes seem very different: the vectors in harmonic ETFs have constant amplitude, whereas Steiner ETFs are extremely sparse. We show that they are actually intimately connected: a large class of Steiner ETFs can be unitarily transformed into constant-amplitude frames, dubbed Kirkman ETFs. Moreover, we show that an important class of harmonic ETFs is a subset of an important class of Kirkman ETFs. This connection informs the discussion of both types of frames: some Steiner ETFs can be transformed into constantamplitude waveforms making them more useful in waveform design; some harmonic ETFs have low spark, making them less desirable for compressed sensing. We conclude by showing that real-valued constant-amplitude ETFs are equivalent to binary codes that achieve the Grey-Rankin bound, and then construct such codes using Kirkman ETFs. Index Terms-equiangular tight frame, Welch bound equality sequence, Welch bound, Grey-Rankin boundJ. Jasper is with the
Abstract. Equiangular tight frames provide optimal packings of lines through the origin. We combine Steiner triple systems with Hadamard matrices to produce a new infinite family of equiangular tight frames. This in turn leads to new constructions of strongly regular graphs and distance-regular antipodal covers of the complete graph.
An equiangular tight frame (ETF) is a type of optimal packing of lines in a finite-dimensional Hilbert space. ETFs arise in various applications, such as waveform design for wireless communication, compressed sensing, quantum information theory and algebraic coding theory. In a recent paper, signature matrices of ETFs were constructed from abelian distance regular covers of complete graphs. We extend this work, constructing ETF synthesis operators from abelian generalized quadrangles, and vice versa. This produces a new infinite family of complex ETFs as well as a new proof of the existence of certain generalized quadrangles. This work involves designing matrices whose entries are polynomials over a finite abelian group. As such, it is related to the concept of a polyphase matrix of a finite filter bank.
An equiangular tight frame (ETF) is a type of optimal packing of lines in Euclidean space. A regular simplex is a special type of ETF in which the number of vectors is one more than the dimension of the space they span. In this paper, we consider ETFs that contain a regular simplex, that is, have the property that a subset of its vectors forms a regular simplex. As we explain, such ETFs are characterized as those that achieve equality in a certain well-known bound from the theory of compressed sensing. We then consider the so-called binder of such an ETF, namely the set of all regular simplices that it contains. We provide a new algorithm for computing this binder in terms of products of entries of the ETF's Gram matrix. In certain circumstances, we show this binder can be used to produce a particularly elegant Naimark complement of the corresponding ETF. Other times, an ETF is a disjoint union of regular simplices, and we show this leads to a certain type of optimal packing of subspaces known as an equichordal tight fusion frame. We conclude by considering the extent to which these ideas can be applied to numerous known constructions of ETFs, including harmonic ETFs. Necessary integrality conditions on the existence of various types of ETFs are given in [58].Conference matrices, Hadamard matrices, Paley tournaments and quadratic residues are related, and lead to infinite families of ETFs whose redundancy n d is either nearly or exactly two [57,43,53,56]. Harmonic ETFs and Steiner ETFs offer much more freedom in choosing d and n. Harmonic ETFs are equivalent to difference sets in finite abelian groups [60,57,63,27]. Steiner ETFs arise from particular types of balanced incomplete block designs (BIBDs) [39,36]. Recent generalizations of Steiner ETFs have led to new infinite families of ETFs arising from projective planes that contain hyperovals [35] as well as from Steiner triple systems [31]. Another new family arises by generalizing the SRG construction of [38] to the complex setting [32].Many of these known constructions give ETFs that contain a regular simplex, and thus achieve equality in both (2) and (3). For example, every Steiner ETF is a disjoint union of regular simplices by construction. This property is also enjoyed by harmonic ETFs arising from McFarland difference sets, since it is known that they can be obtained by applying unitary operators to certain Steiner ETFs [45]. We study ETFs that contain regular simplices in general, and then explore the degree to which the ETFs constructed in [63,27,35,31,32] have this property.In particular, in the next section, we establish notation, discuss some known results that we will need later on, and elaborate on the connections between these ideas and compressed sensing. In Section 3, we show that an ETF achieves equality in (3) if and only if it contains a regular simplex (Theorem 3.1), and give a strong necessary condition on the existence of real ETFs that are full spark (Theorem 3.2). In the fourth section, we characterize regular simplices that are containe...
Abstract-An equiangular tight frame (ETF) is a set of equal norm vectors in a Euclidean space whose coherence is as small as possible, equaling the Welch bound. Also known as Welch-bound-equality sequences, such frames arise in various applications, such as waveform design, quantum information theory, compressed sensing and algebraic coding theory. ETFs seem to be rare, and only a few methods of constructing them are known. In this paper, we present a new infinite family of complex ETFs that arises from hyperovals in finite projective planes. In particular, we give the first ever construction of a complex ETF of 76 vectors in a space of dimension 19. Recently, a computerassisted approach was used to show that real ETFs of this size do not exist, resolving a longstanding open problem in this field. Our construction is a modification of a previously known technique for constructing ETFs from balanced incomplete block designs.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.