In this paper, a novel simplified statistical approach to evaluate the error performance bound of Ordered Statistics Decoding (OSD) of Linear Block Codes (LBC) is investigated. First, we propose a novel statistic which depicts the number of errors contained in the ordered received noisy codeword. Then, simplified expressions for the probability mass function and cumulative distribution function are derived exploiting the implicit statistical independence property of the samples of the received noisy codeword before reordering. Second, we incorporate the properties of this new statistic to derive the simplified error performance bound of the OSD algorithm for all order-I reprocessing. Finally, with the proposed approach, we obtain computationally simpler error performance bounds of the OSD than those proposed in literature for all length LBCs.

On the error performance bound of ordered statistics decoding of linear block codes / Dhakal, Pawan; Garello, Roberto; Shree Krishna, Sharma; Symeon, Chatzinotas; Bjorn, Ottersten. - STAMPA. - (2016), pp. 1-6. (Intervento presentato al convegno 2016 IEEE International Conference on Communications, ICC 2016 tenutosi a Kuala Lumpur Malaysia nel May 2016) [10.1109/ICC.2016.7510798].

On the error performance bound of ordered statistics decoding of linear block codes

DHAKAL, PAWAN;GARELLO, Roberto;
2016

Abstract

In this paper, a novel simplified statistical approach to evaluate the error performance bound of Ordered Statistics Decoding (OSD) of Linear Block Codes (LBC) is investigated. First, we propose a novel statistic which depicts the number of errors contained in the ordered received noisy codeword. Then, simplified expressions for the probability mass function and cumulative distribution function are derived exploiting the implicit statistical independence property of the samples of the received noisy codeword before reordering. Second, we incorporate the properties of this new statistic to derive the simplified error performance bound of the OSD algorithm for all order-I reprocessing. Finally, with the proposed approach, we obtain computationally simpler error performance bounds of the OSD than those proposed in literature for all length LBCs.
2016
978-1-4799-6664-6
File in questo prodotto:
File Dimensione Formato  
2016 ICC Bound OSDx.pdf

accesso aperto

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 1.09 MB
Formato Adobe PDF
1.09 MB Adobe PDF Visualizza/Apri
2016 ICC bound OSD.pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 355.4 kB
Formato Adobe PDF
355.4 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2651414