Search

This study investigates the streaming instability triggered by ion motion in a plasma system that is finite in length, collisionless, and inhomogeneous. Employing numerical simulations using Particle-In-Cell (PIC) techniques and kinetic equations, the study examines how inhomogeneity emerges from integrating a cold ion beam with a background plasma within a confined system. The findings suggest that steady ion flow can modify ion sound waves through acoustic reflections from system boundaries, leading to instability. Such phenomena are known to be a hydrodynamic effect. However, there are also signatures of the beam-driven ion sound instability where kinetic resonances play a pivotal role. The main objective is to understand the impact of a finite-length system on beam-plasma instability and to identify the wave modes supported in such configurations., Comment: 21 pages, 11 figures

We construct a global Lindblad master equation for a Kitaev quantum wire of finite length, weakly coupled to an arbitrary number of thermal baths, within the Born-Markov and secular approximations. We find that the coupling of an external bath to more than one lattice site generates quantum interference effects, arising from the possibility of fermions to tunnel through multiple paths. In the presence of two baths at different temperatures and/or chemical potentials, the steady-state particle current can be expressed through the Landauer-B\"uttiker formula, as in a ballistic transport setup, with the addition of an anomaly factor associated with the presence of the $p$-wave pairing in the Kitaev Hamiltonian. Such a factor is affected by the ground-state properties of the chain, being related to the finite-size equivalent of its Pfaffian topological invariant., Comment: 14 pages, 9 figures. Final version

While analyzing the persistence length of DNA atomistic simulations Wu et al. [J. Chem. Phys. 142, 125103 (2015)] introduced an empirical formula to account for the observed length-dependence. In particular they found that the persistence length increases with the distance. Here, we derive the formula by Wu et al. using a non-local twistable wormlike chain which introduces couplings between distal sites. Finally, we show that the same formula can account for the length-scale dependence of the torsional persistence length and is, in fact, applicable to any kind of polymer model with non-local couplings., Comment: 3 pages, 1 Figure

We consider the usage of finite-length polar codes for the Gaussian multiple access channel (GMAC) with a finite number of users. Based on the interleave-division multipleaccess (IDMA) concept, we implement an iterative detection and decoding non-orthogonal multiple access (NOMA) receiver that benefits from a low complexity, while scaling (almost) linearly with the amount of active users. We further show the conceptual simplicity of the belief propagation (BP)-based decoder in a step-by-step illustration of its construction. Beyond its conceptual simplicity, this approach benefits from an improved performance when compared to some recent work tackling the same problem, namely the setup of finite-length forward errorcorrection (FEC) codes for finite-number of users. We consider the 5th generation mobile communication (5G) polar code with a block length $N = 512$ applied to both a two-user and a four-user GMAC scenario with a sum-rate of $R_{sum} = 0.5$ and $R_{sum} = 1$, respectively. Simulation results show that a BP-based soft interference cancellation (SoIC) receiver outperforms a joint successive cancellation (JSC) scheme. Finally, we investigate the effect of a concatenated repetition code which suggests that alternative polar code design rules are required in multi-user scenarios., Comment: Asilomar2020

We analyze the magnetic mode structure of axially-magnetized, finite-length, nanoscopic cylinders in a regime where the exchange interaction dominates, along with simulations of the mode frequencies of the ferrimagnet yttrium iron garnet. For the bulk modes we find that the frequencies can be represented by an expression given by Herring and Kittel by using wavevector components obtained by fitting the mode patterns emerging from these simulations. In addition to the axial, radial, and azimuthal modes that are present in an infinite cylinder, we find localized "cap modes" that are "trapped" at the top and bottom cylinder faces by the inhomogeneous dipole field emerging from the ends. Semi-quantitative explanations are given for some of the modes in terms of a one-dimensional Schrodinger equation which is valid in the exchange dominant case. The assignment of the azimuthal mode number is carefully discussed and the frequency splitting of a few pairs of nearly degenerate modes is determined through the beat pattern emerging from them.

In this paper we will analyze the propagation of the angular spectrum of the electromagnetic field through a finite length uniaxial crystal. We solve the boundary conditions of the fields at an interface of an isotropic medium and an uniaxial anisotropic medium with the optical axis in an arbitrary direction and soon after we choose the optical axis in a plane formed by the direction of propagation (z-axis) and the x-axis . We show how the couplings occur between the components of the field and in what situations we can give a vector or scalar treatment for the propagation, Comment: 8 pages, 9 figures

