arXiv subjects

Shengli Zhang

Publications and source records attributed to Shengli Zhang.

At least 109 records · Page 6Linked to original sources

arXiv2013

Mapping and Coding Design for Channel Coded Physical-layer Network Coding

Although BICM can significantly improves the BER performance by iteration processing between the demapping and the decoding in a traditional receiver, its design and performance in PNC system has fewer studied. This paper investigates a bit interleaved coded modulation (BICM) scheme in a Gaussian two-way relay channel operated with physical layer network coding (PNC). In particular, we first present an iterative demapping and decoding framework specially designed for PNC. After that, we compare different constellation mapping schemes in this framework, with the convergence analysis by using the EXIT chart. It is found that the anti-Gray mapping outperforms the Gray mapping, which is the best mapping in the traditional decoding schemes. Finally, the numerical simulation shows the better performance of our framework and verifies the mapping design.

cs.IT↗

arXiv2013

Secrecy Rate Study in Two-Hop Relay Channel with Finite Constellations

Two-hop security communication with an eavesdropper in wireless environment is a hot research direction. The basic idea is that the destination, simultaneously with the source, sends a jamming signal to interfere the eavesdropper near to or co-located with the relay. Similar as physical layer network coding, the friendly jamming signal will prevent the eavesdropper from detecting the useful information originated from the source and will not affect the destination on detecting the source information with the presence of the known jamming signal. However, existing investigations are confined to Gaussian distributed signals, which are seldom used in real systems. When finite constellation signals are applied, the behavior of the secrecy rate becomes very different. For example, the secrecy rate depends on phase difference between the input signals with finite constellations, which is not observed with Gaussian signals. In this paper, we investigate the secrecy capacity and derive its upper bound for the two-hop relay model, by assuming an eavesdropper near the relay and the widely used M-PSK modulation. With our upper bound, the best and worst phase differences in high SNR region are then given. Numerical studies verify our analysis and show that the derived upper bound is relatively tight.

cs.IT↗

arXiv2013

Throughput Analysis of CSMA Wireless Networks with Finite Offered-load

This paper proposes an approximate method, equivalent access intensity (EAI), for the throughput analysis of CSMA wireless networks in which links have finite offered-load and their MAC-layer transmit buffers may be empty from time to time. Different from prior works that mainly considered the saturated network, we take into account in our analysis the impacts of empty transmit buffers on the interactions and dependencies among links in the network that is more common in practice. It is known that the empty transmit buffer incurs extra waiting time for a link to compete for the channel airtime usage, since when it has no packet waiting for transmission, the link will not perform channel competition. The basic idea behind EAI is that this extra waiting time can be mapped to an equivalent "longer" backoff countdown time for the unsaturated link, yielding a lower link access intensity that is defined as the mean packet transmission time divided by the mean backoff countdown time. That is, we can compute the "equivalent access intensity" of an unsaturated link to incorporate the effects of the empty transmit buffer on its behavior of channel competition. Then, prior saturated ideal CSMA network (ICN) model can be adopted for link throughput computation. Specifically, we propose an iterative algorithm, "Compute-and-Compare", to identify which links are unsaturated under current offered-load and protocol settings, compute their "equivalent access intensities" and calculate link throughputs. Simulation shows that our algorithm has high accuracy under various offered-load and protocol settings. We believe the ability to identify unsaturated links and compute links throughputs as established in this paper will serve an important first step toward the design and optimization of general CSMA wireless networks with offered-load control.

cs.NI↗

arXiv2012

Faraday rotation effect in periodic graphene structure

We report the magneto-optical rotation effect in a periodic graphene-sheet structure. Due to the masslessness of carriers in graphene, the magnetic response is very sensitive and the magneto-optical rotation effect is therefore significant. We predict that the Verdet constant of the periodic graphene-sheet structure is roughly 10-100 times that of rare-earth-doped magneto-optical glass in the infrared region.

cond-mat.mes-hall↗

arXiv2012

MIMO Physical Layer Network Coding Based on VBLAST Detection

For MIMO two-way relay channel, this paper proposes a novel scheme, VBLAST-PNC, to transform the two superimposed packets received by the relay to their network coding form. Different from traditional schemes, which tries to detect each packet before network coding them, VBLAST-PNC detects the summation of the two packets before network coding. In particular, after firstly detecting the second layer signal in 2-by-2 MIMO system with VBLAST, we only cancel part of the detected signal, rather than canceling all the components, from the first layer. Then we directly map the obtained signal, summation of the first layer and the second layer, to their network coding form. With such partial interference cancellation, the error propagation effect is mitigated and the performance is thus improved as shown in simulations.

