Deterministic construction of sparse binary matrices via incremental integer optimization
A central problem in compressed sensing (CS) is the design of measurement matrices. Compared with the conventional random matrices, sparse binary matrices have some attractive properties, such as lower storage/encoding cost and easy hardware implementation. In this paper, we formulate the constructi...
Saved in:
Main Authors: | Zhang, Jun, Yu, Zhu Liang, Cen, Ling, Gu, Zhenghui, Lin, Zhiping, Li, Yuanqing |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142679 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Spectral analysis of large dimentional random matrices
by: ZHANG LIXIN
Published: (2010) -
Deterministic positioning of few aqueous colloidal quantum dots
by: Pambudi, Muhammad Tegar, et al.
Published: (2024) -
Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
by: Aung, Khin Mi Mi, et al.
Published: (2020) -
Symmetric weighing matrices constructed using group matrices
by: Ang, M.H., et al.
Published: (2014) -
An eigenvalue problem for a large sparse skew symmetric matrix
by: Puntip Toghaw
Published: (2023)