Construction of ternary matrices with small coherence for compressed sensing

Construction of ternary matrices with small coherence for compressed sensing

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Recently, the binary matrix with binary correlations between columns has attracted attention for its sparse structure and competitive performance. However, such kind of matrix tends to suffer an increasing coherence, i.e. the maximum absolute correlation between columns, as the compression ratio decreases. It is shown here that the binary matrix mentioned above allows to be duplicated in columns, while not degrading the coherence, if bipolar signs are introduced. The resulting ternary matrix is thus expected to present smaller coherence than the aforementioned binary matrix of same size.


    1. 1)
    2. 2)
    3. 3)
    4. 4)
      • W. Lu , K. Kpalma , J. Ronsin .
        4. Lu, W., , Kpalma, K., Ronsin, J.: ‘Sparse binary matrices of LDPC Codes for compressed sensing’. Data Compression Conf. (DCC), Snowbird, UT, USA, April 2012, p. 405.
        . Data Compression Conf. (DCC) , 405
    5. 5)
    6. 6)
      • X. Liu , S. Xia .
        6. Liu, X., Xia, S.: ‘Reconstruction guarantee analysis of binary measurement matrices based on girth’. IEEE Int. Symp. on Information Theory Proc. (ISIT), Istanbul, Turkey, July 2013, pp. 474478.
        . IEEE Int. Symp. on Information Theory Proc. (ISIT) , 474 - 478
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)

Related content

This is a required field
Please enter a valid email address