On codes satisfying < e1 > M < /e1 > th-order running digital sum constraints
Multi level sequences with a spectral null of order M at frequency < e1 > f < /e1 > , meaning that the power spectral density, and its first 2M-1 derivatives vanish at < e1 > f < /e1 > , are characterized by finite-state transition diagrams (FSTDs) whose edge labels satisfy b...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on information theory 1991-09, Vol.37 (5), p.1294-1313 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1313 |
---|---|
container_issue | 5 |
container_start_page | 1294 |
container_title | IEEE transactions on information theory |
container_volume | 37 |
creator | Eleftheriou, E Cideciyan, R D |
description | Multi level sequences with a spectral null of order M at frequency < e1 > f < /e1 > , meaning that the power spectral density, and its first 2M-1 derivatives vanish at < e1 > f < /e1 > , are characterized by finite-state transition diagrams (FSTDs) whose edge labels satisfy bounds on the variation of the Mth-order running digital sum (RDS). Necessary and sufficient conditions for FSTDs with higher order null constraints at DC and at an arbitrary submultiple of the symbol frequency are derived. Analytical results are given concerning the performance of codes satisfying an < e1 > M < /e1 > th-order RDS constraint on partial-response channels. Specific code designs for quaternary channel inputs are presented. The Euclidean distance properties of this new class of codes, aside from their spectral-shaping properties, are demonstrated |
doi_str_mv | 10.1109/18.133248 |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_28407538</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28407538</sourcerecordid><originalsourceid>FETCH-proquest_miscellaneous_284075383</originalsourceid><addsrcrecordid>eNqNi70OgjAYRTtoIv4MvkEnN6ClJZbEuBiNC3FxJw0UrClF-7WDby8aH8Dpnpucg9CakoRSUqRUJJSxjIsJigihIi44FzM0B7iPl-c0i1B5sbgeGgUYpNfQvrTt8A4rive4HCH9kr_Fg2uUwy5Y-zEa3WkvDYbQj7kF76S2HpZo2koDavXbBdqcjtfDOX644RkU-KrXUCtjpFVDgCoTnGxzJtjf4hs4YkG0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28407538</pqid></control><display><type>article</type><title>On codes satisfying < e1 > M < /e1 > th-order running digital sum constraints</title><source>IEEE Electronic Library (IEL)</source><creator>Eleftheriou, E ; Cideciyan, R D</creator><creatorcontrib>Eleftheriou, E ; Cideciyan, R D</creatorcontrib><description><![CDATA[Multi level sequences with a spectral null of order M at frequency < e1 > f < /e1 > , meaning that the power spectral density, and its first 2M-1 derivatives vanish at < e1 > f < /e1 > , are characterized by finite-state transition diagrams (FSTDs) whose edge labels satisfy bounds on the variation of the Mth-order running digital sum (RDS). Necessary and sufficient conditions for FSTDs with higher order null constraints at DC and at an arbitrary submultiple of the symbol frequency are derived. Analytical results are given concerning the performance of codes satisfying an < e1 > M < /e1 > th-order RDS constraint on partial-response channels. Specific code designs for quaternary channel inputs are presented. The Euclidean distance properties of this new class of codes, aside from their spectral-shaping properties, are demonstrated]]></description><identifier>ISSN: 0018-9448</identifier><identifier>DOI: 10.1109/18.133248</identifier><language>eng</language><ispartof>IEEE transactions on information theory, 1991-09, Vol.37 (5), p.1294-1313</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,778,782,27907,27908</link.rule.ids></links><search><creatorcontrib>Eleftheriou, E</creatorcontrib><creatorcontrib>Cideciyan, R D</creatorcontrib><title>On codes satisfying < e1 > M < /e1 > th-order running digital sum constraints</title><title>IEEE transactions on information theory</title><description><![CDATA[Multi level sequences with a spectral null of order M at frequency < e1 > f < /e1 > , meaning that the power spectral density, and its first 2M-1 derivatives vanish at < e1 > f < /e1 > , are characterized by finite-state transition diagrams (FSTDs) whose edge labels satisfy bounds on the variation of the Mth-order running digital sum (RDS). Necessary and sufficient conditions for FSTDs with higher order null constraints at DC and at an arbitrary submultiple of the symbol frequency are derived. Analytical results are given concerning the performance of codes satisfying an < e1 > M < /e1 > th-order RDS constraint on partial-response channels. Specific code designs for quaternary channel inputs are presented. The Euclidean distance properties of this new class of codes, aside from their spectral-shaping properties, are demonstrated]]></description><issn>0018-9448</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1991</creationdate><recordtype>article</recordtype><recordid>eNqNi70OgjAYRTtoIv4MvkEnN6ClJZbEuBiNC3FxJw0UrClF-7WDby8aH8Dpnpucg9CakoRSUqRUJJSxjIsJigihIi44FzM0B7iPl-c0i1B5sbgeGgUYpNfQvrTt8A4rive4HCH9kr_Fg2uUwy5Y-zEa3WkvDYbQj7kF76S2HpZo2koDavXbBdqcjtfDOX644RkU-KrXUCtjpFVDgCoTnGxzJtjf4hs4YkG0</recordid><startdate>19910901</startdate><enddate>19910901</enddate><creator>Eleftheriou, E</creator><creator>Cideciyan, R D</creator><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19910901</creationdate><title>On codes satisfying < e1 > M < /e1 > th-order running digital sum constraints</title><author>Eleftheriou, E ; Cideciyan, R D</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_miscellaneous_284075383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1991</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Eleftheriou, E</creatorcontrib><creatorcontrib>Cideciyan, R D</creatorcontrib><collection>Computer and Information Systems 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><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Eleftheriou, E</au><au>Cideciyan, R D</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On codes satisfying < e1 > M < /e1 > th-order running digital sum constraints</atitle><jtitle>IEEE transactions on information theory</jtitle><date>1991-09-01</date><risdate>1991</risdate><volume>37</volume><issue>5</issue><spage>1294</spage><epage>1313</epage><pages>1294-1313</pages><issn>0018-9448</issn><abstract><![CDATA[Multi level sequences with a spectral null of order M at frequency < e1 > f < /e1 > , meaning that the power spectral density, and its first 2M-1 derivatives vanish at < e1 > f < /e1 > , are characterized by finite-state transition diagrams (FSTDs) whose edge labels satisfy bounds on the variation of the Mth-order running digital sum (RDS). Necessary and sufficient conditions for FSTDs with higher order null constraints at DC and at an arbitrary submultiple of the symbol frequency are derived. Analytical results are given concerning the performance of codes satisfying an < e1 > M < /e1 > th-order RDS constraint on partial-response channels. Specific code designs for quaternary channel inputs are presented. The Euclidean distance properties of this new class of codes, aside from their spectral-shaping properties, are demonstrated]]></abstract><doi>10.1109/18.133248</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0018-9448 |
ispartof | IEEE transactions on information theory, 1991-09, Vol.37 (5), p.1294-1313 |
issn | 0018-9448 |
language | eng |
recordid | cdi_proquest_miscellaneous_28407538 |
source | IEEE Electronic Library (IEL) |
title | On codes satisfying < e1 > M < /e1 > th-order running digital sum constraints |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T07%3A44%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20codes%20satisfying%20%3C%20e1%20%3E%20M%20%3C%20/e1%20%3E%20th-order%20running%20digital%20sum%20constraints&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Eleftheriou,%20E&rft.date=1991-09-01&rft.volume=37&rft.issue=5&rft.spage=1294&rft.epage=1313&rft.pages=1294-1313&rft.issn=0018-9448&rft_id=info:doi/10.1109/18.133248&rft_dat=%3Cproquest%3E28407538%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28407538&rft_id=info:pmid/&rfr_iscdi=true |