I discuss the strong link between the transmission line (TL) equation and the TL circuit model for the charging of an electrolyte-filled pore of finite length. In particular, I show how Robin and Neumann boundary conditions to the TL equation, proposed by others on physical grounds, also emerge in the TL circuit subject to a stepwise potential. The pore relaxes with a timescale $\tau$, an expression for which consistently follows from the TL circuit, TL equation, and from the pore's known impedance. An approximation to $\tau$ explains the numerically determined relaxation time of the stack-electrode model of Lian et al. [Phys. Rev. Lett. 124, 076001 (2020), arXiv:1911.09924]., Comment: 5 pages, 3 figures

A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) error. In this context, the exponential rate of convergence of the optimal miss error probability -- as the sample size tends to infinity -- given some (positive) restrictions on the false alarm probabilities is a fundamental question to address in theory. Considering the more realistic context of a BHT with a finite number of observations, this paper presents a new non-asymptotic result for the scenario with monotonic (sub-exponential decreasing) restriction on the Type I error probability, which extends the result presented by Strassen in 2009. Building on the use of concentration inequalities, we offer new upper and lower bounds to the optimal Type II error probability for the case of finite observations. Finally, the derived bounds are evaluated and interpreted numerically (as a function of the number samples) for some vanishing Type I error restrictions.

Let F be a non-Archimedean locally compact field of residue characteristic p, let G be an inner form of GL(n,F) with n>0, and let l be a prime number different from p. We describe the block decomposition of the category of finite length smooth representations of G with coefficients in an algebraically closed field of characteristic l. Unlike the case of complex representations of an arbitrary p-adic reductive group and that of l-modular representations of GL(n,F), several non-isomorphic supercuspidal supports may correspond to the same block. We describe the (finitely many) supercuspidal supports corresponding to a given block. We also prove that a supercuspidal block is equivalent to the principal (that is, the one which contains the trivial character) block of the multiplicative group of a suitable division algebra, and we determine those irreducible representations having a nontrivial extension with a given supercuspidal representation of G., Comment: in French language. Annales de l'Institut Fourier, Association des Annales de l'Institut Fourier, A para{\^i}tre

Constrained codes are used to eliminate error-prone patterns in various practical systems. Recently, we introduced efficient binary symmetric lexicographically-ordered constrained (LOCO) codes and asymmetric LOCO (A-LOCO) codes to increase density in magnetic recording systems and lifetime in Flash systems by eliminating the relevant detrimental patterns. Due to their application, LOCO and A-LOCO codes are associated with level-based signaling. Studying the power spectrum of a random signal with certain properties is principal for any storage or transmission system. In this paper, we first modify a framework from the literature in order to introduce a method to derive the power spectrum of a sequence of constrained data associated with level-based signaling. We apply our method to infinitely long sequences satisfying symmetric and asymmetric constraints. Next, we show how to generalize the method such that it works for a stream of finite-length codewords. We use the generalized method to devise closed forms for the spectra of finite-length LOCO and A-LOCO codes from their transition diagrams. Our LOCO and A-LOCO spectral derivations can be performed for any code length and can be extended to other constrained codes. We plot these power spectra, and discuss various important spectral properties for both LOCO and A-LOCO codes., Comment: 30 pages (single column), 12 figures, submitted to the IEEE Transactions on Communications (TCOM)

We consider sparse superposition codes (SPARCs) over complex AWGN channels. Such codes can be efficiently decoded by an approximate message passing (AMP) decoder, whose performance can be predicted via so-called state evolution in the large-system limit. In this paper, we mainly focus on how to use concatenation of SPARCs and cyclic redundancy check (CRC) codes on the encoding side and use list decoding on the decoding side to improve the finite-length performance of the AMP decoder for SPARCs over complex AWGN channels. Simulation results show that such a concatenated coding scheme works much better than SPARCs with the original AMP decoder and results in a steep waterfall-like behavior in the bit-error rate performance curves. Furthermore, we apply our proposed concatenated coding scheme to spatially coupled SPARCs. Besides that, we also introduce a novel class of design matrices, i.e., matrices that describe the encoding process, based on circulant matrices derived from Frank or from Milewski sequences. This class of design matrices has comparable encoding and decoding computational complexity as well as very close performance with the commonly-used class of design matrices based on discrete Fourier transform (DFT) matrices, but gives us more degrees of freedom when designing SPARCs for various applications., Comment: 12 pages, 8 figures, revised

The interplay of shaped signaling and fiber nonlinearities is reviewed in the asymptotic and finite-length regime. We present explanations and discuss implications of an optimum shaping length of just a few hundred symbols.