cs.IT↗

arXiv2011

Blind Known Interference Cancellation

This paper investigates interference-cancellation schemes at the receiver, in which the original data of the interference is known a priori. Such a priori knowledge is common in wireless relay networks. For example, a transmitting relay could be relaying data that was previously transmitted by a node, in which case the interference received by the node now is actually self information. Besides the case of self information, the node could also have overheard or received the interference data in a prior transmission by another node. Directly removing the known interference requires accurate estimate of the interference channel, which may be difficult in many situations. In this paper, we propose a novel scheme, Blind Known Interference Cancellation (BKIC), to cancel known interference without interference channel information. BKIC consists of two steps. The first step combines adjacent symbols to cancel the interference, exploiting the fact that the channel coefficients are almost the same between successive symbols. After such interference cancellation, however, the signal of interest is also distorted. The second step recovers the signal of interest amidst the distortion. We propose two algorithms for the critical second steps. The first algorithm (BKIC-S) is based on the principle of smoothing. It is simple and has near optimal performance in the slow fading scenario. The second algorithm (BKIC-RBP) is based on the principle of real-valued belief propagation. It can achieve MAP-optimal performance with fast convergence, and has near optimal performance even in the fast fading scenario. Both BKIC schemes outperform the traditional self-interference cancellation schemes with perfect initial channel information by a large margin, while having lower complexities.

cs.IT↗

arXiv2011

Non-memoryless Analog Network Coding in Two-Way Relay Channel

Physical-layer Network Coding (PNC) can significantly improve the throughput of two-way relay channels. An interesting variant of PNC is Analog Network Coding (ANC). Almost all ANC schemes proposed to date, however, operate in a symbol by symbol manner (memoryless) and cannot exploit the redundant information in channel-coded packets to enhance performance. This paper proposes a non-memoryless ANC scheme. In particular, we design a soft-input soft-output decoder for the relay node to process the superimposed packets from the two end nodes to yield an estimated MMSE packet for forwarding back to the end nodes. Our decoder takes into account the correlation among different symbols in the packets due to channel coding, and provides significantly improved MSE performance. Our analysis shows that the SNR improvement at the relay node is lower bounded by 1/R (R is the code rate) with the simplest LDPC code (repeat code). The SNR improvement is also verified by numerical simulation with LDPC code. Our results indicate that LDPC codes of different degrees are preferred in different SNR regions. Generally speaking, smaller degrees are preferred for lower SNRs.

cs.IT↗

arXiv2011

Optimal Decoding Algorithm for Asynchronous Physical-Layer Network Coding

A key issue in physical-layer network coding (PNC) is how to deal with the asynchrony between signals transmitted by multiple transmitters. That is, symbols transmitted by different transmitters could arrive at the receiver with symbol misalignment as well as relative carrier-phase offset. In this paper, 1) we propose and investigate a general framework based on belief propagation (BP) that can effectively deal with symbol and phase asynchronies; 2) we show that for BPSK and QPSK modulations, our BP method can significantly reduce the SNR penalty due to asynchrony compared with prior methods; 3) we find that symbol misalignment makes the system performance less sensitive and more robust against carrier-phase offset. Observation 3) has the following practical implication. It is relatively easier to control symbol timing than carrier-phase offset. Our results indicate that if we could control the symbol offset in PNC, it would actually be advantageous to deliberately introduce symbol misalignment to desensitize the system to phase offset.

cs.IT↗

arXiv2011

Physical-Layer Network Coding: Tutorial, Survey, and Beyond

The concept of physical-layer network coding (PNC) was proposed in 2006 for application in wireless networks. Since then it has developed into a subfield of network coding with wide followings. The basic idea of PNC is to exploit the network coding operation that occurs naturally when electromagnetic (EM) waves are superimposed on one another. This simple idea turns out to have profound and fundamental ramifications. Subsequent works by various researchers have led to many new results in the domains of 1) wireless communication; 2) wireless information theory; and 3) wireless networking. The purpose of this paper is fourfold. First, we give a brief tutorial on the basic concept of PNC. Second, we survey and discuss recent key results in the three aforementioned areas. Third, we examine a critical issue in PNC: synchronization. It has been a common belief that PNC requires tight synchronization. Our recent results suggest, however, that PNC may actually benefit from asynchrony. Fourth, we propose that PNC is not just for wireless networks; it can also be useful in optical networks. We provide an example showing that the throughput of a passive optical network (PON) could potentially be raised by 100% with PNC.

cs.NI↗

arXiv2011

Implementation of Physical-layer Network Coding

