Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper reports low bit-error-rate (BER) polar codes concatenated low density parity check (LDPC) codes for wireless communication systems. The LDPC code has been validated on the error correction capable to approaching the theoretical value. However, the BER performance of this code is still limited because of the effect of the error floor. Therefore, a concatenated coding scheme based on polar...
In this paper, we study the tradeoff of efficiency and delay of Slepian-Wolf distributed source coding (DSC). In the considered network, Machine-Type Communications (MTC) devices transmit correlated data to one base station, the data sources follow a multi-variate Gaussian distribution. To reduce the consumption of communication resources by massive MTC devices, Slepian-Wolf coding is adopted to eliminate...
In this paper, we propose an algebraic approach to design extremely low rate low-density parity-check (LDPC) codes by employing the primitive polynomials. We first investigate the requirements for the polynomials to construct 4-cycle free LDPC codes and then propose an algebraic approach to design the parity check matrix. To achieve a better decoding performance in the extremely low rate region, we...
The existing secure transmission methods based on fountain codes require a quite dominant quality of the main channel. In this paper, we propose a novel feedback-based method for fountain code to achieve stronger security. In the binary erasure channel model, the legitimate user shares the decoding situation with transmitter via feedback messages. The transmitter updates the coding process based on...
In this paper, we propose an advanced polar encoding scheme with successive cancellation list (SCL) decoder for visible light communication (VLC). As much high-profile channel coding methods, polar codes have achieved the symmetric capacity of binary-input discrete memoryless channels (B-DMCs) based on channel polarization. By taking advantages of simple recursive encoding structure and confirmed...
In this paper, we consider a Joint Channel Network Coding (JCNC) scheme applied to Multiple Access Relay Channel (MARC) for correlated sources. Then, two correlated sources send their messages to one destination and one relay which performs network coding and provides additional information to the receiver. At the destination, a joint iterative decoding algorithm is developed which takes into account...
In this paper we propose a robust representation of a digital signal based on error correction codes. For each frame of the signal (N successive samples) a binary decomposition, as a (successive power 2) weighted sum of binary vectors, is first considered. Then, each binary vector is projected into the set of codewords of a corresponding block code. The codes are designed so that their correction...
We propose a scheme of ultraviolet (UV) communication system, with polar channel coding method. The bit error rate (BER) performance of the UV polar code scheme is analyzed by simulations and offline experiments, in contrast with low-density parity-check (LDPC) scheme. Results suggest that the polar code scheme has a better BER performance than LDPC scheme in the UV communication system.
Although Orthogonal Frequency Division Multiplexing (OFDM) seems to be a solution to achieve the demand of high data rates and immunity to the multipath fading channel, it has some drawbacks. High Peak to average power ratio (PAPR) is the most significant problem of these drawbacks. The main objective of this paper is to introduce a modified PAPR reduction technique named as samples clipping and then...
Channel Coding for the 5G wireless networks is facing novel challenges to endorse innumerable emerging use cases and applications with miscellaneous performance aspects. With respect to existing state of art codes; 5G channel Codes have diverse requirements of code lengths and rates, as well as throughput, latency and decoding complexity. Therefore, Turbo codes and LDPC codes that played key enablers...
Hybrid digital-analog (HDA) architectures have been widely developed for efficient digital transmission of analog speech, audio or video data. By considering the advantage of both digital and analog components, HDA systems gain better performances than purely analog and digital schemes in a wide range of channel conditions. However, HDA systems described in previous works are mostly designed for continuous-valued...
We study the problem of strong coordination of actions of two agents X and Y that communicate over a noisy communication channel such that the actions follow a given joint probability distribution. We propose two novel schemes for this noisy strong coordination problem, and derive inner bounds for the underlying strong coordination capacity region. The first scheme is a joint coordination-channel...
The arbitrarily varying channel (AVC) models communication over a channel that varies in an arbitrary and unknown manner from channel use to channel use. This paper considers the AVC under list decoding and studies the corresponding list capacity. In particular, the list capacity function is shown to be discontinuous and the corresponding discontinuity points are characterized for all possible list...
This paper presents the first Network-Coded Multiple Access (NCMA) system with multiple users adopting different signal modulations, referred to as rate-diverse NCMA. A distinguishing feature of NCMA is the joint use of physical-layer network coding (PNC) and multiuser decoding (MUD) to boost throughput of multipacket reception systems. In previous NCMA systems, users adopt the same modulation regardless...
A new coding technique, based on fixed block-length codes, is proposed for the problem of communicating a pair of correlated sources over a 2-user interference channel. Its performance is analyzed to derive a new set of sufficient conditions. The latter is proven to be strictly less binding than the current known best, which is due to Liu and Chen [1]. Our findings are inspired by Dueck's example...
We consider the problem of lossless compression of individual sequences using finite-state (FS) machines, from the perspective of the best achievable empirical cumulant generating function (CGF) of the code length, i.e., the normalized logarithm of the empirical average of the exponentiated code length. Since the probabilistic CGF is minimized in terms of the Renyi entropy of the source, one of the...
The capacity region of the class of injective semi-deterministic two-way channels (TWCs) is investigated in this paper. To characterize this capacity, two conditions under which Shannon's bounds on the capacity region of TWCs are tight are first given. Using those conditions, it is shown that the capacity of this class of TWCs is characterized by the rectangle formed by the one-way capacities. This...
The problem of characterizing sufficient conditions for communicating correlated sources over a MAC is considered. The technique of inducing source correlation onto channel inputs [1] is enhanced by the use of fixed B-L coding [2]. The performance of the proposed coding technique is characterized via single-letter expressions to derive a new set of sufficient conditions. The latter conditions are...
A binary-input binary-output (BIBO) channel is investigated in the presence of feedback and input constraints. The feedback capacity and the optimal input distribution of this setting are presented for the case where the input sequence contains no consecutive ones. A simple coding scheme is designed based on the principle of posterior matching, which was introduced by Shayevitz and Feder for memoryless...
In this paper, we consider the first-order autoregressive moving average Gaussian channel with perfect causal feedback where an eavesdropper receives noisy observations of the channel inputs and outputs. We show that the secrecy capacity is equal to the feedback capacity without the presence of eavesdropper. Furthermore, we explicitly construct the secrecy capacity-achieving feedback code, which is...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.