一种低复杂度的Multi-h CPM相干解调算法及FPGA实现

多调制指数连续相位调制（Multi-h Continuous Phase Modulation,Multi-h CPM）是一种恒包络调制,具有多个周期出现的调制指数,因此其频谱效率和功率效率比单调制指数CPM更高,但其接收机的复杂度也随之增加。本文在倾斜相位（Tilted Phase,TP）的基础上采用频率脉冲截断（Frequency Pulse Truncation,FPT）和状态空间分割（State Space Partition,SSP）相结合的方法来降低多调制指数连续相位调制的复杂度,使相位状态由512降低到16,理论损耗约为0.8 dB。同时,对降低复杂度的解调算法在现场可编程门阵列（Field Programmable Gate Arrays, FPGA）上进行了验证。仿真和在线测试的误码率曲线接近理论分析曲线,和常用的128状态解调算法相比,资源消耗降低了约59%。     

Managing Temporal Constraints with Preferences

Abstract

Preferences in temporal problems are common but significant in many real world applications. In this paper, we extend our temporal reasoning framework, managing numeric and symbolic information, in order to handle preferences. Unlike the existing models managing single temporal preferences, ours supports four types of preferences, namely: numeric and symbolic temporal preferences, composite preferences and conditional preferences. This offers more expressive power in representing a wide variety of temporal constraint problems. The preferences are considered here as a set of soft constraints using a c-semiring structure with combination and projection operators. Solving temporal constraint problems with preferences consists in finding a solution satisfying all the temporal constraints while optimizing the preference values. This is handled by a variant of the branch and bound algorithm, we propose in this paper, and where constraint propagation is used to improve the time efficiency. Experimental tests, we conducted on randomly generated temporal constraint problems with preferences, favor a variant of MAC as the constraint propagation strategy that should be used within the branch and bound algorithm.     

On Embedding a Qualitative Representation in a Two-Dimensional Plane

Abstract

This paper discusses embedding in a two-dimensional plane a symbolic representation for spatial data using the simple objects, points (P), lines (L), circuits (C), and areas (A). We have proposed PLCA as a new framework for a qualitative spatial reasoning. In a PLCA expression, the entire figure is represented in a form in which all the objects are related. We investigate the conditions for two-dimensional realizability of a PLCA expression, and derive the relation that the numbers of objects in a PLCA expression should have. In this process, we use the well-known Euler's formula. We also give an algorithm for drawing the figure of the PLCA expression that satisfies this condition in a two-dimensional plane and prove its correctness. The algorithm generates a quantitative expression from qualitative expression.     

Evolution of seismo-ionospheric disturbances according to the data of dense network of GPS stations

The evolution of seismo-ionospheric disturbances accompanied strong destructive earthquakes in the region of Kuril and Japan Islands on October 4, 1994, September 25, 2003, and November 15, 2006 is studied in the paper. For determination of the dynamics of spatial-temporal and amplitude parameters of disturbances in the total electron content (TEC) on the basis of the Japan network of receiving GPS stations GEONET and Korean network KGN, the method of drawing “distance-time” diagrams and quasi-optimal algorithm of spatial-temporal processing of the GPS network data was used. The ionospheric response was detected at a distance D from the epicenter up 2500 km. The maximal value of the disturbance amplitude is observed at D = 400–600 km. For the September 25, 2003 and November 15, 2006 earthquakes, the velocity V of propagation of the dominant disturbance mode is independent of the distance and equal to 850 and 1100 m/s, respectively. At a distance D ∼ 600 km, the wave disturbance from the main shock of the October 4, 1994 earthquake is split into two modes: the velocity of the “fast mode” of the disturbance increases with distance from 1500 to 2400 m/s, while the velocity of the “slow mode” V = 600 m/s does not depend on D. Possible interpretation of the obtained results is given.     

Perturbation solutions for variable energy blast waves

The trajectory of and the flow field behind blast waves with time varying energy input is determined. Freeman's (1968) Lagrangean coordinate formulation is modified to include both the geometric factor, α, for plane, cylindrical and spherical shocks and also non-integer values of β, the energy input parameter, in a single computational algorithm. Numerical problems associated with vanishing density at the inner mass boundary or “piston face” are then examined and solved. Second order perturbation solutions about the solution for an infinite strength shock are then obtained in Sakurai's (1965) inverse shock Mach number expansion parameter for 0 β < α + 1. Tables and graphs of significant numerical coefficients are presented for comparison to, and extension of, results of other authors. Graphs of typical shock trajectories and flow field density, pressure and velocity variations are also presented and discussed.     

Time-optimal trajectory planning for underactuated spacecraft using a hybrid particle swarm optimization algorithm

