Open AccessShort pulse groups searching based on isomorphic sequences
Author(s) -
Li Feng,
Ren Lixiang,
Cao Jun,
Long Teng
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2014.3106
Subject(s) - pulse (music) , sorting , repetition (rhetorical device) , prefix , interval (graph theory) , suffix , sequence (biology) , pulse sequence , computer science , pulse repetition frequency , mathematics , algorithm , physics , telecommunications , combinatorics , detector , radar , chemistry , linguistics , philosophy , biochemistry , nuclear magnetic resonance
Conventional pulse sorting algorithms have difficulty in extracting short pulse groups which are dispersed in massive pulse streams. An isomorphic sequence search algorithm, based on a suffix array and the longest common prefix, is used to extract short pulse repetition interval‐repeated pulse groups.