On covering distant minterms by the camp algorithm
The computer-aided minimization procedure (CAMP) algorithm is a minterm-based computer-aided procedure for the minimization of single Boolean functions. Major modifications of the algorithm are presented. They allow it always to obtain the minimum cover covering all the uncovered minterms, both adja...
Saved in:
| Published in | IEEE transactions on computer-aided design of integrated circuits and systems Vol. 9; no. 7; pp. 786 - 789 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
IEEE
01.07.1990
Institute of Electrical and Electronics Engineers |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0278-0070 |
| DOI | 10.1109/43.55215 |
Cover
| Abstract | The computer-aided minimization procedure (CAMP) algorithm is a minterm-based computer-aided procedure for the minimization of single Boolean functions. Major modifications of the algorithm are presented. They allow it always to obtain the minimum cover covering all the uncovered minterms, both adjacent and distant, in the normal mode. In the branch mode, the solution may not be minimum in many cases. However, a new theorem introduced in the algorithm allows it to switch to the branch mode only when it is inevitable. The improved algorithm also has a mechanism which ensures the largest possible dimension for each cube of the solution.< > |
|---|---|
| AbstractList | The computer-aided minimization procedure (CAMP) algorithm is a minterm-based computer-aided procedure for the minimization of single Boolean functions. Major modifications of the algorithm are presented. They allow it always to obtain the minimum cover covering all the uncovered minterms, both adjacent and distant, in the normal mode. In the branch mode, the solution may not be minimum in many cases. However, a new theorem introduced in the algorithm allows it to switch to the branch mode only when it is inevitable. The improved algorithm also has a mechanism which ensures the largest possible dimension for each cube of the solution.< > The computer-aided minimization procedure (CAMP) algorithm is a minterm-based computer-aided procedure for the minimization of single Boolean functions. Major modifications of the algorithm are presented. They allow it always to obtain the minimum cover covering all the uncovered minterms, both adjacent and distant, in the normal mode. In the branch mode, the solution may not be minimum in many cases. However, a new theorem introduced in the algorithm allows it to switch to the branch mode only when it is inevitable. The improved algorithm also has a mechanism which ensures the largest possible dimension for each cube of the solution |
| Author | Biswas, N.N. |
| Author_xml | – sequence: 1 givenname: N.N. surname: Biswas fullname: Biswas, N.N. organization: Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19858862$$DView record in Pascal Francis |
| BookMark | eNpF0D1PwzAYBGAPRaItSKxsWUAsKf6MnRFVfEmVusBsufab1ihxiu0i9d8TSAXTDffohpuhSegDIHRF8IIQXN9zthCCEjFBU0ylKjGW-BzNUvrAmHBB6ymi61DY_guiD9vC-ZRNyEXnQ4bYpWJzLPIOCmu6fWHabR993nUX6KwxbYLLU87R-9Pj2_KlXK2fX5cPq9LSSuRSSZAbUynlCDFcgHSbGqhwDKSpKsotNdYSBkI5yzl3YDAjrnGONmCZFGyObsfdfew_D5Cy7nyy0LYmQH9ImiqOFa35AG9O0CRr2iaaYH3S--g7E4-a1EooVdHB3Y3Oxj6lCM0_wfrnMM2Z_j1soNcj9QDwx8buG4wmaIQ |
| CODEN | ITCSDI |
| Cites_doi | 10.1109/DAC.1984.1585887 10.1007/978-1-4613-2821-6 10.1109/TCAD.1986.1270199 |
| ContentType | Journal Article |
| Copyright | 1991 INIST-CNRS |
| Copyright_xml | – notice: 1991 INIST-CNRS |
| DBID | AAYXX CITATION IQODW 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D |
| DOI | 10.1109/43.55215 |
| DatabaseName | CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EndPage | 789 |
| ExternalDocumentID | 19858862 10_1109_43_55215 55215 |
| GroupedDBID | --Z -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IBMZZ ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P PZZ RIA RIE RNS TN5 VH1 VJK AAYXX CITATION IQODW RIG 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c265t-87e7ba688d11a45e7db9e25d3e7a6624c2acc13e58dc444dea031dfdd2fec3753 |
| IEDL.DBID | RIE |
| ISSN | 0278-0070 |
| IngestDate | Thu Oct 02 06:25:39 EDT 2025 Mon Jul 21 09:15:16 EDT 2025 Wed Oct 01 00:57:58 EDT 2025 Tue Aug 26 16:39:11 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | Improvement Integrated circuit Theoretical study Boolean function Minimization Algorithm Computer aided design |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c265t-87e7ba688d11a45e7db9e25d3e7a6624c2acc13e58dc444dea031dfdd2fec3753 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 28408294 |
| PQPubID | 23500 |
| PageCount | 4 |
| ParticipantIDs | proquest_miscellaneous_28408294 ieee_primary_55215 crossref_primary_10_1109_43_55215 pascalfrancis_primary_19858862 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1990-07-01 |
| PublicationDateYYYYMMDD | 1990-07-01 |
| PublicationDate_xml | – month: 07 year: 1990 text: 1990-07-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | IEEE transactions on computer-aided design of integrated circuits and systems |
| PublicationTitleAbbrev | TCAD |
| PublicationYear | 1990 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers |
| References | ref2 brayton (ref3) 1984 ref1 |
| References_xml | – ident: ref1 doi: 10.1109/DAC.1984.1585887 – year: 1984 ident: ref3 publication-title: Logic Minimization Algorithms for VLSI Synthesis doi: 10.1007/978-1-4613-2821-6 – ident: ref2 doi: 10.1109/TCAD.1986.1270199 |
| SSID | ssj0014529 |
| Score | 1.3643979 |
| Snippet | The computer-aided minimization procedure (CAMP) algorithm is a minterm-based computer-aided procedure for the minimization of single Boolean functions. Major... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 786 |
| SubjectTerms | Algorithm design and analysis Applied sciences Boolean functions Design automation Design. Technologies. Operation analysis. Testing Electronics Exact sciences and technology Integrated circuits Minimization methods Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Switches |
| Title | On covering distant minterms by the camp algorithm |
| URI | https://ieeexplore.ieee.org/document/55215 https://www.proquest.com/docview/28408294 |
| Volume | 9 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 0278-0070 databaseCode: RIE dateStart: 19820101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0014529 providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZoJxiA8hDlUYzEmjRx7MQZEaKqkICFSt0ix3YAQZOqSQb49ZydtFBgYMvLVmJffPf57r5D6DLLSCrA9HY8k_5LQ86cVBqUAphZUyokt2Q6d_fheEJvp2za0uTYXBittQ0-0645tL58VcjabJUNGega1kGdiIdNptbKX2Dch3Y3xfDFghS3NLO-Fw9p4Np2a4rHVlIxcZCihKHImhoWv5Zjq2NGO02xotJSE5rQkle3rlJXfvwgbvzf6--i7dbUxFeNbPTQhs730NY3AsJ9RB5yLE0QJ5xhZUzJvMIzQyGxmJU4fcdgHmIpZnMs3p6KxUv1PDtAk9HN4_XYaasoOJKErILlTkepCDlXvi8o05FKY02YCnQkwpBQSYSUfqAZV5JSqrSA_1xlSpFMywDQzCHq5kWujxAGcCOoYgGBjuBBP84AcIBF5YeeAJwo-uhiOcTJvCHLSCzI8OKEBon9_j7qmZFZ3W8vDtZm4qt1zBkH0NVH58upSUD-jVND5LqoywTUq0kPpsd_9XuCNn1Qt0147SnqVotan4ERUaUDKz-fvJjE_A |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELagDMAAlIcoj9ZIrAl52GkyIkRVoC1LK3WLHNsBBEmqJhng13N20kKBgS0vR_L5cff57r5D6DKOnYiB6W1YKv2XeD41Iq5QCmBmSQjjvibTGY68_oTcT-m0psnRuTBSSh18Jk11qX35IuOlOiq7oqBr6DraoIQQWuVqLT0GyoGoz1MUYyzM45po1raCK-KauuWK6tG1VFQkJMtBGHFVxeLXhqy1TG-3KleUa3JCFVzyapZFZPKPH9SN_-vAHtqpjU18Xc2OJlqT6T7a_kZBeICcxxRzFcYJd1goYzItcKJIJOZJjqN3DAYi5iyZYfb2lM1fiufkEE16t-ObvlHXUTC449ECNjzZjZjn-8K2GaGyK6JAOlS4sss8zyHcYZzbrqS-4CBZIRmsdBEL4cSSu4BnjlAjzVJ5jDDAG0YEdR34EXxoBzFADrCpbM9igBRZC10sRBzOKrqMUMMMKwiJG-r-t1BTSWb5vn7YXhmJr9aBT32AXS3UWQxNCCtAuTVYKrMyD0HBqgRhcvLXfztosz8eDsLB3ejhFG3ZoHyrYNsz1CjmpTwHk6KI2noufQI21shJ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+covering+distant+minterms+by+the+camp+algorithm&rft.jtitle=IEEE+transactions+on+computer-aided+design+of+integrated+circuits+and+systems&rft.au=Biswas%2C+N+N&rft.date=1990-07-01&rft.issn=0278-0070&rft.volume=9&rft.issue=7&rft.spage=786&rft.epage=789&rft_id=info:doi/10.1109%2F43.55215&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0278-0070&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0278-0070&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0278-0070&client=summon |