SC-LDPC codes with sub-block locality can be decoded locally at the level of sub-blocks that are much smaller than the full code block, thus providing fast access to the coded information. The same code can also be decoded globally using the entire code block, for increased data reliability. In this paper, we pursue the analysis and design of such codes from both finite-length and asymptotic lenses. This mixed approach has rarely been applied in designing SC codes, but it is beneficial for optimizing code graphs for local and global performance simultaneously. Our proposed framework consists of two steps: 1) designing the local code for both threshold and cycle counts, and 2) designing the coupling of local codes for best cycle count in the global design., Comment: 6 pages, accepted to appear in IEEE ISIT 2020 proceeding

Living systems produce copies of information-carrying molecules such as DNA by assembling monomer units into finite-length oligomer (short polymer) copies. We explore the role of initiation and termination of the copy process in the thermodynamics of copying. By splitting the free-energy change of copy formation into informational and chemical terms, we show that copy accuracy plays no direct role in the overall thermodynamics. Instead, it is thermodynamically costly to produce outputs that are more similar to the oligomers in the environment than sequences obtained by randomly sampling monomers. Copy accuracy can be thermodynamically neutral, or even favoured, depending on the surroundings. Oligomer copying mechanisms can thus function as information engines that interconvert chemical and information-based free energy. Hard thermodynamic constraints on accuracy derived for infinite-length polymers instead manifest as kinetic barriers experienced while the copy is template-attached. These barriers are easily surmounted by shorter oligomers.

We analyze the finite-length performance of spatially coupled low-density parity-check (SC-LDPC) codes under window decoding over the binary erasure channel. In particular, we propose a refinement of the scaling law by Olmos and Urbanke for the frame error rate (FER) of terminated SC-LDPC ensembles under full belief propagation (BP) decoding. The refined scaling law models the decoding process as two independent Ornstein-Uhlenbeck processes, in correspondence to the two decoding waves that propagate toward the center of the coupled chain for terminated SC-LDPC codes. We then extend the proposed scaling law to predict the performance of (terminated) SC-LDPC code ensembles under the more practical sliding window decoding. Finally, we extend this framework to predict the bit error rate (BER) and block error rate (BLER) of SC-LDPC code ensembles. The proposed scaling law yields very accurate predictions of the FER, BLER, and BER for both full BP and window decoding., Comment: Published in IEEE Transactions on Communications (Early Access). This paper was presented in part at the IEEE Information Theory Workshop (ITW), Visby, Sweden, August 2019 (arXiv:1904.10410)

Transfer entropy in information theory was recently demonstrated [Phys. Rev. E 102, 012404 (2020)] to enable us to elucidate the interaction domain among interacting elements solely from an ensemble of trajectories. There, only pairs of elements whose distances are shorter than some distance variable, termed cutoff distance, are taken into account in the computation of transfer entropies. The prediction performance in capturing the underlying interaction domain is subject to noise level exerted on the elements and the sufficiency of statistics of the interaction events. In this paper, the dependence of the prediction performance is scrutinized systematically on noise level and the length of trajectories by using a modified Vicsek model. The larger the noise level and the shorter the time length of trajectories, the more the derivative of average transfer entropy fluctuates, which makes it difficult to identify the interaction domain in terms of the position of global minimum of the derivative of average transfer entropy. A measure to quantify the degree of strong convexity at coarse-grained level is proposed. It is shown that the convexity score scheme can identify the interaction distance fairly well even while the position of global minimum of the derivative of average transfer entropy does not. We also derive an analytical model to explain the relationship between the interaction domain and the change of transfer entropy that supports our cutoff distance technique to elucidate the underlying interaction domain from trajectories.

Interfacial ice on graphene has attracted much attention because it is a model system to study two-dimensional (2D) ice structures on chemically inert substrates. While water-graphene interaction was usually assumed to be negligible, the structures of the 2D ice are believed to be not appreciably perturbed by the graphene substrate. Here we report atomic-resolved characterizations of an exotic 2D ice structure on graphene built from water molecular chains with finite lengths. Our experiments demonstrated that the water molecular chains are exactly orientated along zigzag directions of the graphene substrate, which evidences an anomalously strong interlayer interaction between the 2D ice and the graphene substrate. Moreover, the length of the water molecular chains closely links to the number of graphene layers, indicating layer-number-dependent water-graphene interfacial interactions. Our work highlights the important role of the 2D ice structures on the water-graphene interfacial interactions., Comment: 4 figures in main text

