An overstructured graph (OSG) for a finite state machine (FSM) and a novel message-passing algorithm are proposed. This allows a unified graphical approach to the design of reduced-state forward-backward algorithms.

An overstructured graph for reduced-state forward-backward algorithms / P. THIENNVIBON; FERRARI G.; K. M. CHUGG. - (2002), pp. 367-367. ((Intervento presentato al convegno IEEE International Symposium on Information Theory (ISIT 2002) tenutosi a Losanna, Svizzera nel June-July [10.1109/ISIT.2002.1023639].

An overstructured graph for reduced-state forward-backward algorithms

FERRARI, Gianluigi;
2002

Abstract

An overstructured graph (OSG) for a finite state machine (FSM) and a novel message-passing algorithm are proposed. This allows a unified graphical approach to the design of reduced-state forward-backward algorithms.
0780375017
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11381/1453782
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact