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 develop a joint channel estimation and decoding method for faster-than-Nyquist signaling (FTNS) transmitting over (quasi-static) time-varying frequency-selective fading channels based on the variational Bayesian (VB) framework. In contrast to existing methods, ours is capable of performing explicit frequency-domain channel estimation and decoding in a turbo mode without requiring...
For polar codes, cyclic redundancy check (CRC)-aided successive cancellation list (CA-SCL) decoder has attracted increasing attention from both academia and industry. In this paper, a hardware efficient and low-latency CA-SCL polar decoder based on distributed sorting is first proposed. For path metric (PM) sorting of each level, a distributed sorting (DS) algorithm is proposed to reduce the comparison...
Clustering streaming data has gained importance in recent years due to an expanding opportunity to discover knowledge in widely available data streams. As streams are potentially evolving and unbounded sequence of data objects, clustering algorithms capable of performing fast and incremental processing of data points are necessary. This paper presents a method of clustering high-dimensional data streams...
We propose a joint list decoder and language decoder that exploits the redundancy of language- based sources during polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after the decoding of every few bits. This path-pruning technique based on joint decoding has advantages over stand-alone...
Because of their excellent error correction performance, Low-Density Parity Check Codes (LDPC) have become the most widely used technique for forward error correction in almost all modern communications applications. This paper introduces an FPGA implementation of a partial parallel, flexible LDPC decoder based on the Min-Sum decoding algorithm. The suggested architecture uses a combination of unicast...
This paper proposes a novel method for recovering missing radio frequency identification (RFID) tag identifiers from a group, based on progressive edge-growth (PEG) methods. Extended grouping of RFID tags allows the recovery of missing tag identifiers without external systems such as databases. Motivated by the properties of Tanner graphs, or equivalently, parity check matrices constructed using PEG...
Spatially-coupled (SC) codes have recently attracted significant attention due to their capability to achieve capacity approaching performance. Significant recent research has been devoted to the asymptotic study of SC codes. Although the asymptotic analysis is relevant, it cannot be directly applied in the finite-length setting due to cycle-free and averaging assumptions. In this paper, we consider...
In this paper, we demonstrate the performance of low complexity soft interference cancellation minimum mean-squared error (SIC-MMSE) detection method for a turbo coded multiple-input multiple-output (MIMO) system with joint iterative detection and decoding (JIDD) principle. The main computational burden of SIC-MMSE detector lies in the multiple inverse operation of the filtering process and maximum...
Often, in a distributed system, a task must be performed in which all entities must be involved; however only some of them are active, while the others are inactive, unaware of the new computation that has to take place. In these situations, all entities must become active, a task known as Wake-Up. Another typical occurrence of this problem, known also as Reset, is when some entities, upon detecting...
Powerful forward error correction codes such as quasi-cyclic low density parity check (QC-LDPC) are required in next-generation coherent optical communication systems [1]. This work describes the design and experimental verification of a high net coding gain (NCG), low complexity QC-LDPC code. Towards this end, we develop a field programmable gate array (FPGA) based platform specially designed for...
Random linear network coding simplifies routing decisions, improves throughput, and increases tolerance against packet loss. A substantial limitation, however, is delay: decoding requires as many independent linear combinations as data blocks. Hierarchical network coding purportedly solves this delay problem. It introduces layers to decode prioritized data blocks early, which may benefit video streaming...
Cyclically-coupled quasi-cyclic LDPC (CC-QC-LDPC) block codes have been shown to achieve outstanding bit error performance with extremely low error floor. In this paper, we propose two new types of CC-QC-LDPC block codes which can achieve a larger girth. We present the error performance of the CC-QC-LDPC codes constructed by the new mechanism. We show that with similar codelengths, the new codes outperform...
Communication systems subjected to strong impulse noise are prone to performance degradation when the impulse occurrence is neglected in the decoding process: turbo decoders are likely to exhibit error propagation because the decision-making is dictated by excessive samples corrupted by impulses when the conventional decision metric, which is based on the assumption of additive white Gaussian noise,...
In this paper, we provide a simplified perturbation method for LDPC decoding using a binary noise generator with maximal length sequence (m-sequence). The proposed method provides the improved performance of the conventional perturbation-based decoding without performance degradation.
Wideband satellite communication channel can be considered as nonlinear memory channel, which can be described by Volterra model. To counter both nonlinear and memory effects, linear minimum mean square error (LMMSE) based turbo equalizer is proposed in this paper. Although LMMSE is a kind of affine transform, the nonlinear memory interference is cancelled by taking the coefficients of nonlinear memory...
In this paper, we propose a new improved algorithm to reduce the decoding complexity of NB-LDPC codes especially when the number of iteration is large. The proposed algorithm is based on the extended min-sum (EMS) which truncates the message vectors and trellis-based EMS (T-EMS) which employs the trellis representation. Our modification of EMS introduces the thresholds to further truncate the incoming...
This paper presents a simple method of designing a protograph-based LDPC codes which has excellent performance with a small number of decoding iterations. In addition to designing LDPC codes based on the iterative decoding threshold as before, we add one more dimension into the design process which is a predefined number of decoding iterations. Simulation results show that the proposed codes have...
The higher order constellation scheme, i.e., 128AP-SK, has been adopted in the latest generation satellite digital video broadcasting (DVB-S2X) standard. It significantly improves the spectral efficiency, but also introduces serious complexity problems in the implementation of the demapper. This paper presents an efficient soft demapper for 128APSK of DVB-S2X based on the concept of decision region...
A novel self-normalized weighted bit-flipping (SNWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known weighted bit-flipping decoding, the SNWBF algorithm converges significantly faster but with little performance penalty. For decoding of LDPC codes, the proposed SNWBF algorithm considers not only the reliability of the neighboring check nodes, but...
In this work, we propose a new framework called sequential reduction (SR) for reducing lattice bases, which harnesses the approximate closest vector problem (εCVP) oracles to sequentially reduce each basis vector. With the best εCVP oracle to serve as the theoretical upper limit of this scheme, our bound on basis lengths can be better than that of Minkowski's reduction under a mild assumption. A practical...
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.