Searcharxiv⌕ Search

arXiv subjects

Kai Niu

Publications and source records attributed to Kai Niu.

88 records · Page 5Linked to original sources

Polar-Coded Non-Orthogonal Multiple Access

Non-orthogonal multiple access (NOMA) is one of the key techniques to address the high spectral efficiency and massive connectivity requirements for the fifth generation (5G) wireless system. To efficiently realize NOMA, we propose a joint design framework combining the polar coding and the NOMA transmission, which deeply mines the generalized polarization effect among the users. In this polar coded NOMA (PC-NOMA) framework, the original NOMA channel is decomposed into multiple bit polarized channels by using a three-stage channel transform, that is, user$\to$signal$\to$bit partitions. Specifically, for the first-stage channel transform, we design two schemes, namely sequential user partition (SUP) and parallel user partition (PUP). For the SUP, a joint successive cancellation detecting and decoding scheme is developed, and a search algorithm is proposed to schedule the NOMA detecting order which improves the system performance by enhanced polarization among the user synthesized channels. The "worst-goes-first" idea is employed in the scheduling strategy, and its theoretic performance is analyzed by using the polarization principle. For the PUP, a corresponding parallel detecting scheme is exploited to reduce the latency. The block error ratio performances over the additive white Gaussian noise channel and the Rayleigh fading channel indicate that the proposed PC-NOMA obviously outperforms the state-of-the-art turbo coded NOMA scheme due to the advantages of joint design between the polar coding and NOMA.

cs.IT↗

Does Gaussian Approximation Work Well for The Long-Length Polar Code Construction?

Gaussian approximation (GA) is widely used to construct polar codes. However when the code length is long, the subchannel selection inaccuracy due to the calculation error of conventional approximate GA (AGA), which uses a two-segment approximation function, results in a catastrophic performance loss. In this paper, new principles to design the GA approximation functions for polar codes are proposed. First, we introduce the concepts of polarization violation set (PVS) and polarization reversal set (PRS) to explain the essential reasons that the conventional AGA scheme cannot work well for the long-length polar code construction. In fact, these two sets will lead to the rank error of subsequent subchannels, which means the orders of subchannels are misaligned, which is a severe problem for polar code construction. Second, we propose a new metric, named cumulative-logarithmic error (CLE), to quantitatively evaluate the remainder approximation error of AGA in logarithm. We derive the upper bound of CLE to simplify its calculation. Finally, guided by PVS, PRS and CLE bound analysis, we propose new construction rules based on a multi-segment approximation function, which obviously improve the calculation accuracy of AGA so as to ensure the excellent performance of polar codes especially for the long code lengths. Numerical and simulation results indicate that the proposed AGA schemes are critical to construct the high-performance polar codes.

cs.IT↗

An indirect transmission measurement-based spectrum estimation method for computed tomography

The characteristics of an x-ray spectrum can greatly influence imaging and related tasks. In practice, due to the pile-up effect of the detector, it's difficult to directly measure the spectrum of a CT scanner using an energy resolved detector. An alternative solution is to estimate the spectrum using transmission measurements with a step phantom or other CT phantom. In this work, we present a new spectrum estimation method based on indirect transmission measurement and model spectra mixture approach. The estimated x-ray spectrum was expressed as weighted summation of a set of model spectra, which can significantly reduce the degrees of freedom (DOF) of the spectrum estimation problem. Next, an estimated projection can be calculated with the assumed spectrum. By iteratively updating the unknown weights, we minimized the difference between the estimated projection data and the raw projection data. The final spectrum was calculated with these calibrated weights and the model spectra. Both simulation and experimental data were used to evaluate the proposed method. In the simulation study, the estimated spectra were compared to the raw spectra which were used to generate the raw projection data. For the experimental study, the ground truth measurement of the raw x-ray spectrum was not available. Therefore, the estimated spectrum was compared against spectra generated using the SpekCalc software with tube configurations provided by the scanner manufacturer. The results show the proposed method has potential to accurately estimate x-ray spectra using the raw projection data. The difference between the mean energy of the raw spectra and the mean energy of the estimated spectra were smaller than 0.5 keV for both simulation and experimental data. Further tests show the method was robust with respect to the model spectra generator.

physics.med-ph↗

A patient-specific scatter artifacts correction method

