Sciweavers

33 search results - page 3 / 7
» Single-Symbol Maximum Likelihood Decodable Linear STBCs
Sort
View
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 5 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar
TIT
2011
148views more  TIT 2011»
13 years 23 days ago
On Two-User Gaussian Multiple Access Channels With Finite Input Constellations
—Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Mu...
Jagadeesh Harshan, Bikash Sundar Rajan
TCOM
2010
142views more  TCOM 2010»
13 years 16 days ago
Performance Bounds and Distance Spectra of Variable Length Codes in Turbo/Concatenated Systems
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
Xavier Jaspar, Luc Vandendorpe
GLOBECOM
2007
IEEE
14 years 4 days ago
Geometric Decoding Of PAM and QAM Lattices
— A geometric decoding technique for finite lattices was presented by Seethaler et al. for flat-fading multiple-input multiple-output channels in the case of linear modulations...
Michael Samuel, Michael P. Fitz
CORR
2008
Springer
105views Education» more  CORR 2008»
13 years 5 months ago
On Full Diversity Space-Time Block Codes with Partial Interference Cancellation Group Decoding
In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for th...
Xiaoyong Guo, Xiang-Gen Xia