Polynomial cancellation coding and finite differences
We give a mathematical context for polynomial cancellation coding, proposed previously to reduce intercarrier interference in orthogonal frequency division multiplexing (OFDM). In particular, we analyze polynomial cancellation coding (PCC) in terms of finite differences.
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2000-01, Vol.46 (1), p.311-313 |
|---|---|
| Hauptverfasser: | , |
| 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 | 313 |
|---|---|
| container_issue | 1 |
| container_start_page | 311 |
| container_title | IEEE transactions on information theory |
| container_volume | 46 |
| creator | Seaton, K.A. Armstrong, J. |
| description | We give a mathematical context for polynomial cancellation coding, proposed previously to reduce intercarrier interference in orthogonal frequency division multiplexing (OFDM). In particular, we analyze polynomial cancellation coding (PCC) in terms of finite differences. |
| doi_str_mv | 10.1109/18.817533 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_817533</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>817533</ieee_id><sourcerecordid>56957277</sourcerecordid><originalsourceid>FETCH-LOGICAL-c336t-9382163cdd09c5f1de64667a797c7de8bbb9904d21b8c146b9c9f7376945c1d03</originalsourceid><addsrcrecordid>eNp90D1PwzAQBmALgUQpDKxMEQOIIcUXf4-o4kuqBAPMVmI7yFVqlzgd-u_rkoqBgelk3ePX50PoEvAMAKt7kDMJghFyhCbAmCgVZ_QYTTAGWSpK5Sk6S2mZj5RBNUHsPXbbEFe-7gpTB-O6rh58DIWJ1oevog62aH3wgyusb1vXu2zSOTpp6y65i0Odos-nx4_5S7l4e36dPyxKQwgfSkVkBZwYa7EyrAXrOOVc1EIJI6yTTdMohamtoJEGKG-UUa0ggivKDFhMpuh2zF338Xvj0qBXPv3MGFzcJK3yJVrliCxv_pWVZAQYhgyv_8Bl3PQh_0KDYqqqON-_ezci08eUetfqde9Xdb_VgPV-zxqkHvec7dVovXPu1x2aOzrnddQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195922660</pqid></control><display><type>article</type><title>Polynomial cancellation coding and finite differences</title><source>IEEE Electronic Library (IEL)</source><creator>Seaton, K.A. ; Armstrong, J.</creator><creatorcontrib>Seaton, K.A. ; Armstrong, J.</creatorcontrib><description>We give a mathematical context for polynomial cancellation coding, proposed previously to reduce intercarrier interference in orthogonal frequency division multiplexing (OFDM). In particular, we analyze polynomial cancellation coding (PCC) in terms of finite differences.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/18.817533</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Cancellation ; Codes ; Coding ; Information theory ; Interference ; Mathematical analysis ; Multiplexers ; Orthogonal Frequency Division Multiplexing ; Polynomials</subject><ispartof>IEEE transactions on information theory, 2000-01, Vol.46 (1), p.311-313</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2000</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c336t-9382163cdd09c5f1de64667a797c7de8bbb9904d21b8c146b9c9f7376945c1d03</citedby><cites>FETCH-LOGICAL-c336t-9382163cdd09c5f1de64667a797c7de8bbb9904d21b8c146b9c9f7376945c1d03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/817533$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/817533$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Seaton, K.A.</creatorcontrib><creatorcontrib>Armstrong, J.</creatorcontrib><title>Polynomial cancellation coding and finite differences</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We give a mathematical context for polynomial cancellation coding, proposed previously to reduce intercarrier interference in orthogonal frequency division multiplexing (OFDM). In particular, we analyze polynomial cancellation coding (PCC) in terms of finite differences.</description><subject>Cancellation</subject><subject>Codes</subject><subject>Coding</subject><subject>Information theory</subject><subject>Interference</subject><subject>Mathematical analysis</subject><subject>Multiplexers</subject><subject>Orthogonal Frequency Division Multiplexing</subject><subject>Polynomials</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp90D1PwzAQBmALgUQpDKxMEQOIIcUXf4-o4kuqBAPMVmI7yFVqlzgd-u_rkoqBgelk3ePX50PoEvAMAKt7kDMJghFyhCbAmCgVZ_QYTTAGWSpK5Sk6S2mZj5RBNUHsPXbbEFe-7gpTB-O6rh58DIWJ1oevog62aH3wgyusb1vXu2zSOTpp6y65i0Odos-nx4_5S7l4e36dPyxKQwgfSkVkBZwYa7EyrAXrOOVc1EIJI6yTTdMohamtoJEGKG-UUa0ggivKDFhMpuh2zF338Xvj0qBXPv3MGFzcJK3yJVrliCxv_pWVZAQYhgyv_8Bl3PQh_0KDYqqqON-_ezci08eUetfqde9Xdb_VgPV-zxqkHvec7dVovXPu1x2aOzrnddQ</recordid><startdate>200001</startdate><enddate>200001</enddate><creator>Seaton, K.A.</creator><creator>Armstrong, J.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>200001</creationdate><title>Polynomial cancellation coding and finite differences</title><author>Seaton, K.A. ; Armstrong, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c336t-9382163cdd09c5f1de64667a797c7de8bbb9904d21b8c146b9c9f7376945c1d03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Cancellation</topic><topic>Codes</topic><topic>Coding</topic><topic>Information theory</topic><topic>Interference</topic><topic>Mathematical analysis</topic><topic>Multiplexers</topic><topic>Orthogonal Frequency Division Multiplexing</topic><topic>Polynomials</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Seaton, K.A.</creatorcontrib><creatorcontrib>Armstrong, J.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Seaton, K.A.</au><au>Armstrong, J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Polynomial cancellation coding and finite differences</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2000-01</date><risdate>2000</risdate><volume>46</volume><issue>1</issue><spage>311</spage><epage>313</epage><pages>311-313</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We give a mathematical context for polynomial cancellation coding, proposed previously to reduce intercarrier interference in orthogonal frequency division multiplexing (OFDM). In particular, we analyze polynomial cancellation coding (PCC) in terms of finite differences.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/18.817533</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2000-01, Vol.46 (1), p.311-313 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_ieee_primary_817533 |
| source | IEEE Electronic Library (IEL) |
| subjects | Cancellation Codes Coding Information theory Interference Mathematical analysis Multiplexers Orthogonal Frequency Division Multiplexing Polynomials |
| title | Polynomial cancellation coding and finite differences |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T00%3A59%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Polynomial%20cancellation%20coding%20and%20finite%20differences&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Seaton,%20K.A.&rft.date=2000-01&rft.volume=46&rft.issue=1&rft.spage=311&rft.epage=313&rft.pages=311-313&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/18.817533&rft_dat=%3Cproquest_RIE%3E56957277%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195922660&rft_id=info:pmid/&rft_ieee_id=817533&rfr_iscdi=true |