{"id":21145571,"url":"https://github.com/boschmitt/exorcism","last_synced_at":"2025-04-13T10:35:47.637Z","repository":{"id":85781568,"uuid":"105507533","full_name":"boschmitt/exorcism","owner":"boschmitt","description":"Fast Heuristic Minimization of Exclusive-Sums-of-Products","archived":false,"fork":false,"pushed_at":"2018-02-16T17:54:12.000Z","size":30,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-27T02:01:48.029Z","etag":null,"topics":["logic-minimization","logic-synthesis"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-2-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/boschmitt.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-10-02T07:17:00.000Z","updated_at":"2023-06-12T01:48:21.000Z","dependencies_parsed_at":null,"dependency_job_id":"f254e6bc-e63f-4e1a-9488-a4e6785561cc","html_url":"https://github.com/boschmitt/exorcism","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boschmitt%2Fexorcism","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boschmitt%2Fexorcism/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boschmitt%2Fexorcism/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boschmitt%2Fexorcism/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/boschmitt","download_url":"https://codeload.github.com/boschmitt/exorcism/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248700029,"owners_count":21147752,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["logic-minimization","logic-synthesis"],"created_at":"2024-11-20T08:42:06.294Z","updated_at":"2025-04-13T10:35:47.618Z","avatar_url":"https://github.com/boschmitt.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# exorcism\r\n\r\nexorcism iteratively apply the distance-k ExorLink cube transformation\r\nto cube pairs. If replacement of the starting cubes by the resulting cubes leads\r\nto simplification, the cover is modified without changing the function\r\nrepresented by it.\r\n\r\nThis implementation is based on [4].\r\n\r\n## Limitations\r\n* Maximum of 32 inputs.\r\n* Single output.\r\n\r\n## Input\r\nThe input must be an ASCII file in standard PLA format, representing a\r\nsingle-output Boolean function. In the current version, the don’t-cares of the\r\ninput function are ignored and only the on-set of the function is considered.\r\n\r\n## TODO\r\n* Implement pair queue as circular buffers.\r\n* Implement exorlink-4 operation.\r\n* Add support for multiple outputs.\r\n\r\n## References\r\n[1] N. Song, M. Perkowski, \"EXORCISM-MV-2: Minimization of Exclusive Sum of \r\nProduct Expressions for Multiple-Valued Input Incompletely Specified Functions,\"\r\nProc. ISMVL 1993, pp. 132-137\r\n\r\n[2] N. Song, M. Perkowski, \"Minimization of Exclusive Sum of Products Expressions\r\nfor Multi-Output Multiple-Valued Input, Incompletely Specified Functions,\"\r\nIEEE Trans. on CAD, Vol. 15, No. 4, April 1996, pp. 385-395.\r\n\r\n[3] N. Song. \"Minimization of Exclusive Sum of Product Expressions for \r\nMulti-Valued Input Incompletely Specified Functions.\"\r\nM.S. Thesis. EE Dept. Portland State University. Portland, OR, 1992.\r\n\r\n[4] A. Mishchenko and M. Perkowski. \"Fast heuristic minimization of \r\nExclusive-Sums-of-Products.\"\r\nIn 5th International Workshop on Applications of the Reed Muller Expansion\r\nin Circuit Design August 2001\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fboschmitt%2Fexorcism","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fboschmitt%2Fexorcism","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fboschmitt%2Fexorcism/lists"}