<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/52355071-9D29-4E70-84A3-A8006FA6991E"><efrbr-work:titleOfTheWork>Novel full-rate noncoherent Alamouti encoding that allows polynomialcomplexity
optimal decoding</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/52355071-9D29-4E70-84A3-A8006FA6991E"><efrbr-expression:titleOfTheExpression>Novel full-rate noncoherent Alamouti encoding that allows polynomialcomplexity
optimal decoding</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-10</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2013</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>We consider Alamouti encoding that draws symbols from M-ary phase-shift keying (M-PSK) and develop a new differential modulation scheme that attains full rate for any constellation order. In contrast to past work, the proposed scheme guarantees that the encoded matrix maintains the characteristics of the initial codebook and, at the same time, attains full rate so that all possible sequences of space-time matrices become valid. The latter property is exploited to develop a polynomial-complexity maximum-likelihood noncoherent sequence decoder whose order is solely determined by the number of receive antennas. We show that the proposed scheme is superior to contemporary alternatives in terms of encoding rate, decoding complexity, and performance.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by-nc-nd/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="page range">5075 - 5079</efrbr-expression:note><efrbr-expression:note type="conference name">Intern. Conf. Acoust., Speech and Signal Proc</efrbr-expression:note><efrbr-expression:note type="proceedings title"> Proc. IEEE  - Intern. Conf. Acoust., Speech and Signal Proc.</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~pamarkopoulos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Markopoulos Panagiotis
            Μαρκοπουλος Παναγιωτης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~gkarystinos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Karystinos Georgios
            Καρυστινος Γεωργιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.ieee.org/index.html"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Institute of Electrical and Electronics Engineers
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/52355071-9D29-4E70-84A3-A8006FA6991E" targetURI="http://purl.tuc.gr/dl/dias/52355071-9D29-4E70-84A3-A8006FA6991E"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/52355071-9D29-4E70-84A3-A8006FA6991E" targetURI="http://users.isc.tuc.gr/~pamarkopoulos"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/52355071-9D29-4E70-84A3-A8006FA6991E" targetURI="http://users.isc.tuc.gr/~pamarkopoulos"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/52355071-9D29-4E70-84A3-A8006FA6991E" targetURI="http://users.isc.tuc.gr/~gkarystinos"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/52355071-9D29-4E70-84A3-A8006FA6991E" targetURI="http://www.ieee.org/index.html"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>