Multigroup-Decodable STBCs from Clifford Algebras

A space-time block code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt = 2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a/(2(a-1)), which is, equivalently, a class of single-symbol decodable codes, (ii) A class of (2a-2)-group decodable with rate (a-1)/(2(a-2)), i.e., a class of double-symbol decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known quasi-orthogonal designs

• Publication year

  2006

• Venue

  2006 IEEE Information Theory Workshop - ITW '06 Chengdu

• Publication date

  2006-10-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ITW2.2006.323839arXiv cs/0610162
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Single-symbol maximum likelihood decodable linear STBCs

  2006cited by this paper
• Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras

  2006cited by this paper
• A Class of Four-Group Quasi-Orthogonal STBC Achieving Full Rate and Full Diversity for Any Number of Antennas

  2005cited by this paper
• On optimal quasi-orthogonal space-time block codes with minimum decoding complexity

  2005cited by this paper
• Signal constellations for quasi-orthogonal space-time block codes with full diversity

  2004cited by this paper
• Construction of quasi orthogonal STBC with minimum decoding complexity

  2004cited by this paper
• High-rate codes that are linear in space and time

  2002influential reference
• Square-matrix embeddable space-time block codes for complex signal constellations

  2002influential reference

• A Survey on MIMO Transmission With Finite Input Signals: Technical Challenges, Advances, and Future Trends

  2018cites this paper
• Constellation Collaborated Nonlinear Orthogonal Space–Time Block Codes With Fast Maximum-Likelihood Detection

  2017cites this paper
• Revisited Design Criteria For STBCs With Reduced Complexity ML Decoding

  2016cites this paper
• An Algorithm for Fast Multiplication of Pauli Numbers

  2015cites this paper
• An Algorithm for Fast Multiplication of

  2015cites this paper
• Distributed fast decodable space-frequency coding for CoMP OFDM cellular networks

  2014cites this paper
• Fast-Decodable MIDO Codes With Large Coding Gain

  2014cites this paper
• Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity

  2014cites this paper
• Asymptotically-Good, Multigroup Decodable Space-Time Block Codes

  2013cites this paper
• Low-Complexity Decoding and Construction of Space-Time Block Codes

  2013influential citation
• Minimizing the Complexity of Fast Sphere Decoding of STBCs

  2013cites this paper
• A new family of low-complexity decodable STBCs for four transmit antennas

  2012cites this paper
• Fast-decodable MIDO codes with large coding gain

  2012cites this paper
• A New Family of Low-Complexity STBCs for Four Transmit Antennas

  2012cites this paper
• DMT-optimal, low ML-complexity STBC-schemes for asymmetric MIMO systems

  2012cites this paper
• Full Diversity Non-Coherent Alamouti-Based Toeplitz Space-Time Block Codes

  2012cites this paper
• An Enhanced DMT-Optimality Criterion for STBC Schemes for Asymmetric MIMO Systems

  2012cites this paper
• A high coding gain and low decoding complexity STBC for four transmit antennas

  2012cites this paper
• Linear Receivers for Full-Diversity Training Space-Time Block Codes

  2012cites this paper
• Rate - Reliability - Complexity limits in ML and Lattice based decoding for MIMO, multiuser and cooperative communications. (Le compromis Débit-Fiabilité-Complexité dans les systèmes MMO multi-utilisateurs et coopératifs avec décodeurs ML et Lattice)

  2012cites this paper
• Construction of block orthogonal STBCs and reducing their sphere decoding complexity

  2012cites this paper
• Algebraic Approaches to Space-Time Code Construction for Multiple-Antenna Communication

  2012cites this paper
• A Novel Construction of Multi-Group Decodable Space-Time Block Codes

  2012cites this paper
• Energy-Efficient Collaborative Alamouti Codes

  2012cites this paper
• Generalized Distributive Law for ML decoding of STBCs: Further results

  2011cites this paper
• Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part I: Full-Diversity Criterion

  2011cites this paper
• Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction

  2011cites this paper
• A Novel Unequal-Error-Protected STBC Design for Multimedia Transmission

  2011cites this paper
• Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs

  2011cites this paper
• Low ML Decoding Complexity STBCs via Codes Over the Klein Group

  2011influential citation
• Training-Symbol Embedded, High-Rate, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

  2011cites this paper
• Generalized Silver Codes

  2011cites this paper
• Full Diversity Blind Space-Time Block Codes

  2011cites this paper
• Generalized distributive law for ML decoding of STBCs

  2011cites this paper
