The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we consider a bit interleaved coded modulation (BIC M) scheme over a frequency selective channel. At the receiver, a turbo-detector composed of a maximum a posteriori (MAP) equalizer, and a MAP decoder is used. The channel is supposed to be unknown at the receiver and estimated using pilot symbols. The aim of the paper is to optimize the mapping between the coded bits and the transmitted...
This paper describes a review of turbo coding with channel estimation for Single-input and Single output system in ultra-wide band (SISO-UWB) channel. The common decoding algorithms used in turbo codes are Bahl, Cocke, Jelinek and Raviv (BCJR) algorithm, Viterbi algorithm, and Soft Output Viterbi Algorithm (SOVA). In the application of channel estimation with turbo codes the techniques used are maximum...
In this paper, we compare two different multiplexing strategies for a two-hop parallel relay channel. Precisely, we show the performance of distributed Interleave-Division-Multiplexing Space-Time Coding (dIDM-STC) and cooperative Orthogonal Frequency Division Multiplexing (cOFDM) operating in a decode-and-forward relay network, under the constraint of imperfect channel knowledge and timing and carrier...
A challenging problem related to the design of polar codes is “robustness against channel parameter variations”, as stated in Arıkan's original work. In this paper, we show that mismatched polar codes with a decoder implementation based on an approximation of the polarization transformations proposed in [3] are robust for the class of binary symmetric channels. We carry numerical simulations for the...
In this paper, the channel estimation problem at the relay node in TWRN is investigated. We propose a turbo receiver at the relay where it jointly combines a nonbinary decoder and an EM estimator. By passing soft value between the decoder and estimator in an iterative manner, our approach outperforms the method of separate decoding and estimation in terms of mean square error (MSE) and bit error rates...
The orthodoxy in the time-varying channel is that, the mutual information (MI) rate of the Uniform Symmetric Variable Noise Finite State Markov Channel (USVN-FSMC) is maximized by the channel input of maximum entropy, i.e., independent and identically distributed (i.i.d.) and uniform. The optimal signal detection is performed by a decision-feedback decoder (DFD). However this decoder is not reliable;...
Binary message-passing (BMP) decoders for root-low-density parity-check (LDPC) codes over block fading channels (BFC) are studied using density evolution (DE) and outage boundary analysis. A-priori channel estimation techniques suitable for root-LDPC code are proposed based on DE. The results show that BMP decoders can achieve full diversity performance if soft decisions from the channel are available.
This paper describes a simulation and measurement of digital television signal transmission according to the DVB-T2 standard in Single-Frequency Networks (SFN) over few models of the fading channels. Simulation was done using a software implementation of the DVB-T2 standard with parameters defined for the DVB-T2 test signal that is transmitted in Croatia. Different types of fading channels were used...
This paper studies the behaviour of a crypto-system in a situation where an encoder PX′R′|U′ is used to encrypt a source U which may be different from the source U′ considered to design the encoder. The original crypto-system is designed to achieve perfect secrecy under PU′. The resulting system also achieves perfect secrecy regardless of the source distribution. Finally the mismatch in the system...
In this work we probe the impact of channel estimation on the performance of quantum LDPC codes. Our channel estimation is based on an optimal estimate of the relevant decoherence parameter via its quantum Fisher information. Using state-of-the art quantum LDPC codes designed for the quantum depolarization channel, and utilizing various quantum probes with different entanglement properties, we show...
Performance of Maximum Likelihood Sequence Estimation (MLSE) in receivers highly depends on the reliability of the channel parameters estimation. Traditionally, the channel parameters are estimated based on the tentative decisions before the MLSE detector. Per-survivor Processing (PSP) technique, as compared to traditional Viterbi algorithm, was shown to improve the performance of MLSE in uncertain...
We present sufficient conditions for stabilizing a scalar discrete-time LTI plant in the mean squared sense when a sensor transmits the plant state information to a remotely placed controller across a Gaussian product channel. The Gaussian product channel models a continuous-time waveform Gaussian channel, where the encoder transmits information to the receiver across multiple noisy paths. It is known...
The problem of mean square stabilization of a discrete-time linear dynamical system over a Markov time-varying digital feedback channel is studied. In the scalar case, it is shown that the system can be stabilized if and only if a Markov jump linear system describing the evolution of the estimation error at the decoder is stable — videlicet if and only if the product of the unstable mode of the system...
In this paper, we propose a new transmission scheme for relay-based cooperative communication. The proposed partial decode and forward method renders better bit error rate performance at reduced complexity and lower power consumption at the receiver. Unlike conventional decode-forward and amplify-forward schemes, the relay generates soft-value estimates of the received symbols and retransmits the...
We propose new joint distributed Space-Time Block Code (STBC)-Distributed Turbo Product Code (DTPC) by generating the vertical parity on the relay and transmitting it to the destination using STBC on the source and relay. We tested our proposed system in a fast fading environment on the three channels connecting the three nodes in the cooperative network. Results show an overall gain that can reach...
In this paper, we propose a scheme for increasing the capacity of forward and/or return links of the Digital Video Broadcasting Return Channel via Satellite (DVB-RCS). The increase of the capacity is achieved by overloading a pre-existing channel with a controlled interfering channel using Raptor code such that the transmission and decoding of the interfering data stream does not have any effect on...
In this paper, channel training and coherent decodings with channel estimation errors are investigated in a relay network with one single-antenna transmitter, two single-antenna relays, and one double-antenna receiver. A two-stage training scheme is proposed to estimate both the relay-receiver and transmitter-relay channels at the receiver. We use distributed space-time coding (DSTC) for data transmission...
A novel signaling scheme for iterative channel estimation and data decoding is proposed. In the proposed scheme, the occurrence probability of transmitted symbols is biased. A priori information about the bias is utilized for the initial channel estimation. The proposed scheme is based on parallel concatenation of two biased convolutional codes (BCCs), which are constructed as systematic recursive...
We study iterative receivers for joint decoding and channel-state estimation for transmission on block-fading channels of root- LDPC-coded signals. Root-LDPC codes are known to be most performant codes for block-fading channels, as their spacial "root" structure allows to get the full-diversity property. This property ensures a good error decoding performance of root LDPC codes, especially...
Iterative receiver is poised to become the most prevalent receiver technology in near future. The paper explains the designing methodology of iterative receiver from graph theoretic approach. Modeling of well known turbo convolution code in factor graph framework with Sum-Product-Algorithm (SPA) has been discussed here. The model shows simpler representation of complex encoder trellis. Exchange of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.