2000 character limit reached
On Punctured Pragmatic Space-Time Codes in Block Fading Channel (0704.0282v1)
Published 2 Apr 2007 in cs.IT, cs.CC, and math.IT
Abstract: This paper considers the use of punctured convolutional codes to obtain pragmatic space-time trellis codes over block-fading channel. We show that good performance can be achieved even when puncturation is adopted and that we can still employ the same Viterbi decoder of the convolutional mother code by using approximated metrics without increasing the complexity of the decoding operations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.