• Title/Summary/Keyword: linear block codes

Search Result 31, Processing Time 0.037 seconds

A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

  • Liu, Qian;Zhang, Hao;Yu, Peidong;Wang, Gang;Qiu, Zhaoyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3458-3481
    • /
    • 2021
  • Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

New Design for Linear Complex Precoding over ABBA Quasi-Orthogonal Space-Time Block Codes

  • Ran, Rong;Yang, Jang-Hoon;An, Chan-Ho;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12C
    • /
    • pp.1062-1067
    • /
    • 2008
  • ABBA codes, a class of quasi-orthognal space-time block codes (QoSTBC) proposed by Tirkkonen and others, allow full rate and a fast maximum likelihood (ML) decoding, but do not have full diversity. In this paper, a linear complex precoder is proposed for ABBA codes to achieve full rate and full diversity. Moreover, the same diversity produce as that of orthogonal space-time block code with linear complex precoder (OSTBC-LCP) is achieved. Meanwhile, the size of the linear complex precoder can be reduced by half without affecting performance, which means the same complexity of decoding as that of the conventional ABBA code is guaranteed.

LLR Based Generalization of Soft Decision Iterative Decoding Algorithms for Block Turbo Codes (LLR 기반 블록 터보 부호의 연판정 복호 알고리즘 일반화)

  • Im, Hyun-Ho;Kwon, Kyung-Hoon;Heo, Jun
    • Journal of Broadcast Engineering
    • /
    • v.16 no.6
    • /
    • pp.1026-1035
    • /
    • 2011
  • This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

BER Performance Analysis of Linear Orthogonal Space-Time Block Codes with Quadrature Amplitude Modulation in Quasi Static Rayleigh Fading Channel (QAM 변조방식을 갖는 선형 직교 시공간 블록 부호의 준정지 레일리 페이딩 채널에서의 비트 오율 성능 분석)

  • Kim Sang-Hyo;Yang Jae-Dong;No Jong-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6C
    • /
    • pp.575-581
    • /
    • 2006
  • In this paper, we first define one-dimensional component symbol error function (ODSEF) from the exact expression of the pairwise error probability of orthogonal space-time block codes (OSTBC). Using the ODSEF and the general bit error probability (BEP) expression for quadrature amplitude modulation (QAM) introduced by Cho and Yoon, the exact closed form expressions for the BEP of linear OSTBCs with QAM in slow-varying Rayleigh fading channel are derived.

Exact Bit Error Probability of Orthogonal Space-Time Block Codes with Quadrature Amplitude Modulation

  • Kim, Sang-Hyo;Yang, Jae-Dong;No, Jong-Seon
    • Journal of Communications and Networks
    • /
    • v.10 no.3
    • /
    • pp.253-257
    • /
    • 2008
  • In this paper, the performance of generic orthogonal space-time block codes (OSTBCs) introduced by Alamouti [2], Tarokh [3], and Su and Xia [11] is analyzed. We first define one-dimensional component symbol error function (ODSEF) from the exact expression of the pairwise error probability of an OSTBC. Utilizing the ODSEF and the bit error probability (BEP) expression for quadrature amplitude modulation (QAM) introduced by Cho and Yoon [9], the exact closed-form expressions for the BEP of linear OSTBCs with QAM in quasi-static Rayleigh fading channel are derived. We also derive the exact closed-form of the BEP for some OSTBCs which have at least one message symbol transmitted with unequal power via all transmit antennas.

AN ALTERED GROUP RING CONSTRUCTION OF THE [24, 12, 8] AND [48, 24, 12] TYPE II LINEAR BLOCK CODE

  • Shefali Gupta;Dinesh Udar
    • Bulletin of the Korean Mathematical Society
    • /
    • v.60 no.3
    • /
    • pp.829-844
    • /
    • 2023
  • In this paper, we present a new construction for self-dual codes that uses the concept of double bordered construction, group rings, and reverse circulant matrices. Using groups of orders 2, 3, 4, and 5, and by applying the construction over the binary field and the ring F2 + uF2, we obtain extremal binary self-dual codes of various lengths: 12, 16, 20, 24, 32, 40, and 48. In particular, we show the significance of this new construction by constructing the unique Extended Binary Golay Code [24, 12, 8] and the unique Extended Quadratic Residue [48, 24, 12] Type II linear block code. Moreover, we strengthen the existing relationship between units and non-units with the self-dual codes presented in [10] by limiting the conditions given in the corollary. Additionally, we establish a relationship between idempotent and self-dual codes, which is done for the first time in the literature.