This paper presents the first implementation of a two-way relay network based on the principle of physical-layer network coding. To date, only a simplified version of physical-layer network coding (PNC) method, called analog network coding (ANC), has been successfully implemented. The advantage of ANC is that it is simple to implement; the disadvantage, on the other hand, is that the relay amplifies the noise along with the signal before forwarding the signal. PNC systems in which the relay performs XOR or other denoising PNC mappings of the received signal have the potential for significantly better performance. However, the implementation of such PNC systems poses many challenges. For example, the relay must be able to deal with symbol and carrier-phase asynchronies of the simultaneous signals received from the two end nodes, and the relay must perform channel estimation before detecting the signals. We investigate a PNC implementation in the frequency domain, referred to as FPNC, to tackle these challenges. FPNC is based on OFDM. In FPNC, XOR mapping is performed on the OFDM samples in each subcarrier rather than on the samples in the time domain. We implement FPNC on the universal soft radio peripheral (USRP) platform. Our implementation requires only moderate modifications of the packet preamble design of 802.11a/g OFDM PHY. With the help of the cyclic prefix (CP) in OFDM, symbol asynchrony and the multi-path fading effects can be dealt with in a similar fashion. Our experimental results show that symbol-synchronous and symbol-asynchronous FPNC have essentially the same BER performance, for both channel-coded and unchannel-coded FPNC.

cs.NI↗

arXiv2010

Channel-coded Collision Resolution by Exploiting Symbol Misalignment

In random-access networks, such as the IEEE 802.11 network, different users may transmit their packets simultaneously, resulting in packet collisions. Traditionally, the collided packets are simply discarded. To improve performance, advanced signal processing techniques can be applied to extract the individual packets from the collided signals. Prior work of ours has shown that the symbol misalignment among the collided packets can be exploited to improve the likelihood of successfully extracting the individual packets. However, the failure rate is still unacceptably high. This paper investigates how channel coding can be used to reduce the failure rate. We propose and investigate a decoding scheme that incorporates the exploitation of the aforementioned symbol misalignment into the channel decoding process. This is a fine-grained integration at the symbol level. In particular, collision resolution and channel decoding are applied in an integrated manner. Simulation results indicate that our method outperforms other schemes, including the straightforward method in which collision resolution and channel coding are applied separately.

cs.IT↗

arXiv2010

The Modulation of de Haas-van Alphen Effect in Graphene by Electric Field

This paper is to explore the de Haas-van Alphen effect $(dHvA)$ of graphene in the presence of an in-plane uniform electric field. Three major findings are yielded. First of all, the electric field is found to modulate the de Haas-van Alphen magnetization and magnetic susceptibility through the dimensionless parameter $(β=\frac{E}{\upsilon_{F}B})$. As the parameter $β$ increases, the values of magnetization and magnetic susceptibility increase to positive infinity or decrease to negative infinity at the exotic point $β_{c}=1$. Besides, the $dHvA$ oscillation amplitude rises abruptly to infinity for zero temperature at $β_{c}=1$, but eventually collapses at a finite temperature thereby leading to the vanishing of de Haas-van Alphen effect. In addition, the magnetic susceptibility depends on the electric and magnetic fields, suggesting that the graphene should be a non-linear magnetic medium in the presence of the external field. These results, which are different from those obtained in the standard nonrelativistic 2D electron gas, are attributed to its anomalous Landau level spectrum in graphene.

cond-mat.mes-hall↗

arXiv2010

Quantum transport in a curved one-dimensional quantum wire with spin-orbit interactions

The one-dimensional effective Hamiltonian for a planar curvilinear quantum wire with arbitrary shape is proposed in the presence of the Rashba spin-orbit interaction. Single electron propagation through a device of two straight lines conjugated with an arc has been investigated and the analytic expressions of the reflection and transmission probabilities have been derived. The effects of the device geometry and the spin-orbit coupling strength $α$ on the reflection and transmission probabilities and the conductance are investigated in the case of spin polarized electron incidence. We find that no spin-flip exists in the reflection of the first junction. The reflection probabilities are mainly influenced by the arc angle and the radius, while the transmission probabilities are affected by both spin-orbit coupling and the device geometry. The probabilities and the conductance take the general behavior of oscillation versus the device geometry parameters and $α$. Especially the electron transportation varies periodically versus the arc angle $θ_{w}$. We also investigate the relationship between the conductance and the electron energy, and find that electron resonant transmission occurs for certain energy. Finally, the electron transmission for the incoming electron with arbitrary state is considered. For the outgoing electron, the polarization ratio is obtained and the effects of the incoming electron state are discussed. We find that the outgoing electron state can be spin polarization and reveal the polarized conditions.

cond-mat.mes-hall↗

arXiv2010

