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.
We consider polar coded BPSK receiver performance improvement based on the concepts of channel log-likelihood ratio (LLR) approximation and the maximum achievable transmission rate on fading channel. Based on symmetry condition of random variables, uniform scaling factors are applied to correct soft messages at the absence of channel state information (CSI) at the receiver side. The searching method...
We present the first approach to automated audio captioning. We employ an encoder-decoder scheme with an alignment model in between. The input to the encoder is a sequence of log mel-band energies calculated from an audio file, while the output is a sequence of words, i.e. a caption. The encoder is a multi-layered, bi-directional gated recurrent unit (GRU) and the decoder a multi-layered GRU with...
The bit mapping pattern has a crucial effect on the error performance of a bit-interleaved polar-coded modulation (BIPCM) system. In this paper, we have shown that a large proportion of the mapping patterns are producing the same error performances and are hence redundant as far as mapping optimization is concerned. An effective method is then proposed to eliminate the redundant mapping patterns and...
In this paper a log-MAP turbo decoding algorithm which incorporates reliability threshold based trellis branch elimination together with mean based early iteration termination has been proposed. The proposed algorithm reduces computational complexity by eliminating branches in trellis. Since the minimum Log Likelihood Ratio (LLR) obtained for each iteration varies with channel conditions, an early...
In this paper, the BER performance of a soft distance successive cancellation decoder for Polar codes is analyzed in the presence of impulsive noise, modelled using both the Middleton's Class A model and the symmetric alpha-stable model, for impulsive noise channels. This algorithm avoids estimation of the signal-to-noise ratio of the channel, and simplifies the initialization step of the classic...
The given paper presents a method for constructing a QC-LDPC code of shorter length by length adaption from a given QC-LDPC code of maximal length. The proposed method can be considered as a generalization of floor lifting. Making some offline calculation it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated from a single exponent matrix of QC-LDPC code which...
Automatic hand detection and accurate hand pose estimation from depth data in real system are challenging and vital tasks for human-computer interaction. In this paper, we introduce a Convolutional Neural Network (CNN) as Deep learning regression framework while employing an embedding denoising auto-encoder in the bottom layer of the network to learn latent representation of hand pose and account...
Laser phase noise remarkably degrades the bit-error-ratio (BER) characteristics of Trellis code modulation (TCM) signals based on high-order QAM constellation. In order to suppress phase noise, we propose to combine adaptive equalization with maximum likelihood estimation for TCM decoding. With our scheme, we experimentally evaluate the BER characteristics of dual-polarization 64QAM-based TCM optical...
This paper proposes a modified IMWBF decoding algorithm for low-density parity-check (LDPC) codes. In the proposed modification, the magnitude of the received signal is updated when the number of the unsatisfied parity-check equations participated by this received signal is larger than a predetermined threshold. Through this modification, the outlier, defined as the undesired large-magnitude received...
Soft-input soft-output (SISO) sphere decoding is applied to multiple-input multi-output (MIMO) systems to offer good bit error rate (BER) performance but at high complexity. To reduce this computational complexity, we propose a novel hybrid enumeration strategy for such decoding that dynamically determines the candidate list; moreover, this strategy uses a new node enumeration based on concentric...
Differential spatial modulation (DSM) is a novel attractive alternative technique for coherent spatial modulation (CSM) without channel state information (CSI) at the receiver. In this paper, iterative detection is firstly employed to improve the performance of DSM schemes. With the Hamming distance of two matrices reduced to the sum of simple elements, a lowcomplexity iterative detection scheme for...
In this paper, a code-aided maximum-likelihood and moment-based joint SNR estimator is proposed for M- ary amplitude phase shift keying (APSK) signals over AWGN channels. The proposed estimator significantly improves the performance at low SNRs by utilizing the syndrome in the LDPC codes to act as a reference measurement of estimation performance. Moreover, a methodology to measure the performance...
The multiple-input multiple-output (MIMO) technology can make full use of spectrum and increase the communication throughput. In the coded MIMO system, the main challenge of soft detection is to efficiently generate the loglikelihood ratios (LLR) values for channel decoder. The exact maximum a posteriori (MAP) probability detection can guarantee the optimal performance, but its realization is difficult...
Stringent mobile usage characteristics force wireless networks to undergo a paradigm shift from conventional connection-centric to content-centric deployment. With respect to 5G, caching and heterogenous networks (HetNet) are key technologies that will facilitate the evolution of highly content-centric networks by facilitating unified quality of service in terms of low-latency communication. In this...
In this paper we give the first blind signature protocol for code-based cryptography. Our approach is different from the classical original RSA based blind signature scheme, it is done in the spirit of the Fischlin approach [9] which is based on proofs of knowledge. To achieve our goal we consider a new tool for zero-knowledge (ZK) proofs, the Concatenated Stern ZK protocol, which permits to obtain...
We study the continuity of several channel parameters and operations under various topologies on the space of equivalent discrete memoryless channels (DMC). We show that mutual information, channel capacity, Bhattacharyya parameter, probability of error of a fixed code, and optimal probability of error for a given code rate and blocklength, are continuous under various DMC topologies. We also show...
A channel W is said to be input-degraded from another channel W′ if W can be simulated from W′ by randomization at the input. We provide a necessary and sufficient condition for a channel to be input-degraded from another one. We show that any decoder that is good for W′ is also good for W. We provide two characterizations for input-degradedness, one of which is similar to the Blackwell-Sherman-Stein...
List decoding of insertions and deletions in the Levenshtein metric is considered. In this paper, a Johnson-like upper bound on the maximum list size when decoding in the Levenshtein metric is derived. This bound depends only on the length and minimum Levenshtein distance of the code, the length of the received word, and the alphabet size. It shows that polynomial-time list decoding beyond half the...
We propose a new partial decoding algorithm for m-interleaved Reed-Solomon (IRS) codes that can decode, with high probability, a random error of relative weight 1 − Rm/m+1 at all code rates R, in time polynomial in the code length n. For m > 2, this is an asymptotic improvement over the previous state-of-the-art for all rates, and the first improvement for R > 1/3 in the last 20 years. The method...
A decoding algorithm is presented for rank-metric array codes that are based on diagonal interleaving of MDS codes. W.r.t. this metric, such array codes are known to be optimal when the underlying field is algebraically closed. It is also shown that for any list decoding radius that is smaller than the minimum rank distance, the list size can be bounded from above by an expression that is independent...
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.