Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,887 papers for “Sequential decoding”

The sequential decoding accuracy for passive vs. active decoder.

Min-Ho Lee (1567513), John Williamson (246543), Young-Jin Kee (8190312) et al. · Figshare · 2019

<p>The sequential decoding accuracy of all individual subjects for passive vs. pitch-imagery decoding (red line) and passive vs. counting decoding (blue line).</p>

Cited by 0Open access

Fast decoding and Easy Implementation: Transliteration as Sequential Labeling

Eiji Aramaki, Takeshi Abekawwa · 2010

Although most of previous translitera-tion methods are based on a generative model, this paper presents a discrimi-native transliteration model using condi-tional random fields. We regard charac-ter(s) as a kind of label, which enables us to consider a transliteration process as a sequential labeling process. This ap-proach has two advantages: (1) fast decod-ing and (2) easy implementation. Experi-mental results yielded competitive perfor-mance, demonstrating the feasibility of the proposed approach. 1

Cited by 0

Uncertainty-Aware Semantic Decoding for LLM-Based Sequential Recommendation

Chenke Yin, Fan Li, Jia Wang et al. · ArXiv.org · 2025

Large language models have been widely applied to sequential recommendation tasks, yet during inference, they continue to rely on decoding strategies developed for natural language processing. This creates a mismatch between text-generation objectives and recommendation next item selection objectives. This paper addresses this limitation by proposing an Uncertainty-aware Semantic Decoding (USD) framework that combines logit-based clustering with adaptive scoring to improve next-item predictions. Our approach clusters items with similar logit vectors into semantic equivalence groups, then redistributes probability mass within these clusters and computes entropy across them to control item scoring and sampling temperature during recommendation inference. Experiments on Amazon Product datasets (six domains) gains of 18.5\% in HR@3, 11.9\% in NDCG@3, and 10.8\% in MRR@3 compared to state-of-the-art baselines. Hyperparameter analysis confirms the optimal parameters among various settings, and experiments on H\&M, and Netflix datasets indicate that the framework can adapt to differing recommendation domains. The experimental results confirm that integrating semantic clustering and uncertainty assessment yields more reliable and accurate recommendations.

Cited by 0Open access

Sequential decoding of trellis codes at high spectral efficiencies

Fu-Quan Wang, Daniel J. Costello · IEEE Transactions on Information Theory · 1997

A probabilistic algorithm is used to construct large constraint length trellis codes at high spectral efficiencies for use with sequential decoding. Linear trellis codes for two- and four-dimensional constellations with constraint lengths up to 19 are obtained. These codes can achieve 180/spl deg/ rotational invariance. To achieve full 90/spl deg/ rotational invariance, nonlinear trellis codes for four-dimensional constellations with constraint lengths up to 19 are obtained. In both cases it is shown that the channel cutoff rate bound can be achieved using constraint lengths between 16 and 19 with sequential decoding at a bit-error rate of 10/sup -5/-10/sup -6/ and that 4.9-5.8 dB real coding gains can be achieved over uncoded systems with the same spectral efficiency.

Cited by 9

Nonsystematic convolutional codes for sequential decoding in space applications

James L. Massey, Daniel J. Costello · IEEE Transactions on Communication Technology · 1971

Previous space applications of sequential decoding have all employed convolutional codes of the systematic type where the information sequence itself is used as one of the encoded sequences. This paper describes a class of rate 1/2 nonsystematic convolutional codes with the following desirable properties: 1) an undetected decoding error probability verified by simulation to be much smaller than for the best systematic codes of the same constraint length; 2) computation behavior with sequential decoding verified by simulation to be virtually identical to that of the best systematic codes; 3) a "quick-look-in" feature that permits recovery of the information sequence from the hard-decisioned received data without decoding simply by modulo-two addition of the received sequences; and 4) suitability for encoding by simple circuitry requiring less hardware than encoders for the best systematic codes of the same constraint length. Theoretical analyses are given to show 1) that with these codes the information sequence is extracted as reliably as possible without decoding for nonsystematic codes and 2) that the constraints imposed to achieve the quicklook-in feature do not significantly limit the error-correcting ability of the codes in the sense that the Gilbert bound on minimum distance can still be attained under these constraints. These codes have been adopted for use in several forthcoming space missions.

