SearcharxivSearch

arXiv subjects

Inyup Kang

Publications and source records attributed to Inyup Kang.

At least 19 recordsLinked to original sources

Mitigating large adversarial perturbations on X-MAS (X minus Moving Averaged Samples)

We propose the scheme that mitigates the adversarial perturbation $ε$ on the adversarial example $X_{adv}$ ($=$ $X$ $\pm$ $ε$, $X$ is a benign sample) by subtracting the estimated perturbation $\hatε$ from $X$ $+$ $ε$ and adding $\hatε$ to $X$ $-$ $ε$. The estimated perturbation $\hatε$ comes from the difference between $X_{adv}$ and its moving-averaged outcome $W_{avg}*X_{adv}$ where $W_{avg}$ is $N \times N$ moving average kernel that all the coefficients are one. Usually, the adjacent samples of an image are close to each other such that we can let $X$ $\approx$ $W_{avg}*X$ (naming this relation after X-MAS[X minus Moving Averaged Samples]). By doing that, we can make the estimated perturbation $\hatε$ falls within the range of $ε$. The scheme is also extended to do the multi-level mitigation by configuring the mitigated adversarial example $X_{adv}$ $\pm$ $\hatε$ as a new adversarial example to be mitigated. The multi-level mitigation gets $X_{adv}$ closer to $X$ with a smaller (i.e. mitigated) perturbation than original unmitigated perturbation by setting the moving averaged adversarial sample $W_{avg} * X_{adv}$ (which has the smaller perturbation than $X_{adv}$ if $X$ $\approx$ $W_{avg}*X$) as the boundary condition that the multi-level mitigation cannot cross over (i.e. decreasing $ε$ cannot go below and increasing $ε$ cannot go beyond). With the multi-level mitigation, we can get high prediction accuracies even in the adversarial example having a large perturbation (i.e. $ε$ $>$ $16$). The proposed scheme is evaluated with adversarial examples crafted by the FGSM (Fast Gradient Sign Method) based attacks on ResNet-50 trained with ImageNet dataset.

cs.CV

Controlling the privacy loss with the input feature maps of the layers in convolutional neural networks

We propose the method to sanitize the privacy of the IFM(Input Feature Map)s that are fed into the layers of CNN(Convolutional Neural Network)s. The method introduces the degree of the sanitization that makes the application using a CNN be able to control the privacy loss represented as the ratio of the probabilistic accuracies for original IFM and sanitized IFM. For the sanitization of an IFM, the sample-and-hold based approximation scheme is devised to satisfy an application-specific degree of the sanitization. The scheme approximates an IFM by replacing all the samples in a window with the non-zero sample closest to the mean of the sampling window. It also removes the dependency on CNN configuration by unfolding multi-dimensional IFM tensors into one-dimensional streams to be approximated.

cs.LG

Convolutional Neural Network Quantization using Generalized Gamma Distribution

As edge applications using convolutional neural networks (CNN) models grow, it is becoming necessary to introduce dedicated hardware accelerators in which network parameters and feature-map data are represented with limited precision. In this paper we propose a novel quantization algorithm for energy-efficient deployment of the hardware accelerators. For weights and biases, the optimal bit length of the fractional part is determined so that the quantization error is minimized over their distribution. For feature-map data, meanwhile, their sample distribution is well approximated with the generalized gamma distribution (GGD), and accordingly the optimal quantization step size can be obtained through the asymptotical closed form solution of GGD. The proposed quantization algorithm has a higher signal-to-quantization-noise ratio (SQNR) than other quantization schemes previously proposed for CNNs, and even can be more improved by tuning the quantization parameters, resulting in efficient implementation of the hardware accelerators for CNNs in terms of power consumption and memory bandwidth.

cs.NE

Circular Buffer Rate-Matched Polar Codes

