arXiv subjects

Nan Liu

Publications and source records attributed to Nan Liu.

At least 181 records · Page 10Linked to original sources

arXiv2015

Energy-Efficient Data Transmission with A Non-FIFO Packet

This paper investigates the problem of energy-efficient packet transmission with a non-FIFO Packet over a point-to-point additive white Gaussian noise (AWGN) time-invariant channel under the feasibility constraints. More specifically, we consider the scenario where there is a packet that has a deadline that is earlier than that of the previously arrived packet. For this problem, the First-In-First-Out (FIFO) transmission mode adopted in the existing literatures is no longer optimal. We first propose a novel packet split and reorder process which convert the inconsistency in the order of deadlines and arrival instants of the packet sequence into a consistent one. After the split and reorder process, the original problem considered in this paper is transformed into the problem of finding the optimal split factor. We propose an algorithm that finds the split factor which consists of checking four possibilities by applying the existing optimal transmission strategy \emph{"String Tautening"} for FIFO packets. In addition, we prove the optimality of the proposed algorithm in the presence of a non-FIFO packet by exploiting the optimality properties of the most energy efficient transmission strategy. Based on the proposed optimal offline scheme, an efficient online policy which assumes causal arrival information is also studied and shown to achieve a comparable performance to the proposed optimal offline scheme.

cs.NI↗

arXiv2015

Energy Efficiency Optimization for MIMO Distributed Antenna Systems

In this paper, we propose a transmit covariance optimization method to maximize the energy efficiency (EE) for a single-user distributed antenna system, where both the remote access units (RAUs) and the user are equipped with multiple antennas. Unlike previous related works, both the rate requirement and RAU selection are taken into consideration. Here, the total circuit power consumption is related to the number of active RAUs. Given this setup, we first propose an optimal transmit covariance optimization method to solve the EE optimization problem under a fixed set of active RAUs. More specifically, we split this problem into three subproblems, i.e., the rate maximization problem, the EE maximization problem without rate constraint, and the power minimization problem, and each subproblem can be efficiently solved. Then, a novel distance-based RAU selection method is proposed to determine the optimal set of active RAUs. Simulation results show that the performance of the proposed RAU selection is almost identical to the optimal exhaustive search method with significantly reduced computational complexity, and the performance of the proposed algorithm significantly outperforms the existing EE optimization methods.

cs.IT↗

arXiv2015

Energy-Efficient Data Transmission with Non-FIFO Packets

This paper investigates the problem of energy-efficient packet transmission with arbitrary arrival instants and deadline constraints over a point-to-point Additive White Gaussian Noise (AWGN) channel. This is different from previous work where it is assumed that the packets follow a First-In-First-Out (FIFO) order in that the packets that arrive earlier will have a deadline that is also earlier. We first investigate the necessary and sufficient conditions of the optimal transmission scheduler. We then propose an algorithm which finds the transmission schedule of each packet in the order of the packets with the largest transmission rate to the packets with the smallest transmission rate. Finally, we show that our algorithm satisfies the sufficient conditions of the optimal transmission scheduler and thus, is optimal.

cs.NI↗

arXiv2015

The $^{13}C$-pockets in AGB Stars and Their Fingerprints in Mainstream SiC Grains

We identify three isotopic tracers that can be used to constrain the $^{13}C$-pocket and show the correlated isotopic ratios of Sr and Ba in single mainstream presolar SiC grains. These newly measured data can be explained by postprocess AGB model calculations with large $^{13}C$-pockets with a range of relatively low $^{13}C$ concentrations, which may suggest that multiple mixing processes contributed to the $^{13}C$-pocket formation in parent AGB stars.

astro-ph.SR↗

arXiv2015

Correlated Strontium and Barium Isotopic Compositions of Acid-Cleaned Single Silicon Carbides from Murchison

