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.
The Cross-Entropy-based (CE-based) stopping criteria advantage is able to terminate early in the high signal-to-noise ratio (SNR) while maintain the bit error rate (BER) performance. Unfortunately, the criteria fails to cope with low SNR region and make the decoder iterates until maximum or infinite iteration. This paper proposed an early termination technique at low SNR for the CE-based stopping...
Over the past decade, the research of decoding visual stimuli from brain signal recorded during a person viewing the image is developing fast as a challenging and up to date work in the neural decoding field. Previous studies have demonstrated that it's possible to identify the one of a set of natural images from human brain activity. In neural decoding studies, the computational model played a key...
In this paper we show how the complexity of Linear Programming (LP) decoder can decrease. We use the degree 3 check equation to model all variation check degrees. The complexity of LP decoding is directed relative to the number of constraint. Number of constraint for original LP decoder is O(n2n). Our method decrease the number of the constraint to O(n).
In this research a novel discriminative reordering model for statistical machine translation is proposed. Source dependency tree is used to define the orientation classes of the reordering model. We use maximum entropy principle to train the model. In addition to the common features used in the discriminative reordering models, two new and effective features are introduced. They are phrase number...
In this paper, we employ distributed jointed source-channel (DJSC) coding based on quasi-cyclic low-density parity-check (QC-LDPC) codes in our wireless sensor network (WSN) for seismic exploration. In order to reduce the latency of jointed decoding, we propose a parallel structure of jointed decoding, and decoders of multiple sources can decode simultaneously. We make use of the soft information...
We present the first demonstration of single-trial neural decoding of vowel acoustic features during speech production with high performance. The ability to predict trial-by-trial fluctuations in speech production was facilitated by using high-density, large-area electrocorticography (ECoG) combined with an adaptive principal components regression. In experiments from two human neurosurgical patients...
RS decoder is widely applied in data communication and data storage systems about error control. Aiming at the error codes of UAT mode ADS-B signal produced during transmission, this paper designs an RS decoder which can correct the error codes. The decoder improves the conventional RS decoder and adopts the improved BM iterative algorithm which avoids the emergence of a finite field inverse operation...
A low-density parity-check (LDPC) code of column weight of 2 is known as an LDPC cycle code. In this paper, we study the encoding algorithm about a type of non-binary quasi-cyclic LDPC cycle codes. The position of parity check symbols is located firstly through parity check equations. Then, we show that these parity check symbols can be calculated linearly through the corresponding Tanner graph. It...
In mobile communication systems such as LTE, Hybrid-ARQ (HARQ) schemes based on Turbo codes have proved to be very effective in ensuring reliable transmission. However, several modified HARQ and Turbo decoding strategies have been recently developed to further improve performance. This paper proposes an enhanced coding scheme for LTE which couples a modified Turbo coding strategy with Reliability...
Brain-Machine Interfaces (BMI) have strong potential to benefit a large number of disabled people but current decoding algorithms suffer from the following shortcomings. First, BMI decoding algorithms are often trained offline, but this paradigm ignores the discrepancy between the Manual Control (MC) and the Brain Control (BC) modes of operation. Second, the standard neural decoder, the Kalman filter,...
Vector Symbolic Architectures (VSA) are methods designed to enable distributed representation and manipulation of semantically-structured information, such as natural languages. Recently, a new VSA based on multiplication of distributed vectors by random matrices was proposed, this is known as Matrix-Binding-of-Additive-Terms (MBAT). We propose an enhancement that introduces an important additional...
Control mechanism is usually much more complex for open quantum systems than closed systems. In this article, the Hamiltonian encoding-observable decoding method for open quantum systems is formulated, starting from the Lindblad equation. The dipole-field-induced and dissipationinduced quantum pathways in Liouville space are analyzed with this method for a single-qubit open system. Different signatures...
RaptorQ is the most advanced fountain code proposed so far. Its properties make it attractive for forward error correction (FEC), offering high reliability at low overheads (i.e., for a small amount of repair information) and efficient encoding and decoding operations. Since RaptorQ's emergence, it has already been standardized by the IETF, and there is the expectation that it will be adopted by several...
This paper presents an efficient approach to verifying higher-degree Galois-Field(GF) arithmetic circuits. The proposed method describes GF arithmetic circuits by graph-based representation, and verifies them by a combination of algebraic method with a new verification method based on natural deduction for the first-order predicate logic with equal sign. The natural deduction method can verify kind...
This paper presents a mathematical model for slotted Aloha-based multihop wireless ad hoc network with ZigZag decoding. We aim by using ZigZag decoding to exploit collision that occurs due to simultaneous transmissions or hidden nodes, in order to decode involved packets by through an iterative piece-by-piece algorithm. Now, the channel state (which we confound with the transmission issue) either...
The performance of Polar codes has been proved to achieve the Shannon capacity when N, the block length, tends to infinity. However, finite block length performance of Polar codes is rather poor compared to other capacity approaching codes such as LDPC (Low-Density Parity-Check) codes. In this paper, we propose a concatenated scheme with a polar code as an inner code and a Reed-Solomon code as an...
Bose, Ray-Chaudhuri, Hocquenghem (BCH) codes are one of the efficient error-correcting codes used to correct errors occurred during the transmission of the data in the unreliable communication mediums. This paper presents a low-complexity and area efficient error-correcting BCH decoder architecture for detecting and correction of two errors. The advanced Peterson error locator computation algorithm,...
In this paper, we propose a simplified belief propagation(SBP) decoder for the polar codes, where the update calculation for the messages of the so-called frozen nodes is replaced by setting these nodes' messages by prior probabilities during the BP procedure. Numerical results show that the derived SBP yields almost the same performance as the BP decoders in the literature, while the computational...
This paper investigates the behavior of the noisy Min-Sum decoder over binary symmetric channels. A noisy decoder is a decoder running on a noisy device, which may introduce errors during the decoding process. We show that in some particular cases, the noise introduce by the device can help the Min-Sum decoder to escape from fixed points attractors, and may actually result in an increased correction...
Large-scale distributed storage systems are prone to node failures. To provide fault tolerance, data is often encoded to maintain data redundancy over multiple storage nodes. If a node fails, it can be repaired by downloading data from surviving nodes and regenerating the lost data in a new node. Network coding has recently been proposed (e.g., see [2]) to generate data redundancy. It is shown that...
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.