ML Decoding Complexity Reduction in STBCs Using Time-Orthogonal Pulse Shaping

Details ML Decoding Complexity Reduction in STBCs Using Time-Orthogonal Pulse Shaping ML Decoding Complexity Reduction in STBCs Using Time-Orthogonal Pulse Shaping

2012-04-25

arxiv.org/abs/1204.5652v1

Computer Science

Information Theory

10 pages

Scientific paper

Motivated by the recent developments in the Space Shift Keying (SSK) and Spatial Modulation (SM) systems which employ Time-Orthogonal Pulse Shaping (TOPS) filters to achieve transmit diversity gains, we propose TOPS for Space-Time Block Codes (STBC). We show that any STBC whose set of weight matrices partitions into P subsets under the equivalence relation termed as Common Support Relation can be made P -group decodable by properly employing TOPS waveforms across space and time. Furthermore, by considering some of the well known STBCs in the literature we show that the order of their Maximum Likelihood decoding complexity can be greatly reduced by the application of TOPS.

Affiliated with

Also associated with

No associations

Rating

ML Decoding Complexity Reduction in STBCs Using Time-Orthogonal Pulse Shaping does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with ML Decoding Complexity Reduction in STBCs Using Time-Orthogonal Pulse Shaping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and ML Decoding Complexity Reduction in STBCs Using Time-Orthogonal Pulse Shaping will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138819