光孤子通信系统研究进展

分析了常规线性通信系统中存在的问题，提出了其解决方法，概述了孤子通信的优点及其发展简况，并着重对高速长距离全光孤子通信系统方案作了评述。     

光孤子传输控制方案的探讨

文章首先分析了光孤子通信系统的限制因素,包括光纤损耗、孤子间的相互作用、各种高阶效应以及参量随机变化等.然后在此基础上,讨论了光孤子通信系统的传输控制方案,并分析比较了这些方案的优缺点,对光孤子系统设计具有参考价值.     

Optimal power allocation with AF and SDF strategies in dual-hop cooperative MIMO networks

Dual-hop cooperative Multiple-Input Multiple-Output (MIMO) network with multi-relay cooperative communication is introduced. Power allocation problem with Amplify-and-Forward (AF) and Selective Decode-and-Forward (SDF) strategies in multi-node scenario are formulated and solved respectively. Optimal power allocation schemes that maximize system capacity with AF strategy are presented. In addition, optimal power allocation methods that minimize asymptotic Symbol Error Rate (SER) with SDF cooperative protocol in multi-node scenario are also proposed. Furthermore, performance comparisons are provided in terms of system capacity and approximate SER. Numerical and simulation results confirm our theoretical analysis. It is revealed that, maximum system capacity could be obtained when powers are allocated optimally with AF protocol, while minimization of system’s SER could also be achieved with optimum power allocation in SDF strategy. In multi-node scenario, those optimal power allocation algorithms are superior to conventional equal power allocation schemes.     

Stepwise dispersion profiling of periodically amplified solitonsystems

Average soliton propagation in periodically amplified optical fiber systems with stepwise varying dispersion is studied analytically and numerically. A simple scheme for determining optimal profiles is described and generalized design diagrams in terms of the average system dispersion and net periodic loss are presented. n-fold optimal profiling is shown to be as effective in reducing perturbations to the average soliton as n-fold reduction of the amplifier spacing. Hence, stable soliton propagation for communications applications well beyond the usually accepted limits is proposed     

Power Allocation Schemes in OFDM-Based Femtocell Networks

Orthogonal frequency division multiplex-based femtocell networks in downlink with two-tier interference are considered in this paper. In order to satisfy the quality of service of macrocell users, a capacity maximization problem with the total and the upper power constraints by allocating power to subcarriers for a user in femtocell systems becomes important. In this paper, the optimal power allocation is derived by using the Lagrangian technique. Based on the analysis of the Karush-Kuhn-Tucker conditions, subcarriers can be classified into two sets with different power allocation strategies according to the upper power constraint. One set of subcarriers is allocated with upper power, and the other set of subcarriers is processed by using the waterfilling approach. A direct linear search scheme is presented to achieve the optimal performance by finding the threshold over the channel states of all subcarriers to determine the two sets. In order to reduce the computational load, a reduced complexity scheme is designed for the optimal solution by utilizing the relationship of the allocated power in the two sets of subcarriers. Unlike the schemes in iterative manners, a fast power allocation scheme with a near-optimal performance is also developed. Simulation results reveal that the proposed schemes outperform the existing scheme. The efficacy of the proposed schemes is demonstrated in the simulations.     

Robustness of Weighting Receive Antenna Selection Algorithm

The conventional antenna selection schemes suffer from severe performance degradations in most fading channels. This paper proposes a new receive antenna selection algorithm based on the theory of convex optimization that improve the system performance over Rayleigh fading multiple-input multiple-output (MIMO) channels. With this method, each Radio Frequency chain is not allocated to a single antenna element, but instead to the complex-weighted and combined response of a group array of elements. In this paper, we firstly get optimal solution under no constraints. Then, suboptimal algorithms are introduced based on minimised the squared error and convex optimization technique. The Monte-Carlo simulations show that the algorithm proposed can provide the performance very close to that of the optimal selection based on exhaustive search.     

Resource allocation scheme in two-way multi-relay OFDM system

