Searcharxiv⌕ Search

arXiv subjects

Gerhard Kramer

Publications and source records attributed to Gerhard Kramer.

At least 55 records · Page 3Linked to original sources
arXiv2020

Nested Tailbiting Convolutional Codes for Secrecy, Privacy, and Storage

A key agreement problem is considered that has a biometric or physical identifier, a terminal for key enrollment, and a terminal for reconstruction. A nested convolutional code design is proposed that performs vector quantization during enrollment and error control during reconstruction. Physical identifiers with small bit error probability illustrate the gains of the design. One variant of the nested convolutional codes improves on the best known key vs. storage rate ratio but it has high complexity. A second variant with lower complexity performs similar to nested polar codes. The results suggest that the choice of code for key agreement with identifiers depends primarily on the complexity constraint.

cs.IT↗
arXiv2020

Private Authentication with Physical Identifiers Through Broadcast Channel Measurements

A basic model for key agreement with biometric or physical identifiers is extended to include measurements of a hidden source through a general broadcast channel (BC). An inner bound for strong secrecy, maximum key rate, and minimum privacy-leakage and database-storage rates is proposed. The inner bound is shown to be tight for physically-degraded and less-noisy BCs.

cs.IT↗
arXiv2020

Secure and Reliable Key Agreement with Physical Unclonable Functions

Different transforms used in binding a secret key to correlated physical-identifier outputs are compared. Decorrelation efficiency is the metric used to determine transforms that give highly-uncorrelated outputs. Scalar quantizers are applied to transform outputs to extract uniformly distributed bit sequences to which secret keys are bound. A set of transforms that perform well in terms of the decorrelation efficiency is applied to ring oscillator (RO) outputs to improve the uniqueness and reliability of extracted bit sequences, to reduce the hardware area and information leakage about the key and RO outputs, and to maximize the secret-key length. Low-complexity error-correction codes are proposed to illustrate two complete key-binding systems with perfect secrecy, and better secret-key and privacy-leakage rates than existing methods. A reference hardware implementation is also provided to demonstrate that the transform-coding approach occupies a small hardware area.

cs.CR↗
arXiv2019

Finite-Precision Implementation of Arithmetic Coding Based Distribution Matchers

A distribution matcher (DM) encodes a binary input data sequence into a sequence of symbols with a desired target probability distribution. Several DMs, including shell mapping and constant-composition distribution matcher (CCDM), have been successfully employed for signal shaping, e.g., in optical-fiber or 5G. The CCDM, like many other DMs, is typically implemented by arithmetic coding (AC). In this work we implement AC based DMs using finite-precision arithmetic (FPA). An analysis of the implementation shows that FPA results in a rate-loss that shrinks exponentially with the number of precision bits. Moreover, a relationship between the CCDM rate and the number of precision bits is derived.

cs.IT↗
arXiv2019

Strong Secrecy for Cooperative Broadcast Channels

A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided user. The secrecy level is measured in terms of strong secrecy, i.e., a vanishing information leakage. An inner bound on the capacity region is derived by using a channel-resolvability-based code that double-bins the codebook of the secret message, and by using a likelihood encoder to choose the transmitted codeword. The inner bound is shown to be tight for semi-deterministic and physically degraded BCs and the results are compared to those of the corresponding BCs without a secrecy constraint. Blackwell and Gaussian BC examples illustrate the impact of secrecy on the rate regions. Unlike the case without secrecy, where sharing information about both private messages via the cooperative link is optimal, our protocol conveys parts of the common and non-confidential messages only. This restriction reduces the transmission rates more than the usual rate loss due to secrecy requirements. An example that illustrates this loss is provided.

cs.IT↗
arXiv2019

Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems

The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random linear codes and achieves all points of the key-leakage-storage regions of the generated-secret and chosen-secret models. The second construction uses nested polar codes for vector quantization during enrollment and for error correction during reconstruction. Simulations show that the nested polar codes achieve privacy-leakage and storage rates that improve on existing code designs. One proposed code achieves a rate tuple that cannot be achieved by existing methods.

cs.IT↗
arXiv2019

Joint State Sensing and Communication over Memoryless Multiple Access Channels