A hybrid algorithm combining particle swarm optimization (PSO) algorithm with the Legendre pseudospectral method (LPM) is proposed for solving time-optimal trajectory planning problem of underactuated spacecrafts. At the beginning phase of the searching process, an initialization generator is constructed by the PSO algorithm due to its strong global searching ability and robustness to random initial values, however, PSO algorithm has a disadvantage that its convergence rate around the global optimum is slow. Then, when the change in fitness function is smaller than a predefined value, the searching algorithm is switched to the LPM to accelerate the searching process. Thus, with the obtained solutions by the PSO algorithm as a set of proper initial guesses, the hybrid algorithm can find a global optimum more quickly and accurately. 200 Monte Carlo simulations results demonstrate that the proposed hybrid PSO–LPM algorithm has greater advantages in terms of global searching capability and convergence rate than both single PSO algorithm and LPM algorithm. Moreover, the PSO–LPM algorithm is also robust to random initial values.     

Rapid generation of entry trajectories with waypoint and no-fly zone constraints

Waypoints are positions for multiple payload deployments or reconnaissance missions, and no-fly zones are exclusion zones that cannot be passed for threat avoidance or due to geopolitical restrictions. This paper proposes a rapid entry trajectory generation approach satisfying waypoint and no-fly zone constraints for entry vehicles with relatively high lift-to-drag ratio. A lateral planning algorithm based on a Newton iteration scheme is developed to simultaneously design both the magnitude and sign of the control variable according to waypoints and no-fly zones. The algorithm converts the highly constrained trajectory planning problem into a series of one-parameter search problems based on a reduced-order system. Then, the quasi-equilibrium glide phenomenon is employed to extract the remaining state variables corresponding to longitudinal motion. The algorithm is tested using the Common Aero Vehicle model, and the results demonstrate that the algorithm can generate flyable entry trajectories rapidly within allowable tolerances while satisfying all the flight constraints.     

一种新型火星定点着陆轨迹快速优化方法

针对火星定点着陆任务大气进入段的轨迹规划问题,给出了一种基于hp Radau伪谱法的快速优化算法。综合考虑大气进入段的动力学约束、边值约束、以及着陆器的机动能力约束和安全性约束,结合hp Radau伪谱法的配点特性,将轨迹优化问题转换成一个大规模多约束参数优化问题,给出了大气进入段轨迹优化问题的求解框架;为了提高算法的计算效率,给出了参数优化过程中雅克比矩阵的解析表达式;并通过数学仿真对本文算法进行了数值验证,结果表明：     

空间机器人惯性参数辨识的粒子群优化新算法

提出了针对一类多自由度空间机器人卫星惯性参数在轨辨识的一种粒子群（PSO）优化新算法。通过粒子邻域限定的多样性保持、低效粒子随机重置和粒子误差的序列性评价,得到了比常规方法更好的结果,且具有无附加燃料消耗、线动量测量和特定的机器人路径规划等便利性优点。仿真算例表明,该改进方法具有较高的准确性与效率。     

深空测控通信中GMSK体制非相干解调算法研究

针对深空测控通信中GMSK体制非相干解调损失较大的难点,提出了一种改进的GMSK信号非相干维特比解调算法。通过分析相位状态网格图中相位转移规律,建立理论仿真模型。通过原理样机的研制和测试,实测数据表明：该算法具有解调损失低、实现复杂度适中的优点;相比于理论的最佳相干解调算法,在误码率1×10 -4 量级下,实测仅损失0.6 dB。目前该算法已应用于国内某深空测控通信系统GMSK体制基带设备中,并成功解调出欧空局Herschel–Planck卫星数据。     

Control of satellite imaging formations in multi-body regimes

Libration point orbits may be ideal locations for satellite imaging formations. Therefore, control of these arrays in multi-body regimes is critical. A continuous feedback control algorithm is developed that maintains a formation of satellites in motion that is bounded relative to a halo orbit. This algorithm is derived based on the dynamic characteristics of the phase space near periodic orbits in the circular restricted three-body problem (CR3BP). By adjusting parameters of the control algorithm appropriately, satellites in the formation follow trajectories that are particularly advantageous to imaging arrays. Image reconstruction and coverage of the (u, v) plane are simulated for interferometric satellite configurations, demonstrating potential applications of the algorithm and the resulting motion.     

一种适用于深空通信的有限随机性喷泉码算法

