STBCs from Representation of Extended Clifford Algebras

A set of sufficient conditions to construct \(\lambda\)-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) codes. In this paper, the maximal rate (as measured in c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2007-04
Hauptverfasser: Rajan, G. Susinder, Rajan, B. Sundar
Format: Artikel
Sprache:eng
Schlagworte:
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 Rajan, G. Susinder
Rajan, B. Sundar
description A set of sufficient conditions to construct \(\lambda\)-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) codes. In this paper, the maximal rate (as measured in complex symbols per channel use) of CUW codes for \(\lambda=2^a,a\in\mathbb{N}\) is obtained using tools from representation theory. Two algebraic constructions of codes achieving this maximal rate are also provided. One of the constructions is obtained using linear representation of finite groups whereas the other construction is based on the concept of right module algebra over non-commutative rings. To the knowledge of the authors, this is the first paper in which matrices over non-commutative rings is used to construct STBCs. An algebraic explanation is provided for the 'ABBA' construction first proposed by Tirkkonen et al and the tensor product construction proposed by Karmakar et al. Furthermore, it is established that the 4 transmit antenna STBC originally proposed by Tirkkonen et al based on the ABBA construction is actually a single complex symbol ML decodable code if the design variables are permuted and signal sets of appropriate dimensions are chosen.
doi_str_mv 10.48550/arxiv.0704.2507
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0704_2507</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2081282875</sourcerecordid><originalsourceid>FETCH-LOGICAL-a515-d97e6c67f2e7de6d0ba047c62d12184b576c157a7b365c7a1e645e4ad80b69723</originalsourceid><addsrcrecordid>eNotj0FLwzAYhoMgOObunqTguTX5muTLjrNMJwwE7b2kzRfp6NqadDL_vZvz9F4eXp6HsTvBM2mU4o82HNvvjCOXGSiOV2wGeS5SIwFu2CLGHeccNIJS-YzhR_lUxMSHYZ-80xgoUj_ZqR36ZPDJ-jhR78glRdd6PwSXrLpPqoONt-za2y7S4n_nrHxel8Um3b69vBarbWqVUKlbIulGowdCR9rx2nKJjQYnQBhZK9SNUGixzrVq0ArSUpG0zvBaLxHyObu_3P5FVWNo9zb8VOe46hx3Ah4uwBiGrwPFqdoNh9CflCrgRoABgyr_BXV0UEE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2081282875</pqid></control><display><type>article</type><title>STBCs from Representation of Extended Clifford Algebras</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Rajan, G. Susinder ; Rajan, B. Sundar</creator><creatorcontrib>Rajan, G. Susinder ; Rajan, B. Sundar</creatorcontrib><description>A set of sufficient conditions to construct \(\lambda\)-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) codes. In this paper, the maximal rate (as measured in complex symbols per channel use) of CUW codes for \(\lambda=2^a,a\in\mathbb{N}\) is obtained using tools from representation theory. Two algebraic constructions of codes achieving this maximal rate are also provided. One of the constructions is obtained using linear representation of finite groups whereas the other construction is based on the concept of right module algebra over non-commutative rings. To the knowledge of the authors, this is the first paper in which matrices over non-commutative rings is used to construct STBCs. An algebraic explanation is provided for the 'ABBA' construction first proposed by Tirkkonen et al and the tensor product construction proposed by Karmakar et al. Furthermore, it is established that the 4 transmit antenna STBC originally proposed by Tirkkonen et al based on the ABBA construction is actually a single complex symbol ML decodable code if the design variables are permuted and signal sets of appropriate dimensions are chosen.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0704.2507</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algebra ; Codes ; Computer Science - Discrete Mathematics ; Computer Science - Information Theory ; Mathematical analysis ; Mathematics - Information Theory ; Maximum likelihood decoding ; Representations ; Rings (mathematics) ; Tensors ; Weight</subject><ispartof>arXiv.org, 2007-04</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/0704.2507.</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,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.1109/ISIT.2007.4557141$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.0704.2507$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Rajan, G. Susinder</creatorcontrib><creatorcontrib>Rajan, B. Sundar</creatorcontrib><title>STBCs from Representation of Extended Clifford Algebras</title><title>arXiv.org</title><description>A set of sufficient conditions to construct \(\lambda\)-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) codes. In this paper, the maximal rate (as measured in complex symbols per channel use) of CUW codes for \(\lambda=2^a,a\in\mathbb{N}\) is obtained using tools from representation theory. Two algebraic constructions of codes achieving this maximal rate are also provided. One of the constructions is obtained using linear representation of finite groups whereas the other construction is based on the concept of right module algebra over non-commutative rings. To the knowledge of the authors, this is the first paper in which matrices over non-commutative rings is used to construct STBCs. An algebraic explanation is provided for the 'ABBA' construction first proposed by Tirkkonen et al and the tensor product construction proposed by Karmakar et al. Furthermore, it is established that the 4 transmit antenna STBC originally proposed by Tirkkonen et al based on the ABBA construction is actually a single complex symbol ML decodable code if the design variables are permuted and signal sets of appropriate dimensions are chosen.</description><subject>Algebra</subject><subject>Codes</subject><subject>Computer Science - Discrete Mathematics</subject><subject>Computer Science - Information Theory</subject><subject>Mathematical analysis</subject><subject>Mathematics - Information Theory</subject><subject>Maximum likelihood decoding</subject><subject>Representations</subject><subject>Rings (mathematics)</subject><subject>Tensors</subject><subject>Weight</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj0FLwzAYhoMgOObunqTguTX5muTLjrNMJwwE7b2kzRfp6NqadDL_vZvz9F4eXp6HsTvBM2mU4o82HNvvjCOXGSiOV2wGeS5SIwFu2CLGHeccNIJS-YzhR_lUxMSHYZ-80xgoUj_ZqR36ZPDJ-jhR78glRdd6PwSXrLpPqoONt-za2y7S4n_nrHxel8Um3b69vBarbWqVUKlbIulGowdCR9rx2nKJjQYnQBhZK9SNUGixzrVq0ArSUpG0zvBaLxHyObu_3P5FVWNo9zb8VOe46hx3Ah4uwBiGrwPFqdoNh9CflCrgRoABgyr_BXV0UEE</recordid><startdate>20070419</startdate><enddate>20070419</enddate><creator>Rajan, G. Susinder</creator><creator>Rajan, B. Sundar</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>20070419</creationdate><title>STBCs from Representation of Extended Clifford Algebras</title><author>Rajan, G. Susinder ; Rajan, B. Sundar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a515-d97e6c67f2e7de6d0ba047c62d12184b576c157a7b365c7a1e645e4ad80b69723</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algebra</topic><topic>Codes</topic><topic>Computer Science - Discrete Mathematics</topic><topic>Computer Science - Information Theory</topic><topic>Mathematical analysis</topic><topic>Mathematics - Information Theory</topic><topic>Maximum likelihood decoding</topic><topic>Representations</topic><topic>Rings (mathematics)</topic><topic>Tensors</topic><topic>Weight</topic><toplevel>online_resources</toplevel><creatorcontrib>Rajan, G. Susinder</creatorcontrib><creatorcontrib>Rajan, B. Sundar</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>Rajan, G. Susinder</au><au>Rajan, B. Sundar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>STBCs from Representation of Extended Clifford Algebras</atitle><jtitle>arXiv.org</jtitle><date>2007-04-19</date><risdate>2007</risdate><eissn>2331-8422</eissn><abstract>A set of sufficient conditions to construct \(\lambda\)-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) codes. In this paper, the maximal rate (as measured in complex symbols per channel use) of CUW codes for \(\lambda=2^a,a\in\mathbb{N}\) is obtained using tools from representation theory. Two algebraic constructions of codes achieving this maximal rate are also provided. One of the constructions is obtained using linear representation of finite groups whereas the other construction is based on the concept of right module algebra over non-commutative rings. To the knowledge of the authors, this is the first paper in which matrices over non-commutative rings is used to construct STBCs. An algebraic explanation is provided for the 'ABBA' construction first proposed by Tirkkonen et al and the tensor product construction proposed by Karmakar et al. Furthermore, it is established that the 4 transmit antenna STBC originally proposed by Tirkkonen et al based on the ABBA construction is actually a single complex symbol ML decodable code if the design variables are permuted and signal sets of appropriate dimensions are chosen.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0704.2507</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2007-04
issn 2331-8422
language eng
recordid cdi_arxiv_primary_0704_2507
source arXiv.org; Free E- Journals
subjects Algebra
Codes
Computer Science - Discrete Mathematics
Computer Science - Information Theory
Mathematical analysis
Mathematics - Information Theory
Maximum likelihood decoding
Representations
Rings (mathematics)
Tensors
Weight
title STBCs from Representation of Extended Clifford Algebras
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T06%3A53%3A40IST&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=STBCs%20from%20Representation%20of%20Extended%20Clifford%20Algebras&rft.jtitle=arXiv.org&rft.au=Rajan,%20G.%20Susinder&rft.date=2007-04-19&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0704.2507&rft_dat=%3Cproquest_arxiv%3E2081282875%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=2081282875&rft_id=info:pmid/&rfr_iscdi=true