activity
20072026
most citedLow-Complexity Detection/Equalization in Large-Dimension MIMO-ISI Channels Using Graphical Models

130 citations · 340 across the 21 of their papers we have counts for

collaborators
Showing 2007Show all

5 papers · 1 filter

cs.IT2007★ 15 cited

Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks

G. Susinder Rajan, B. Sundar Rajan

The differential encoding/decoding setup introduced by Kiran et al, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is ext…

cs.IT2007★ 4 cited

Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs

G. Susinder Rajan, B. Sundar Rajan

The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of -group…

cs.IT2007★ 4 cited

STBCs from Representation of Extended Clifford Algebras

G. Susinder Rajan, B. Sundar Rajan

A set of sufficient conditions to construct -real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient…

cs.IT2007★ 19 cited

Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity

G. Susinder Rajan, B. Sundar Rajan

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classe…

cs.IT2007★ 11 cited

MMSE Optimal Algebraic Space-Time Codes

G. Susinder Rajan, B. Sundar Rajan

Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs be…