A practical rate-matching system for constructing rate-compatible polar codes is proposed. The proposed polar code circular buffer rate-matching is suitable for transmissions on communication channels that support hybrid automatic repeat request (HARQ) communications, as well as for flexible resource-element rate-matching on single transmission channels. Our proposed circular buffer rate matching scheme also incorporates a bit-mapping scheme for transmission on bit-interleaved coded modulation (BICM) channels using higher order modulations. An interleaver is derived from a puncturing order obtained with a low complexity progressive puncturing search algorithm on a base code of short length, and has the flexibility to achieve any desired rate at the desired code length, through puncturing or repetition. The rate-matching scheme is implied by a two-stage polarization, for transmission at any desired code length, code rate, and modulation order, and is shown to achieve the symmetric capacity of BICM channels. Numerical results on AWGN and fast fading channels show that the rate-matched polar codes have a competitive performance when compared to the spatially-coupled quasi-cyclic LDPC codes or LTE turbo codes, while having similar rate-dematching storage and computational complexities.

cs.IT

Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding

We consider the problem of polar coding for transmission over $m$-user multiple access channels. In the proposed scheme, all users encode their messages using a polar encoder, while a multi-user successive cancellation decoder is deployed at the receiver. The encoding is done separately across the users and is independent of the target achievable rate. For the code construction, the positions of information bits and frozen bits for each of the users are decided jointly. This is done by treating the polar transformations across all the $m$ users as a single polar transformation with a certain \emph{polarization base}. We characterize the resolution of achievable rates on the dominant face of the uniform rate region in terms of the number of users $m$ and the length of the polarization base $L$. In particular, we prove that for any target rate on the dominant face, there exists an achievable rate, also on the dominant face, within the distance at most $\frac{(m-1)\sqrt{m}}{L}$ from the target rate. We then prove that the proposed MAC polar coding scheme achieves the whole uniform rate region with fine enough resolution by changing the decoding order in the multi-user successive cancellation decoder, as $L$ and the code block length $N$ grow large. The encoding and decoding complexities are $O(N \log N)$ and the asymptotic block error probability of $O(2^{-N^{0.5 - ε}})$ is guaranteed. Examples of achievable rates for the $3$-user multiple access channel are provided.

cs.IT

Rate-Compatible Polar Codes for Wireless Channels

A design of rate-compatible polar codes suitable for HARQ communications is proposed in this paper. An important feature of the proposed design is that the puncturing order is chosen with low complexity on a base code of short length, which is then further polarized to the desired length. A practical rate-matching system that has the flexibility to choose any desired rate through puncturing or repetition while preserving the polarization is suggested. The proposed rate-matching system is combined with channel interleaving and a bit-mapping procedure that preserves the polarization of the rate-compatible polar code family over bit-interleaved coded modulation systems. Simulation results on AWGN and fast fading channels with different modulation orders show the robustness of the proposed rate-compatible polar code in both Chase combining and incremental redundancy HARQ communications.

cs.IT

Relaxed Polar Codes

Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Arıkan's polar encoder and successive cancellation decoder have complexities of $N \log N$, for code length $N$. Although, the complexity bound of $N \log N$ is asymptotically favorable, we report in this work methods to further reduce the encoding and decoding complexities of polar coding. The crux is to relax the polarization of certain bit-channels without performance degradation. We consider schemes for relaxing the polarization of both \emph{very good} and \emph{very bad} bit-channels, in the process of channel polarization. Relaxed polar codes are proved to preserve the capacity achieving property of polar codes. Analytical bounds on the asymptotic and finite-length complexity reduction attainable by relaxed polarization are derived. For binary erasure channels, we show that the computation complexity can be reduced by a factor of 6, while preserving the rate and error performance. We also show that relaxed polar codes can be decoded with significantly reduced latency. For AWGN channels with medium code lengths, we show that relaxed polar codes can have lower error probabilities than conventional polar codes, while having reduced encoding and decoding computation complexities.

cs.IT

A Structured Construction of Optimal Measurement Matrix for Noiseless Compressed Sensing via Analog Polarization

In this paper, we propose a method of structured construction of the optimal measurement matrix for noiseless compressed sensing (CS), which achieves the minimum number of measurements which only needs to be as large as the sparsity of the signal itself to be recovered to guarantee almost error-free recovery, for sufficiently large dimension. To arrive at the results, we employ a duality between noiseless CS and analog coding across sparse additive noisy channel (SANC). Extending Renyi Information Dimension to Mutual Information Dimension (MID), we show the operational meaning of MID to be the fundamental limit of asymptotically error-free analog transmission across SANC under linear analog encoding constraint. We prove that MID polarizes after analog polar transformation and obeys the same recursive relationship as BEC. We further prove that analog polar encoding can achieve the fundamental limit of achievable dimension rate with vanishing Pe across SANC. From the duality, a structured construction scheme is proposed for the linear measurement matrix which achieves the minimum measurement requirement for noiseless CS.