Cited by 77

High Throughput Packet Radio using Sequential Decoding and Tailbiting

Pal Orten · 2002

Sequential decoding of long constraint length convolutional codes is proposed for hy- brid automatic repeat request packet data transmission on a Rayleigh fading channel. In this scheme computational complexity (the timeout condition) is applied for error detec- tion. In order to improve the throughput, a tailbiting scheme is proposed. Furthermore, a method for estimating the initial state of the encoder is proposed that is applicable to codes produced by systematic and Quick-look-in encoders. For systematic encoders the tailbiting scheme with initial state estimation yields a throughput very close to the code rate even for short packets. For a packet length equal to 200, and a code with constraint length 36 and rate 0.75, a performance improvement of more than 4 dB and 0.75 dB was demonstrated compared to a scheme with known tail and a reduced tail scenario, respectively. For longer constraint lengths (or shorter packets) the gain can be even larger. Although interleaving must be performed over one packet only, high throughput is maintained also for correlated fading. Finally, it is shown that the tailbiting scheme applied to systems using systematic encoders results in superior performance compared to that of quick-look-in encoders.

Cited by 0

Optimality of Sequential Decoding for the Bosonic Compound Channel

Florian Seitz, Janis Nötzel · 2024

Recent efforts in the design of communication systems have in addition to data rates embraced a focus on other metrics, such as round-trip latency. Data transmission over a channel is typically preceded by so-called pilot symbols, which let the receiver learn the channel conditions. Together with appropriate feedback, this allows for transmission at high data rates. Trading data rates for communication latency, a communication link may however avoid feedback and instead operate under channel uncertainty, in which case the accurate model is the compound channel. Further reductions of latency may be harnessed from quantum receiver design. In this work we focus in particular on the application of the sequential decoding approach to the bosonic compound channel with unknown phase rotations, loss parameters and thermal noise values. We show that sequential decoding is optimal.

Cited by 2

An upper bound on moments of sequential decoding effort

F. Jelinek · IEEE Transactions on Information Theory · 1969

In this paper we derive an infinite tree code ensemble upper bound on the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\nu</tex> th <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(\nu \leq 1)</tex> moments of the computational effort connected with sequential decoding governed by the Fano \footnote[1]{algorithm}. It is shown that the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\nu</tex> th moment of the effort per decoded branch is hounded by a constant, provided the transmission rate <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R_{0}</tex> satisfies inequality (2), This result, although often conjectured, has previously been shown to hold only for positive integral values of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\nu</tex> . For a wide class of discrete memoryless channels (that includes all symmetric channels), our bounds agree qualitatively with the lower bounds of Jacobs and Berlekamp [8].

Cited by 63

Decoding sequential vs non-sequential two-photon double ionization of helium using nuclear \nrecoil

Horner, Daniel A., Rescigno, Thomas N., McCurdy, C. William · eScholarship (California Digital Library) · 2008

Above 54.4 eV, two-photon double ionization of helium is dominated by a sequential absorption process, producing characteristic behavior in the single and triple differential cross sections. We show that the signature of this process is visible in the nuclear recoil cross section, integrated over all energy sharings of the ejected electrons, even below the threshold for the sequential process. Since nuclear recoil momentum imaging does not require coincident photoelectron measurement, the predicted images present a viable target for future experiments with new short-pulse VUV and soft X-ray sources.

Cited by 0Open access

A Markov chain analysis of the sequential decoding metric (Corresp.)

David Haccoun · IEEE Transactions on Information Theory · 1980

Using Massey's Markov chain model of the correct path metric, closed-form expressions are derived for the average separation between nonsearch nodes for the single path and the multiple path sequential decoder. An exact expression for the cumulative distribution of the correct path metric dips is also derived. All expressions are given in matrix form in terms of the correct path branch metric values and their probability assignments.

Cited by 3