Construction of Binary Matrices as a Union of Orthogonal Blocks via Generalized Euler Squares

Sasmal, Pradip and Jampana, Phanindra Varma and Sastry, Challa S (2021) Construction of Binary Matrices as a Union of Orthogonal Blocks via Generalized Euler Squares. IEEE Signal Processing Letters, 28 (940482). pp. 882-886. ISSN 1070-9908

Full text not available from this repository. (Request a copy)


The construction of binary matrices has attained significance due to its potential for hardware-friendly implementation and appealing applications in compressed sensing (CS). A class of binary matrices with low coherence and flexible row sizes can be constructed from Euler Squares (ES). In this paper, we introduce a generalization of the ES concept, namely, Generalized Euler Square (GES). We show that the binary matrices designed from GES provide significant improvements in column size compared to the ones constructed from Euler square. Exploiting the properties of GES, we obtain that such constructed binary matrices possess block orthogonal structure. As a result, such binary matrices are suitable for the recovery of block sparse signals.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Jampana, Phanindra Varma
Sastry, Challa SubrahmanyaUNSPECIFIED
Item Type: Article
Uncontrolled Keywords: Binary matrix; Block-sparse signals; Column size; Compressive sensing; Euler squares; Low-coherence; Orthogonal structures
Subjects: Chemical Engineering
Chemical Engineering > Oils, fats, waxes, gases
Chemical Engineering > Cleaning, color, coating, related technologies
Divisions: Department of Chemical Engineering
Depositing User: . LibTrainee 2021
Date Deposited: 26 Jun 2021 08:40
Last Modified: 26 Jun 2021 08:40
Publisher URL:
OA policy:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 8013 Statistics for this ePrint Item