An algorithm for face-constrained encoding of symbols using minimum code length

Martinez, M.; Avedillo, M.J.; Quintana, J.M.; Huertas, J.L.

doi:10.1109/date.1999.761176

Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078)

DOI: 10.1109/date.1999.761176

|View full text |Cite

An algorithm for face-constrained encoding of symbols using minimum code length

M. Martinez¹,

M.J. Avedillo²,

J.M. Quintana³

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

An Integrated Input Encoding and Symbolic Functional Decomposition for LUT-Based FPGAs

Deniziak

Wiśniewski

2008

2008 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems

View full text Add to dashboard Cite

In this paper a method for decomposition of encoding and symbolic functional decomposition for functions functions with multi-valued inputs is presented. Decomposition is with multi-valued inputs. The goal of our method is to find performed simultaneously with encoding of symbolic values. In encoding that simplifies functional decomposition. Input this way an impact of input encoding on decomposition efficiency encoding is built in balanced decomposing strategy based on is taken into consideration during optimization. The goal of our . and serial decompositions[2]. E method is to find encoding that maximally simplifies functional paaled serial decompsitioi E mnt al rests decomposition. Experimental results showed that the presented showed that our method significantly reduces the cost of method significantly reduces the cost of FPGA implementations FPGA implementations for most evaluated benchmarks. for most evaluated benchmarks.Next section presents a basic theory concerning functional decomposition and blanked algebra which is the mathematical

show abstract

An Integrated Input Encoding and Symbolic Functional Decomposition for LUT-Based FPGAs

Deniziak

Wiśniewski

2008

2008 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

An algorithm for face-constrained encoding of symbols using minimum code length

Cited by 1 publication

References 12 publications

An Integrated Input Encoding and Symbolic Functional Decomposition for LUT-Based FPGAs

An Integrated Input Encoding and Symbolic Functional Decomposition for LUT-Based FPGAs

Contact Info

Product

Resources

About