Short pulse groups searching based on isomorphic sequences

Feng Li; Lixiang Ren; Jun Cao; Teng Long

doi:10.1049/el.2014.3106

Short pulse groups searching based on isomorphic sequences

Feng Li, Lixiang Ren, Jun Cao, Teng Long

School of Information and Electronics

Beijing Institute of Technology

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	1875-1877
Number of pages	3
Journal	Electronics Letters
Volume	50
Issue number	24
DOIs	https://doi.org/10.1049/el.2014.3106
Publication status	Published - 1 Nov 2014

Access to Document

10.1049/el.2014.3106

Cite this

@article{274294536120486bb5cbf5010cdbb8fa,

title = "Short pulse groups searching based on isomorphic sequences",

abstract = "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.",

author = "Feng Li and Lixiang Ren and Jun Cao and Teng Long",

note = "Publisher Copyright: {\textcopyright} The Institution of Engineering and Technology 2014.",

year = "2014",

month = nov,

day = "1",

doi = "10.1049/el.2014.3106",

language = "English",

volume = "50",

pages = "1875--1877",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley & Sons Inc.",

number = "24",

}

TY - JOUR

T1 - Short pulse groups searching based on isomorphic sequences

AU - Li, Feng

AU - Ren, Lixiang

AU - Cao, Jun

AU - Long, Teng

PY - 2014/11/1

Y1 - 2014/11/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84915806346&partnerID=8YFLogxK

U2 - 10.1049/el.2014.3106

DO - 10.1049/el.2014.3106

M3 - Article

AN - SCOPUS:84915806346

SN - 0013-5194

VL - 50

SP - 1875

EP - 1877

JO - Electronics Letters

JF - Electronics Letters

IS - 24

ER -

Short pulse groups searching based on isomorphic sequences

Abstract

Access to Document

Other files and links

Fingerprint

Cite this