Name
Abstract | ||
|---|---|---|
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... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/LCOMM.2017.2650227 | IEEE Communications Letters |
Keywords | Field | DocType |
Prediction algorithms,Generators,Parity check codes,Maximum likelihood decoding,Computational modeling,Fading channels | Multidimensional parity-check code,Generator matrix,Constant-weight code,Low-density parity-check code,Computer science,Systematic code,Polynomial code,Cyclic code,Algorithm,Space–time trellis code | Journal |
Volume | Issue | ISSN |
21 | 4 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ungku Azmi Iskandar Ungku Chulan | 1 | 0 | 0.34 |
| Mardina Abdullah | 2 | 0 | 2.37 |
| Nor Fadzilah Abdullah | 3 | 53 | 12.55 |