arXiv subjects

Jacob King

Publications and source records attributed to Jacob King.

4 recordsLinked to original sources

arXiv2026

NIMROD-to-IMAS workflow for extended-magnetohydrodynamic data with reusable datasets and implications for IMAS schema development

Extended magnetohydrodynamic (MHD) simulations of tokamak plasmas regularly produce outputs in multi-dimensional, multiple-field formats; these code-specific formats make it difficult to do cross-code validation/coupling and analyze at a database scale. In this paper, a workflow that converts NIMROD code inputs and outputs to records compatible with version 4 of the ITER IMAS Data Dictionary is presented. The scope of the workflow includes preprocessing of NIMROD code inputs, conversion of hierarchical NIMROD code HDF5 dumps, COCOS-consistent treatment of the coordinate system and sign convention, and encoding finite-element poloidal meshes and toroidal Fourier components through IMAS General Grid Description. Furthermore, the workflow allows for provenance and integrity metadata to be included while providing optimal I/O operations for large array structures. An example conversion based on an NIMROD code simulation of edge harmonic oscillations performed for the DIII-D discharge 163518 [A.Y. Pankin, et al., Nuclear Fusion 60.9 (2020), p. 092004] is used to validate the conservation of essential equilibrium, profile, perturbation, and grid data in the resulting IMAS records. Finally, this implementation exposes gaps in the current IMAS framework that need to be addressed to accommodate extended MHD data, and it highlights the metadata, provenance, and governance needs of the downstream use cases in the form of dataset validation, integration, and machine learning.

physics.plasm-ph↗

arXiv2023

Design, Performance, and Complexity of CRC-Aided List Decoding of Convolutional and Polar Codes for Short Messages

Motivated by the need to communicate short control messages in 5G and beyond, this paper carefully designs codes for cyclic redundancy check (CRC)-aided list decoding of tail-biting convolutional codes (TBCCs) and polar codes. Both codes send a 32-bit message using an 11-bit CRC and 512 transmitted bits. We aim to provide a careful, fair comparison of the error performance and decoding complexity of polar and TBCC techniques for a specific case. Specifically, a TBCC is designed to match the rate of a (512, 43) polar code, and optimal 11-bit CRCs for both codes are designed. The paper examines the distance spectra of the polar and TBCC codes, illuminating the different distance structures for the two code types. We consider both adaptive and non-adaptive CRC-aided list decoding schemes. For polar codes, an adaptive decoder must start with a larger list size to avoid an error floor. For rate-32/512 codes with an 11-bit CRC, the optimized CRC-TBCC design achieves a lower total failure rate than the optimized CRC-polar design. Simulations showed that the optimized CRC-TBCC design achieved significantly higher throughput than the optimized CRC-polar design, so that the TBCC solution achieved a lower total failure rate while requiring less computational complexity.

cs.IT↗

arXiv2022

CRC-Aided Short Convolutional Codes and RCU Bounds for Orthogonal Signaling

We extend earlier work on the design of convolutional code-specific CRC codes to $Q$-ary alphabets, with an eye toward $Q$-ary orthogonal signaling. Starting with distance-spectrum optimal, zero-terminated, $Q$-ary convolutional codes, we design $Q$-ary CRC codes so that the CRC/convolutional concatenation is distance-spectrum optimal. The $Q$-ary code symbols are mapped to a $Q$-ary orthogonal signal set and sent over an AWGN channel with noncoherent reception. We focus on $Q = 4$, rate-1/2 convolutional codes in our designs. The random coding union bound and normal approximation are used in earlier works as benchmarks for performance for distance-spectrum optimal convolutional codes. We derive a saddlepoint approximation of the random coding union bound for the coded noncoherent signaling channel, as well as a normal approximation for this channel, and compare the performance of our codes to these limits. Our best design is within $0.6$ dB of the RCU bound at a frame error rate of $10^{-4}$.

cs.IT↗

arXiv2022

CRC-Aided List Decoding of Convolutional and Polar Codes for Short Messages in 5G

This paper explores list decoding of convolutional and polar codes for short messages such as those found in the 5G physical broadcast channel. A cyclic redundancy check (CRC) is used to select a codeword from a list of likely codewords. One example in the 5G standard encodes a 32-bit message with a 24-bit CRC and a 512-bit polar code with additional bits added by repetition to achieve a very low rate of 32/864. This paper shows that optimizing the CRC length improves the $E_b/N_0$ performance of this polar code, where $E_b/N_0$ is the ratio of the energy per data bit to the noise power spectral density. Furthermore, even better $E_b/N_0$ performance is achieved by replacing the polar code with a tail-biting convolutional code (TBCC) with a distance-spectrum-optimal (DSO) CRC. This paper identifies the optimal CRC length to minimize the frame error rate (FER) of a rate-1/5 TBCC at a specific value of $E_b/N_0$. We also show that this optimized TBCC/CRC can attain the same excellent $E_b/N_0$ performance with the very low rate of 32/864 of the 5G polar code, where the low rate is achieved through repetition. We show that the proposed TBCC/CRC concatenated code outperforms the PBCH polar code described in the 5G standard both in terms of FER and decoding run time. We also explore the tradeoff between undetected error rate and erasure rate as the CRC size varies.

cs.IT↗