Please use this identifier to cite or link to this item: http://hdl.handle.net/2289/7553
Title: An MCS with Iterative Multi-dimensional Hamming Product Codes
Authors: Parvathi, C.
Balasubramanyam, R.
Keywords: Block turbo code (BTC)
Channel coding
Data storage systems
Digital video broadcasting
MIMO systems; OFDM
Satellite communication
space–time coding
Issue Date: Sep-2020
Publisher: Taylor & Francis for IETE
Citation: IETE Journal of Research, 2020, Vol.66, p711–719
Abstract: Product codes are preferred in high data rate wireless communication systems to achieve good error performance. The combination of Block Product Code (BPC), Multi-Input Multi-Output (MIMO) antenna systems with Space–Time Block Code (STBC), and Orthogonal Frequency Division Multiplexing (OFDM) yields better error recovery. In this paper, two novel iterative hard decision decoding methods for multi-dimensional Hamming BPC are presented. The first method uses a pattern based approach to enhance detection and correction of double errors in two dimensional Extended Hamming Code (2DEHC); the second method is a perturbation based decoder for three dimensional Normal Hamming Code (3DNHC). The base data rate used in this study is 100 Mbps. From the simulation results, which show both the methods to achieve significant coding gain, we derive a Modulation and Coding Scheme (MCS). The MCS shows that the 3D decoder readily satisfies the requirements for heterogeneous network systems as it spans a wide range in EbNo and Effective Bits per Symbol (EBS) with fine steps. Such an MCS is also relevant and suitable for digital video broadcasting and advanced satellite communication technologies.
Description: Restricted Access
URI: http://hdl.handle.net/2289/7553
ISSN: 0377-2063
0974-780X (Online)
Alternative Location: https://doi.org/10.1080/03772063.2018.1527257
Copyright: 2020 IETE
Appears in Collections:Research Papers (A&A)

Files in This Item:
File Description SizeFormat 
2020_IETE Journal of Research_Vol.66_p717.pdf
  Restricted Access
Restricted Access1.63 MBAdobe PDFView/Open Request a copy


Items in RRI Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.