Embedded Rank Distance Codes for ISI channels

Embedded Rank Distance Codes for ISI channels

Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the bi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2007-07
Hauptverfasser: Dusad, S, Diggavi, S N, Calderbank, A R
Format: Artikel
Sprache:eng
Schlagworte:
Asymptotic properties
Channels
Computer Science - Information Theory
Constellations
Design
Fading
Mapping
Mathematics - Information Theory
Spacetime
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Dusad, S
Diggavi, S N
Calderbank, A R
description Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto QAM and PSK constellations. In this paper we demonstrate that diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary we obtain an asymptotic characterization of the fixed transmit alphabet rate-diversity trade-off for multiple antenna fading ISI channels. The key idea is to construct and analyze properties of binary matrices with a particular structure induced by ISI channels.
doi_str_mv 10.48550/arxiv.0707.4311
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0707_4311</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2080944634</sourcerecordid><originalsourceid>FETCH-LOGICAL-a514-aea7f452d4740a06cb2573b2fdb87b475afc16e3f4e6d8d51aeb0610a8ea17533</originalsourceid><addsrcrecordid>eNotj01Lw0AURQdBsNTuXcmA68Q33-NSYtVAQdDuw5vMC6a2SZ1pRf-9rXV1N4fLOYxdCSi1NwZuMX33XyU4cKVWQpyxiVRKFF5LecFmOa8AQFonjVETVsw3gWKkyF9x-OAPfd7h0BKvxkiZd2Pi9VvN23ccBlrnS3be4TrT7H-nbPk4X1bPxeLlqa7uFwUaoQskdJ02MmqnAcG2QRqnguxi8C5oZ7BrhSXVabLRRyOQAlgB6AmFM0pN2fXp9i-l2aZ-g-mnOSY1x6QDcHMCtmn83FPeNatxn4aDUiPBw53WVmn1C4MQTIM</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2080944634</pqid></control><display><type>article</type><title>Embedded Rank Distance Codes for ISI channels</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Dusad, S ; Diggavi, S N ; Calderbank, A R</creator><creatorcontrib>Dusad, S ; Diggavi, S N ; Calderbank, A R</creatorcontrib><description>Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto QAM and PSK constellations. In this paper we demonstrate that diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary we obtain an asymptotic characterization of the fixed transmit alphabet rate-diversity trade-off for multiple antenna fading ISI channels. The key idea is to construct and analyze properties of binary matrices with a particular structure induced by ISI channels.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0707.4311</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Asymptotic properties ; Channels ; Computer Science - Information Theory ; Constellations ; Design ; Fading ; Mapping ; Mathematics - Information Theory ; Spacetime</subject><ispartof>arXiv.org, 2007-07</ispartof><rights>Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the associated terms available at http://arxiv.org/abs/0707.4311.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27904</link.rule.ids><backlink>$$Uhttps://doi.org/10.1109/TIT.2008.929960$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.0707.4311$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Dusad, S</creatorcontrib><creatorcontrib>Diggavi, S N</creatorcontrib><creatorcontrib>Calderbank, A R</creatorcontrib><title>Embedded Rank Distance Codes for ISI channels</title><title>arXiv.org</title><description>Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto QAM and PSK constellations. In this paper we demonstrate that diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary we obtain an asymptotic characterization of the fixed transmit alphabet rate-diversity trade-off for multiple antenna fading ISI channels. The key idea is to construct and analyze properties of binary matrices with a particular structure induced by ISI channels.</description><subject>Asymptotic properties</subject><subject>Channels</subject><subject>Computer Science - Information Theory</subject><subject>Constellations</subject><subject>Design</subject><subject>Fading</subject><subject>Mapping</subject><subject>Mathematics - Information Theory</subject><subject>Spacetime</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj01Lw0AURQdBsNTuXcmA68Q33-NSYtVAQdDuw5vMC6a2SZ1pRf-9rXV1N4fLOYxdCSi1NwZuMX33XyU4cKVWQpyxiVRKFF5LecFmOa8AQFonjVETVsw3gWKkyF9x-OAPfd7h0BKvxkiZd2Pi9VvN23ccBlrnS3be4TrT7H-nbPk4X1bPxeLlqa7uFwUaoQskdJ02MmqnAcG2QRqnguxi8C5oZ7BrhSXVabLRRyOQAlgB6AmFM0pN2fXp9i-l2aZ-g-mnOSY1x6QDcHMCtmn83FPeNatxn4aDUiPBw53WVmn1C4MQTIM</recordid><startdate>20070729</startdate><enddate>20070729</enddate><creator>Dusad, S</creator><creator>Diggavi, S N</creator><creator>Calderbank, A R</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20070729</creationdate><title>Embedded Rank Distance Codes for ISI channels</title><author>Dusad, S ; Diggavi, S N ; Calderbank, A R</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a514-aea7f452d4740a06cb2573b2fdb87b475afc16e3f4e6d8d51aeb0610a8ea17533</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Asymptotic properties</topic><topic>Channels</topic><topic>Computer Science - Information Theory</topic><topic>Constellations</topic><topic>Design</topic><topic>Fading</topic><topic>Mapping</topic><topic>Mathematics - Information Theory</topic><topic>Spacetime</topic><toplevel>online_resources</toplevel><creatorcontrib>Dusad, S</creatorcontrib><creatorcontrib>Diggavi, S N</creatorcontrib><creatorcontrib>Calderbank, A R</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dusad, S</au><au>Diggavi, S N</au><au>Calderbank, A R</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Embedded Rank Distance Codes for ISI channels</atitle><jtitle>arXiv.org</jtitle><date>2007-07-29</date><risdate>2007</risdate><eissn>2331-8422</eissn><abstract>Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto QAM and PSK constellations. In this paper we demonstrate that diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary we obtain an asymptotic characterization of the fixed transmit alphabet rate-diversity trade-off for multiple antenna fading ISI channels. The key idea is to construct and analyze properties of binary matrices with a particular structure induced by ISI channels.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0707.4311</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2007-07
issn 2331-8422
language eng
recordid cdi_arxiv_primary_0707_4311
source arXiv.org; Free E- Journals
subjects Asymptotic properties
Channels
Computer Science - Information Theory
Constellations
Design
Fading
Mapping
Mathematics - Information Theory
Spacetime
title Embedded Rank Distance Codes for ISI channels
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T11%3A22%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Embedded%20Rank%20Distance%20Codes%20for%20ISI%20channels&rft.jtitle=arXiv.org&rft.au=Dusad,%20S&rft.date=2007-07-29&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0707.4311&rft_dat=%3Cproquest_arxiv%3E2080944634%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2080944634&rft_id=info:pmid/&rfr_iscdi=true