cs.IT

Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes

A scheme for concatenating the recently invented polar codes with non-binary MDS codes, as Reed-Solomon codes, is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any $ε> 0$, and total frame length $N$, the parameters of the scheme can be set such that the frame error probability is less than $2^{-N^{1-ε}}$, while the scheme is still capacity achieving. This improves upon $2^{-N^{0.5-ε}}$, the frame error probability of Arikan's polar codes. The proposed concatenated polar codes and Arikan's polar codes are also compared for transmission over channels with erasure bursts. We provide a sufficient condition on the length of erasure burst which guarantees failure of the polar decoder. On the other hand, it is shown that the parameters of the concatenated polar code can be set in such a way that the capacity-achieving properties of polar codes are preserved. We also propose decoding algorithms for concatenated polar codes, which significantly improve the error-rate performance at finite block lengths while preserving the low decoding complexity.

cs.IT

BICM Performance Improvement via Online LLR Optimization

We consider bit interleaved coded modulation (BICM) receiver performance improvement based on the concept of generalized mutual information (GMI). Increasing achievable rates of BICM receiver with GMI maximization by proper scaling of the log likelihood ratio (LLR) is investigated. While it has been shown in the literature that look-up table based LLR scaling functions matched to each specific transmission scenario may provide close to optimal solutions, this method is difficult to adapt to time-varying channel conditions. To solve this problem, an online adaptive scaling factor searching algorithm is developed. Uniform scaling factors are applied to LLRs from different bit channels of each data frame by maximizing an approximate GMI that characterizes the transmission conditions of current data frame. Numerical analysis on effective achievable rates as well as link level simulation of realistic mobile transmission scenarios indicate that the proposed method is simple yet effective.

cs.IT

Performance of Spatially-Coupled LDPC Codes and Threshold Saturation over BICM Channels

We study the performance of binary spatially-coupled low-density parity-check codes (SC-LDPC) when used with bit-interleaved coded-modulation (BICM) schemes. This paper considers the cases when transmission takes place over additive white Gaussian noise (AWGN)channels and Rayleigh fast-fading channels. The technique of upper bounding the maximum-a-posteriori (MAP) decoding performance of LDPC codes using an area theorem is extended for BICM schemes. The upper bound is computed for both the optimal MAP demapper and the suboptimal max-log-MAP (MLM) demapper. It is observed that this bound approaches the noise threshold of BICM channels for regular LDPC codes with large degrees. The rest of the paper extends these techniques to SC-LDPC codes and the phenomenon of threshold saturation is demonstrated numerically. Based on numerical evidence, we conjecture that the belief-propagation (BP) decoding threshold of SC-LDPC codes approaches the MAP decoding threshold of the underlying LDPC ensemble on BICM channels. Numerical results also show that SC-LDPC codes approach the BICM capacity over different channels and modulation schemes.

cs.IT

Compound Polar Codes

A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar codes and then discuss our proposed scheme. Instead of encoding separately across the individual underlying channels, which requires multiple encoders and decoders, we take advantage of the recursive structure of polar codes to construct a unified scheme with a single encoder and decoder that can be used over the multi-channels. We prove that the scheme achieves the capacity over this multi-channel. Numerical analysis and simulation results for BICM channels at finite block lengths shows a considerable improvement in the probability of error comparing to a conventional separated scheme.

cs.IT

On the Construction and Decoding of Concatenated Polar Codes

A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any $ε> 0$, and total frame length $N$, the parameters of the scheme can be set such that the frame error probability is less than $2^{-N^{1-ε}}$, while the scheme is still capacity achieving. This improves upon $2^{-N^{0.5-\eps}}$, the frame error probability of Arikan's polar codes. We also propose decoding algorithms for concatenated polar codes, which significantly improve the error-rate performance at finite block lengths while preserving the low decoding complexity.

cs.IT

On the achievable region for interference networks with point-to-point codes