A memoryless state-dependent multiple access channel (MAC) is considered where two transmitters wish to convey a respective message to a receiver while simultaneously estimating the respective channel state via generalized feedback. The scenario is motivated by a joint radar and communication system where the radar and data applications share the same bandwidth. An achievable capacity-distortion tradeoff region is derived that outperforms a resource-sharing scheme through a binary erasure MAC with binary states.

cs.IT↗
arXiv2019

Quasi-Concavity for Gaussian Multicast Relay Channels

Standard upper and lower bounds on the capacity of relay channels are cut-set (CS), decode-forward (DF), and quantize-forward (QF) rates. For real additive white Gaussian noise (AWGN) multicast relay channels with one source node and one relay node, these bounds are shown to be quasi-concave in the receiver signal-to-noise ratios and the squared source-relay correlation coefficient. Furthermore, the CS rates are shown to be quasi-concave in the relay position for a fixed correlation coefficient, and the DF rates are shown to be quasi-concave in the relay position. The latter property characterizes the optimal relay position when using DF.

cs.IT↗
arXiv2018

Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels with Feedback

The feedback sum-rate capacity is established for the symmetric $J$-user Gaussian multiple-access channel (GMAC). The main contribution is a converse bound that combines the dependence-balance argument of Hekstra and Willems (1989) with a variant of the factorization of a convex envelope of Geng and Nair (2014). The converse bound matches the achievable sum-rate of the Fourier-Modulated Estimate Correction strategy of Kramer (2002).

cs.IT↗
arXiv2018

Optimization of Bit Mapping and Quantized Decoding for Off-the-Shelf Protograph LDPC Codes with Application to IEEE 802.3ca

Protograph-based, off-the-shelf low-density parity-check (LDPC) codes are optimized for higher-order modulation and quantized sum-product decoders. As an example, for the recently proposed LDPC code from the upcoming IEEE 802.3ca standard for passive optical networks (PONs), an optimized mapping of the bit channels originating from bit-metric decoding to the protograph variable nodes gains 0.4 dB and 0.3 dB at a bit-error rate of 1e-6 for shaped and uniform signaling, respectively. Furthermore, the clipping value for a quantized sum-product LDPC decoder is optimized via discretized density evolution.

cs.IT↗
arXiv2018

Joint State Sensing and Communication: Optimal Tradeoff for a Memoryless Case

A communication setup is considered where a transmitter wishes to simultaneously sense its channel state and convey a message to a receiver. The state is estimated at the transmitter by means of generalized feedback, i.e. a strictly causal channel output that is observed at the transmitter. The scenario is motivated by a joint radar and communication system where the radar and data applications share the same frequency band. For the case of a memoryless channel with i.i.d. state sequences, we characterize the capacity-distortion tradeoff, defined as the best achievable rate below which a message can be conveyed reliably while satisfying some distortion constraint on state sensing. An iterative algorithm is proposed to optimize the input probability distribution. Examples demonstrate the benefits of joint sensing and communication as compared to a separation-based approach.

cs.IT↗
arXiv2018

Privacy, Secrecy, and Storage with Multiple Noisy Measurements of Identifiers

The key-leakage-storage region is derived for a generalization of a classic two-terminal key agreement model. The additions to the model are that the encoder observes a hidden, or noisy, version of the identifier, and that the encoder and decoder can perform multiple measurements. To illustrate the behavior of the region, the theory is applied to binary identifiers and noise modeled via binary symmetric channels. In particular, the key-leakage-storage region is simplified by applying Mrs. Gerber's lemma twice in different directions to a Markov chain. The growth in the region as the number of measurements increases is quantified. The amount by which the privacy-leakage rate reduces for a hidden identifier as compared to a noise-free (visible) identifier at the encoder is also given. If the encoder incorrectly models the source as visible, it is shown that substantial secrecy leakage may occur and the reliability of the reconstructed key might decrease.

cs.IT↗
arXiv2018

Quantized Precoding for Multi-Antenna Downlink Channels with MAGIQ