The theoretical analysis of topological insulators (TIs) has been traditionally focused on infinite homogeneous crystals with band gap in the bulk and nontrivial topology of their wavefunctions, or infinite wires whose boundaries host surface or edge metallic states. However, experimental devices contain finite-size topological region attached to normal metal (NM) leads, which poses a question about how precise is quantization of longitudinal conductance and how electrons transition from topologically trivial NM leads into the edge states. This is particularly pressing issues for recently conjectured two-dimensional (2D) Floquet TI where electrons flow from time-independent NM leads into time-dependent edge states---the very recent experimental realization of Floquet TI using graphene irradiated by circularly polarized light did not exhibit either quantized longitudinal or Hall conductance. Here we employ charge conserving solution for Floquet-nonequlibrium Green functions (NEGFs) of irradiated graphene nanoribbon to compute longitudinal two-terminal conductance, as well as spatial profiles of local current density as electrons propagate from NM leads into the Floquet TI. In the case of Floquet TI both bulk and edge local current densities contribute equally to total current, which leads to longitudinal conductance below the expected quantized plateau that is slightly reduced by edge vacancies. We propose two experimental schemes to detect coexistence of bulk and edge current densities within Floquet TI: (i) drilling a nanopore in the interior of irradiated region of graphene will induce backscattering of bulk current density, thereby reducing longitudinal conductance by $\sim 28$%; (ii) imaging of magnetic field produced by local current density using diamond NV centers., Comment: 13 pages, 6 figures

A binary code of blocklength $n$ and codebook size $M$ is called an $(n,M)$ code, which is studied for memoryless binary symmetric channels (BSCs) with the maximum likelihood (ML) decoding. For any $n \geq 2$, some optimal codes among the linear $(n,4)$ codes have been explicitly characterized in the previous study, but whether the optimal codes among the linear codes are better than all the nonlinear codes or not is unknown. In this paper, we first show that for any $n\geq 2$, there exists an optimal code (among all the $(n,4)$ codes) that is either linear or in a subset of nonlinear codes, called Class-I codes. We identified all the optimal codes among the linear $(n,4)$ codes for each blocklength $n\geq 2$, and found ones that were not given in literature. For any $n$ from $2$ to $300$, all the optimal $(n,4)$ codes are identified, where except for $n=3$, all the optimal $(n,4)$ codes are equivalent to linear codes. There exist optimal $(3,4)$ codes that are not equivalent to linear codes. Furthermore, we derive a subset of nonlinear codes called Class-II codes and justify that for any $n >300$, the set composed of linear, Class-I and Class-II codes and their equivalent codes contains all the optimal $(n,4)$ codes. Both Class-I and Class-II codes are close to linear codes in the sense that they involve only one type of columns that are not included in linear codes. Our results are obtained using a new technique to compare the ML decoding performance of two codes, featured by a partition of the entire range of the channel output., Comment: This is the full version of our papers at ISITA 2020 and ISIT 2023

In order to realize probabilistically shaped signaling within the probabilistic amplitude shaping (PAS) framework, a shaping device outputs sequences that follow a certain nonuniform distribution. In case of constant-composition (CC) distribution matching (CCDM), the sequences differ only in the ordering of their constituent symbols, whereas the number of occurrences of each symbol is constant in every output block. Recent results by Amari \textit{et al.} have shown that the CCDM block length can have a considerable impact on the effective signal-to-noise ratio (SNR) after fiber transmission. So far, no explanation for this behavior has been presented. Furthermore, the block-length dependence of the SNR seems not to be fully aligned with previous results in the literature. This paper is devoted to a detailed analysis of the nonlinear fiber interactions for CC sequences. We confirm in fiber simulations the inverse proportionality of SNR with CCDM block length and present two explanations. The first one, which only holds in the short-length regime, is based on how two-dimensional symbols are generated from shaped amplitudes in the PAS framework. The second, more general explanation relates to an induced shuffling within a sequence, or equivalently a limited concentration of identical symbols, that is an inherent property for short CC blocks, yet not necessarily present for long blocks. This temporal property results in weaker nonlinear interactions, and thus higher SNR, for short CC sequences. For a typical multi-span fiber setup, the SNR difference is numerically demonstrated to be up to 0.7dB. Finally, we evaluate a heuristic figure of merit that captures the number of runs of identical symbols in a concatenation of several CC sequences. For moderate block lengths up to approximately 100 symbols, this metric suggests that limiting the number of identical-symbol runs can be beneficial., Comment: The work was supported in part by the German Ministry of Education and Research in the projects SpeeD (contract #13N1374) and PEARLS (contract #13N14937)

Smith-Purcell radiation is generated by a charged particle beam passing close to the surface of a diffraction grating which has a strong dependency of the emitted radiation intensity on the form of the grating profile. For relativistic electron beam, it is important to take into account the number of grating periods in practical SPR setups. In this paper, the theoretical investigations of Smith-Purcell radiation from a three-dimensional bunch of relativistic electrons that moves at constant speed parallel to an electrically perfectly conducting grating with finite rectangular grooves are carried out by using the modal matching method. This model may offer a new efficient tool for terahertz production by SPR interaction and for nondestructive bunch-length measurements by SPR.