基于GEO移动无线分组业务GMPRS(GEO-Mobile Packet Radio Service)协议,实现网络端MAC层信道管理功能并提出一种混合信道分配算法HCA。不同于传统的GEO信道分配算法,HCA根据同信道小区的信道占用情况与干扰小区的信道利用率,计算信道分...基于GEO移动无线分组业务GMPRS(GEO-Mobile Packet Radio Service)协议,实现网络端MAC层信道管理功能并提出一种混合信道分配算法HCA。不同于传统的GEO信道分配算法,HCA根据同信道小区的信道占用情况与干扰小区的信道利用率,计算信道分配代价,以提高GMPRS频谱利用率。采用QualNet对MAC层信令流程进行仿真,并验证算法性能。仿真结果表明,在信道资源一定的情况下,HCA能够降低阻塞率,提高GEO系统容量。展开更多
非正交多址接入(Non-Orthogonal Multiple Access,NOMA)技术与设备到设备(Device-to-Device,D2D)通信技术相结合在实现高效频谱利用率和大规模接入上有着突出的优势。针对现有的NOMA-D2D系统存在的信道分配模式单一和D2D组内功率分配难...非正交多址接入(Non-Orthogonal Multiple Access,NOMA)技术与设备到设备(Device-to-Device,D2D)通信技术相结合在实现高效频谱利用率和大规模接入上有着突出的优势。针对现有的NOMA-D2D系统存在的信道分配模式单一和D2D组内功率分配难以获得最优解的问题,构建了以D2D组和速率为优化目标的联合资源分配算法的方案:首先,在子信道分配上,将问题转换为双边匹配问题,提出了一种基于多对一场景下的D2D组信道分配算法;然后运用基于逐次凸逼近的凸差分(Difference of two Convex functions,DC)编程方法求出接近最优的功率分配值。仿真结果表明,提出的多对一场景下信道匹配算法在和速率上明显优于一对一场景下的信道匹配算法,提出的功率分配算法相比起对偶迭代算法更接近最优功率分配。展开更多
To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical mode...To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.展开更多
This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the...This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the channel allocation model with interference constraints. Then we focus on the use of evolutionary algorithms to solve the optimal allocation distribution. We further consider that the search time can be reduced by means of parallel computing, and then a parallel algorithm based APO is proposed. In contrast with the existing algorithms, we decompose the allocation vector into a number of sub-vectors and search for optimal allocation distribution of sub-vector in parallel. In order to speed up converged rate and improve converged value, some typical operations of evolutionary algorithms are modified by two novel operators. Finally, simulation results show that the proposed algorithm drastically outperform other optimal solutions in term of the network utilization.展开更多
文摘基于GEO移动无线分组业务GMPRS(GEO-Mobile Packet Radio Service)协议,实现网络端MAC层信道管理功能并提出一种混合信道分配算法HCA。不同于传统的GEO信道分配算法,HCA根据同信道小区的信道占用情况与干扰小区的信道利用率,计算信道分配代价,以提高GMPRS频谱利用率。采用QualNet对MAC层信令流程进行仿真,并验证算法性能。仿真结果表明,在信道资源一定的情况下,HCA能够降低阻塞率,提高GEO系统容量。
文摘非正交多址接入(Non-Orthogonal Multiple Access,NOMA)技术与设备到设备(Device-to-Device,D2D)通信技术相结合在实现高效频谱利用率和大规模接入上有着突出的优势。针对现有的NOMA-D2D系统存在的信道分配模式单一和D2D组内功率分配难以获得最优解的问题,构建了以D2D组和速率为优化目标的联合资源分配算法的方案:首先,在子信道分配上,将问题转换为双边匹配问题,提出了一种基于多对一场景下的D2D组信道分配算法;然后运用基于逐次凸逼近的凸差分(Difference of two Convex functions,DC)编程方法求出接近最优的功率分配值。仿真结果表明,提出的多对一场景下信道匹配算法在和速率上明显优于一对一场景下的信道匹配算法,提出的功率分配算法相比起对偶迭代算法更接近最优功率分配。
文摘To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.
基金supported in part by the National Natural Science Foundation under Grant No.61072069National Science and Technology Major Project of the Ministry of Science and Technology of China under Grant No.2012ZX03003012
文摘This article investigates channel allocation for cognitive networks, which is difficult to obtain the optimal allocation distribution. We first study interferences between nodes in cognitive networks and establish the channel allocation model with interference constraints. Then we focus on the use of evolutionary algorithms to solve the optimal allocation distribution. We further consider that the search time can be reduced by means of parallel computing, and then a parallel algorithm based APO is proposed. In contrast with the existing algorithms, we decompose the allocation vector into a number of sub-vectors and search for optimal allocation distribution of sub-vector in parallel. In order to speed up converged rate and improve converged value, some typical operations of evolutionary algorithms are modified by two novel operators. Finally, simulation results show that the proposed algorithm drastically outperform other optimal solutions in term of the network utilization.
