Results 21 to 30 of about 1,926,748 (272)
IEEE Access, 2023 Joint Source-Channel Coding (JSCC) is a powerful technique that allows for the efficient transmission of information by simultaneously considering the characteristics of both the source and the channel.
Alexander Hamilton +2 more
doaj +1 more source
Channel Detection in Coded Communication [PDF]
IEEE Transactions on Information Theory, 2017 We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the prevailing channel. We begin with the simplified case where each of the sets is
Nir Weinberger, Neri Merhav
openaire +4 more sources
Polar coding for fading channels [PDF]
2013 IEEE Information Theory Workshop (ITW), 2013 A polar coding scheme for fading channels is proposed in this paper. More specifically, the focus is Gaussian fading channel with a BPSK modulation technique, where the equivalent channel could be modeled as a binary symmetric channel with varying cross-over probabilities.
Hongbo Si +2 more
openaire +3 more sources
IEEE Access, 2016 A novel joint source and channel coding (JSCC) scheme is proposed, which we refer to as the reordered Elias gamma error correction (REGEC) code. Like the recently proposed unary error correction (UEC) code and EGEC code, the proposed code facilitates the
Tao Wang +4 more
doaj +1 more source
Channel Coding and Source Coding With Increased Partial Side Information
Entropy, 2017 Let ( S 1 , i , S 2 , i ) ∼ i . i . d p ( s 1 , s 2 ) , i = 1 , 2 , ⋯ be a memoryless, correlated partial side information sequence. In this work, we study channel coding and source coding problems where the partial side
Avihay Sadeh-Shirazi +2 more
doaj +1 more source
Performance of polar codes for channel and source coding [PDF]
2009 IEEE International Symposium on Information Theory, 2009 Polar codes, introduced recently by Arıkan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation, are optimal in this respect, their finite-length performance is not record breaking.
Hussami, Nadine +2 more
openaire +2 more sources
Design of overcomplete expansions for channel coding [PDF]
, 2004 The redundancy afforded by overcomplete expansions have been recently been considered for channel coding. In this paper, we utilise this approach in order to propose a channel coder design to for a correlated additive Gaussian noise channel, of which the
Weiss, S.
core +3 more sources
Expansion Coding for Channel and Source Coding
CoRR, 2015 42 pages, 10 ...
Hongbo Si +3 more
openaire +3 more sources
Paraunitary oversampled filter bank design for channel coding [PDF]
, 2006 Oversampled filter banks (OSFBs) have been considered for channel coding, since their redundancy can be utilised to permit the detection and correction of channel errors.
McWhirter, J.G. +5 more
core +4 more sources
IEEE Access, 2016 The recently proposed unary error correction (UEC) and Elias gamma error correction (EGEC) codes facilitate the near-capacity joint source and channel coding (JSCC) of symbol values selected from large alphabets at a low complexity.
Matthew F. Brejza +6 more
doaj +1 more source