z-logo
open-access-imgOpen Access
Low computational cost matching pursuit algorithm for LCX-based Intruder Detection System
Author(s) -
Tomonori Sato,
Ziji Ma,
Takeshi Higashino,
Minoru Okada
Publication year - 1970
Publication title -
ecti transactions on computer and information technology (ecti-cit)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.132
H-Index - 2
ISSN - 2286-9131
DOI - 10.37936/ecti-cit.2016102.75145
Subject(s) - matching pursuit , computer science , computational complexity theory , algorithm , impulse response , limiting , impulse (physics) , real time computing , detection theory , compressed sensing , engineering , telecommunications , mathematics , detector , mechanical engineering , mathematical analysis , physics , quantum mechanics
The leaky coaxial cable (LCX) based intruder detection system detects intruders by making efficient use of time-variation of the channel impulse response among the cables. Recently, a compressed sensing (CS)-assisted intruder detection system has been proposed for improving the accuracy of the intruder detection. Although the CS-assisted system can improve the false detection probability performance efficiently, it is difficult to implement it because of its huge computational cost requirement. This paper proposes a modified matching pursuit (MMP) algorithm for reducing the computational cost of the CS-assisted intruder detection scheme. MMP can reduce the computational cost by limiting the search range in the vicinity of impulse response peaks estimated at the last measurement. Computer simulation results show the proposed system can reduce the computational cost for the conventional CS-basedalgorithm without degradation in the false detection performance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom