Toward the Prediction of Irreducible Error Floor in Space Time Trellis Code
Ungku Azmi Iskandar Ungku Chulan, Mardina Abdullah, Nor Fadzilah Abdullah · IEEE Communications Letters · 2017
This letter presents a prediction algorithm that foresees the possibility of irreducible error floor for a particular design of a generator matrix G in space time trellis code. This is done without the need of complex and time-consuming simulation, which removes the demand of considerable computational resource. To note, the prediction achieves approximately 93% accuracy and reduces roughly 99% of the temporal cost of simulation. It capitalizes on error prone substructure, a well-known concept from low density parity check code to enable the predictive mechanism. This can be useful in code design where problematic generator matrices can be omitted from consideration.