Searcharxiv⌕ Search

arXiv subjects

Frank R. Kschischang

Publications and source records attributed to Frank R. Kschischang.

At least 55 records · Page 3Linked to original sources

Energy, Latency, and Reliability Tradeoffs in Coding Circuits

It is shown that fully-parallel encoding and decoding schemes with asymptotic block error probability that scales as $O\left(f\left(n\right)\right)$ have Thompson energy that scales as $Ω\left(\sqrt{\ln f\left(n\right)}n\right)$. As well, it is shown that the number of clock cycles (denoted $T\left(n\right)$) required for any encoding or decoding scheme that reaches this bound must scale as $T\left(n\right)\ge\sqrt{\ln f\left(n\right)}$. Similar scaling results are extended to serialized computation. The Grover information-friction energy model is generalized to three dimensions and the optimal energy of encoding or decoding schemes with probability of block error $P_\mathrm{e}$ is shown to be at least $Ω\left(n\left(\ln P_{\mathrm{e}}\left(n\right)\right)^{\frac{1}{3}}\right)$.

cs.IT↗

On Scaling Rules for Energy of VLSI Polar Encoders and Decoders

It is shown that all polar encoding schemes of rate $R>\frac{1}{2}$ of block length $N$ implemented according to the Thompson VLSI model must take energy $E\geΩ\left(N^{3/2}\right)$. This lower bound is achievable up to polylogarithmic factors using a mesh network topology defined by Thompson and the encoding algorithm defined by Arikan. A general class of circuits that compute successive cancellation decoding adapted from Arikan's butterfly network algorithm is defined. It is shown that such decoders implemented on a rectangle grid for codes of rate $R>2/3$ must take energy $E\geΩ(N^{3/2})$, and this can also be reached up to polylogarithmic factors using a mesh network. Capacity approaching sequences of energy optimal polar encoders and decoders, as a function of reciprocal gap to capacity $χ= (1-R/C)^{-1}$, have energy that scales as $Ω\left(χ^{5.325}\right)\le E \le O\left(χ^{7.05}\log^{4}\left(χ\right)\right)$.

cs.IT↗

Upper Bound on the Capacity of a Cascade of Nonlinear and Noisy Channels

An upper bound on the capacity of a cascade of nonlinear and noisy channels is presented. The cascade mimics the split-step Fourier method for computing waveform propagation governed by the stochastic generalized nonlinear Schroedinger equation. It is shown that the spectral efficiency of the cascade is at most log(1+SNR), where SNR is the receiver signal-to-noise ratio. The results may be applied to optical fiber channels. However, the definition of bandwidth is subtle and leaves open interpretations of the bound. Some of these interpretations are discussed.

cs.IT↗

Upper Bound on the Capacity of the Nonlinear Schrödinger Channel

It is shown that the capacity of the channel modeled by (a discretized version of) the stochastic nonlinear Schrödinger (NLS) equation is upper-bounded by $\log(1+\text{SNR})$ with $\text{SNR}=\mathcal P_0/σ^2(z)$, where $\mathcal P_0$ is the average input signal power and $σ^2(z)$ is the total noise power up to distance $z$. The result is a consequence of the fact that the deterministic NLS equation is a Hamiltonian energy-preserving dynamical system.

cs.IT↗

On the Energy Complexity of LDPC Decoder Circuits

It is shown that in a sequence of randomly generated bipartite configurations with number of left nodes approaching infinity, the probability that a particular configuration in the sequence has a minimum bisection width proportional to the number of vertices in the configuration approaches $1$ so long as a sufficient condition on the node degree distribution is satisfied. This graph theory result implies an almost sure $Ω\left(n^{2}\right)$ scaling rule for the energy of capacity-approaching LDPC decoder circuits that directly instantiate their Tanner Graphs and are generated according to a uniform configuration model, where $n$ is the block length of the code. For a sequence of circuits that have a full set of check nodes but do not necessarily directly instantiate a Tanner graph, this implies an $Ω\left(n^{1.5}\right)$ scaling rule. In another theorem, it is shown that all (as opposed to almost all) capacity-approaching LDPC decoding circuits that directly implement their Tanner graphs must have energy that scales as $Ω\left(n\left(\log n\right)^{2}\right)$. These results further imply scaling rules for the energy of LDPC decoder circuits as a function of gap to capacity.