This paper provides a fast and patient-specific scatter artifact correction method for cone-beam computed tomography (CBCT) used in image-guided interventional procedures. Due to increased irradiated volume of interest in CBCT imaging, scatter radiation has increased dramatically compared to 2D imaging, leading to a degradation of image quality. In this study, we propose a scatter artifact correction strategy using an analytical convolution-based model whose free parameters are estimated using a rough estimation of scatter profiles from the acquired cone-beam projections. It was evaluated using Monte Carlo simulations with both monochromatic and polychromatic X-ray sources. The results demonstrated that the proposed method significantly reduced the scatter-induced shading artifacts and recovered CT numbers.

physics.med-ph↗

Space-Time Polar Coded Modulation

The polar codes are proven to be capacity-achieving and are shown to have equivalent or even better finite-length performance than the turbo/LDPC codes under some improved decoding algorithms over the additive white Gaussian noise (AWGN) channels. Polar coding is based on the so-called channel polarization phenomenon induced by a transform over the underlying binary-input channel. The channel polarization is found to be universal in many signal processing problems and has been applied to the coded modulation schemes. In this paper, the channel polarization is further extended to the multiple antenna transmission following a multilevel coding principle. The multiple-input multile-output (MIMO) channel under quadrature amplitude modulation (QAM) are transformed into a series of synthesized binary-input channels under a three-stage channel transform. Based on this generalized channel polarization, the proposed space-time polar coded modulation (STPCM) scheme allows a joint optimization of the binary polar coding, modulation and MIMO transmission. In addition, a practical solution of polar code construction over the fading channels is also provided, where the fading channels are approximated by an AWGN channel which shares the same capacity with the original. The simulations over the MIMO channel with uncorrelated Rayleigh fast fading show that the proposed STPCM scheme can outperform the bit-interleaved turbo coded scheme in all the simulated cases, where the latter is adopted in many existing communication systems.

cs.IT↗

Polar Coded HARQ Scheme with Chase Combining

A hybrid automatic repeat request scheme with Chase combing (HARQ-CC) of polar codes is proposed. The existing analysis tools of the underlying rate-compatible punctured polar (RCPP) codes for additive white Gaussian noise (AWGN) channels are extended to Rayleigh fading channels. Then, an approximation bound of the throughput efficiency for the polar coded HARQ-CC scheme is derived. Utilizing this bound, the parameter configurations of the proposed scheme can be optimized. Simulation results show that, the proposed HARQ-CC scheme under a low-complexity SC decoding is only about $1.0$dB away from the existing schemes with incremental redundancy (\mbox{HARQ-IR}). Compared with the polar coded \mbox{HARQ-IR} scheme, the proposed HARQ-CC scheme requires less retransmissions and has the advantage of good compatibility to other communication techniques.

cs.IT↗

Low-Complexity Sphere Decoding of Polar Codes based on Optimum Path Metric

Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere are enumerated and the radius is decreased gradually until no available candidate is in the sphere. In order to reduce the complexity of SD, a stack SD (SSD) algorithm with an efficient enumeration is proposed in this paper. Based on a novel path metric, SSD can effectively narrow the search range when enumerating the candidates within a sphere. The proposed metric follows an exact ML rule and takes the full usage of the whole received sequence. Furthermore, another very simple metric is provided as an approximation of the ML metric in the high signal-to-noise ratio regime. For short polar codes, simulation results over the additive white Gaussian noise channels show that the complexity of SSD based on the proposed metrics is up to 100 times lower than that of the conventional SD.

cs.IT↗

Polar Coded Modulation with Optimal Constellation Labeling

A practical $2^m$-ary polar coded modulation (PCM) scheme with optimal constellation labeling is proposed. To efficiently find the optimal labeling rule, the search space is reduced by exploiting the symmetry properties of the channels. Simulation results show that the proposed PCM scheme can outperform the bit-interleaved turbo coded modulation scheme used in the WCDMA (Wideband Code Division Multiple Access) mobile communication systems by up to 1.5dB.

cs.IT↗

A Hybrid ARQ Scheme Based on Polar Codes

A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (\mbox{RCP}) codes are proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes. Simulation results over binary-input additive white Gaussian noise channels (BAWGNCs) show that, using a low-complexity successive cancellation (SC) decoder, the proposed HARQ scheme performs as well as the existing schemes based on turbo codes and low-density parity-check (LDPC) codes. The proposed transmission scheme is only about 1.0-1.5dB away from the channel capacity with the information block length of 1024 bits.

cs.IT↗

Improved Successive Cancellation Decoding of Polar Codes