Minimum-Distance Decoding of Linear Block Codes with Soft-Decision (연판정에 의한 선형 블록 부호의 최소 거리 복호법)

  • 심용걸;이충웅
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.7
    • /
    • pp.12-18
    • /
    • 1993
  • We have proposed a soft-decision decoding method for block codes. With careful examinations of the first hard-decision decoded results, The candidate codewords are efficiently searched for. Thus, we can reduce the decoding complexity (the number of hard-decision decodings) and lower the block error probability. Computer simulation results are presented for the (23,12) Golay code. They show that the decoding complexity is considerably reduced and the block error probability is close to that of the maximum likelihood decoder.

  • PDF

A Soft-Decision Decoding Algorithm for Linear Binary Block Codes (線形 2元 블럭 符號를 위한 軟判定 復號 알고리듬)

  • Shim, Yong-Geol;Lee, Choong-Woong
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.2
    • /
    • pp.9-15
    • /
    • 1990
  • A soft-decision decoding algorithm for linear binary block codes is proposed, for minimizing the block error probability. To compare the proposed algorithm with already established decoding methods, computer simulations are performed for the (7,4)Hamming code and the (23,12) Golay code. The average number of hard-decision decoding is always less then 2, and approaches to 1 when the signal to noise ratio is sufficiently large. These results show that the proposed algorithm reduces the decoding complexity.

  • PDF

Linear Unequal Error Protection Codes based on Terminated Convolutional Codes

  • Bredtmann, Oliver;Czylwik, Andreas
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.12-20
    • /
    • 2015
  • Convolutional codes which are terminated by direct truncation (DT) and zero tail termination provide unequal error protection. When DT terminated convolutional codes are used to encode short messages, they have interesting error protection properties. Such codes match the significance of the output bits of common quantizers and therefore lead to a low mean square error (MSE) when they are used to encode quantizer outputs which are transmitted via a noisy digital communication system. A code construction method that allows adapting the code to the channel is introduced, which is based on time-varying convolutional codes. We can show by simulations that DT terminated convolutional codes lead to a lower MSE than standard block codes for all channel conditions. Furthermore, we develop an MSE approximation which is based on an upper bound on the error probability per information bit. By means of this MSE approximation, we compare the convolutional codes to linear unequal error protection code construction methods from the literature for code dimensions which are relevant in analog to digital conversion systems. In numerous situations, the DT terminated convolutional codes have the lowest MSE among all codes.

Space-Time Block Coding Techniques for MIMO 2×2 System using Walsh-Hadamard Codes

  • Djemamar, Younes;Ibnyaich, Saida;Zeroual, Abdelouhab
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.1
    • /
    • pp.1-7
    • /
    • 2022
  • Herein, a new space-time block coding technique is proposed for a MIMO 2 × 2 multiple-input multiple output (MIMO) system to minimize the bit error rate (BER) in Rayleigh fading channels with reduced decoding complexity using ZF and MMSE linear detection techniques. The main objective is to improve the service quality of wireless communication systems and optimize the number of antennas used in base stations and terminals. The idea is to exploit the correlation product technique between both information symbols to transmit per space-time block code and their own orthogonal Walsh-Hadamard sequences to ensure orthogonality between both symbol vectors and create a full-rate orthogonal STBC code. Using 16 quadrature amplitude modulation and the quasi-static Rayleigh channel model in the MATLAB environment, the simulation results show that the proposed space-time block code performs better than the Alamouti code in terms of BER performance in the 2 × 2 MIMO system for both cases of linear decoding ZF and MMSE.