cs.IT↗

Energy Consumption of VLSI Decoders

Thompson's model of VLSI computation relates the energy of a computation to the product of the circuit area and the number of clock cycles needed to carry out the computation. It is shown that for any family of circuits implemented according to this model, using any algorithm that performs decoding of a codeword passed through a binary erasure channel, as the block length approaches infinity either (a) the probability of block error is asymptotically lower bounded by 1/2 or (b) the energy of the computation scales at least as Omega(n(log n)^(1/2)), and so the energy of successful decoding, per decoded bit, must scale at least as Omega((log n)^(1/2)). This implies that the average energy per decoded bit must approach infinity for any sequence of codes that approaches capacity. The analysis techniques used are then extended to the case of serial computation, showing that if a circuit is restricted to serial computation, then as block length approaches infinity, either the block error probability is lower bounded by 1/2 or the energy scales at least as fast as Omega(n log(n)). In a very general case that allows for the number of output pins to vary with block length, it is shown that the average energy per decoded bit must scale as Omega(n(log n)^(1/5)). A simple example is provided of a class of circuits performing low-density parity-check decoding whose energy complexity scales as O(n^2 log log n).

cs.IT↗

On the Per-Sample Capacity of Nondispersive Optical Fibers

The capacity of the channel defined by the stochastic nonlinear Schrödinger equation, which includes the effects of the Kerr nonlinearity and amplified spontaneous emission noise, is considered in the case of zero dispersion. In the absence of dispersion, this channel behaves as a collection of parallel per-sample channels. The conditional probability density function of the nonlinear per-sample channels is derived using both a sum-product and a Fokker-Planck differential equation approach. It is shown that, for a fixed noise power, the per-sample capacity grows unboundedly with input signal. The channel can be partitioned into amplitude and phase subchannels, and it is shown that the contribution to the total capacity of the phase channel declines for large input powers. It is found that a two-dimensional distribution with a half-Gaussian profile on the amplitude and uniform phase provides a lower bound for the zero-dispersion optical fiber channel, which is simple and asymptotically capacity-achieving at high signal-to-noise ratios (SNRs). A lower bound on the capacity is also derived in the medium-SNR region. The exact capacity subject to peak and average power constraints is numerically quantified using dense multiple ring modulation formats. The differential model underlying the zero-dispersion channel is reduced to an algebraic model, which is more tractable for digital communication studies, and in particular it provides a relation between the zero-dispersion optical channel and a $2 \times 2$ multiple-input multiple-output Rician fading channel. It appears that the structure of the capacity-achieving input distribution resembles that of the Rician fading channel, i.e., it is discrete in amplitude with a finite number of mass points, while continuous and uniform in phase.

cs.IT↗

Information Transmission using the Nonlinear Fourier Transform, Part I: Mathematical Tools

The nonlinear Fourier transform (NFT), a powerful tool in soliton theory and exactly solvable models, is a method for solving integrable partial differential equations governing wave propagation in certain nonlinear media. The NFT decorrelates signal degrees-of-freedom in such models, in much the same way that the Fourier transform does for linear systems. In this three-part series of papers, this observation is exploited for data transmission over integrable channels such as optical fibers, where pulse propagation is governed by the nonlinear Schrödinger equation. In this transmission scheme, which can be viewed as a nonlinear analogue of orthogonal frequency-division multiplexing commonly used in linear channels, information is encoded in the nonlinear frequencies and their spectral amplitudes. Unlike most other fiber-optic transmission schemes, this technique deals with both dispersion and nonlinearity directly and unconditionally without the need for dispersion or nonlinearity compensation methods. This first paper explains the mathematical tools that underlie the method.

