An iterative transmit power allocation (PA) algorithm was proposed for group-wise space-time block coding (G-STBC) systems with group-wise successive interference cancellation (GSIC) receivers. Group-wise interference...An iterative transmit power allocation (PA) algorithm was proposed for group-wise space-time block coding (G-STBC) systems with group-wise successive interference cancellation (GSIC) receivers. Group-wise interference suppression (GIS) filters are employed to separate each group's transmit signals from other interferences and noise. While the total power on all transmit symbols is constrained, all transmit PA coefficients are updated jointly according to the channel information at each iteration. Through PA, each detection symbol has the same post-detection signal to interference-and-noise ratio (SINR). The simulation results verify that the proposed PA algorithm converges at the equilibrium quickly after few iterations, and it achieves much lower bit error rates than the previous single symbol SIC PA and the fixed ratio PA algorithms for G-STBC systems with GSIC receivers .展开更多
A practical transportation problem for finding the “departure” time at “all source nodes” in order to arrive at “some destination nodes” at specified time for both FIFO (i.e., First In First Out) and Non-FIFO “...A practical transportation problem for finding the “departure” time at “all source nodes” in order to arrive at “some destination nodes” at specified time for both FIFO (i.e., First In First Out) and Non-FIFO “Dynamic ” Networks is considered in this study. Although shortest path (SP) for dynamic networks have been studied/documented by various researchers, contributions from this present work consists of a sparse matrix storage scheme for efficiently storing large scale sparse network’s connectivity, a concept of Time Delay Factor (TDF) combining with a “general piece- wise linear function” to describe the link cost as a function of time for Non-FIFO links’ costs, and Backward Dijkstra SP Algorithm with simple heuristic rules for rejecting unwanted solutions during the backward search algorithm. Both small-scale (academic) networks as well as large- scale (real-life) networks are investigated in this work to explain and validate the proposed dynamic algorithms. Numerical results obtained from this research work have indicated that the newly proposed dynamic algorithm is reliable, and efficient. Based on the numerical results, the calculated departure time at the source node(s), for a given/specified arrival time at the destination node(s), can be non-unique, for some Non-FIFO networks’ connectivity.展开更多
航空传感器故障检测在航空飞行任务中具有重要意义。然而传感器时序数据长度极长、时间跨度极广导致目前大多数方法检测性能较差。针对上述问题,提出基于时序二维化的航空传感器故障检测(time-series to 2D fault detection,T2D)方法。...航空传感器故障检测在航空飞行任务中具有重要意义。然而传感器时序数据长度极长、时间跨度极广导致目前大多数方法检测性能较差。针对上述问题,提出基于时序二维化的航空传感器故障检测(time-series to 2D fault detection,T2D)方法。将信息熵应用到分段聚合近似算法中,充分保留时序特征的同时实现对数据的有效压缩;引入格拉姆角场将降维后的一维数据编码为二维图像,维持原始序列的长程依赖性;设计一种灵活的卷积映射模块并插入检测网络Vision Transformer的编码器中,提高模型的检测精度。实验结果表明,T2D模型在某民机试飞仿真时序数据集上,性能显著优于其他模型,验证了所提方法的有效性和优越性。展开更多
基金The National High Technology ResearchDevelopment Program of China (863 Pro-gram) (No003aa12331007)National Nat-ural Science Foudation of China ( No60572157,60332030)
文摘An iterative transmit power allocation (PA) algorithm was proposed for group-wise space-time block coding (G-STBC) systems with group-wise successive interference cancellation (GSIC) receivers. Group-wise interference suppression (GIS) filters are employed to separate each group's transmit signals from other interferences and noise. While the total power on all transmit symbols is constrained, all transmit PA coefficients are updated jointly according to the channel information at each iteration. Through PA, each detection symbol has the same post-detection signal to interference-and-noise ratio (SINR). The simulation results verify that the proposed PA algorithm converges at the equilibrium quickly after few iterations, and it achieves much lower bit error rates than the previous single symbol SIC PA and the fixed ratio PA algorithms for G-STBC systems with GSIC receivers .
文摘A practical transportation problem for finding the “departure” time at “all source nodes” in order to arrive at “some destination nodes” at specified time for both FIFO (i.e., First In First Out) and Non-FIFO “Dynamic ” Networks is considered in this study. Although shortest path (SP) for dynamic networks have been studied/documented by various researchers, contributions from this present work consists of a sparse matrix storage scheme for efficiently storing large scale sparse network’s connectivity, a concept of Time Delay Factor (TDF) combining with a “general piece- wise linear function” to describe the link cost as a function of time for Non-FIFO links’ costs, and Backward Dijkstra SP Algorithm with simple heuristic rules for rejecting unwanted solutions during the backward search algorithm. Both small-scale (academic) networks as well as large- scale (real-life) networks are investigated in this work to explain and validate the proposed dynamic algorithms. Numerical results obtained from this research work have indicated that the newly proposed dynamic algorithm is reliable, and efficient. Based on the numerical results, the calculated departure time at the source node(s), for a given/specified arrival time at the destination node(s), can be non-unique, for some Non-FIFO networks’ connectivity.