基于数字喷泉的编译码技术无码率、不需要反馈的特点可适应深空环境下的文件传输。但传统的喷泉随机编码算法需要10^4量级以上的码长以保证可恢复概率,且原有的译码算法是一种次优方案,无法满足功率和存储空间严格受限的深空通信系统。提出了一种限制编码过程中部分随机性的相关列补偿编码算法,采用渐增高斯消去算法优化译码性能。仿真结果表明所提出的联合优化编译码方案能使码长不大于10^3的喷泉码在冗余度小于0.20的情况下,获得10^-4的译码失败率,较好地解决了传统数字喷泉码在空间通信系统中的适用问题。     

N形缝光线引入器太阳敏感器技术研究

为适应微小卫星发展的需求,提出了基于线阵电荷耦合器(Charge Coupled Devices, CCD)的N字形狭缝数字太阳敏感器研究方案,以减小系统功耗并降低系统复杂度。该方案通过采用带有N字形狭缝的光线引入器以及单个线阵CCD作为光线探测器,实现了太阳敏感器对两轴太阳角的精确计算。提出利用迭代算法和修正系数对系统折射误差进行修正的方法,进一步结合质心算法,能够快速准确修正系统误差,提高系统精度和分辨率。N型数字太阳敏感器视场角可达(±60°)×(±60°),在整个视场范围内定姿精度优于0.1°,功耗 300mW。该数字太阳敏感器具有低功耗、大视场角和高精度的特点,设计、算法均大大简化,实现了太阳敏感器的微型化,在各种微小卫星上有广阔的应用前景。     

一种高超星图高精度半盲复原算法

针对高超声速飞行器在平流层内应用天文导航时受气动光学效应及运动模糊影响后难以观星和高精度导航的问题,提出一种基于正则化思想的高超星图半盲复原算法。该算法首先针对高超星图的特点进行去噪与星点初提取等预处理操作,接着从图像中提出可用的模糊核信息,并通过融合达到去噪的目的。然后结合天文图像灰度及梯度的稀疏先验分布特性,提出一种针对高超星图的正则化非盲复原模型,利用分裂布雷格曼迭代法等算法迭代估计清晰图像。将本算法与传统星图复原算法、其他最新正则化复原算法进行星图复原与导航效果比较,结果表明本算法复原效果最佳,且能明显改善星点识别正确率及质心坐标计算精度,可用于大幅提高超声速飞行器在平流层中的天文导航适应性及导航精度。     

Symmetric periodic solutions of the Hill’s problem. II

An algorithm for studying the families of symmetric periodic orbits using their generating solutions, whose structure was presented in the first part of this paper [1], is described. The algorithm is essentially based on symmetry of the generating solution and on its initial approximation. More than 20 new families of symmetric periodic solutions of the Hill’s problem have been found and investigated with the use of this algorithm. The families including trajectories for orbital injection into the vicinity of collinear libration points L _1,2 are described.     

一种小型固体运载火箭末级多约束制导方法

针对耗尽关机的固体运载火箭末级多约束制导问题,提出了在真空飞行段设计一种具有速度管控能力的多约束制导方法。同时针对速度管控引起的状态矢量耦合问题,基于定点制导算法推导出一种适用于耗尽关机制导的拓展理论算法,通过求解交变姿态速度管控方向实现对耦合项的抑制;并对大气层外“助推-滑行-助推”的任务模式,在此理论基础上推导出滑行点火时间、〖JP2〗需要速度矢量与终端轨道根数之间的理论关系,解决了固体运载火箭在固定弧长条件下的两点边值问题。蒙特卡洛仿真结果表明：该制导算法对不同载荷任务具有较强的适应能力,对模型的参数偏差及不确定性具有高制导精度和强鲁棒性,因此该算法具有一定的理论意义和工程应用价值。     

敏捷成像卫星调度的改进量子遗传算法

针对敏捷成像卫星调度问题中解空间大,选择任务的搜索空间和确定任务观测时间的搜索空间分别是离散域和连续域的难题。建立了多种决策变量混合的敏捷成像卫星调度模型,提出一种改进的量子遗传算法对其求解,改进的量子遗传算法采用二进制与实数杂合的编码方式,降低染色体的基因位编码数目,提高了搜索效率,有效适应了敏捷成像卫星调度问题中离散与连续混合的解空间;以杂合编码为基础,设计对应的观测函数将敏捷成像卫星调度问题的解映射到相位空间,从而将量子优化机制引入敏捷成像卫星调度问题中,利用量子遗传算法在相位空间搜索的特性解决敏捷成像卫星解空间大、解空间离散与连续并存的问题。最后,通过不同规模的仿真校验对算法的调度效果进行测试和分析。结果表明,所提改进的量子遗传算法在收敛速度和方案收益方面都有较好的表现,能够满足敏捷成像卫星调度的需要。