In wireless communications, bit-interleaved coded modulation (BICM) with Gray labeling is commonly utilized for the transmission with higher-order modulation. In case of polar codes, BICM performance can be further improved if the coded bits are grouped according to their reliability levels and the interleaving is performed independently at each level. This improvement is achieved due to the faster polarization.In this paper, we propose an efficient divide-and-conquer method to construct polar codes for BICM with quadrature amplitude modulation (QAM). At the first step we decompose the polar design for QAM into several polar code designs for quadrature phase shift keying (QPSK). Next, given the number of information bits to be assigned, we recursively compute their allocations to the polarized subchannels until some predefined length is reached. This allows to utilize the reliability sequences optimized for additive white Gaussian noise (AWGN) channel with QPSK modulation such as 5G New Radio (NR) universal reliability sequence, and enables a low-complexity approach to construct polar codes for several modulation orders. Hence we can take an advantage of the existing designs while providing the performance boost by utilizing the QAM structure in the unified manner.

Lines are interesting geometrical features commonly seen in indoor and urban environments. There is missing a complete benchmark where one can evaluate lines from a sequential stream of images in all its stages: Line detection, Line Association and Pose error. To do so, we present a complete and exhaustive benchmark for visual lines in a SLAM front-end, both for RGB and RGBD, by providing a plethora of complementary metrics. We have also labeled data from well-known SLAM datasets in order to have all in one poses and accurately annotated lines. In particular, we have evaluated 17 line detection algorithms, 5 line associations methods and the resultant pose error for aligning a pair of frames with several combinations of detector-association. We have packaged all methods and evaluations metrics and made them publicly available on web-page33https://prime-slam.github.io/evolin/.

Polar coding solutions demonstrate excellent performance under the list decoding that is challenging to implement in hardware due to the path sorting operations. As a potential solution to this problem, permutation decoding recently became a hot research topic. However, it imposes more constraints on the code structure.In this paper, we study the structural properties of Arikan’s polar codes. It is known that they are invariant under lower-triangular affine permutations among others. However, those permutations are not useful in the context of permutation decoding. We show that, unfortunately, the group of affine automorphisms of Arikan’s polar codes asymptotically cannot be much bigger than the group of lower-triangular permutations.

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plotkin construction. The decoding algorithm can be applied with slight modifications to Reed-Muller or eBCH codes, that both achieve the capacity of erasure channels, although the list size needed for good performance grows too fast to make the decoding practical even for moderate block lengths. The key ingredient for proving the capacity-achieving property of Reed-Muller and eBCH codes is their group of symmetries. It can be plugged into the concept of Plotkin decomposition to design various permutation decoding algorithms. Although such techniques allow to outperform the straightforward polar-like decoding, the complexity stays impractical. In this paper, we show that although invariance under a large automorphism group is valuable in a theoretical sense, it also ensures that the list size needed for good performance grows exponentially. We further establish the bounds that arise if we sacrifice some of the symmetries. Although the theoretical analysis of the list decoding algorithm remains an open problem, our result provides an insight into the factors that impact the decoding complexity.

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, permutations of encoding factor graph as well as the properties of erasure channels.We show that with properly selected number of random permutations, this algorithm considerably outperforms straightforward list decoding while maintaining the same asymptotic complexity. This also means that near-MAP decoding can be achieved with lower complexity cost.

In this paper, we consider low-complexity decoding of second-order Reed-Muller codes. A class of polynomial-time algorithms, based on the projections onto first-order codes, is studied. An old representative of this class, originally developed for binary symmetric channel, is brought back to life and applied for AWGN channel. Some improvements are proposed, which bring the performance closer to ML bound with lower complexity compared to other algorithms. Another potentially fruitful property is returning the list of codewords. In addition, a simple method for complexity reduction and its impact on the performance are demonstrated.

Neurofeedback training is one type of the biofeedback training that allows the subject do self-regulation during the training according to his/her real-time brain activities recognized from Electroencephalogram (EEG) and given to him/her through visual, audio or haptic feedback. The Neurofeedback training has been proved to be helpful in improvement of cognitive abilities not only for patients with mental illnesses but also for healthy subjects including athletes. In this paper, we proposed an experiment in which we recruited elite shooters and conducted a novel individual beta-1/theta based neurofeedback training to confirm the usage of neurofeedback training in boosting the performance of rifle shooters. The efficiency of the neurofeedback training was examined by comparing the shooting scores and results of DAUF test assessing the ability of sustained attention of the shooters before and after neurofeedback training.