arXiv subjects

Chau Yuen

Publications and source records attributed to Chau Yuen.

At least 559 records · Page 31Linked to original sources

arXiv2012

Outage Probability of Dual-Hop Multiple Antenna AF Relaying Systems with Interference

This paper presents an analytical investigation on the outage performance of dual-hop multiple antenna amplify-and-forward relaying systems in the presence of interference. For both the fixed-gain and variable-gain relaying schemes, exact analytical expressions for the outage probability of the systems are derived. Moreover, simple outage probability approximations at the high signal to noise ratio regime are provided, and the diversity order achieved by the systems are characterized. Our results suggest that variable-gain relaying systems always outperform the corresponding fixed-gain relaying systems. In addition, the fixed-gain relaying schemes only achieve diversity order of one, while the achievable diversity order of the variable-gain relaying scheme depends on the location of the multiple antennas.

cs.IT↗

arXiv2012

Exchanging Third-Party Information with Minimum Transmission Cost

In this paper, we consider the problem of minimizing the total transmission cost for exchanging channel state information. We proposed a network coded cooperative data exchange scheme, such that the total transmission cost is minimized while each client can decode all the channel information held by all other clients. In this paper, we first derive a necessary and sufficient condition for a feasible transmission. Based on the derived condition, there exists a feasible code design to guarantee that each client can decode the complete information. We further formulate the problem of minimizing the total transmission cost as an integer linear programming. Finally, we discuss the probability that each client can decode the complete information with distributed random linear network coding.

cs.IT↗

arXiv2012

Beamforming in Two-Way Fixed Gain Amplify-and-Forward Relay Systems with CCI

We analyze the outage performance of a two-way fixed gain amplify-and-forward (AF) relay system with beamforming, arbitrary antenna correlation, and co-channel interference (CCI). Assuming CCI at the relay, we derive the exact individual user outage probability in closed-form. Additionally, while neglecting CCI, we also investigate the system outage probability of the considered network, which is declared if any of the two users is in transmission outage. Our results indicate that in this system, the position of the relay plays an important role in determining the user as well as the system outage probability via such parameters as signal-to-noise imbalance, antenna configuration, spatial correlation, and CCI power. To render further insights into the effect of antenna correlation and CCI on the diversity and array gains, an asymptotic expression which tightly converges to exact results is also derived.

cs.IT↗

arXiv2011

Joint Rate Selection and Wireless Network Coding for Time Critical Applications

In this paper, we dynamically select the transmission rate and design wireless network coding to improve the quality of services such as delay for time critical applications. With low transmission rate, and hence longer transmission range, more packets may be encoded together, which increases the coding opportunity. However, low transmission rate may incur extra transmission delay, which is intolerable for time critical applications. We design a novel joint rate selection and wireless network coding (RSNC) scheme with delay constraint, so as to minimize the total number of packets that miss their deadlines at the destination nodes. We prove that the proposed problem is NPhard, and propose a novel graph model and transmission metric which consider both the heterogenous transmission rates and the packet deadline constraints during the graph construction. Using the graph model, we mathematically formulate the problem and design an efficient algorithm to determine the transmission rate and coding strategy for each transmission. Finally, simulation results demonstrate the superiority of the RSNC scheme.

cs.NI↗

arXiv2011

Block-Orthogonal Space-Time Code Structure and Its Impact on QRDM Decoding Complexity Reduction

Full-rate space time codes (STC) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant decoding complexity reduction without performance loss. We show that such complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate BOSTC (Block-Orthogonal STC) that further maximize the QRDM complexity reduction potential. Simulation results of bit error rate (BER) performance against decoding complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-complexity mode, and the code exhibits a desirable complexity saturation property.

cs.IT↗

arXiv2011

Optimization of Fast-Decodable Full-Rate STBC with Non-Vanishing Determinants

Full-rate STBC (space-time block codes) with non-vanishing determinants achieve the optimal diversity-multiplexing tradeoff but incur high decoding complexity. To permit fast decoding, Sezginer, Sari and Biglieri proposed an STBC structure with special QR decomposition characteristics. In this paper, we adopt a simplified form of this fast-decodable code structure and present a new way to optimize the code analytically. We show that the signal constellation topology (such as QAM, APSK, or PSK) has a critical impact on the existence of non-vanishing determinants of the full-rate STBC. In particular, we show for the first time that, in order for APSK-STBC to achieve non-vanishing determinant, an APSK constellation topology with constellation points lying on square grid and ring radius $\sqrt{m^2+n^2} (m,n\emph{\emph{integers}})$ needs to be used. For signal constellations with vanishing determinants, we present a methodology to analytically optimize the full-rate STBC at specific constellation dimension.

cs.IT↗

arXiv2010