As improved versions of successive cancellation (SC) decoding algorithm, successive cancellation list (SCL) decoding and successive cancellation stack (SCS) decoding are used to improve the finite-length performance of polar codes. Unified descriptions of SC, SCL and SCS decoding algorithms are given as path searching procedures on the code tree of polar codes. Combining the ideas of SCL and SCS, a new decoding algorithm named successive cancellation hybrid (SCH) is proposed, which can achieve a better trade-off between computational complexity and space complexity. Further, to reduce the complexity, a pruning technique is proposed to avoid unnecessary path searching operations. Performance and complexity analysis based on simulations show that, with proper configurations, all the three improved successive cancellation (ISC) decoding algorithms can have a performance very close to that of maximum-likelihood (ML) decoding with acceptable complexity. Moreover, with the help of the proposed pruning technique, the complexities of ISC decoders can be very close to that of SC decoder in the moderate and high signal-to-noise ratio (SNR) regime.

cs.IT↗

The $\ell_{1}$-norm in quantum information via the approach of Yang-Baxter Equation

The role of $\ell_{1}$-norm in Quantum Mechanics (QM) has been studied through Wigner's D-functions where $\ell_{1}$-norm means $\sum_{i}\left|C_{i}\right|$ for $\left|Ψ\right\rangle =\sum_{i}C_{i}\left|ψ_{i}\right\rangle $ if $\left|ψ_{i}\right\rangle $ are uni-orthogonal and normalized basis. It was shown that the present two types of transformation matrix acting on the natural basis in physics consist in an unified braiding matrix, which can be viewed as a particular solution of the Yang-Baxter equation (YBE). The maximum of the $\ell_{1}$-norm is connected with the maximally entangled states and topological quantum field theory (TQFT) with two-component anyons while the minimum leads to the permutation for fermions or bosons.

quant-ph↗

The geodesic form of light-ray trace in the inhomogeneous media

The canonical equations of the optical cloaking proposed by Shurig, Pendry and Smith has been proved to be equivalent to the geodesic in a 3-dimensional curved space. Carrying out the argument we extend to the 4-dimensional Riemannian space where the extra time item appears as the potential term in the canonical equations. The physical meaning of the results is interpreted.

physics.optics↗

Criteria on Utility Designing of Convex Optimization in FDMA Networks

In this paper, we investigate the network utility maximization problem in FDMA systems. We summarize with a suite of criteria on designing utility functions so as to achieve the global optimization convex. After proposing the general form of the utility functions, we present examples of commonly used utility function forms that are consistent with the criteria proposed in this paper, which include the well-known proportional fairness function and the sigmoidal-like functions. In the second part of this paper, we use numerical results to demonstrate a case study based on the criteria mentioned above, which deals with the subcarrier scheduling problem with dynamic rate allocation in FDMA system.

cs.NI↗

Performance Comparison of Cooperative and Distributed Spectrum Sensing in Cognitive Radio

In this paper, we compare the performances of cooperative and distributed spectrum sensing in wireless sensor networks. After introducing the basic problem, we describe two strategies: 1) a cooperative sensing strategy, which takes advantage of cooperation diversity gain to increase probability of detection and 2) a distributed sensing strategy, which by passing the results in an inter-node manner increases energy efficiency and fairness among nodes. Then, we compare the performances of the strategies in terms of three criteria: agility, energy efficiency, and robustness against SNR changes, and summarize the comparison. It shows that: 1) the non-cooperative strategy has the best fairness of energy consumption, 2) the cooperative strategy leads to the best agility, and 3) the distributed strategy leads to the lowest energy consumption and the best robustness against SNR changes.

cs.NI↗

A Heuristic Scheduling Scheme in Multiuser OFDMA Networks

Conventional heterogeneous-traffic scheduling schemes utilize zero-delay constraint for real-time services, which aims to minimize the average packet delay among real-time users. However, in light or moderate load networks this strategy is unnecessary and leads to low data throughput for non-real-time users. In this paper, we propose a heuristic scheduling scheme to solve this problem. The scheme measures and assigns scheduling priorities to both real-time and non-real-time users, and schedules the radio resources for the two user classes simultaneously. Simulation results show that the proposed scheme efficiently handles the heterogeneous-traffic scheduling with diverse QoS requirements and alleviates the unfairness between real-time and non-real-time services under various traffic loads.

cs.NI↗

Non-uniform Black Strings with Schwarzschild-(Anti-)de Sitter Foliation

We present some exact non-uniform black string solutions of 5-dimensional pure Einstein gravity as well as Einstein-Maxwell-dilaton theory at arbitrary dilaton coupling. The solutions share the common property that their 4-dimensional slices are Schwarzchild-(anti-)de Sitter spacetimes. The pure gravity solution is also generalized to spacetimes of dimensions higher than 5 to get non-uniform black branes.

hep-th↗