A VLSI architecture for fast inversion in GF(2/sup m/)
A new algorithm for performing fast inversion in GF (2/sup m/) is presented. The algorithm requires O(mlog/sub 2/ m) computation time. Using serial-in-parallel-out multiplication, the design of the algorithm is highly regular, modular, and well suited for VLSI implementation.< >
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computers 1989-10, Vol.38 (10), p.1383-1386 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1386 |
|---|---|
| container_issue | 10 |
| container_start_page | 1383 |
| container_title | IEEE transactions on computers |
| container_volume | 38 |
| creator | Feng, G.-L. |
| description | A new algorithm for performing fast inversion in GF (2/sup m/) is presented. The algorithm requires O(mlog/sub 2/ m) computation time. Using serial-in-parallel-out multiplication, the design of the algorithm is highly regular, modular, and well suited for VLSI implementation.< > |
| doi_str_mv | 10.1109/12.35833 |
| format | Article |
| fullrecord | <record><control><sourceid>pascalfrancis_RIE</sourceid><recordid>TN_cdi_ieee_primary_35833</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>35833</ieee_id><sourcerecordid>6608066</sourcerecordid><originalsourceid>FETCH-LOGICAL-c272t-309538401fc7259e248e77d38a0949efb0d7252aeb48fc358bca47feceeba8db3</originalsourceid><addsrcrecordid>eNo9j81Lw0AUxBdRMFbBq7c9eKiHNG93k_04lmJrIeDBj2vYbN5ipE3Dbir43xuN9DSPmR_DG0JuGSwYA5MxvhCFFuKMJKwoVGpMIc9JAsB0akQOl-Qqxk8AkBxMQuSSvpcvW2qD-2gHdMMxIPWHQL2NA227LwyxPXTjRTfrOc_isaf77OGaXHi7i3jzrzPytn58XT2l5fNmu1qWqeOKD6kAUwidA_NO8cIgzzUq1QhtweQGfQ3N6HOLda69G_-unc2VR4dYW93UYkbmU68LhxgD-qoP7d6G74pB9bu3Yrz62zui9xPa2-jszgfbuTaeeClBg5QjdjdhLSKe0qniB8aVWkU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A VLSI architecture for fast inversion in GF(2/sup m/)</title><source>IEEE Electronic Library (IEL)</source><creator>Feng, G.-L.</creator><creatorcontrib>Feng, G.-L.</creatorcontrib><description>A new algorithm for performing fast inversion in GF (2/sup m/) is presented. The algorithm requires O(mlog/sub 2/ m) computation time. Using serial-in-parallel-out multiplication, the design of the algorithm is highly regular, modular, and well suited for VLSI implementation.< ></description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.35833</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Applied sciences ; Coding, codes ; Computer architecture ; Cryptography ; Decoding ; Error correction codes ; Exact sciences and technology ; Galois fields ; Information, signal and communications theory ; Pipelines ; Reed-Solomon codes ; Signal and communications theory ; Signal processing algorithms ; Telecommunications and information theory ; Very large scale integration</subject><ispartof>IEEE transactions on computers, 1989-10, Vol.38 (10), p.1383-1386</ispartof><rights>1990 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c272t-309538401fc7259e248e77d38a0949efb0d7252aeb48fc358bca47feceeba8db3</citedby><cites>FETCH-LOGICAL-c272t-309538401fc7259e248e77d38a0949efb0d7252aeb48fc358bca47feceeba8db3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/35833$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/35833$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=6608066$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Feng, G.-L.</creatorcontrib><title>A VLSI architecture for fast inversion in GF(2/sup m/)</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>A new algorithm for performing fast inversion in GF (2/sup m/) is presented. The algorithm requires O(mlog/sub 2/ m) computation time. Using serial-in-parallel-out multiplication, the design of the algorithm is highly regular, modular, and well suited for VLSI implementation.< ></description><subject>Algorithm design and analysis</subject><subject>Applied sciences</subject><subject>Coding, codes</subject><subject>Computer architecture</subject><subject>Cryptography</subject><subject>Decoding</subject><subject>Error correction codes</subject><subject>Exact sciences and technology</subject><subject>Galois fields</subject><subject>Information, signal and communications theory</subject><subject>Pipelines</subject><subject>Reed-Solomon codes</subject><subject>Signal and communications theory</subject><subject>Signal processing algorithms</subject><subject>Telecommunications and information theory</subject><subject>Very large scale integration</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNo9j81Lw0AUxBdRMFbBq7c9eKiHNG93k_04lmJrIeDBj2vYbN5ipE3Dbir43xuN9DSPmR_DG0JuGSwYA5MxvhCFFuKMJKwoVGpMIc9JAsB0akQOl-Qqxk8AkBxMQuSSvpcvW2qD-2gHdMMxIPWHQL2NA227LwyxPXTjRTfrOc_isaf77OGaXHi7i3jzrzPytn58XT2l5fNmu1qWqeOKD6kAUwidA_NO8cIgzzUq1QhtweQGfQ3N6HOLda69G_-unc2VR4dYW93UYkbmU68LhxgD-qoP7d6G74pB9bu3Yrz62zui9xPa2-jszgfbuTaeeClBg5QjdjdhLSKe0qniB8aVWkU</recordid><startdate>19891001</startdate><enddate>19891001</enddate><creator>Feng, G.-L.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19891001</creationdate><title>A VLSI architecture for fast inversion in GF(2/sup m/)</title><author>Feng, G.-L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c272t-309538401fc7259e248e77d38a0949efb0d7252aeb48fc358bca47feceeba8db3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Algorithm design and analysis</topic><topic>Applied sciences</topic><topic>Coding, codes</topic><topic>Computer architecture</topic><topic>Cryptography</topic><topic>Decoding</topic><topic>Error correction codes</topic><topic>Exact sciences and technology</topic><topic>Galois fields</topic><topic>Information, signal and communications theory</topic><topic>Pipelines</topic><topic>Reed-Solomon codes</topic><topic>Signal and communications theory</topic><topic>Signal processing algorithms</topic><topic>Telecommunications and information theory</topic><topic>Very large scale integration</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Feng, G.-L.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Feng, G.-L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A VLSI architecture for fast inversion in GF(2/sup m/)</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1989-10-01</date><risdate>1989</risdate><volume>38</volume><issue>10</issue><spage>1383</spage><epage>1386</epage><pages>1383-1386</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>A new algorithm for performing fast inversion in GF (2/sup m/) is presented. The algorithm requires O(mlog/sub 2/ m) computation time. Using serial-in-parallel-out multiplication, the design of the algorithm is highly regular, modular, and well suited for VLSI implementation.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/12.35833</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9340 |
| ispartof | IEEE transactions on computers, 1989-10, Vol.38 (10), p.1383-1386 |
| issn | 0018-9340 1557-9956 |
| language | eng |
| recordid | cdi_ieee_primary_35833 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis Applied sciences Coding, codes Computer architecture Cryptography Decoding Error correction codes Exact sciences and technology Galois fields Information, signal and communications theory Pipelines Reed-Solomon codes Signal and communications theory Signal processing algorithms Telecommunications and information theory Very large scale integration |
| title | A VLSI architecture for fast inversion in GF(2/sup m/) |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T18%3A58%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20VLSI%20architecture%20for%20fast%20inversion%20in%20GF(2/sup%20m/)&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Feng,%20G.-L.&rft.date=1989-10-01&rft.volume=38&rft.issue=10&rft.spage=1383&rft.epage=1386&rft.pages=1383-1386&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.35833&rft_dat=%3Cpascalfrancis_RIE%3E6608066%3C/pascalfrancis_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=35833&rfr_iscdi=true |