Hybrid Arq Type I Based On Convolutional Code

2012 ◽  
Author(s):  
Hazilah Mad Kaidi ◽  
Muhammad Ibrahim

Hibrid Automatik Permintaan Ulangan (HARQ), sejenis kaedah mengawal kesilapan berdasarkan pada kod konvolutional di penghantaran paket merentasi saluran tanpa wayar telah dikemukakan. Analisis prestasi daya pemprosesan dan kadar–bit–silap (BER), merujuk kepada simulasi panjang kekangan yang berbeza (K=3 dan K=4) dan kadar kod (1/2 dan 1/3) di kod konvolutional pada HARQ jenis I telah dipersembahkan. Beberapa kebolehupaya kesilapan pembetulan disediakan pada setiap penghantaran semula paket dan maklumat yang boleh dibaiki semula dengan sendiri dari setiap penghantaran atau penghantaran semula jikalau kesilapan adalah berada di antara julat kebolehupaya pembetulan kesilapan. Simulasi HARQ adalah terhad kepada tiga penghantaran semula bagi setiap satu SNR dalam beberapa kali perulangan. Kata kunci: Istilah–Hibrid ARQ; ARQ; pengkodan konvolusional; kawalan kesilapan A Hybrid Automatic Repeat reQuest (HARQ), error control scheme based on a convolutional code for packet transmission over wireless channels was proposed. The analysis of the throughput and bit–error rate (BER) performance, according to the different constraint lengths (K=3 and K=4) and code rate (1/2 and 1/3) of convolutional codes on HARQ type I simulation scheme are presented. Certain error correction capability is provided in each (re)transmitted packet, and the information can be recovered from each transmission or retransmission alone if the errors are within the error correction capability. Simulation of HARQ is limited up to three retransmissions for each SNR in several iterations. Key words: Terms–Hybrid ARQ; ARQ; convolutional coding; error control

1980 ◽  
Vol 3 (4) ◽  
pp. 401-417
Author(s):  
Adrian Atanasiu

The paper deals with some C-grammars and tree-codification properties extending the result in [1]. We try to exhibit new aspects and important results, e.g. that any algebraic convolutional code is a particular case of a tree-code, as well as the finite forms of the code-sets. They can result in new methods of decodification and error correction in the case of convolutional coding.


Author(s):  
Mitsutaka Kimura ◽  
Mitsuhiro Imaizumi ◽  
Takahito Araki

Code error correction methods have been important techniques at a radio environment and video stream transmission. In general, when a server transmits some data packets to a client, the server resends the only loss packets. But in this method, a delay occurs in a transmission. In order to prevent the transmission delay, the loss packets are restored by the error correction packet on a client side. The code error correction method is called Hybrid Automatic Repeat reQuest (ARQ) and has been researched. On the other hand, congestion control schemes have been important techniques at a data communication. Some packet losses are generated by network congestion. In order to prevent some packet losses, the congestion control performs by prolonging packet transmission intervals, which is called High-performance and Flexible Protocol (HpFP). In this paper, we present a stochastic model of congestion control based on packet transmission interval with Hybrid ARQ for data transmission. That is, if the packet loss occurs, the data packet received in error is restored by the error correction packet. Moreover, if errors occur in data packets, the congestion control performs by prolonging packet transmission intervals. The mean time until packet transmissions succeed is derived analytically, and a window size which maximizes the quantity of packets per unit of time until the transmission succeeds is discussed.


Author(s):  
Hodjatollah Hamidi

The Algorithm-Based Fault Tolerance (ABFT) approach transforms a system that does not tolerate a specific type of faults, called the fault-intolerant system, to a system that provides a specific level of fault tolerance, namely recovery. The ABFT philosophy leads directly to a model from which error correction can be developed. By employing an ABFT scheme with effective convolutional code, the design allows high throughput as well as high fault coverage. The ABFT techniques that detect errors rely on the comparison of parity values computed in two ways. The parallel processing of input parity values produce output parity values comparable with parity values regenerated from the original processed outputs and can apply convolutional codes for the redundancy. This method is a new approach to concurrent error correction in fault-tolerant computing systems. This chapter proposes a novel computing paradigm to provide fault tolerance for numerical algorithms. The authors also present, implement, and evaluate early detection in ABFT.


1999 ◽  
Vol 7 (6) ◽  
pp. 917-925 ◽  
Author(s):  
M.A. Kousa ◽  
A.K. Elhakeem ◽  
H. Yang

2018 ◽  
Vol 7 (3.27) ◽  
pp. 129 ◽  
Author(s):  
Huda Saleem ◽  
Huda Albermany ◽  
Husein Hadi

The typical scheme used to generated cryptographic key is a fuzzy extractor. The fuzzy extractor is the extraction of a stable data from biometric data or noisy data based on the error correction code (ECC) method. Forward error correction includes two ways are blocked and convolutional coding used for error control coding. “Bose_Chaudhuri_Hocquenghem” (BCH) is one of the error correcting codes employ to correct errors in noise data. In this paper use fuzzy extractor scheme to find strong key based on BCH coding, face recognition data used SVD method and hash function. Hash_512 converted a string with variable length into a string of fixed length, it aims to protect information against the threat of repudiation.  


Sign in / Sign up

Export Citation Format

Share Document