Compressive Sensing Approach to Harmonics Detection in the Ship Electrical Network.

compressive sensing discrete Radon transform harmonics signal reconstruction sparse signal domain

Journal

Sensors (Basel, Switzerland)
ISSN: 1424-8220
Titre abrégé: Sensors (Basel)
Pays: Switzerland
ID NLM: 101204366

Informations de publication

Date de publication:
11 May 2020
Historique:
received: 15 04 2020
revised: 06 05 2020
accepted: 09 05 2020
entrez: 15 5 2020
pubmed: 15 5 2020
medline: 15 5 2020
Statut: epublish

Résumé

The contribution of this paper is to show the opportunities for using the compressive sensing (CS) technique for detecting harmonics in a frequency sparse signal. The signal in a ship's electrical network, polluted by harmonic distortions, can be modeled as a superposition of a small number of sinusoids and the discrete Fourier transform (DFT) basis forms its sparse domain. According to the theory of CS, a signal may be reconstructed from under-sampled incoherent linear measurements. This paper highlights the use of the discrete Radon transform (DRT) techniques in the CS scheme. In the reconstruction algorithm section, a fast algorithm based on the inverse DRT is presented, in which a few randomly sampled projections of the input signal are used to correctly reconstruct the original signal. However, DRT requires a very large set of measurements that can defeat the purpose of compressive data acquisition. To acquire the wideband data below the Nyquist frequency, the K-rank-order filter is applied in the sparse transform domain to extract the most significant components and accelerate the convergence of the solution. While most CS research efforts focus on random Gaussian measurements, the Bernoulli matrix with different values of the probability of ones is applied in the presented algorithm. Preliminary results of numerical simulation confirm the effectiveness of the algorithm used, but also indicate its limitations. A significant advantage of the proposed approach is the speed of analysis, which uses fast Fourier transform (FFT) and inverse FFT (IFFT) algorithms widely available in programming environments. Moreover, the data processing algorithm is quite simple, and therefore memory usage and burden of the data processing load are relatively low.

Identifiants

pubmed: 32403441
pii: s20092744
doi: 10.3390/s20092744
pmc: PMC7248871
pii:
doi:

Types de publication

Journal Article

Langues

eng

Sous-ensembles de citation

IM

Références

IEEE Trans Pattern Anal Mach Intell. 2016 Apr;38(4):772-84
pubmed: 26353363
Sensors (Basel). 2015 Oct 09;15(10):25648-62
pubmed: 26473858
Sensors (Basel). 2019 Aug 26;19(17):
pubmed: 31454950
Sensors (Basel). 2019 Oct 17;19(20):
pubmed: 31627448

Auteurs

Beata Palczynska (B)

Faculty of Electrical and Control Engineering, Gdansk University of Technology, 11/12 Gabriela Narutowicza Street, 80-233 Gdansk, Poland.

Romuald Masnicki (R)

Department of Marine Electrical Power Engineering, Gdynia Maritime University, Morska 81-87, 81-225 Gdynia, Poland.

Janusz Mindykowski (J)

Department of Marine Electrical Power Engineering, Gdynia Maritime University, Morska 81-87, 81-225 Gdynia, Poland.

Classifications MeSH