Ordered binary decision diagrams and minimal trellises

IEEE Transactions on Computers

Volumn 48, Issue 9, 1999, Pages 971-986

  Lafferty, John ^a,b   Vardy, Alexander ^a,c  

^a IEEE   (United States)

^b Carnegie Mellon University   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Binary decision diagrams; CAD; Coding theory; Formal verification; Trellises

Indexed keywords

ALGORITHMS; BINARY CODES; BINARY SEQUENCES; BLOCK CODES; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; DIGITAL CIRCUITS; ERROR CORRECTION; GRAPH THEORY; MATHEMATICAL MODELS; TRELLIS CODES;

CODING THEORY; FORMAL VERIFICATION; MINIMAL TRELLISES; ORDERED BINARY DECISION DIAGRAMS;

DATA STRUCTURES;

EID: 0033195334     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.795225     Document Type: Article

References (81)

1. S.M. Aji and R.J. McEliece, "The Generalized Distributive Law," IEEE Trans. Information Theory, submitted for publication, July 1998.
2. S.B. Akers, "Binary Decision Diagrams," IEEE Trans. Computers, vol. 27, no. 8, pp. 509-516, Aug. 1978.
3. D.P. Appenzeller and A. Kuehlmann, "Formal Verification of a PowerPC Microprocessor," Proc. Int'l Conf. Computer-Aided Design (ICCAD), pp. 79-84, San Jose, Calif., Nov. 1995.
4. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Prado, and F. Somenzi, "Algebraic Decision Diagrams and Their Application," Proc. Int'l Conf. Computer-Aided Design (ICCAD), pp. 188-191, Santa Clara, Calif., Nov. 1993.
5. L.R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate," IEEE Trans. Information Theory, vol. 20, pp. 284-287, Mar. 1974.
6. L.R. Bahl, F. Jelinek, and R.L. Mercer, "A Maximum Likelihood Approach to Continuous Speech Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, pp. 179-190, Mar. 1983.
7. B. Becker and R. Drechsler, "How Many Decomposition Types Do We Need?" Proc. European Design and Test Conf., pp. 438-443, Paris, Mar. 1995.
8. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon Limit Error-Eorrecting Coding and Decoding: Turbo Codes," Proc. IEEE Int'l Conf. Comm., pp. 1,064-1,070, Geneva, July 1993.
9. D. Bhattacharya, P. Agrawal, and V.D. Agrawal, "Delay Fault Test Generation for Scan/Hold Circuits Using Boolean Expressions," Proc. Design Automation Conf. (DAC), pp. 159-164, Anaheim, Calif., June 1992.
10. B. Bollig, M. Löbbing, M. Sauerhoff, and I. Wegener, "Complexity Theoretical Aspects of OFDDs," Representations of Discrete Functions, T. Sasao and M. Fujita, eds. Boston: Kluwer Academic, 1996.
11. B. Bollig and I. Wegener, "Improving the Variable Ordering of OBDDs Is NP-Complete," IEEE Trans. Computers, vol. 45, no. 9, pp. 993-1,002, Sept. 1996.
12. K.S. Brace, R.L. Rudell, and R.E. Bryant, "Efficient Implementation of a BDD Package," Proc. Design Automation Conf. (DAC), pp. 40-45, Orlando, Fla., June 1990.
13. F.M. Brown, Boolean Reasoning. Boston: Kluwer Academic, 1990.
14. R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulations," IEEE Trans. Computers, vol. 35, no. 8, pp. 677-691, Aug. 1986.
15. R.E. Bryant, "On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication," IEEE Trans. Computers, vol. 40, no. 2, pp. 205-213, Feb. 1991.
16. R.E. Bryant, "Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams," ACM Computing Surveys, vol. 24, pp. 293-318, Sept. 1992.
17. R.E. Bryant, "Division, Pentium Style: An Analysis of Intel's Mistake(s)," CMU Computer Systems Seminar, 22 Feb. 1995
18. R.E. Bryant, "Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification," Proc. Int'l Conf. Computer-Aided Design (ICCAD), pp. 236-243, San Jose, Calif., Nov. 1995.
19. R.E. Bryant, personal communication, Nov. 1997.
20. R.E. Bryant and Y.-A. Chen, "Verification of Arithmetic Functions with Binary Moment Diagrams," Proc. Design Automation Conf. (DAC), pp. 535-541, San Francisco, June 1995.
21. J.R. Burch, E.M. Clarke, D.L. Dill, and K. McMillan, "Sequential Circuit Verification Using Symbolic Model Checking," Proc. Design Automation Conf. (DAC), pp. 46-51, Orlando, Fla., June 1990.
22. A.R. Calderbank, G.D. Forney Jr., and A. Vardy, "Minimal Tail-Biting Trellises: The Golay Code and More," IEEE Trans. Information Theory, to appear, July 1999.
23. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao, "Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation," Proc. Int'l Workshop Logic Synthesis, pp. P6a:1-15, Louvain, Belgium, July 1993.
24. E.M. Clarke, M. Fujita, and X. Zhao, "Hybrid Decision Diagrams - Overcoming the Limitations of MTBDDs and BMDs," Proc. Int'l Conf. Computer-Aided Design (ICCAD), pp. 159-163, San Jose, Calif., Nov. 1995.
25. J.H. Conway and N.J.A. Sloane, "Soft Decoding Techniques for Codes and Lattices, Including the Golay Code and the Leech Lattice," IEEE Trans. Information Theory, vol. 32, pp. 41-50, Jan. 1986.
26. O. Coudert, C. Berthet, and J.C. Madre, "Verification of Sequential Machines Based on Symbolic Execution," Automatic Verification Methods for Finite State Systems, pp. 365-373, 1989.
27. R. Drechsler, B. Becker, and S. Ruppertz, "K*BMDs: A New Data Structure for Verification," Proc. European Design and Test Conf., Paris, Mar. 1996.
28. R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M.A. Perkowski, "Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams," Proc. Design Automation Conf. (DAC), pp. 415-419, San Diego, Calif., June 1994.
29. Proc. Symp. Application of Hidden Markov Models to Text and Speech, J.D. Ferguson, ed., Inst, for Defense Analyses, Princeton, N.J., 1980.
30. G.D. Forney Jr., "Final Report on a Coding System Design for Advanced Solar Missions," Contract NAS2-3637, NASA Ames Research Center, Calif., Dec. 1967.
31. G.D. Forney Jr., "Maximum-Likelihood Sequence Estimation of Digital Sequences in the Presence of Intersymbol Interference," IEEE Trans. Information Theory, vol. 18, pp. 363-378, May 1972.
32. G.D. Forney Jr., "The Viterbi Algorithm," Proc. IEEE, vol. 61, pp. 268-278, 1973.
33. G.D. Forney Jr., "Dimension/Length Profiles and Trellis Complexity of Linear Block Codes," IEEE Trans. Information Theory, vol. 40, pp. 1,741-1,752, Nov. 1994.
34. G.D. Forney Jr., "Coset Codes II: Binary Lattices and Related Codes," IEEE Trans. Information Theory, vol. 34, pp. 1,152-1,187, Sept. 1988.
35. G.D. Forney Jr., B.H. Marcus, N.T. Sindhushayana, and M.D. Trott, "Multilingual Dictionary: System Theory, Coding Theory, Symbolic Dynamics and Automata Theory," Different Aspects of Coding Theory, A.R. Calderbank, ed., vol. 50, pp. 109-138. Providence, R.I.: AMS Press, 1995.
36. G.D. Forney Jr. and M.D. Trott, "The Dynamics of Group Codes: State Spaces, Trellises and Canonical Encoders," IEEE Trans. Information Theory, vol. 39, pp. 1,491-1,513, Sept. 1993.
37. B.J. Frey, Graphical Models for Machine Learning and Digital Comm., Cambridge, Mass.: MIT Press, 1998.
38. C. Gröpl, H.J. Prömel, and A. Srivastav, "Size and Structure of Random OBDDs," preprint, June 1997.
39. A. Hett, R. Drechsler, and B. Becker, "MORE: Alternative Implementation of BDD-Packages by Multi-Operand Synthesis," Proc. European Design and Test Conf., Paris, Mar. 1996.
40. M.F. Hole and O. Ytrehus, "Two-Step Trellis Decoding of Partial Unit Memory Convolutional Codes," IEEE Trans. Information Theory, vol. 43, pp. 324-325, Jan. 1997.
41. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, Mass.: Addison-Wesley, 1979.
42. G. Horn and F.R. Kschischang, "On the Intractability of Permuting a Block Code to Minimize Trellis Complexity," IEEE Trans. Information Theory, vol. 42, pp. 2,042-2,048, Nov. 1996.
43. H. Imai and S. Hirakawa, "A New Multilevel Coding Method Using Error-Correcting Codes," IEEE Trans. Information Theory, vol. 23, pp. 371-377, 1977.
44. K. Jain, I. Mandoiu, and V.V. Vazirani, "The 'Art of Trellis Decoding' Is Computationally Hard - For Large Fields," IEEE Trans. Information Theory, vol. 44, pp. 1,211-1,214, May 1998.
45. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On the Optimum Bit Orders with Respect to the State Complexity of Trellis Diagrams for Binary Linear Block Codes," IEEE Trans. Information Theory, vol. 39, pp. 242-245, Jan. 1993.
46. U. Kebschull, E. Schubert, and W. Rosentiel, "Multilevel Logic Based on Functional Decision Diagrams," Proc. European Design and Test Conf., pp. 43-47, Paris, Mar. 1992.
47. A.B. Kiely, S. Dolinar, R.J. McEliece, L. Ekroot, and W. Lin, "Trellis Decoding Complexity of Linear Block Codes," IEEE Trans. Information Theory, vol. 42, pp. 1,687-1,697, Nov. 1996.
48. R. Kötter and A. Vardy, "Construction of Minimal Tail-Biting Trellises," Proc. IEEE Int'l Workshop Information Theory, pp. 73-75, Killarney, Ireland, June 1998.
49. R. Kötter and A. Vardy, "Minimality of Factor Graphs," Proc. Math. Theory Networks and Systems Conf. (MTNS), Padova, Italy, July 1998.
50. R. Kötter and A. Vardy, "Factor Graphs: Classification, Constructions, and Bounds," manuscript in preparation, 1999.
51. F.R. Kschischang, "The Trellis Structure of Maximal Fixed-Cost Codes," IEEE Trans. Information Theory, vol. 42, pp. 1,828-1,838, Nov. 1996.
52. F.R. Kschischang, B.J. Frey, and H.-A. Loeliger, "Factor Graphs and the Sum-Product Algorithm," IEEE Trans. Information Theory, submitted for publication, July 1998.
53. F.R. Kschischang and V. Sorokine, "On the Trellis Structure of Block Codes," IEEE Trans. Information Theory, vol. 41, pp. 1,924-1,937, Nov. 1995.
54. A. Lafourcade and A. Vardy, "Asymptotically Good Codes Have Infinite Trellis Complexity," IEEE Trans. Information Theory, vol. 41, pp. 555-559, Mar. 1995.
55. A. Lafourcade and A. Vardy, "Lower Bounds on Trellis Complexity of Block Codes," IEEE Trans. Information Theory, vol. 41, pp. 1,938-1,954, Nov. 1995.
56. A. Lafourcade and A. Vardy, "Optimal Sectionalization of a Trellis," IEEE Trans. Information Theory, vol. 42, pp. 689-703, May 1996.
57. Y.-T. Lai and S. Sastry, "Edge-Valued Binary Decision Diagrams for Multi-Level Hierarchical Verification," Proc. Design Automation Conf. (DAC), pp. 608-613, Anaheim, Calif., June 1992.
58. C. Lee, "Representation of Switching Circuits by Binary Decision Programs," Bell Systems Technical J., vol. 38, pp. 985-999, July 1959.
59. H.T. Liaw and C.S. Lin, "On the OBDD-Representation of General Boolean Functions," IEEE Trans. Computers, vol. 41, no. 7, pp. 661-664, July 1992.
60. D.J.C. MacKay, "Good Error-Correcting Codes Based on Very Sparse Matrices," IEEE Trans. Information Theory, vol. 45, pp. 399-431, Mar. 1999.
61. J.C. Madre and O. Coudert, "A Logically Complete Reasoning Maintenance System Based on a Logical Constraint Solver," Proc. Int'l Joint Conf. Artificial Intelligence, pp. 294-299, Sydney, Australia, Aug. 1991.
62. J.L. Massey, "Foundation and Methods of Channel Encoding," Proc. Int'l Conf. Information Theory and Systems, vol. 65, pp. 148-157, NTG-Fachberichte, Berlin, 1978.
63. R.J. McEliece, "On the BCJR Trellis for Linear Block Codes," IEEE Trans. Information Theory, vol. 42, pp. 1,072-1,092, July 1996.
64. D.J. Muder, "Minimal Trellises for Block Codes," IEEE Trans. Information Theory, vol. 34, pp. 1,049-1,053, Sept. 1988.
65. R.K. Ranjan, J.V. Sanghavi, R.K. Brayton, and A. Sangiovanni-Vincentelli, "High Performance BDD Package Based on Exploiting Memory Hierarchy," Proc. Design Automation Conf. (DAC), Las Vegas, Nev., June 1996.
66. I. Reuven and Y. Be'ery, "Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes," IEEE Trans. Information Theory, vol. 44, pp. 580-598, Mar. 1998.
67. R.L. Rudell, "Dynamic Variable Ordering for Ordered Binary Decision Diagrams," Proc. Int'l Conf. Computer-Aided Design (ICCAD), pp. 42-47, Nov. 1993.
68. H. Sato, Y. Yasue, Y. Matsunaga, and M. Fujita, "Boolean Resubstitution with Permissible Functions and Binary Decision Diagrams," Proc. Design Automation Conf. (DAC), pp. 284-289, Orlando, Fla., June 1990.
69. C.E. Shannon, "The Synthesis of Two-Terminal Switching Circuits," Bell Systems Technical J., vol. 28, pp. 59-98, Jan. 1949.
70. V.R. Sidorenko, I. Martin, and B. Honary, "On the Rectangularity of Nonlinear Block Codes," IEEE Trans. Information Theory, vol. 45, pp. 720-725, Mar. 1999.
71. M. Sipser and D.A. Spielman, "Expander Codes," IEEE Trans. Information Theory, vol. 42, pp. 1,710-1,722, Nov. 1996.
72. R.M. Tanner, "A Recursive Approach to Low-Complexity Codes," IEEE Trans. Information Theory, vol. 27, pp. 533-547, Sept. 1981.
73. A. Vardy, "Trellis Complexity and Soft-Decision Decoding: Conventional and Unconventional Results on Conventional Trellises," Proc. IEEE Int'l Workshop Information Theory, pp. 67-69, Svalbard, Norway, July 1997.
74. A. Vardy, "The Intractability of Computing the Minimum Distance of a Code," IEEE Trans. Information Theory, vol. 43, pp. 1,757-1,766, Nov. 1997.
75. A. Vardy, "Trellis Structure of Codes," Handbook of Coding Theory, V.S. Pless and W.C. Huffman, ed., chapter 24. Amsterdam: Elsevier, 1998.
76. A. Vardy and F.R. Kschischang, "Proof of a Conjecture of McEliece Regarding the Expansion Index of the Minimal Trellis," IEEE Trans. Information Theory, vol. 42, pp. 2,027-2,033, Nov. 1996.
77. I. Wegener, "The Size of Reduced OBDDs and Optimal Read-Once Branching Programs for Almost All Boolean Functions," IEEE Trans. Computers, vol. 43, no. 12, pp. 1,262-1,269, Dec. 1994,
78. see also "Graph-Theoretic Concepts in Computer Science," Lecture Notes Computer Science, vol. 790, pp. 252-263, Berlin: Springer-Verlag, 1994.
79. R. Wercherner, R. Harich, R. Drechsler, and B. Becker, "Satisfiability Problems for OFDDs," Representations of Discrete Functions, T. Sasao and M. Fujita, eds. Boston: Kluwer Academic, 1996.
80. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and Iterative Decoding on General Graphs," European Trans. Telecomm., vol. 6, pp. 513-526, May 1995.
81. Ø. Ytrehus, "Trellis Complexity and Generalized Hamming Weights," Proc. IEEE Int'l Workshop Information Theory, pp. 71-72, Svalbard, Norway, July 1997.