A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train

DOI10.1109/TSP.2003.822285zbMath1369.94365MaRDI QIDQ5354027

Byeungwoo Jeon, Alexander Kel'Manov

Publication date: 8 September 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Related Items (10)

Problem of minimizing a sum of differences of weighted convolutions ⋮ A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem ⋮ A randomized algorithm for a sequence 2-clustering problem ⋮ 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence ⋮ An approximation polynomial-time algorithm for a sequence bi-clustering problem ⋮ Unnamed Item ⋮ On polynomial solvability of one quadratic Euclidean clustering problem on a line ⋮ Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem ⋮ Off-line detection of a quasi-periodically recurring fragment in a numerical sequence ⋮ The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension

This page was built for publication: A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train