We present strontium, barium, carbon, and silicon isotopic compositions of 61 acid-cleaned presolar SiC grains from Murchison. Comparison with previous data shows that acid washing is highly effective in removing both strontium and barium contamination. For the first time, by using correlated $^{88}Sr$/$^{86}Sr$ and $^{138}Ba$/$^{136}Ba$ ratios in mainstream SiC grains, we are able to resolve the effect of $^{13}C$ concentration from that of $^{13}C$-pocket mass on s-process nucleosynthesis, which points towards the existence of large $^{13}C$-pockets with low $^{13}C$ concentration in AGB stars. The presence of such large $^{13}$R-pockets with a variety of relatively low $^{13}C$ concentrations seems to require multiple mixing processes in parent AGB stars of mainstream SiC grains.

astro-ph.SR↗

arXiv2015

The Gaussian Multiple Access Diamond Channel

In this paper, we study the capacity of the diamond channel. We focus on the special case where the channel between the source node and the two relay nodes are two separate links with finite capacities and the link from the two relay nodes to the destination node is a Gaussian multiple access channel. We call this model the Gaussian multiple access diamond channel. We first propose an upper bound on the capacity. This upper bound is a single-letterization of an $n$-letter upper bound proposed by Traskov and Kramer, and is tighter than the cut-set bound. As for the lower bound, we propose an achievability scheme based on sending correlated codes through the multiple access channel with superposition structure. We then specialize this achievable rate to the Gaussian multiple access diamond channel. Noting the similarity between the upper and lower bounds, we provide sufficient and necessary conditions that a Gaussian multiple access diamond channel has to satisfy such that the proposed upper and lower bounds meet. Thus, for a Gaussian multiple access diamond channel that satisfies these conditions, we have found its capacity.

cs.IT↗

arXiv2014

Selective metal deposition at graphene line defects by atomic layer deposition

One-dimensional defects in graphene have strong influence on its physical properties, such as electrical charge transport and mechanical strength. With enhanced chemical reactivity, such defects may also allow us to selectively functionalize the material and systematically tune the properties of graphene. Here we demonstrate the selective deposition of metal at chemical vapour deposited graphene's line defects, notably grain boundaries, by atomic layer deposition. Atomic layer deposition allows us to deposit Pt predominantly on graphene's grain boundaries, folds, and cracks due to the enhanced chemical reactivity of these line defects, which is directly confirmed by transmission electron microscopy imaging. The selective functionalization of graphene defect sites, together with the nanowire morphology of deposited Pt, yields a superior platform for sensing applications. Using Pt-graphene hybrid structures, we demonstrate high-performance hydrogen gas sensors at room temperatures and show its advantages over other evaporative Pt deposition methods, in which Pt decorates graphene surface non-selectively.

cond-mat.mtrl-sci↗

arXiv2014

Compressing Encrypted Data and Permutation Cipher

In a system that performs both encryption and lossy compression, the conventional way is to compress first and then encrypt the compressed data. This separation approach proves to be optimal. In certain applications where sensitive information should be protected as early as possible, it is preferable to perform encryption first and then compress the encrypted data, which leads to the concept of the reversed system. Johnson et al. proposed an achievability scheme for the reversed system that has a modulo-sum encryption followed by a compression using Wyner-Ziv distributed source coding with side information. However, this reversed system performs worse than the conventional system in the sense that it requires more compression rate and secrecy key rate. In this paper, we propose a new achievability scheme for the reverse system where encryption is conducted by a permutation cipher and then the encrypted data is compressed using the optimal rate-distortion code. The proposed scheme can achieve the optimal compression rate and secret key rate, and therefore shows that reversing the order of encryption and compression does not necessarily compromise the performance of an encryption-compression system. The proposed system attains weak secrecy, and we show that the information leakage is mainly contributed by the type information of the sequence, which is not concealed by the permutation cipher. Given the type of the sequence, the rest of the information leakage vanishes exponentially.

cs.IT↗

arXiv2014

Deception with Side Information in Biometric Authentication Systems

In this paper, we study the probability of successful deception of an uncompressed biometric authentication system with side information at the adversary. It represents the scenario where the adversary may have correlated side information, e.g.,~a partial finger print or a DNA sequence of a relative of the legitimate user. We find the optimal exponent of the deception probability by proving both the achievability and the converse. Our proofs are based on the connection between the problem of deception with side information and the rate distortion problem with side information at both the encoder and decoder.

