An interactive concatenated turbo coding system

The block product turbo code (BPTC) is classified as one of block turbo code concatenation forms. The Hamming code can detect two-bit error and correct one-bit error. The BPTC uses two Hamming codes for "column" coding and "row" coding, it has improved the Hamming code correcting only one error. In addition, the BPTC carries out block interleaving coding for disorganizing the transmission sequence before transmission, so as to avoid burst errors when the signal meets multi-path channel in the channel. This paper will discuss the decoding mechanism of the BPTC and analyze the efficiency of using a soft decoding algorithm in the decoding process. The soft Hamming Decoder is based on error patterns which belong to the same syndrome. It is shown that it is sufficient to investigate error patterns with one and two errors to gain up to 1.2 dB compared to hard decision decoding. Here, we will consider also the error patterns with three errors which belong to the determined syndrome, which increases the gain and improves the quality of the soft-output due to the increased number of comparisons with valid code words, in despite that, it will increase the complexity of the decoding process. The system is based on two Hamming block channel code combinations, which can be similar or different, a block interleaving to construct a BPSK modulation and BPTC coding system in the concept of feedback encoding in turbo code over an AWGN channel. To observe its coding improvement, we present the simulation results for the soft decoding of the BPTC codes of a code word length from 49 bits (using two (7,4) codes) up to 1440 bits (using two (127,120) codes).

Download Full-text

A Proposed Chaotic-Switched Turbo Coding Design and Its Application for Half-Duplex Relay Channel

Discrete Dynamics in Nature and Society ◽

10.1155/2015/818421 ◽

2015 ◽

Vol 2015 ◽

pp. 1-11 ◽

Cited By ~ 2

Author(s):

Tamer H. M. Soliman ◽

Fengfan Yang ◽

S. Ejaz

Keyword(s):

Turbo Codes ◽

Chaotic Maps ◽

Turbo Coding ◽

Relay Channel ◽

Coding System ◽

Data Channel ◽

Relay Systems ◽

Coding Schemes ◽

Half Duplex ◽

Combat Problems

Both reliability and security are two important subjects in modern digital communications, each with a variety of subdisciplines. In this paper we introduce a new proposed secure turbo coding system which combines chaotic dynamics and turbo coding reliability together. As we utilize the chaotic maps as a tool for hiding and securing the coding design in turbo coding system, this proposed system model can provide both data secrecy and data reliability in one process to combat problems in an insecure and unreliable data channel link. To support our research, we provide different schemes to design a chaotic secure reliable turbo coding system which we call chaotic-switched turbo coding schemes. In these schemes the design of turbo codes chaotically changed depending on one or more chaotic maps. Extensions of these chaotic-switched turbo coding schemes to half-duplex relay systems are also described. Results of simulations of these new secure turbo coding schemes are compared to classical turbo codes with the same coding parameters and the proposed system is able to achieve secured reasonable bit error rate performance when it is made to switch between different puncturing and design configuration parameters especially with low switching rates.

Download Full-text

A Turbo Coding System for High Speed Communications

IEEE Transactions on Wireless Communications ◽

10.1109/twc.2007.060086 ◽

2007 ◽

Vol 6 (10) ◽

pp. 3700-3711 ◽

Cited By ~ 1

Author(s):

Yan-Xiu Zheng ◽

Yu Su

Keyword(s):

High Speed ◽

Turbo Coding ◽

Coding System

Download Full-text

Application of Information Introduced to Dynamic Message Processing and Enjoyment

Journal of Media Psychology Theories Methods and Applications ◽

10.1027/1864-1105/a000195 ◽

2018 ◽

Vol 30 (4) ◽

pp. 196-206 ◽

Cited By ~ 4

Author(s):

Byungho Park ◽

Rachel L. Bailey

Keyword(s):

Resource Allocation ◽

Recognition Memory ◽

Emotional Processing ◽

Orienting Response ◽

Structural Features ◽

Cognitive Resources ◽

Coding System ◽

Message Complexity ◽

Cognitive Resource ◽

Cognitive Overload

Abstract. In an effort to quantify message complexity in such a way that predictions regarding the moment-to-moment cognitive and emotional processing of viewers would be made, Lang and her colleagues devised the coding system information introduced (or ii). This coding system quantifies the number of structural features that are known to consume cognitive resources and considers it in combination with the number of camera changes (cc) in the video, which supply additional cognitive resources owing to their elicitation of an orienting response. This study further validates ii using psychophysiological responses that index cognitive resource allocation and recognition memory. We also pose two novel hypotheses regarding the confluence of controlled and automatic processing and the effect of cognitive overload on enjoyment of messages. Thirty television advertisements were selected from a pool of 172 (all 20 s in length) based on their ii/cc ratio and ratings for their arousing content. Heart rate change over time showed significant deceleration (indicative of increased cognitive resource allocation) for messages with greater ii/cc ratios. Further, recognition memory worsened as ii/cc increased. It was also found that message complexity increases both automatic and controlled allocations to processing, and that the most complex messages may have created a state of cognitive overload, which was received as enjoyable by the participants in this television context.

Download Full-text