1-5hit |
Caixia CAI Wenyang GAN Han HAI Fengde JIA
In this paper, to improve communication system's energy-efficiency (EE), multi-case optimization of two new transmission strategies is investigated. Firstly, with amplify-and-forward relaying and full-duplex technique, two new transmission strategies are designed. The designed transmission strategies consider direct links and non-ideal transmission conditions. At the same time, detailed capacity and energy consumption analyses of the designed transmission strategies are given. In addition, EE optimization and analysis of the designed transmission strategies are studied. It is the first case of EE optimization and it is achieved by joint optimization of transmit time (TT) and transmit power (TP). Furthermore, the second and third cases of EE optimization with respectively optimizing TT and TP are given. Simulations reveal that the designed transmission strategies can effectively improve the communication system's EE.
Yusaku ITO Yojiro MORI Hiroshi HASEGAWA Ken-ichi SATO
A novel coarse and fine hybrid granular routing network architecture is proposed. Virtual direct links (VDLs) defined by the coarse granular routing to bridge distant node pairs, and routing via VDL mitigate the spectrum narrowing caused by optical filtering at wavelength-selective switches in ROADM (Reconfigurable Optical Add/Drop Multiplexing) nodes. The impairment mitigation yields denser channel accommodation in the frequency domain, which substantially increases fiber spectral efficiency. The proposed network simultaneously utilizes fine granular optical path level routing so that optical paths can be effectively accommodated in VDLs. The newly developed network design algorithm presented in this paper effectively implements routing and spectrum assignment to paths in addition to optimizing VDL establishment and path accommodation to VDLs. The effectiveness of the proposed architecture is demonstrated through both numerical and experimental evaluations; the number of fibers necessary in a network, and the spectrum bandwidth and hop count product are, respectively, reduced by up to 18% and increased by up to 111%.
Yuping SU Ying LI Guanghui SONG
Information-theoretic limits of a multi-way relay channel with direct links (MWRC-DL), where multiple users exchange their messages through a relay terminal and direct links, are discussed in this paper. Under the assumption that a restricted encoder is employed at each user, an outer bound on the capacity region is derived first. Then, a decode-and-forward (DF) strategy is proposed and the corresponding rate region is characterized. The explicit outer bound and the achievable rate region for the Gaussian MWRC-DL are also derived. Numerical examples are provided to demonstrate the performance of the proposed DF strategy.
Fan LIU Hongbo XU Jun LI Hongxing XIA
This paper designs the closed-form precoding matrices for non-regenerative MIMO relay system with the direct link. A multiple power constrained non-convex optimization problem is formulated by using the minimum-mean-squared error (MMSE) criterion. We decompose the original problem into two sub-problems. The relay transceiver Wiener filter structure is first rigorously derived, then the source transmit and destination receive matrices are jointly designed by solving an equivalent dual problem. Through our proposed joint iterative algorithm, the closed-form solutions can be finally obtained. The effectiveness of our proposed scheme is validated by simulations with comparison to some of the existing schemes.
We propose linear precoders which jointly minimize the mean-squared error of estimated symbol at the destination node for cooperative multiple-input multiple-output communication systems. Unlike the existing precoders which require high computational complexity to solve the optimization problem on the direct link, the proposed precoder is expressed in a closed-form. Simulation results show that the proposed precoder outperforms the existing precoders in the low SNR region. Moreover, we observe that the proposed iterative algorithm is not sensitive to the initial matrices.