cs.IT↗

arXiv2014

The 13C-Pocket Structure in AGB Models: Constraints from Zirconium Isotope Abundances in Single Mainstream SiC Grains

We present postprocess AGB nucleosynthesis models with different $^{13}$C-pocket internal structures to better explain zirconium isotope measurements in mainstream presolar SiC grains by Nicolussi et al. (1997) and Barzyk et al. (2007). We show that higher-than-solar $^{92}$Zr/$^{94}$Zr ratios can be predicted by adopting a $^{13}$C-pocket with a flat $^{13}$C profile, instead of the previous decreasing-with-depth $^{13}$C profile. The improved agreement between grain data for zirconium isotopes and AGB models provides additional support for a recent proposal of a flat $^{13}$C profile based on barium isotopes in mainstream SiC grains by Liu et al. (2014).

astro-ph.SR↗

arXiv2014

Barium Isotopic Composition of Mainstream Silicon Carbides from Murchison: Constraints for s-Process Nucleosynthesis in AGB Stars

We present barium, carbon, and silicon isotopic compositions of 38 acid-cleaned presolar SiC grains from Murchison. Comparison with previous data shows that acid washing is highly effective in removing barium contamination. Strong depletions in $δ$($^{138}$Ba/$^{136}$Ba) values are found, down to $-$400 permil, which can only be modeled with a flatter $^{13}$C profile within the $^{13}$C pocket than is normally used. The dependence of $δ$($^{138}$Ba/$^{136}$Ba) predictions on the distribution of $^{13}$C within the pocket in AGB models allows us to probe the $^{13}$C profile within the $^{13}$C pocket and the pocket mass in asymptotic giant branch (AGB) stars. In addition, we provide constraints on the $^{22}$Ne$(α,n)^{25}$Mg rate in the stellar temperature regime relevant to AGB stars, based on $δ$($^{134}$Ba/$^{136}$Ba) values of mainstream grains. We found two nominally mainstream grains with strongly negative $δ$($^{134}$Ba/$^{136}$Ba) values that cannot be explained by any of the current AGB model calculations. Instead, such negative values are consistent with the intermediate neutron capture process ($i$-process), which is activated by the Very Late Thermal Pulse (VLTP) during the post-AGB phase and characterized by a neutron density much higher than the $s$-process. These two grains may have condensed around post-AGB stars. Finally, we report abundances of two $p$-process isotopes, $^{130}$Ba and $^{132}$Ba, in single SiC grains. These isotopes are destroyed in the $s$-process in AGB stars. By comparing their abundances with respect to that of $^{135}$Ba, we conclude that there is no measurable decay of $^{135}$Cs ($t_{1/2}$= 2.3 Ma) to $^{135}$Ba in individual SiC grains, indicating condensation of barium, but not cesium into SiC grains before $^{135}$Cs decayed.

astro-ph.SR↗

arXiv2012

Capacity Bounds and Exact Results for the Cognitive Z-interference Channel

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide an upper bound on the capacity of this channel. We then show that, when the channel of the transmitter-receiver pair that does not experience interference is deterministic, our proposed upper bound matches the known lower bound provided by Cao and Chen in 2008. The obtained results imply that, unlike in the Gaussian cognitive ZIC, in the considered channel superposition encoding at the non-cognitive transmitter as well as Gel'fand-Pinsker encoding at the cognitive transmitter are needed in order to minimize the impact of interference. As a byproduct of the obtained capacity region, we obtain the capacity under the generalized Gel'fand-Pinsker conditions where a transmitter-receiver pair communicates in the presence of interference noncausally known at the encoder.

cs.IT↗

arXiv2008

The Capacity Region of the Cognitive Z-interference Channel with One Noiseless Component