A joint optimization scheme for power allocation and subcarrier pairing under high SNR in two-way multi-relay OFDM system was proposed.Unlike those schemes in which relays use subcarriers separately,all the relays were allowed to forward signal on each subcarrier pair for providing much space diversity.With the constraint of total system power,the proposed scheme firstly allocated each relay power with Cauchy inequality with the assuming that the total relay power was fixed.Then the dichotomy was used to calculate the power allocation between the source node and the relay node by maximizing the equivalent channel gain for different subcarrier pairs.Lastly,the power of different subcarrier pairs was allocated by convex programming,and the subcarriers were paired by Hungarian algorithm to obtain the maximum system capacity.There was no optimal power allocation method with low complexity because of the complexity of the power allocation algorithm in two-way multi-relay networks.This algorithm greatly reduces the complexity of power allocation and simulation results show that the proposed scheme outperforms the relay selection scheme and the relays use subcarriers separately scheme.     

EDFA对基孤子脉冲进行压缩与放大的数值研究

从描述光脉冲在掺铒光纤放大器(EDFA)中传输的非线性薛定谔方程出发,对基孤子脉冲在EDFA中的压缩与放大进行了数值研究,并对孤子脉冲在其中的压缩提出优化方案。结果表明,通过合理地选择EDFA的参数,可使无啁啾的基孤子脉冲实现绝热压缩和放大;对具有初始啁啾的基孤子脉冲,压缩过程将不再满足绝热条件;对于正啁啾的基孤子脉冲,可得到较好的压缩与放大;而对于负啁啾的基孤子脉冲,压缩效果却较差。     

采用色散搭配技术的孤子传输实验

采用色散搭配技术进行了１Ｇｂｉｔ／ｓ，５２．６８ｋｍ的孤子传输实验，实验表明采用色散搭配技术传输孤子时存在着合理地组合光纤的问题，相同的组合即使入纤方向改变，孤子传输的稳定性以及为了实现一阶孤子传输所需要的能量也是不同的，采用合理的色散搭配技术有利于孤子的稳定传输。     

Crosstalk-aware dynamic spectrum management algorithm for green DSL systems

Dynamic spectrum management (DSM) techniques mitigate crosstalk in digital subscriber line (DSL) networks by adapting the transmit spectra to the actual noise and channel conditions. Conventional DSM schemes are designed based on single-objective optimization, either belonging to the rate-adaptive or margin-adaptive category. In this paper, an efficient crosstalk-aware DSM (CA-DSM) algorithm which jointly considers both the data rate and power is proposed to search for the best rate-power tradeoff solution based on the network conditions. The crosstalk-aware power strategy prevents transmitters which contribute excessive crosstalk from being allocated high power, thereby reducing the aggregate crosstalk noise in the system. A convex cost function is used to formulate the DSM optimization problem wherein two coefficients are introduced to make the CA-DSM algorithm adaptive to different network conditions. An iterative power update strategy is proposed for the CA-DSM algorithm to minimize the cost function. Convergence properties of the CA-DSM algorithm along with existence and uniqueness of optimal power solutions are examined analytically and illustrated graphically. Simulation results show that the proposed CA-DSM algorithm can provide a significantly better rate-power tradeoff performance compared to existing spectrum management schemes.     

“Magic” dispersion maps for multichannel solitontransmission

Using asymptotic theory and a momentum method, we have identified a family of dispersion management schemes that are advantageous for massive multichannel soliton transmission. For the practical case of two-step dispersion maps, special schemes are found that have optimal launch point locations (where no pulse prechirping is needed) that are independent of the fiber's dispersion. Despite the variation of dispersion with respect to carrier wavelength due to the fiber's dispersion slope, the transmission in several different channels can be optimized simultaneously using the same optimal launch point. Theoretical predictions are verified by direct numerical simulations     

光孤子传输控制方案与系统技术的探讨

本文首先讨论了光孤子通信的传输理论，控制与方案与系统技术，最后介绍了光孤子通信的实验情况。     