On Two-way Communications for Cooperative Multiple Source Pairs Through a Multi-antenna Relay

We study amplified-and-forward (AF)-based two-way relaying (TWR) with multiple source pairs, which are exchanging information through the relay. Each source has single antenna and the relay has multi-antenna. The optimal beamforming matrix structure that achieves maximum signal-to-interference-plus-noise ratio (SINR) for TWR with multiple source pairs is derived. We then present two new non-zero-forcing based beamforming schemes for TWR, which take into consideration the tradeoff between preserving the desired signals and suppressing inter-pair interference between different source pairs. Joint grouping and beamforming scheme is proposed to achieve a better signal-to-interference-plus-noise ratio (SINR) when the total number of source pairs is large and the signal-to-noise ratio (SNR) at the relay is low.

cs.IT↗

arXiv2010

Group-Decodable Space-Time Block Codes with Code Rate > 1

High-rate space-time block codes (STBC with code rate > 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since group-decodable (quasi-orthogonal) code structure can reduce the decoding complexity, we present in this paper systematic methods to construct group-decodable high-rate STBC with full symbol-wise diversity gain for arbitrary transmit antenna number and code length. We show that the proposed group-decodable STBC can achieve high code rate that increases almost linearly with the transmit antenna number, and the slope of this near-linear dependence increases with the code length. Comparisons with existing low-rate and high-rate codes (such as orthogonal STBC and algebraic STBC) are conducted to show the decoding complexity reduction and good code performance achieved by the proposed codes.

cs.IT↗

arXiv2010

Average Sum-Rate of Distributed Alamouti Space--Time Scheme in Two-Way Amplify-and-Forward Relay Networks

In this paper, we propose a distributed Alamouti space-time code (DASTC) for two-way relay networks employing a single amplify-and-forward (AF) relay. We first derive closed-form expressions for the approximated average sum-rate of the proposed DASTC scheme. Our analysis is validated by a comparison against the results of Monte-Carlo simulations. Numerical results verify the effectiveness of our proposed scheme over the conventional DASTC with one-way communication.

cs.IT↗

arXiv2010

Double-Directional Information Azimuth Spectrum and Relay Network Tomography for a Decentralized Wireless Relay Network

A novel channel representation for a two-hop decentralized wireless relay network (DWRN) is proposed, where the relays operate in a completely distributive fashion. The modeling paradigm applies an analogous approach to the description method for a double-directional multipath propagation channel, and takes into account the finite system spatial resolution and the extended relay listening/transmitting time. Specifically, the double-directional information azimuth spectrum (IAS) is formulated to provide a compact representation of information flows in a DWRN. The proposed channel representation is then analyzed from a geometrically-based statistical modeling perspective. Finally, we look into the problem of relay network tomography (RNT), which solves an inverse problem to infer the internal structure of a DWRN by using the instantaneous doubledirectional IAS recorded at multiple measuring nodes exterior to the relay region.

cs.IT↗

arXiv2008

Multi-User SISO Precoding based on Generalized Multi-Unitary Decomposition for Single-carrier Transmission in Frequency Selective Channel

In this paper, we propose to exploit the richly scattered multi-path nature of a frequency selective channel to provide additional degrees of freedom for desigining effective precoding schemes for multi-user communications. We design the precoding matrix for multi-user communications based on the Generalized Multi-Unitary Decomposition (GMUD), where the channel matrix H is transformed into P_i*R_r*Q_i^H. An advantage of GMUD is that multiple pairs of unitary matrices P_i and Q_i can be obtained with one single R_r. Since the column of Q_i can be used as the transmission beam of a particular user, multiple solutions of Q_i provide a large selection of transmission beams, which can be exploited to achieve high degrees of orthogonality between the multipaths, as well as between the interfering users. Hence the proposed precoding technique based on GMUD achieves better performance than precoding based on singular value decomposition.

cs.IT↗

arXiv2008

Four-node Relay Network with Bi-directional Traffic Employing Wireless Network Coding with Pre-cancellation

Network coding has the potential to improve the overall throughput of a network by combining different streams of data and forwarding them. In wireless networks, the wireless channel provide an excellent medium for physical layer network coding as signals from different transmitters are combined automatically by the wireless channel. In such scenarios, it would be interesting to investigate protocols and algorithms which can optimally relay information. In this paper, we look at a four-node two-way or bidirectional relay network, and propose a relay protocol which can relay information efficiently in this network.

cs.IT↗

arXiv2008

Bi-Directional Multi-Antenna Relay Communications with Wireless Network Coding

In this paper, we consider a two-way or bidirectional communications system with a relay equipped with multiple antennas. We show that when the downlink channel state information is not known at the relay, the benefit of having additional antennas at the relay can only be obtained by using decode and forward (DF) but not amplify and forward (AF). The gain becomes significant when we employ transmit diversity together with wireless network coding. We also demonstrate how the performance of such system can be improved by performing antenna selection at the relay. Our results show that if downlink channel state information is known at the relay, network coding may not provide additional gain than simple antenna selection scheme.

cs.IT↗

arXiv2008

Comparative Study of SVD and QRS in Closed-Loop Beamforming Systems

We compare two closed-loop beamforming algorithms, one based on singular value decomposition (SVD) and the other based on equal diagonal QR decomposition (QRS). SVD has the advantage of parallelizing the MIMO channel, but each of the sub-channels has different gain. QRS has the advantage of having equal diagonal value for the decomposed channel, but the subchannels are not fully parallelized, hence requiring successive interference cancellation or other techniques to perform decoding. We consider a closed-loop system where the feedback information is a unitary beamforming matrix. Due to the discrete and limited modulation set, SVD may have inferior performance to QRS when no modulation set selection is performed. However, if the selection of modulation set is performed optimally, we show that SVD can outperform QRS.

cs.IT↗

arXiv2008

Comparative Study of Open-loop Transmit Diversity Schemes for Four Transmit Antennas in Coded OFDM Systems

We compare four open-loop transmit diversity schemes in a coded Orthogonal Frequency Division Multiplexing (OFDM) system with four transmit antennas, namely cyclic delay diversity (CDD), Space-Time Block Code (STBC, Alamouti code is used) with CDD, Quasi-Orthogonal STBC (QO-STBC) and Minimum-Decoding-Complexity QOSTBC (MDC-QOSTBC). We show that in a coded system with low code rate, a scheme with spatial transmit diversity of second order can achieve similar performance to that with spatial transmit diversity of fourth order due to the additional diversity provided by the phase shift diversity with channel coding. In addition, we also compare the decoding complexity and other features of the above four mentioned schemes, such as the requirement for the training signals, hybrid automatic retransmission request (HARQ), etc. The discussions in this paper can be readily applied to future wireless communication systems, such as mobile systems beyond 3G, IEEE 802.11 wireless LAN, or IEEE 802.16 WiMAX, that employ more than two transmit antennas and OFDM.

cs.IT↗

arXiv2008

A Continuous Vector-Perturbation for Multi-Antenna Multi-User Communication

The sum-rate of the broadcast channel in a multi-antenna multi-user communication system can be achieved by using precoding and adding a regular perturbation to the data vector. The perturbation can be removed by the modulus function, thus transparent to the receiver, but the information of the precoding matrix is needed to decode the symbols. This paper proposes a new technique to improve the multi-antenna multi-user system, by adding a continuous perturbation to the data vector without the need of information on the precoding matrix to be known at the receiver. The perturbation vector will be treated as interference at the receiver, thus it will be transparent to the receiver. The derivation of the continuous vector perturbation is provided by maximizing the signal-to-interference plus noise ratio or minimizing the minimum mean square error of the received signal.

cs.IT↗

arXiv2008

Differential Transmit Diversity Based on Quasi-Orthogonal Space-Time Block Code

By using joint modulation and customized constellation set, we show that Quasi-Orthogonal Space-Time Block Code (QO-STBC) can be used to form a new differential space-time modulation (DSTM) scheme to provide full transmit diversity with non-coherent detection. Our new scheme can provide higher code rate than existing DSTM schemes based on Orthogonal STBC. It also has a lower decoding complexity than the other DSTM schemes, such as those based on Group Codes, because it only requires a joint detection of two complex symbols. We derive the design criteria for the customized constellation set and use them to construct a constellation set that provides a wide range of spectral efficiency with full diversity and maximum coding gain.

cs.IT↗

arXiv2008

Unitary Differential Space-Time Modulation with Joint Modulation

We develop two new designs of unitary differential space-time modulation (DSTM) with low decoding complexity. Their decoder can be separated into a few parallel decoders, each of which has a decoding search space of less than sqrt(N) if the DSTM codebook contains N codewords. Both designs are based on the concept of joint modulation, which means that several information symbols are jointly modulated, unlike the conventional symbol-by-symbol modulation. The first design is based on Orthogonal Space-Time Block Code (O-STBC) with joint constellation constructed from spherical codes. The second design is based on Quasi-Orthogonal Space-Time Block Code (QO-STBC) with specially designed pair-wise constellation sets. Both the proposed unitary DSTM schemes have considerably lower decoding complexity than many prior DSTM schemes, including those based on Group Codes and Sp(2) which generally have a decoding search space of N for a codebook size of N codewords, and much better decoding performance than the existing O-STBC DSTM scheme. Between two designs, the proposed DSTM based on O-STBC generally has better decoding performance, while the proposed DSTM based on QO-STBC has lower decoding complexity when 8 transmit antennas.

cs.IT↗