Skip to main content
Log in

1-Bit Hilbert Transform for Signed Signals with Sparse Prior

  • Short Paper
  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

Owing to the advantages of low cost and easy implementation, the 1-bit sampling technique attracts more and more attention recently. In many signal processing areas, such as in the direction finding problem, the complete analytical 1-bit signal is required to provide the instantaneous phase information, rather than the real-valued 1-bit signal. However, how to generate the imaginary component of the 1-bit signal continues to be an open problem in the literature. To this end, in this paper the concept of 1-bit Hilbert transform is introduced. Moreover, we propose an algorithm to construct the analytical signal for the real-valued 1-bit signal based on the 1-bit compressive sensing method. Simulations show that the proposed method can obtain the analytical 1-bit signal with a reasonable accuracy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Data availability

The datasets generated and analyzed during the current study are available from the corresponding author on reasonable request.

Notes

  1. It is worth noting that the signum function \(\mathcal {S}(\cdot )\) defined here is different from the sign function \(\text {sgn}(\cdot )\) defined for 1-bit signals. In (3), \(\mathcal {S}(0)=0\). However, since there are only two status in 1-bit signals (+1 or -1), it is defined that \(\text {sgn}(0)=-1\) in this paper.

  2. The Hadamard product of two matrices \(\mathbf{A}\) and \(\mathbf{B}\) of same dimension is defined as \(\left[ \mathbf{A}\odot \mathbf{B}\right] _{ij}=\left[ \mathbf{A}\right] _{ij}\left[ \mathbf{B}\right] _{ij}\), i.e., the elements of the resulting matrix are obtained by the scalar product of the corresponding elements of \(\mathbf{A}\) and \(\mathbf{B}\) matrices.

References

  1. A.O. Andrade, P. Kyberd, S.J. Nasuto, The application of the hilbert spectrum to the analysis of electromyographic signals. Inf. Sci. 178(9), 2176–2193 (2008)

    Article  MathSciNet  Google Scholar 

  2. P.T. Boufounos, Greedy sparse signal reconstruction from sign measurements, in: 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers (IEEE, 2009). pp. 1305–1309.

  3. K.N. Chaudhury, M. Unser, Construction of hilbert transform pairs of wavelet bases and gabor-like transforms. IEEE Trans. Signal Process. 57(9), 3411–3425 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. K.N. Chaudhury, M. Unser, Construction of hilbert transform pairs of wavelet bases and optimal time-frequency localization, in 2008 IEEE International Conference on Acoustics, Speech and Signal Processing (2008), pp. 3277-3280

  5. X. Huang, P. Xiao, B. Liao, One-bit direction of arrival estimation with an improved fixed-point continuation algorithm, in 2018 10th International Conference on Wireless Communications and Signal Processing(WCSP) (IEEE, 2018). IEEE. pp. 1–4

  6. X. Huang, M. Yan, Nonconvex penalties with analytical solutions for one-bit compressive sensing. Signal Process. 144, 341–351 (2018)

    Article  Google Scholar 

  7. L. Jacques, J.N. Laska, P.T. Boufounos, R.G. Baraniuk, Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors. IEEE Trans. Inf. Theory 59(4), 2082–2102 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. J.C. Jayasudha, S.L. Kumari, Feature analysis for characterization of phased array images based on hilbert transform, in 2020 International Conference on Communication and Signal Processing (ICCSP) (2020). pp. 1204-1207.

  9. J. Koh, J. Jeon, S. Jung, Antenna pattern restoration using hilbert transform. in IET International Radar Conference 2015 (2015). pp. 1–5

  10. J.N. Laska, R.G. Baraniuk, Regime change: Bit-depth versus measurement-rate in compressive sensing. IEEE Trans. Signal Process. 60(7), 3496–3505 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Z. Li, W. Xu, X. Zhang, J. Lin, A survey on one-bit compressed sensing: theory and applications. Front. Comp. Sci. 12(2), 217–230 (2018)

    Article  Google Scholar 

  12. H. Liu, J. Peng, Z. Lin, A theoretical result of sparse signal recovery via alternating projection method. Inf. Sci. 506, 51–57 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  13. A.V. Oppenheim, R.W. Schafer, Discrete-Time Signal Processing, Pearson education signal processing series (Pearson Education, Boston, 2010)

    Google Scholar 

  14. Y. Plan, R. Vershynin, One bit compressed sensing by linear programming. Commun. Pure Appl. Math. 66(8), 1275–1297 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  15. K.I.A. Sampath, K. Takano, Phase-shift method-based optical vsb modulation using high-pass hilbert transform. IEEE Photonics J. 8(5), 1–13 (2016)

    Article  Google Scholar 

  16. I. Stankovic, M. Brajovic, M. Dakovic, L. Stankovic, Complex-valued binary compressive sensing, In 2018 26th Telecommunications Forum (TELFOR) (2018). pp. 1–4

  17. J. Wang, Sparse reconstruction via the mixture optimization model with iterative support estimate. Inf. Sci. 574, 1–11 (2021)

    Article  MathSciNet  Google Scholar 

  18. P. Xiao, B. Liao, N. Deligiannis, Deepfpc: A deep unfolded network for sparse signal recovery from 1-bit measurements with application to doa estimation. Signal Process. 176, 107699 (2020)

    Article  Google Scholar 

  19. P. Xiao, B. Liao, X. Huang, Z. Quan, 1-bit compressive sensing with an improved algorithm based on fixed-point continuation. Signal Process. 154, 168–173 (2019)

    Article  Google Scholar 

  20. Y. Zeng, Z. Dong, Y. Chen, X. Wu, H. He, J. You, Q. Xiao, A novel cap-wdm-pon employing multi-band dft-spread dmt signals based on optical hilbert-transformed ssb modulation. IEEE Access 7, 29397–29404 (2019)

    Article  Google Scholar 

  21. L. Zhang, J. Yi, R. Jin, Efficient algorithms for robust one-bit compressive sensing. in International Conference on International Conference on Machine Learning (2014). p. 820

  22. Y. Zhou, W. Cao, L. Liu, S. Agaian, C.L.P. Chen, Fast fourier transform using matrix decomposition. Inf. Sci. 291, 172–183 (2015)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China under Grant 61901273, the Stable Supporting Fund of Acoustics Science and Technology Laboratory, the State Key Laboratory of Acoustics, Chinese Academy of Sciences, and Guangdong marine economic development project (GDNRC2021-31).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lingji Xu.

Ethics declarations

Conflict of interest

The manuscript has been approved by all authors for publication, and no conflict of interest exists in the submission of it.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiao, P., Li, Y., Chen, Y. et al. 1-Bit Hilbert Transform for Signed Signals with Sparse Prior. Circuits Syst Signal Process 42, 1848–1859 (2023). https://doi.org/10.1007/s00034-022-02162-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-022-02162-9

Keywords

Navigation