R. Kotter and A. Vardy, "Minimality of factor graphs," in Proc. Math. Theory Networks and Syst. Conference (MTNS), Padova, Italy, July 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Ordered Binary Decision Diagrams - And Minimal Trellises Self-citation (Vardy) (Correct)
No context found.
R. Kotter and A. Vardy, "Minimality of factor graphs," in Proc. Math. Theory Networks and Syst. Conference (MTNS), Padova, Italy, July 1998.
On the Representation of Codes in Forney Graphs - Koetter (2000) Self-citation (Koetter) (Correct)
....and trellis representation of codes (or linear systems) is a natural uni cation between the two elds, undertaken for the rst time by Wiberg [4] The traditional problems concerning minimality and other systemtheoretic notions are considerably more dicult in this context. It is by now understood [13, 14] that state space realizations that are generalized to loopy time axes (a timeordering that is not linearly evolving but obeys more general relationships) usually do not exhibit a minimal realization. Indeed, it is nontrivial to even de ne the meaning of minimal in this context (cf. 13, 14] In ....
....[13, 14] that state space realizations that are generalized to loopy time axes (a timeordering that is not linearly evolving but obeys more general relationships) usually do not exhibit a minimal realization. Indeed, it is nontrivial to even de ne the meaning of minimal in this context (cf. [13, 14]) In general, the di erent realizations of the same linear system form a partially ordered set. Nevertheless, most construction techniques for conventional trellises, like the product construction of Kschischang and Sorokine [15] can be applied to the construction of state space realizations on ....
[Article contains additional citation context not shown here]
R. Koetter and A. Vardy, \Minimality of Factor Graphs", In Proc. MTNS, Padua, Italy, 1998
Ordered Binary Decision Diagrams and Minimal Trellises - Lafferty, Vardy (1998) (1 citation) Self-citation (Vardy) (Correct)
....In recent years, a number of new graphical models have emerged in coding theory, and evolved into a far reaching general framework for representing a code by a graph. In this context, one encounters various generalizations of a trellis, such as tail biting trellises [22] and trellis formations [49, 50], as well as Tanner graphs [71] that are in some sense diametrically opposite to trellises. All these representations are special cases of the general concept of a factor graph. We refer the reader to [1, 37, 38, 79] for a detailed treatment of factor graphs and the associated iterative ....
.... of this function requires at least Omega Gammaa :14 n ) vertices, yet there exists an alternative implementation of f hw (x 1 ; x n ) with area time complexity of O(n 1 ffl ) We point out here that this alternative implementation is essentially a factor graph implementation [49]. We refrain from pursuing this any further in this paper. However, we believe that this line of research holds great promise. 5.2. From binary decision diagrams to trellises Since 1986, when ordered binary decision diagrams were introduced for verification problems [14] many refinements and ....
R. Kotter and A. Vardy, "Minimality of factor graphs," in Proc. Math. Theory Networks and Syst. Conference (MTNS), Padova, Italy, July 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC