A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex s...A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.展开更多
With the widespread application of distributed systems, many problems need to be solved urgently. How to design distributed optimization strategies has become a research hotspot. This article focuses on the solution r...With the widespread application of distributed systems, many problems need to be solved urgently. How to design distributed optimization strategies has become a research hotspot. This article focuses on the solution rate of the distributed convex optimization algorithm. Each agent in the network has its own convex cost function. We consider a gradient-based distributed method and use a push-pull gradient algorithm to minimize the total cost function. Inspired by the current multi-agent consensus cooperation protocol for distributed convex optimization algorithm, a distributed convex optimization algorithm with finite time convergence is proposed and studied. In the end, based on a fixed undirected distributed network topology, a fast convergent distributed cooperative learning method based on a linear parameterized neural network is proposed, which is different from the existing distributed convex optimization algorithms that can achieve exponential convergence. The algorithm can achieve finite-time convergence. The convergence of the algorithm can be guaranteed by the Lyapunov method. The corresponding simulation examples also show the effectiveness of the algorithm intuitively. Compared with other algorithms, this algorithm is competitive.展开更多
Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memor...Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.展开更多
随着先进工艺和技术的不断进步,要想保证数据在高速传输中的正确性,均衡器需要有更高的补偿和更低的功耗,才能实现高效通信。基于12 nm互补金属氧化物半导体工艺,设计了一种高增益、低功耗的自适应连续时间线性均衡器(continuous time l...随着先进工艺和技术的不断进步,要想保证数据在高速传输中的正确性,均衡器需要有更高的补偿和更低的功耗,才能实现高效通信。基于12 nm互补金属氧化物半导体工艺,设计了一种高增益、低功耗的自适应连续时间线性均衡器(continuous time linear equalizer,CTLE),该均衡器采用2级级联结构来补偿信道衰减,并提高接收信号的质量。此外,自适应模块通过采用符号-符号最小均方误差(sign-sign least mean square,SS-LMS)算法,使抽头系数加快了收敛速度。仿真结果表明,当传输速率为16 Gbit/s时,均衡器可以补偿-15.53 dB的半波特率通道衰减,均衡器系数在16×10^(4)个单元间隔数据内收敛,并且收敛之后接收误码率低于10^(-12)。展开更多
This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all ag...This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.展开更多
The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the ...The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the products of the filled-in relay function induced by Coulomb friction and the absolute values of normal constraint reactions. With the time-stepping impulse-velocity scheme, the measure differential equations are discretized. The equations of horizontal linear complementarity problems （HLCPs）, which are used to compute the impulses, are constructed by decomposing the absolute function and the filled-in relay function. These HLCP equations degenerate into equations of LCPs for frictional unilateral constraints, or HLCPs for frictional bilateral constraints. Finally, a numerical simulation for multibody systems with both unilateral and bilateral constraints is presented.展开更多
提出了一种适用于超短距离(Very Short Reach,VSR)信道、面向112 Gb/s PAM4(Pulse Amplitude Modulation 4)接收机的自适应均衡设计方案。在该方案中,接收机前端利用3个连续时间线性均衡器(Continuous Time Linear Equalizer,CTLE)对信...提出了一种适用于超短距离(Very Short Reach,VSR)信道、面向112 Gb/s PAM4(Pulse Amplitude Modulation 4)接收机的自适应均衡设计方案。在该方案中,接收机前端利用3个连续时间线性均衡器(Continuous Time Linear Equalizer,CTLE)对信号分别在高频、中频和低频进行补偿,可变增益放大器(Variable Gain Amplifier,VGA)和饱和放大器(Saturation Amplifier,SatAmp)则用于对信号幅值的缩放。除了3个数据采样器外,引入4个辅助采样器用于进一步改善阈值自适应算法性能。同时,采用符号最小均方算法,利用接收端数据采样器和辅助采样器之间的偏移推动辅助参考电压收敛到信号星座电平,从而确保PAM4接收信号的眼图在垂直方向上3个眼睛具有相等的间隔和恒定的信噪比(Signal-to-Noise Ratio,SNR)。仿真结果表明,所提出的112 Gb/s PAM4接收机能够在损耗为15 dB的信道上实现小于10~(-12)的误码率,并且具有良好的眼图性能,其最差眼高为75 mV,眼宽为0.34 UI(Unit Interval),与传统方案相比具有显著的性能提升。展开更多
随着全球定位系统的发展和应用,巨量的轨迹数据被实时收集,给数据的传输、存储和分析带来挑战.基于分段线性近似(piecewise linear approximation,PLA)的数据压缩技术因具有简单直观、压缩存储低和传输快的特点被广泛应用和研究.针对现...随着全球定位系统的发展和应用,巨量的轨迹数据被实时收集,给数据的传输、存储和分析带来挑战.基于分段线性近似(piecewise linear approximation,PLA)的数据压缩技术因具有简单直观、压缩存储低和传输快的特点被广泛应用和研究.针对现有轨迹PLA压缩方法不能最优化地在线压缩多维数据的现状,在最大误差限定(maximum error bound,记为L_(∞))下提出多维轨迹数据的最优化PLA压缩问题(记为m DisPLA_(∞)),并给出一种在线MDisPLA算法予以解决.该算法利用“分治-融合”的策略扩展一维最优化PLA算法,以最优化地压缩多维轨迹数据.MDisPLA算法具有线性时间复杂性,可以生成最少的不连续分割,且可以保证生成直线表示的质量,即原始数据点和对应解压缩点之间的同步误差具有上界.通过与基于同步距离锥交(cone intersection using the synchronous Euclidean distance,CISED)的轨迹压缩算法进行理论和实验比较,验证了MDisPLA算法是稳健的,可生成具有保质性的直线表示.MDisPLA算法以更低的内存消耗,较CISED算法提高了14倍左右的处理速度,降低了约48%的分割个数和10.5%的存储个数.MDisPLA算法在保证压缩质量的同时,显著提高了处理速度和降低了存储空间,整体上优于CISED算法.展开更多
文摘A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.
文摘With the widespread application of distributed systems, many problems need to be solved urgently. How to design distributed optimization strategies has become a research hotspot. This article focuses on the solution rate of the distributed convex optimization algorithm. Each agent in the network has its own convex cost function. We consider a gradient-based distributed method and use a push-pull gradient algorithm to minimize the total cost function. Inspired by the current multi-agent consensus cooperation protocol for distributed convex optimization algorithm, a distributed convex optimization algorithm with finite time convergence is proposed and studied. In the end, based on a fixed undirected distributed network topology, a fast convergent distributed cooperative learning method based on a linear parameterized neural network is proposed, which is different from the existing distributed convex optimization algorithms that can achieve exponential convergence. The algorithm can achieve finite-time convergence. The convergence of the algorithm can be guaranteed by the Lyapunov method. The corresponding simulation examples also show the effectiveness of the algorithm intuitively. Compared with other algorithms, this algorithm is competitive.
文摘Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.
文摘随着先进工艺和技术的不断进步,要想保证数据在高速传输中的正确性,均衡器需要有更高的补偿和更低的功耗,才能实现高效通信。基于12 nm互补金属氧化物半导体工艺,设计了一种高增益、低功耗的自适应连续时间线性均衡器(continuous time linear equalizer,CTLE),该均衡器采用2级级联结构来补偿信道衰减,并提高接收信号的质量。此外,自适应模块通过采用符号-符号最小均方误差(sign-sign least mean square,SS-LMS)算法,使抽头系数加快了收敛速度。仿真结果表明,当传输速率为16 Gbit/s时,均衡器可以补偿-15.53 dB的半波特率通道衰减,均衡器系数在16×10^(4)个单元间隔数据内收敛,并且收敛之后接收误码率低于10^(-12)。
基金supported by Deanship of Scientific research(CDSR)at KFUPM(RG-1316-1)
文摘This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.
基金supported by the National Natural Science Foundation of China (10672007)
文摘The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the products of the filled-in relay function induced by Coulomb friction and the absolute values of normal constraint reactions. With the time-stepping impulse-velocity scheme, the measure differential equations are discretized. The equations of horizontal linear complementarity problems （HLCPs）, which are used to compute the impulses, are constructed by decomposing the absolute function and the filled-in relay function. These HLCP equations degenerate into equations of LCPs for frictional unilateral constraints, or HLCPs for frictional bilateral constraints. Finally, a numerical simulation for multibody systems with both unilateral and bilateral constraints is presented.
文摘随着全球定位系统的发展和应用,巨量的轨迹数据被实时收集,给数据的传输、存储和分析带来挑战.基于分段线性近似(piecewise linear approximation,PLA)的数据压缩技术因具有简单直观、压缩存储低和传输快的特点被广泛应用和研究.针对现有轨迹PLA压缩方法不能最优化地在线压缩多维数据的现状,在最大误差限定(maximum error bound,记为L_(∞))下提出多维轨迹数据的最优化PLA压缩问题(记为m DisPLA_(∞)),并给出一种在线MDisPLA算法予以解决.该算法利用“分治-融合”的策略扩展一维最优化PLA算法,以最优化地压缩多维轨迹数据.MDisPLA算法具有线性时间复杂性,可以生成最少的不连续分割,且可以保证生成直线表示的质量,即原始数据点和对应解压缩点之间的同步误差具有上界.通过与基于同步距离锥交(cone intersection using the synchronous Euclidean distance,CISED)的轨迹压缩算法进行理论和实验比较,验证了MDisPLA算法是稳健的,可生成具有保质性的直线表示.MDisPLA算法以更低的内存消耗,较CISED算法提高了14倍左右的处理速度,降低了约48%的分割个数和10.5%的存储个数.MDisPLA算法在保证压缩质量的同时,显著提高了处理速度和降低了存储空间,整体上优于CISED算法.
