HyperMon is a blind signal analysis tool for modulation / constellation / coding scheme / framing standard identification based upon an extensive algorithms library which represents the "state of the art" of this field:

cyclostationnary methods, Bayesian methods, clustering, blind equalization, very high speed basic DSP tasks (optimisations based on polyphase filtering, PRFB, resampling, …), time-frequency analysis, composite signal break-down procedure, unsupervised noise level estimation, unsupervised channel analysis (scattering function, …).

HyperMon was created and still evolves against an ever growing set of tests, mainly composed of real signals. This approach leeds us to a low failure ratio in field applications.

The Graphical User Interface (GUI), targeted to operational users from the beginning, is very intuitive and simple use. All actions and data are available through a context sensitive menu, in an analysis tree which:

  • reduces complexity to the minimum,
  • hides all possibilities except those making sense on the selected node/object,
  • provides an easy view of the data processing.



Blind signal analysis

Identified MAC acces:

  • frame duration, slots duration, guard duration, number of users, load,
  • modulation and FEC recognition inside each burst,

Identified modulation families:

  • analog,
    • AM, SSB-L, SSB-U, …
    • FM,
  • digital linear (BPSK, QPSK, 8PSK, 8AMPM, 16QAM, 16APSK, 32APSK, ...),
  • digital non linear:
    • CPM (GMSK, N-SRC, N-REC, TFM, …)
    • N-FSK

Rates/speed estimates:

  • symbols,
  • binary streams (coded / uncoded),
  • frames (OFDM, …)

Linear modulation identification:

  • M-PSK, M-QAM, M-PAM,
  • OFDM / FDM

Code detection or identification:

  • FEC,
  • RS, alone or concatenated,
  • TCM,
  • TPC,
  • LDPC,
  • ...

Estimated transmission parameters:

  • Eb/No, SNR,
  • true bit rate, carrier frequency, bandwidth,
  • link budget.

carrier under carrier detection, double talk detection, motif detection, blind equalization,

And much, much more!