An area and latency assessment for coding for memories with stuck cells

An area and latency assessment for coding for memories with stuck cells

We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode time, but not at decode time. Recently, an algorithm for BCH-like codes for stuck cel...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lastras-Montaño, L A, Jagmohan, A, Franceschini, M M
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Decoding
Encoding
Interpolation
Polynomials
Redundancy
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1855
container_issue
container_start_page 1851
container_title
container_volume
creator Lastras-Montaño, L A
Jagmohan, A
Franceschini, M M
description We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode time, but not at decode time. Recently, an algorithm for BCH-like codes for stuck cells was developed that relies on a type of polynomial interpolation in an extension field followed by a step of projection of the result of the interpolation back into the binary field. In this article, we report on the area and latency of a sequential implementation of this encoding algorithm for a variety of values for the number of stuck cells. The statistics on area and latency follow from preliminary circuit synthesis results obtained from a full VHDL implementation of these examples.
doi_str_mv 10.1109/GLOCOMW.2010.5700262
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5700262</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5700262</ieee_id><sourcerecordid>5700262</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-221eb977290957916f36210fb775e4fe438775558358fef8ba62b67cb379b75a3</originalsourceid><addsrcrecordid>eNpVkMtOwzAURM1Loir5Alj4B1L8vvayqiAgBWUDYlnZ6TUE8kBxEOrfE0EXMJsZzZFmMYRccbbinLnroqw21cPzSrC50cCYMOKIZA4sV0Ipa41mx2QhuDE5YwAn_5g0p3_YOclSemOztABl-YIU6576ET31_Y62fsK-3lOfEqbUYT_ROIy0HnZN__ITO-yGscFEv5rplabps36nNbZtuiBn0bcJs4MvydPtzePmLi-r4n6zLvOGg55yITgGByAccxocN1EawVkMABpVRCXtnLS2UtuI0QZvRDBQBwkugPZySS5_dxtE3H6MTefH_fZwi_wG3c9RBg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An area and latency assessment for coding for memories with stuck cells</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Lastras-Montaño, L A ; Jagmohan, A ; Franceschini, M M</creator><creatorcontrib>Lastras-Montaño, L A ; Jagmohan, A ; Franceschini, M M</creatorcontrib><description>We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode time, but not at decode time. Recently, an algorithm for BCH-like codes for stuck cells was developed that relies on a type of polynomial interpolation in an extension field followed by a step of projection of the result of the interpolation back into the binary field. In this article, we report on the area and latency of a sequential implementation of this encoding algorithm for a variety of values for the number of stuck cells. The statistics on area and latency follow from preliminary circuit synthesis results obtained from a full VHDL implementation of these examples.</description><identifier>ISSN: 2166-0077</identifier><identifier>ISBN: 9781424488636</identifier><identifier>ISBN: 142448863X</identifier><identifier>EISSN: 2166-0077</identifier><identifier>EISBN: 9781424488650</identifier><identifier>EISBN: 1424488648</identifier><identifier>EISBN: 9781424488643</identifier><identifier>EISBN: 1424488656</identifier><identifier>DOI: 10.1109/GLOCOMW.2010.5700262</identifier><language>eng</language><publisher>IEEE</publisher><subject>Decoding ; Encoding ; Interpolation ; Polynomials ; Redundancy</subject><ispartof>2010 IEEE Globecom Workshops, 2010, p.1851-1855</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5700262$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54899</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5700262$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lastras-Montaño, L A</creatorcontrib><creatorcontrib>Jagmohan, A</creatorcontrib><creatorcontrib>Franceschini, M M</creatorcontrib><title>An area and latency assessment for coding for memories with stuck cells</title><title>2010 IEEE Globecom Workshops</title><addtitle>GLOCOMW</addtitle><description>We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode time, but not at decode time. Recently, an algorithm for BCH-like codes for stuck cells was developed that relies on a type of polynomial interpolation in an extension field followed by a step of projection of the result of the interpolation back into the binary field. In this article, we report on the area and latency of a sequential implementation of this encoding algorithm for a variety of values for the number of stuck cells. The statistics on area and latency follow from preliminary circuit synthesis results obtained from a full VHDL implementation of these examples.</description><subject>Decoding</subject><subject>Encoding</subject><subject>Interpolation</subject><subject>Polynomials</subject><subject>Redundancy</subject><issn>2166-0077</issn><issn>2166-0077</issn><isbn>9781424488636</isbn><isbn>142448863X</isbn><isbn>9781424488650</isbn><isbn>1424488648</isbn><isbn>9781424488643</isbn><isbn>1424488656</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkMtOwzAURM1Loir5Alj4B1L8vvayqiAgBWUDYlnZ6TUE8kBxEOrfE0EXMJsZzZFmMYRccbbinLnroqw21cPzSrC50cCYMOKIZA4sV0Ipa41mx2QhuDE5YwAn_5g0p3_YOclSemOztABl-YIU6576ET31_Y62fsK-3lOfEqbUYT_ROIy0HnZN__ITO-yGscFEv5rplabps36nNbZtuiBn0bcJs4MvydPtzePmLi-r4n6zLvOGg55yITgGByAccxocN1EawVkMABpVRCXtnLS2UtuI0QZvRDBQBwkugPZySS5_dxtE3H6MTefH_fZwi_wG3c9RBg</recordid><startdate>201012</startdate><enddate>201012</enddate><creator>Lastras-Montaño, L A</creator><creator>Jagmohan, A</creator><creator>Franceschini, M M</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201012</creationdate><title>An area and latency assessment for coding for memories with stuck cells</title><author>Lastras-Montaño, L A ; Jagmohan, A ; Franceschini, M M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-221eb977290957916f36210fb775e4fe438775558358fef8ba62b67cb379b75a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Decoding</topic><topic>Encoding</topic><topic>Interpolation</topic><topic>Polynomials</topic><topic>Redundancy</topic><toplevel>online_resources</toplevel><creatorcontrib>Lastras-Montaño, L A</creatorcontrib><creatorcontrib>Jagmohan, A</creatorcontrib><creatorcontrib>Franceschini, M M</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lastras-Montaño, L A</au><au>Jagmohan, A</au><au>Franceschini, M M</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An area and latency assessment for coding for memories with stuck cells</atitle><btitle>2010 IEEE Globecom Workshops</btitle><stitle>GLOCOMW</stitle><date>2010-12</date><risdate>2010</risdate><spage>1851</spage><epage>1855</epage><pages>1851-1855</pages><issn>2166-0077</issn><eissn>2166-0077</eissn><isbn>9781424488636</isbn><isbn>142448863X</isbn><eisbn>9781424488650</eisbn><eisbn>1424488648</eisbn><eisbn>9781424488643</eisbn><eisbn>1424488656</eisbn><abstract>We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode time, but not at decode time. Recently, an algorithm for BCH-like codes for stuck cells was developed that relies on a type of polynomial interpolation in an extension field followed by a step of projection of the result of the interpolation back into the binary field. In this article, we report on the area and latency of a sequential implementation of this encoding algorithm for a variety of values for the number of stuck cells. The statistics on area and latency follow from preliminary circuit synthesis results obtained from a full VHDL implementation of these examples.</abstract><pub>IEEE</pub><doi>10.1109/GLOCOMW.2010.5700262</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2166-0077
ispartof 2010 IEEE Globecom Workshops, 2010, p.1851-1855
issn 2166-0077
2166-0077
language eng
recordid cdi_ieee_primary_5700262
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Decoding
Encoding
Interpolation
Polynomials
Redundancy
title An area and latency assessment for coding for memories with stuck cells
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T08%3A16%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20area%20and%20latency%20assessment%20for%20coding%20for%20memories%20with%20stuck%20cells&rft.btitle=2010%20IEEE%20Globecom%20Workshops&rft.au=Lastras-Monta%C3%B1o,%20L%20A&rft.date=2010-12&rft.spage=1851&rft.epage=1855&rft.pages=1851-1855&rft.issn=2166-0077&rft.eissn=2166-0077&rft.isbn=9781424488636&rft.isbn_list=142448863X&rft_id=info:doi/10.1109/GLOCOMW.2010.5700262&rft_dat=%3Cieee_6IE%3E5700262%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424488650&rft.eisbn_list=1424488648&rft.eisbn_list=9781424488643&rft.eisbn_list=1424488656&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5700262&rfr_iscdi=true