A multi-antenna, greedy, iterative, and quantized (MAGIQ) precoding algorithm is proposed for downlink channels. MAGIQ allows a straightforward integration with orthogonal frequency-division multiplexing (OFDM). MAGIQ is compared to three existing algorithms in terms of information rates and complexity: quantized linear precoding (QLP), SQUID, and an ADMM-based algorithm. The information rate is measured by using a lower bound for finite modulation sets, and the complexity is measured by the number of multiplications and comparisons. MAGIQ and ADMM achieve similar information rates with similar complexity for Rayleigh flat-fading channels and one-bit quantization per real dimension, and they outperform QLP and SQUID for higher order modulation.

cs.IT↗
arXiv2018

Analysis of Massive MIMO and Base Station Cooperation in an Indoor Scenario

The performance of centralized and distributed massive MIMO deployments are analyzed for indoor office scenarios. The distributed deployments use one of the following precoding methods: (1) local precoding with local channel state information (CSI) to the user equipments (UEs) that it serves; (2) large-scale MIMO with local CSI to all UEs in the network; (3) network MIMO with global CSI. For the distributed deployments (2) and (3), it is shown that using twice as many base station antennas as data streams provides many of the massive MIMO benefits in terms of spectral efficiency and fairness. This is in contrast to the centralized deployment and the distributed deployment (1) where more antennas are needed. Two of the main conclusions are that distributing base stations helps to overcome wall penetration loss; however, a backhaul is required to mitigate inter-cell interference. The effect of estimation errors on the performance is also quantified.

cs.IT↗
arXiv2018

Autocorrelation Function for Dispersion-Free Fiber Channels with Distributed Amplification

Optical fiber signals with high power exhibit spectral broadening that seems to limit capacity. To study spectral broadening, the autocorrelation function of the output signal given the input signal is derived for a simplified fiber model that has zero dispersion, distributed optical amplification (OA), and idealized spatial noise processes. The autocorrelation function is used to upper bound the output power of bandlimited or time-resolution limited receivers, and thereby to bound spectral broadening and the capacity of receivers with thermal noise. The output power scales at most as the square-root of the launch power, and thus capacity scales at most as one-half the logarithm of the launch power. The propagating signal bandwidth scales at least as the square-root of the launch power. However, in practice the OA bandwidth should exceed the signal bandwidth to compensate attenuation. Hence, there is a launch power threshold beyond which the fiber model loses practical relevance. Nevertheless, for the mathematical model an upper bound on capacity is developed when the OA bandwidth scales as the square-root of the launch power, in which case capacity scales at most as the inverse fourth root of the launch power.

cs.IT↗
arXiv2017

Energy Conservation in Optical Fibers with Distributed Brick-Walls Filters

A band-pass filtering scheme is proposed to mitigate spectral broadening and channel coupling in the Nonlinear Schrödinger (NLS) fiber optic channel. The scheme is modeled by modifying the NLS Equation to include an attenuation profile with multiple brick-wall filters centered at different frequencies. It is shown that this brick-walls profile conserves the total in-band energy of the launch signal. Furthermore, energy fluctuations between the filtered channels are characterized, and conditions on the channel spacings are derived that ensure energy conservation in each channel. The maximum spectral efficiency of such a system is derived, and a constructive rule for achieving it using Sidon sequences is provided.

cs.IT↗
arXiv2017

Models and Information Rates for Multiuser Optical Fiber Channels with Nonlinearity and Dispersion

Two discrete-time interference channel models are developed for information transmission over a single span of optical fiber using wavelength-division multiplexing (WDM) and lumped amplification. The models are derived from the nonlinear Schroedinger (NLS) equation by including the nonlinear phenomena of self-phase modulation (SPM) and cross-phase modulation (XPM) but ignoring four-wave mixing (FWM), polarization effects and group velocity dispersion (GVD) within WDM bands. The first model also ignores GVD across WDM bands, referred to as group velocity mistmatch (GVM). For the case of two users, a new technique called "interference focusing" is proposed where each carrier achieves the capacity pre-log 1, thereby doubling the pre-log of 1/2 achieved by using conventional methods. For three users, interference focusing is also useful under certain conditions. The second model captures GVM and the effect of filtering at the receivers in addition to SPM and XPM. In a 3-user system, it is shown that all users can achieve the maximum pre-log factor 1 simultaneously by using interference focusing, a time-limited pulse and a bank of filters at the receivers.

cs.IT↗