cs.IT↗

Information Transmission using the Nonlinear Fourier Transform, Part II: Numerical Methods

In this paper, numerical methods are suggested to compute the discrete and the continuous spectrum of a signal with respect to the Zakharov-Shabat system, a Lax operator underlying numerous integrable communication channels including the nonlinear Schrödinger channel, modeling pulse propagation in optical fibers. These methods are subsequently tested and their ability to estimate the spectrum are compared against each other. These methods are used to compute the spectrum of various signals commonly used in the optical fiber communications. It is found that the layer-peeling and the spectral methods are suitable schemes to estimate the nonlinear spectra with good accuracy. To illustrate the structure of the spectrum, the locus of the eigenvalues is determined under amplitude and phase modulation in a number of examples. It is observed that in some cases, as signal parameters vary, eigenvalues collide and change their course of motion. The real axis is typically the place from which new eigenvalues originate or are absorbed into after traveling a trajectory in the complex plane.

cs.IT↗

Information Transmission using the Nonlinear Fourier Transform, Part III: Spectrum Modulation

Motivated by the looming "capacity crunch" in fiber-optic networks, information transmission over such systems is revisited. Among numerous distortions, inter-channel interference in multiuser wavelength-division multiplexing (WDM) is identified as the seemingly intractable factor limiting the achievable rate at high launch power. However, this distortion and similar ones arising from nonlinearity are primarily due to the use of methods suited for linear systems, namely WDM and linear pulse-train transmission, for the nonlinear optical channel. Exploiting the integrability of the nonlinear Schrödinger (NLS) equation, a nonlinear frequency-division multiplexing (NFDM) scheme is presented, which directly modulates non-interacting signal degrees-of-freedom under NLS propagation. The main distinction between this and previous methods is that NFDM is able to cope with the nonlinearity, and thus, as the the signal power or transmission distance is increased, the new method does not suffer from the deterministic cross-talk between signal components which has degraded the performance of previous approaches. In this paper, emphasis is placed on modulation of the discrete component of the nonlinear Fourier transform of the signal and some simple examples of achievable spectral efficiencies are provided.

cs.IT↗

Communication over Finite-Chain-Ring Matrix Channels

Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finite rings, more efficient physical-layer network coding schemes can be constructed. This paper considers the problem of communication over a finite-ring matrix channel $Y = AX + BE$, where $X$ is the channel input, $Y$ is the channel output, $E$ is random error, and $A$ and $B$ are random transfer matrices. Tight capacity results are obtained and simple polynomial-complexity capacity-achieving coding schemes are provided under the assumption that $A$ is uniform over all full-rank matrices and $BE$ is uniform over all rank-$t$ matrices, extending the work of Silva, Kschischang and Kötter (2010), who handled the case of finite fields. This extension is based on several new results, which may be of independent interest, that generalize concepts and methods from matrices over finite fields to matrices over finite chain rings.

cs.IT↗

Algebraic Approach to Physical-Layer Network Coding

The problem of designing physical-layer network coding (PNC) schemes via nested lattices is considered. Building on the compute-and-forward (C&F) relaying strategy of Nazer and Gastpar, who demonstrated its asymptotic gain using information-theoretic tools, an algebraic approach is taken to show its potential in practical, non-asymptotic, settings. A general framework is developed for studying nested-lattice-based PNC schemes---called lattice network coding (LNC) schemes for short---by making a direct connection between C&F and module theory. In particular, a generic LNC scheme is presented that makes no assumptions on the underlying nested lattice code. C&F is re-interpreted in this framework, and several generalized constructions of LNC schemes are given. The generic LNC scheme naturally leads to a linear network coding channel over modules, based on which non-coherent network coding can be achieved. Next, performance/complexity tradeoffs of LNC schemes are studied, with a particular focus on hypercube-shaped LNC schemes. The error probability of this class of LNC schemes is largely determined by the minimum inter-coset distances of the underlying nested lattice code. Several illustrative hypercube-shaped LNC schemes are designed based on Construction A and D, showing that nominal coding gains of 3 to 7.5 dB can be obtained with reasonable decoding complexity. Finally, the possibility of decoding multiple linear combinations is considered and related to the shortest independent vectors problem. A notion of dominant solutions is developed together with a suitable lattice-reduction-based algorithm.