• Energy-Efficient Full Diversity Collaborative Unitary Space-Time Block Code Designs via Unique Factorization of Signals

  2011cites this paper
• A New Low-Complexity Decodable Rate-1 Full-Diversity 4 x 4 STBC with Nonvanishing Determinants

  2011cites this paper
• Generalized Distributive Law for ML Decoding of Space–Time Block Codes

  2011cites this paper
• Multigroup ML Decodable Collocated and Distributed Space-Time Block Codes

  2010cites this paper
• Asymptotically-Good, Multigroup ML-Decodable STBCs

  2010cites this paper
• Reduced ML-Decoding Complexity, Full-Rate STBCs for 2a Transmit Antenna Systems

  2010cites this paper
• A Low-PAPR High-Rate Full-Diversity 4x4 Space-Time Code with Fast Maximum-Likelihood Decoding

  2010cites this paper
• Low ML Decoding Complexity STBCs via Codes over GF(4)

  2010cites this paper
• Minimizing the complexity of fast sphere decoding of STBCs

  2010cites this paper
• Training-Embedded , Single-Symbol ML-Decodable , Distributed STBCs for Relay Networks

  2010cites this paper
• On space-time code design with a conditional PIC group decoding

  2010cites this paper
• A Quadratic Form Approach to ML Decoding Complexity of STBCs

  2010cites this paper
• A Novel Construction of 2-Group Decodable 4X4 Space-Time Block Codes

  2010cites this paper
• Fast-group-decodable STBCs via codes over GF(4)

  2010cites this paper
• Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs

  2010cites this paper
• Distributed Space-Time Block Codes for Two-Hop Wireless Relay Networks (Invited Paper)

  2010cites this paper
• A New Class of TAST Codes With A Simplified Tree Structure

  2010cites this paper
• Group-Decodable Space-Time Block Codes with Code Rate > 1

  2010cites this paper
• A new full-diversity criterion and low-complexity STBCs with Partial Interference Cancellation decoding

  2010cites this paper
• Reduced ML-decoding complexity, full-rate STBCs for 4 transmit antenna systems

  2010cites this paper
• On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity

  2009cites this paper
• Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

  2009cites this paper
• Space–Time Block Codes Achieving Full Diversity With Linear Receivers

  2009cites this paper
• High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

  2009cites this paper
• LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes

  2009cites this paper
• Unbalanced and Balanced 2-Group Decodable Spatial Multiplexing Code

  2009cites this paper
• Novel Rotated Quasi-Orthogonal Space-Time Block Codes With the Fixed Nearest Neighbor Number

  2009cites this paper
• A rate-3/2 full-diversity 4×4 space-time code with fast Maximum-Likelihood Decoding

  2009cites this paper
• A Design of Space-Time Block Codes Achieving Full Diversity with Partial Interference Cancellation Group Decoding

  2009cites this paper
• DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models

  2009cites this paper
• High-rate, 2-group ML-decodable STBCs for 2m transmit antennas

  2009cites this paper
• Space-Time Block Codes with Symbol-by-Symbol Maximum Likelihood Detections

  2009influential citation
• On full diversity space-time block codes with partial interference cancellation group decoding

  2009cites this paper
• S ep 2 00 9 Training-Embedded , Single-Symbol ML-Decodable , Distributed STBCs for Relay Networks

  2009cites this paper
• A Simple Design of Space-Time Block Codes Achieving Full Diversity with Linear Receivers

  2008cites this paper
• On full diversity linear dispersion codes with partial interference cancellation group decoding

  2008cites this paper
• Full-Diversity Codes for MISO Systems Equipped With Linear or ML Detectors

  2008cites this paper
• On Full Diversity Space–Time Block Codes With Partial Interference Cancellation Group Decoding

  2008cites this paper
• On the Rate Versus ML-Decoding Complexity Tradeoff of Square LDSTBCs with Unitary Weight Matrices

  2008cites this paper
• Diversity embedded space-time code from quasi-orthogonal designs

  2008influential citation
• STBCs from Representation of Extended Clifford Algebras

  2007cites this paper
• Four-Group Decodable Space–Time Block Codes

  2007cites this paper
• Multi-group ML Decodable Collocated and Distributed Space Time Block Codes

  2007cites this paper
• High-Rate, Multisymbol-Decodable STBCs From Clifford Algebras

  2007cites this paper
• Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs

  2007influential citation
• On optimal quasi-orthogonal space-time block codes with minimum decoding complexity

  2005cites this paper