Power Allocation with Max–Min and Min–Max Fairness for Cognitive Radio Networks with Imperfect CSI

This paper consider the power allocation strategies in the cognitive radio (CR) system in the presence of channel estimation errors. As the user has different channel condition in CR systems, different amount of power resource is required to meets the QoS request. In order to guarantee the fairness of each CR user, ensure the interference from the primary user and other CR users meet the QoS requirement of the CR user and limit the interference that is caused by CR users on primary user within the range into the level that primary user can tolerate, we proposed some new power allocation schemes. The targets are to minimize the maximum power allocated to CR users, to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among all CR users and to minimize the maximum outage probability over all CR users. The first power allocation scheme can be formulated using Geometric Programming (GP). Since GP problem is equivalent to the convex optimization problem, we can obtain the optimal solutions for the first scheme. The latter two power allocation schemes are not GP problems. We propose iterative algorithms to solve them. Simulation results show that proposed schemes can efficiently guarantee the fairness of CR users under the QoS constraint of the primary user and CR users.     

Biorthogonal Frequency Division Multiple Access Cellular System with Angle Division Reuse Scheme

In conventional OFDMA cellular systems, mobile stations (MSs) suffer from large ICI in fully loaded cellular environments with full cell frequency reuse, especially at the cell-edge. The fundamental cause is that the signals from serving Base Station (BS) and interference BSs, are modulated by same exponential bases, at same subcarrier. In this paper, a generalized low-complexity fractional Fourier transform (FrFT) based biorthogonal frequency division multiple access (B-OFDMA) cellular system with multiple angle division reuse scheme (MADR) scheme for inter-cell interference (ICI) cancellation is proposed. FrFT angle is regarded as a kind of time-frequency combination resource (TFCR), and it can be optimally allocated to each BS of the cellular system, based on simplified minimal base correlation coefficient (MBCC) criteria, which confirms the inner-cell mutual orthogonality between modulating bases at different subcarriers, and inter-cell mutual approximate orthogonality between modulating bases at same subcarriers. Therefore, at the receiver, ICI can be dramatically suppressed by MMSE equalization and correlative detection in respective optimal FrFT domain. Extensive system simulations are conducted for various practical scenarios to demonstrate the superior performance of the proposed FrFT MADR scheme in bit error rate (BER) and system throughput, especially for cell-edge MSs, compared with conventional OFDMA cellular with different ICI cancellation schemes and scheduling schemes.     

Proportional fair scheduling with superposition coding in a cellular cooperative relay system

Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on superposition coding (SC) which maximizes the achievable sum-rate under a proportional fairness constraint. Unlike most relaying schemes where users are allocated orthogonally, our scheme serves the two users simultaneously on the same time-frequency resource unit by superposing their messages into three SC layers. The optimal power allocation parameters of each SC layer are derived by analysis. Next, we consider the general multi-user case in a cellular relay system, for which we design resource allocation algorithms based on proportional fair scheduling exploiting the proposed SC-based scheme. Numerical results show that the proposed algorithms allowing simultaneous user allocation outperform conventional schedulers based on orthogonal user allocation, both in terms of throughput and proportional fairness. These results indicate promising new directions for the design of future radio resource allocation and scheduling algorithms.     

Dynamic resource allocation for Device‐to‐Device communication underlaying cellular networks

Future cellular networks such as IMT‐Advanced are expected to allow underlaying direct Device‐to‐Device (D2D) communication for spectrum efficiency. However, enabling D2D communication in a cellular network presents a challenge in resource allocation because of the potentially severe interference it may cause to the cellular network by reusing the spectrum with the cellular users. In this paper, we analyze the resource allocation problem in a single cell system when both cellular users and D2D users are present in the system. We first consider the scenario where cellular users and D2D users are allocated resource independently and propose an optimal algorithm and a heuristic algorithm, and then extend the methods to the scenario where cellular users and D2D users are allocated resource jointly. The number of permitted D2D pairs is selected as a performance measure because it is a more specific performance measure than spectrum efficiency. The proposed schemes maximize the number of permitted D2D communication pairs in a system meanwhile avoiding the strong interference from D2D links to the cellular links. Finally, the performance of the proposed methods is evaluated through the numerical simulation. The simulation results show that the proposed methods enhance the number of permitted D2D communication pairs significantly and that the performance of the proposed scheme for jointly allocation scenario is better than that of the proposed scheme for independently allocation scenario. Copyright © 2012 John Wiley & Sons, Ltd.     