cs.IT↗

A Two-Dimensional Signal Space for Intensity-Modulated Channels

A two-dimensional signal space for intensity- modulated channels is presented. Modulation formats using this signal space are designed to maximize the minimum distance between signal points while satisfying average and peak power constraints. The uncoded, high-signal-to-noise ratio, power and spectral efficiencies are compared to those of the best known formats. The new formats are simpler than existing subcarrier formats, and are superior if the bandwidth is measured as 90% in-band power. Existing subcarrier formats are better if the bandwidth is measured as 99% in-band power.

cs.IT↗

Staircase Codes: FEC for 100 Gb/s OTN

Staircase codes, a new class of forward-error-correction (FEC) codes suitable for high-speed optical communications, are introduced. An ITU-T G.709-compatible staircase code with rate R=239/255 is proposed, and FPGA-based simulation results are presented, exhibiting a net coding gain (NCG) of 9.41 dB at an output error rate of 1E-15, an improvement of 0.42 dB relative to the best code from the ITU-T G.975.1 recommendation. An error floor analysis technique is presented, and the proposed code is shown to have an error floor at 4.0E-21.

cs.IT↗

A Pragmatic Coded Modulation Scheme for High-Spectral-Efficiency Fiber-Optic Communications

A pragmatic coded modulation system is presented that incorporates signal shaping and exploits the excellent performance and efficient high-speed decoding architecture of staircase codes. Reliable communication within 0.62 bits/s/Hz of the estimated capacity (per polarization) of a system with L=2000 km is provided by the proposed system, with an error floor below 1E-20. Also, it is shown that digital backpropagation increases the achievable spectral efficiencies---relative to linear equalization---by 0.55 to 0.75 bits/s/Hz per polarization.

cs.IT↗

An Algebraic Approach to Physical-Layer Network Coding

The problem of designing new physical-layer network coding (PNC) schemes via lattice partitions is considered. Building on a recent work by Nazer and Gastpar, who demonstrated its asymptotic gain using information-theoretic tools, we take an algebraic approach to show its potential in non-asymptotic settings. We first relate Nazer-Gastpar's approach to the fundamental theorem of finitely generated modules over a principle ideal domain. Based on this connection, we generalize their code construction and simplify their encoding and decoding methods. This not only provides a transparent understanding of their approach, but more importantly, it opens up the opportunity to design efficient and practical PNC schemes. Finally, we apply our framework for PNC to a Gaussian relay network and demonstrate its advantage over conventional PNC schemes.

cs.IT↗

Universal Secure Network Coding via Rank-Metric Codes

The problem of securing a network coding communication system against an eavesdropper adversary is considered. The network implements linear network coding to deliver n packets from source to each receiver, and the adversary can eavesdrop on μarbitrarily chosen links. The objective is to provide reliable communication to all receivers, while guaranteeing that the source information remains information-theoretically secure from the adversary. A coding scheme is proposed that can achieve the maximum possible rate of n-μpackets. The scheme, which is based on rank-metric codes, has the distinctive property of being universal: it can be applied on top of any communication network without requiring knowledge of or any modifications on the underlying network code. The only requirement of the scheme is that the packet length be at least n, which is shown to be strictly necessary for universal communication at the maximum rate. A further scenario is considered where the adversary is allowed not only to eavesdrop but also to inject up to t erroneous packets into the network, and the network may suffer from a rank deficiency of at most ρ. In this case, the proposed scheme can be extended to achieve the rate of n-ρ-2t-μpackets. This rate is shown to be optimal under the assumption of zero-error communication.

cs.IT↗