✦ LIBER ✦

Lower bound study on interconnect complexity of the decomposed finite state machines

✍ Scribed by Yang, W.-L.; Owens, R.M.; Irwin, M.J.

Book ID: 114448204
Publisher: The Institution of Electrical Engineers
Year: 1995
Tongue: English
Weight: 363 KB
Volume: 142
Category: Article
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:19952127

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the complexity of recurrent ne

Bounds on the complexity of recurrent neural network implementations of finite state machines

✍ Bill G. Horne; Don R. Hush 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 823 KB

In this paper the efficiency of recurrent neural network implementations of m-state finite state machines will be explored. Specifically, it will be shown that the node complexity for the unrestricted case can be bounded above by O(v/-m-). It will also be shown that the node complexity is 0( ~) when

A Lower Bound on the Complexity of Polyn

A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields

✍ Kaminski, Michael 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 338 KB

Lower Bounds on the State Complexity of

Lower Bounds on the State Complexity of Geometric Goppa Codes

✍ T. Blackmore; G. H. Norton 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 156 KB

Lower bounds on the state complexity of

Lower bounds on the state complexity of linear tail-biting trellises

✍ Shany, Y.; Reuven, I.; Be'ery, Y. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 348 KB

Lower bounds on the linear complexity of

Lower bounds on the linear complexity of the discrete logarithm in finite fields

✍ Meidl, W.; Winterhof, A. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 297 KB

A lower bound on the probability of deco

A lower bound on the probability of decoding error for the finite-state channel (Corresp.)

✍ Kieffer, J. 📂 Article 📅 1974 🏛 IEEE 🌐 English ⚖ 428 KB