An optimal scheduling and routing under adaptive spectrum-matching framework for MIMO systems

Multi-users (MUs) along the communication links cause noise and traffic in the channel. The prediction of availability and the optimal usage of channels are the main objectives of the multi-input multi-output (MIMO) system. Several optimisation algorithms select the optimal channel for the users effectively. But the high-error rate and the probability values are the two major problems in traditionally optimised channel selection methods. The bandwidth allotted for information transmission is minimum. Moreover, the outage probability values are maximum in traditional scheduling algorithms. This paper proposes the new optimisation algorithm that predicts the channels for transmission and adaptive spectrum matching concept to predict the suitable channel from allocated bands. Also, the prioritisation on high-spectrum intensity basis assures an efficient data delivery to the receiver. The scheduling of available channels and data prioritisation minimises the error probability rates. This paper investigates the effectiveness of proposed optimal channel utilisation against the different modulation schemes such as three-dimensional complementary codes, linear network coding with the quadrature phase shift keying in terms of the average block error probability and bit error rate.     

Multilevel RS/convolutional concatenated coded QAM for hybridIBOC-AM broadcasting

Bandwidth efficient modulation schemes using Reed-Solomon (RS) codes are proposed for hybrid in-band-on-channel (IBOC) systems that broadcast digital audio signals simultaneously with analog amplitude modulation (AM) programs in the AM band. Since both the power and bandwidth allocated for digital audio transmission are limited in this application, the system cannot afford to add enough redundancy for error control using conventional concatenated coding schemes. We show that by using multilevel RS and convolutional concatenated coded quadrature amplitude modulation (QAM), an efficient modulation schemes can be obtained for applications such as IBOC-AM broadcasting     

Seamless channel transition for the staircase video broadcasting scheme

In the literature, many broadcasting-based schemes have been proposed to efficiently support near-VOD services. However, none of these schemes allows the server to dynamically and seamlessly change the number of channels allocated to a video. Naively allocating a new set of channels for the transition could increase server's load, waste communication bandwidth, and even drain the channels of the system. In Tseng et al. (2000), it is shown how to enhance the Fast Broadcasting (FB) scheme for seamless channel transition. The problem remains open whether other broadcasting-based schemes can sustain seamless channel transition. In this paper, we show how to enhance the Staircase Broadcasting (SB) scheme so that a server can seamlessly increase or decrease the channels allocated to a video. The SB scheme has been proved to require significantly less buffering space than FB, while sustaining the same startup latency as FB. Detailed performance comparisons are presented to demonstrate the advantages of the proposed scheme.     

色散管理孤子传输特性分析

色散管理孤子光波系统的色散图周期由具有正负色散值的两段光纤组成，并且在系统中周期性放置集中放大器及滤波器装置。采用变分法获得了描述此种系统性能的常微分方程组，并利用这组方程数值研究了各种参量对孤子传输性能的影响。研究结果表明，虽然从整体趋势上看，当要求色散管理孤子有较好的稳定性时，应适当降低系统的色散管理强度，但在一定条件下，调整光纤放大器的位置以及正负色散光纤的色散差值，可同时获得相对较大的色散管理强度和好的孤子稳定性；总体来讲，集总放大器的位置会对孤子传输的稳定性、色散管理孤子的能量增强因子、脉冲最佳入射位置以及波分复用系统中的信道间的孤子碰撞致定时抖动等系统性能参量产生较明显的影响，可通过优化放大器的位置使系统的性能得到优化。