This paper studies evaluation of the capacity region for interference networks with point-to-point (p2p) capacity-achieving codes. Such capacity region has recently been characterized as union of several sub-regions each of which has distinctive operational characteristics. Detailed evaluation of this region, therefore, can be accomplished in a very simple manner by acknowledging such characteristics, which, in turn, provides an insight for a simple implementation scenario. Completely generalized message assignment which is also practically relevant is considered in this paper, and it is shown to provide strictly larger achievable rates than what traditional message assignment does when a receiver with joint decoding capability is used.

cs.IT

On the capacity limit of wireless channels under colored scattering

It has been generally believed that the multiple-input multiple-output (MIMO) channel capacity grows linearly with the size of antenna arrays. In terms of degrees of freedom, linear transmit and receive arrays of length $L$ in a scattering environment of total angular spread $|Ω|$ asymptotically have $|Ω| L$ degrees of freedom. In this paper, it is claimed that the linear increase in degrees of freedom may not be attained when scattered electromagnetic fields in the underlying scattering environment are statistically correlated. After introducing a model of correlated scattering, which is referred to as the colored scattering model, we derive the number of degrees of freedom. Unlike the uncorrelated case, the number of degrees of freedom in the colored scattering channel is asymptotically limited by $|Ω| \cdot \min \{L, 1/Γ}$, where $Γ$ is a parameter determining the extent of correlation. In other words, for very large arrays in the colored scattering environment, degrees of freedom can get saturated to an intrinsic limit rather than increasing linearly with the array size.

cs.IT

Outage-based ergodic link adaptation for fading channels with delayed CSIT

Link adaptation in which the transmission data rate is dynamically adjusted according to channel variation is often used to deal with time-varying nature of wireless channel. When channel state information at the transmitter (CSIT) is delayed by more than channel coherence time due to feedback delay, however, the effect of link adaptation can possibly be taken away if this delay is not taken into account. One way to deal with such delay is to predict current channel quality given available observation, but this would inevitably result in prediction error. In this paper, an algorithm with different view point is proposed. By using conditional cdf of current channel given observation, outage probability can be computed for each value of transmission rate $R$. By assuming that the transmission block error rate (BLER) is dominated by outage probability, the expected throughput can also be computed, and $R$ can be determined to maximize it. The proposed scheme is designed to be optimal if channel has ergodicity, and it is shown to considerably outperform conventional schemes in certain Rayleigh fading channel model.

cs.IT

Interference Mitigation via Interference-Aware Successive Decoding

In modern wireless networks, interference is no longer negligible since each cell becomes smaller to support high throughput. The reduced size of each cell forces to install many cells, and consequently causes to increase inter-cell interference at many cell edge areas. This paper considers a practical way of mitigating interference at the receiver equipped with multiple antennas in interference channels. Recently, it is shown that the capacity region of interference channels over point-to-point codes could be established with a combination of two schemes: treating interference as noise and jointly decoding both desired and interference signals. In practice, the first scheme is straightforwardly implementable, but the second scheme needs impractically huge computational burden at the receiver. Within a practical range of complexity, this paper proposes the interference-aware successive decoding (IASD) algorithm which successively decodes desired and interference signals while updating a priori information of both signals. When multiple decoders are allowed to be used, the proposed IASD can be extended to interference-aware parallel decoding (IAPD). The proposed algorithm is analyzed with extrinsic information transfer (EXIT) chart so as to show that the interference decoding is advantageous to improve the performance. Simulation results demonstrate that the proposed algorithm significantly outperforms interference non-decoding algorithms.

cs.IT

Combining Schemes for Hybrid ARQ with Interference-Aware Successive Decoding

For decades, cellular networks have greatly evolved to support high data rates over reliable communication. Hybrid automatic-repeat-request (ARQ) is one of the techniques to make such improvement possible. However, this advancement is reduced at the cell edge where interference is not negligible. In order to overcome the challenge at the cell edge, the concept of interference-aware receiver has been recently proposed in which both desired and interference signals are successively decoded, called interference-aware successive decoding (IASD). Although IASD is the advanced receiver technology, interference signals are out of the mobile station's control so that they cannot be requested by the mobile station. For this reason, this paper proposes new combining schemes for the IASD receiver, which operate with hybrid ARQ in a bit level or in a symbol level. In addition, this paper compares the memory requirement among the proposed combining schemes and analyzes the impact of discrete modulation on the proposed scheme. Simulation results presents the superiority of the proposed combining schemes and shows the improvement in terms of the number of transmission.

cs.IT