Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (2)

Search Parameters:
Keywords = Welch bound

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
19 pages, 1073 KiB  
Article
A New Method of Measurement Matrix Optimization for Compressed Sensing Based on Alternating Minimization
by Renjie Yi, Chen Cui, Biao Wu and Yang Gong
Mathematics 2021, 9(4), 329; https://doi.org/10.3390/math9040329 - 7 Feb 2021
Cited by 18 | Viewed by 2850
Abstract
In this paper, a new method of measurement matrix optimization for compressed sensing based on alternating minimization is introduced. The optimal measurement matrix is formulated in terms of minimizing the Frobenius norm of the difference between the Gram matrix of sensing matrix and [...] Read more.
In this paper, a new method of measurement matrix optimization for compressed sensing based on alternating minimization is introduced. The optimal measurement matrix is formulated in terms of minimizing the Frobenius norm of the difference between the Gram matrix of sensing matrix and the target one. The method considers the simultaneous minimization of the mutual coherence indexes including maximum mutual coherence μmax, t-averaged mutual coherence μave and global mutual coherence μall, and solves the problem that minimizing a single index usually results in the deterioration of the others. Firstly, the threshold of the shrinkage function is raised to be higher than the Welch bound and the relaxed Equiangular Tight Frame obtained by applying the new function to the Gram matrix is taken as the initial target Gram matrix, which reduces μave and solves the problem that μmax would be larger caused by the lower threshold in the known shrinkage function. Then a new target Gram matrix is obtained by sequentially applying rank reduction and eigenvalue averaging to the initial one, leading to lower. The analytical solutions of measurement matrix are derived by SVD and an alternating scheme is adopted in the method. Simulation results show that the proposed method simultaneously reduces the above three indexes and outperforms the known algorithms in terms of reconstruction performance. Full article
Show Figures

Figure 1

13 pages, 288 KiB  
Article
Four Constructions of Asymptotically Optimal Codebooks via Additive Characters and Multiplicative Characters
by Xia Wu and Wei Lu
Mathematics 2019, 7(12), 1144; https://doi.org/10.3390/math7121144 - 23 Nov 2019
Cited by 1 | Viewed by 2169
Abstract
In this paper, we present four new constructions of complex codebooks with multiplicative characters, additive characters, and quadratic irreducible polynomials and determine the maximal cross-correlation amplitude of these codebooks. We prove that the codebooks we constructed are asymptotically optimal with respect to the [...] Read more.
In this paper, we present four new constructions of complex codebooks with multiplicative characters, additive characters, and quadratic irreducible polynomials and determine the maximal cross-correlation amplitude of these codebooks. We prove that the codebooks we constructed are asymptotically optimal with respect to the Welch bound. Moreover, we generalize the result obtained by Zhang and Feng and contain theirs as a special case. The parameters of these codebooks are new. Full article
(This article belongs to the Special Issue Information Theory, Cryptography, Randomness and Statistical Modeling)
Back to TopTop