We study the discrete memoryless Z-interference channel (ZIC) where the transmitter of the pair that suffers from interference is cognitive. We first provide upper and lower bounds on the capacity of this channel. We then show that, when the channel of the transmitter-receiver pair that does not face interference is noiseless, the two bounds coincide and therefore yield the capacity region. The obtained results imply that, unlike in the Gaussian cognitive ZIC, in the considered channel superposition encoding at the non-cognitive transmitter as well as Gel'fand-Pinsker encoding at the cognitive transmitter are needed in order to minimize the impact of interference. As a byproduct of the obtained capacity region, we obtain the capacity result for a generalized Gel'fand-Pinsker problem.

cs.IT↗

arXiv2008

Interference Channels with Correlated Receiver Side Information

The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source, it is shown that source-channel code separation is optimal. When each receiver has side information correlated with the interfering source, sufficient conditions for reliable transmission are provided based on a joint source-channel coding scheme using the superposition encoding and partial decoding idea of Han and Kobayashi. When the receiver side information is a deterministic function of the interfering source, source-channel code separation is again shown to be optimal. As a special case, for a class of Z-interference channels, when the side information of the receiver facing interference is a deterministic function of the interfering source, necessary and sufficient conditions for reliable transmission are provided in the form of single letter expressions. As a byproduct of these joint source-channel coding results, the capacity region of a class of Z-channels with degraded message sets is also provided.

cs.IT↗

arXiv2008

Capacity Regions and Bounds for a Class of Z-interference Channels

We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A channel in this class has the property that, for the transmitter-receiver pair that suffers from interference, the conditional output entropy at the receiver is invariant with respect to the transmitted codewords. We compare the new capacity region upper bound with the Han/Kobayashi achievable rate region for interference channels. This comparison shows that our bound is tight in some cases, thereby yielding specific points on the capacity region as well as sum capacity for certain Z-interference channels. In particular, this result can be used as an alternate method to obtain sum capacity of Gaussian Z-interference channels. We then apply an additional restriction on our channel class: the transmitter-receiver pair that suffers from interference achieves its maximum output entropy with a single input distribution irrespective of the interference distribution. For these channels we show that our new capacity region upper bound coincides with the Han/Kobayashi achievable rate region, which is therefore capacity-achieving. In particular, for these channels superposition encoding with partial decoding is shown to be optimal and a single-letter characterization for the capacity region is obtained.

cs.IT↗

arXiv2007

Towards the Secrecy Capacity of the Gaussian MIMO Wire-tap Channel: The 2-2-1 Channel

We find the secrecy capacity of the 2-2-1 Gaussian MIMO wire-tap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy capacity of this channel by proposing an achievable scheme and then developing a tight upper bound that meets the proposed achievable secrecy rate. We show that, for this channel, Gaussian signalling in the form of beam-forming is optimal, and no pre-processing of information is necessary.

cs.IT↗

arXiv2006

Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation

We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements from an underlying random process, code and transmit those measurement samples to a collector node in a cooperative multiple access channel with potential feedback, and reconstruct the entire random process at the collector node. We provide lower and upper bounds for the minimum achievable expected distortion when the underlying random process is Gaussian. When the Gaussian random process satisfies some general conditions, we evaluate the lower and upper bounds explicitly, and show that they are of the same order for a wide range of power constraints. Thus, for these random processes, under these power constraints, we express the minimum achievable expected distortion as a function of the power constraint. Further, we show that the achievability scheme that achieves the lower bound on the distortion is a separation-based scheme that is composed of multi-terminal rate-distortion coding and amplify-and-forward channel coding. Therefore, we conclude that separation is order-optimal for the dense Gaussian sensor network scenario under consideration, when the underlying random process satisfies some general conditions.

cs.IT↗

arXiv2006

The Capacity Region of a Class of Discrete Degraded Interference Channels

We provide a single-letter characterization for the capacity region of a class of discrete degraded interference channels (DDICs). The class of DDICs considered includes the discrete additive degraded interference channel (DADIC) studied by Benzel. We show that for the class of DDICs studied, encoder cooperation does not increase the capacity region, and therefore, the capacity region of the class of DDICs is the same as the capacity region of the corresponding degraded broadcast channel.

cs.IT↗