On the use of Reed-Solomon codes in Space-Time Coding

In this paper, we present an original use of Reed-Solomon (RS) codes as space-time block codes (STBCs) and compare them to orthogonal STBCs (OSTBCs). Due to their symbol structure, they can have a representation close to that of an STBC. RS codes are admittedly more complex to decode as they have no orthogonal properties. However, they offer much higher coding rates. In addition, a wide range of these codes can be easily generated. To decode them, we have developed a new algorithm using a sliding encoding-window (SEW), which is combined with the decoding-based Chase algorithm. We compare the RS(15,7) code to the Alamouti one, both having an equivalent coding rate. Its performance compared to Alamouti gets better as the receive diversity increases. Moreover, RS codes do not require the channel to remain constant over the code duration. In fact, they offer better results if the channel changes rapidly, which can be obtained virtually by introducing interleaving