Anomalous Valley Magnetic Moment of Graphene

Carrier interactions on graphene are studied. The study shows that besides the well known Coulomb repulsion between carriers, there also exist four-fermion interactions associated with U-process, one of which attracts carriers in different valleys. We then calculate the contributions to valley magnetic moment from vertex correction and from four-fermion corrections explicitly. The relative contributions are -18% and 3% respectively. At last we point out that we can mimic heavy quarkonium system by carrier interactions in graphene.

cond-mat.str-el↗

arXiv2010

Physical layer network coding with multiple antennas

The two-phase MIMO NC (network coding) scheme can be used to boost the throughput in a two-way relay channel in which nodes are equipped with multiple antennas. The obvious strategy is for the relay node to extract the individual packets from the two end nodes and mix the two packets to form a network-coded packet. In this paper, we propose a new scheme called MIMO PNC (physical network coding), in which the relay extracts the summation and difference of the two end packets and then converts them to the network-coded form. MIMO PNC is a natural combination of the single-antenna PNC scheme and the linear MIMO detection scheme. The advantages of MIMO PNC are many. First, it removes the stringent carrier-phase requirement in single-antenna PNC. Second, it is linear in complexity with respect to the constellation size and the number of simultaneous data streams in MIMO. Simulation shows that MIMO PNC outperforms the straightforward MIMO NC significantly under random Rayleigh fading channel. Based on our analysis, we further conjecture that MIMO PNC outperforms MIMO NC under all possible realizations of the channel.

cs.NI↗

arXiv2010

Channel Coding and Decoding in a Relay System Operated with Physical layer Network Coding

Physical-layer Network Coding (PNC) can significantly improve the throughput of wireless two way relay channel (TWRC) by allowing the two end nodes to transmit messages to the relay simultaneously. To achieve reliable communication, channel coding could be applied on top of PNC. This paper investigates link-by-link channel-coded PNC, in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes plus noise, Y3=X1+X2+W3, to the network-coded combination of the source packets, S1 XOR S2 . This is in distinct to the traditional multiple-access problem, in which the goal is to obtain S1 and S2 separately. The transformation from Y3 to (S1 XOR S2) is referred to as the Channel-decoding-Network-Coding process (CNC) in that it involves both channel decoding and network coding operations. A contribution of this paper is the insight that in designing CNC, we should first (i) channel-decode Y3 to the superimposed source symbols S1+S2 before (ii) transforming S1+S2 to the network-coded packets (S1 XOR S2) . Compared with previously proposed strategies for CNC, this strategy reduces the channel-coding network-coding mismatch. It is not obvious, however, that an efficient decoder for step (i) exists. A second contribution of this paper is to provide an explicit construction of such a decoder based on the use of the Repeat Accumulate (RA) code. Specifically, we redesign the belief propagation algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity.

cs.NI↗

arXiv2009

Synchronization Analysis in Physical Layer Network Coding

Physical-layer Network Coding (PNC) makes use of the additive nature of the electromagnetic (EM) waves to apply network coding arithmetic at the physical layer. With PNC,the destructive effect of interference in wireless networks is eliminated and the capacity of networks can be boosted significantly. This paper addresses a key outstanding issue in PNC: synchronization among transmitting nodes. We first investigate the impact of imperfect synchronization (i.e., finite synchronization errors) in a 3-node network. It is shown that with QPSK modulation, PNC still yields significantly higher capacity than straightforward network coding when there are synchronization errors. Significantly, this remains to be so even in the extreme case when synchronization is not performed at all. Moving beyond a 3-node network, we propose and investigate a synchronization scheme for PNC in a general chain network. At last, numerical simulation verifies that PNC is robust to synchronization errors. In particular, for the mutual information performance, there is about 0.5dB loss without time synchronization and there is at most 2dB loss without phase synchronization.

cs.NI↗

arXiv2009

Interference with Symbol-misalignment

This paper studies the impact of interference asynchrony among different links in a wireless network. Without deliberate coordination and cooperation among the active links, there is a naturally occurring misalignment between the symbols of the targeted signal of a receiver and the symbols of the interfering signals. Interestingly, we show that the interference asynchrony can actually improve the BER performance, compared with the situation in which symbols of al signals ay aligned. In particular, we show that symbol misalignment can decrease the "effective interference power" and change the distribution of the interfering signals, in a way that results in lower BER. To ensure that symbol misalignment can be consistently attained, we propose two simple schemes that introduce time-varying symbol offsets to obtain an "average" performance of random symbol misalignment. Notably, our schemes do not change the simple receiver design structure; only the transmitters are modified in a minor way.

cs.NI↗