It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clu...It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clustering tasks according to spatio-temporal attributes,the clustered groups are linked into task sub-chains according to similarity.Then,based on the correlation between clusters,the child chains are connected to form a task chain.Therefore,the limitation is solved that the task chain in the bee colony algorithm can only be connected according to one dimension.When a sudden task occurs,a method of inserting a small number of tasks into the original task chain and a task chain reconstruction method are designed according to the relative relationship between the number of sudden tasks and the number of remaining tasks.Through the above improvements,the algorithm can be used to process tasks with spatio-temporal coupling and burst tasks.In order to reflect the efficiency and applicability of the algorithm,a task allocation model for the unmanned aerial vehicle(UAV)group is constructed,and a one-to-one correspondence between the improved bee colony double suppression division algorithm and each attribute in the UAV group is proposed.Task assignment has been constructed.The study uses the self-adjusting characteristics of the bee colony to achieve task allocation.Simulation verification and algorithm comparison show that the algorithm has stronger planning advantages and algorithm performance.展开更多
A new control mode is proposed for a networked control system whose network-induced delay is longer than a sampling period. A time-division algorithm is presented to implement the control and for the mathematical mode...A new control mode is proposed for a networked control system whose network-induced delay is longer than a sampling period. A time-division algorithm is presented to implement the control and for the mathematical modeling of such networked control system. The infinite horizon controller is designed, which renders the networked control system mean square exponentially stable.Simulation results show the validity of the proposed theory.展开更多
The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to ...The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to support massive network nodes, the common participation over all nodes in the consensus mechanism would lead to increased communication complexity, and the arbitrary selection of master nodes would also lead to inefficient consensus. This paper offered a PBFT consensus method (Role Division-based Practical Byzantine Fault Tolerance, RD-PBFT) to address the above problems based on node role division. First, the nodes in the system voted with each other to divide the high reputation group and low reputation group, and determined the starting reputation value of the nodes. Then, the mobile node in the group was divided into roles according to the high reputation value, and a total of three roles were divided into consensus node, backup node, and supervisory node to reduce the number of nodes involved in the consensus process and reduced the complexity of communication. In addition, an adaptive method was used to select the master nodes in the consensus process, and an integer value was introduced to ensure the unpredictability and equality of the master node selection. Experimentally, it was verified that the algorithm has lower communication complexity and better decentralization characteristics compared with the PBFT consensus algorithm, which improved the efficiency of consensus.展开更多
Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting incr...Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.展开更多
Near-space airship is a frontier and hotspot in current military research and development,and the near-space composite propeller is the key technology for its development.In order to obtain higher aerodynamic efficien...Near-space airship is a frontier and hotspot in current military research and development,and the near-space composite propeller is the key technology for its development.In order to obtain higher aerodynamic efficiency at an altitude of 22 km,a certain near-space composite propeller is designed as a long and slender aerodynamic shape with a 10 m diameter,which brings many challenges to the composite structure design.The initial design is obtained by the composite structure variable stiffness design method using based on fixed region division blending model.However,it weighs 23.142 kg,exceeding the required 20 kg.In order to meet the structural design requirements of the propeller,a variable stiffness design method using the adaptive region division blending model is proposed in this paper.Compared with the methods using the fixed region division blending model,this method optimizes region division,stacking thickness and stacking sequence in a single level,considering the coupling effect among them.Through a more refined region division,this method can provide a more optimal design for composite tapered structures.Additionally,to improve the efficiency of optimization subjected to manufacturing constraints,a hierarchical penalty function is proposed to quickly filter out the solutions that do not meet manufacturing constraints.The above methods combined with a Genetic Algorithm(GA)using specific encoding are adopted to optimize the near-space composite propeller.The optimal design of the structure weighs 18.831 kg,with all manufacturing constraints and all structural response constraints being satisfied.Compared with the initial design,the optimal design has a more refined region division,and achieves a weight reduction of 18.6%.This demonstrates that a refined region division can significantly improve the mechanical performance of the composite tapered structure.展开更多
In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and t...In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.展开更多
A novel divider based on dual-bit algorithm and its VLSI implementation are presented.Compared with the divider of MIPS microprocessor,it decreases the average executing cycles by 52.5% while its maximum delay is almo...A novel divider based on dual-bit algorithm and its VLSI implementation are presented.Compared with the divider of MIPS microprocessor,it decreases the average executing cycles by 52.5% while its maximum delay is almost the same and its transistor count increases by 60%.Furthermore,the simulation result indicates that the power consumption decreases to 11.3% with the same processing ability.展开更多
In order to increase the transmission efficiency,a subspace-based algorithm for blind channel estimation using second-order statistics is proposed in orthogonal frequency division multiplexing (OFDM) systems.Because t...In order to increase the transmission efficiency,a subspace-based algorithm for blind channel estimation using second-order statistics is proposed in orthogonal frequency division multiplexing (OFDM) systems.Because the transmission equation of OFDM systems does not exactly have the desired structure to directly derive a subspace algorithm,the algorithm first divides the OFDM signals into three parts,then,by exploiting the redundancy introduced by the cyclic prefix (CP) in OFDM signals,a new equation with Toeplitz channel matrix is derived.Based on the equation,a new blind subspace algorithm is developed.Toeplitz structure eases the derivation of the subspace algorithm and practical computation.Moreover the algorithm does not change the existing OFDM system,is robust to channel order overdetermination,and the channel zero locations.The performances are demonstrated by simulation results.展开更多
In an orthogonal frequency division multiplexing(OFDM) system,a time and frequency domain least mean square algorithm(TF-LMS) was proposed to cancel the frequency offset(FO).TF-LMS algorithm is composed of two stages....In an orthogonal frequency division multiplexing(OFDM) system,a time and frequency domain least mean square algorithm(TF-LMS) was proposed to cancel the frequency offset(FO).TF-LMS algorithm is composed of two stages.Firstly,time domain least mean square(TD-LMS) scheme was selected to pre-cancel the frequency offset in the time domain,and then the interference induced by residual frequency offset was eliminated by the frequency domain mean square(FD-LMS) scheme in frequency domain.The results of bit error rate(BER) and quadrature phase shift keying(QPSK) constellation figures show that the performance of the proposed suppression algorithm is excellent.展开更多
This paper investigates the problem of synchronization for offset quadrature amplitude modulation based orthogonal frequency division multiplexing(OFDM/OQAM) systems based on the genetic algorithm. In order to increas...This paper investigates the problem of synchronization for offset quadrature amplitude modulation based orthogonal frequency division multiplexing(OFDM/OQAM) systems based on the genetic algorithm. In order to increase the spectrum efficiency,an improved preamble structure without guard symbols is derived at first. On this basis, instead of deriving the log likelihood function of power spectral density, joint estimation of the symbol timing offset and carrier frequency offset based on the preamble proposed is formulated into a bivariate optimization problem. After that, an improved genetic algorithm is used to find its global optimum solution. Conclusions can be drawn from simulation results that the proposed method has advantages in the joint estimation of synchronization.展开更多
A new channel estimation and data detection joint algorithm is proposed for multi-input multi-output （MIMO） - orthogonal frequency division multiplexing （OFDM） system using linear minimum mean square error （LMMSE...A new channel estimation and data detection joint algorithm is proposed for multi-input multi-output （MIMO） - orthogonal frequency division multiplexing （OFDM） system using linear minimum mean square error （LMMSE）- based space-alternating generalized expectation-maximization （SAGE） algorithm. In the proposed algorithm, every sub-frame of the MIMO-OFDM system is divided into some OFDM sub-blocks and the LMMSE-based SAGE algorithm in each sub-block is used. At the head of each sub-flame, we insert training symbols which are used in the initial estimation at the beginning. Channel estimation of the previous sub-block is applied to the initial estimation in the current sub-block by the maximum-likelihood （ML） detection to update channel estimatjon and data detection by iteration until converge. Then all the sub-blocks can be finished in turn. Simulation results show that the proposed algorithm can improve the bit error rate （BER） performance.展开更多
Community detection methods have been used in computer, sociology, physics, biology, and brain information science areas. Many methods are based on the optimization of modularity. The algorithm proposed by Blondel et ...Community detection methods have been used in computer, sociology, physics, biology, and brain information science areas. Many methods are based on the optimization of modularity. The algorithm proposed by Blondel et al. （Blondel V D, Guillaume J L, Lambiotte R and Lefebvre E 2008 J. Star. Mech. 10 10008） is one of the most widely used methods because of its good performance, especially in the big data era. In this paper we make some improvements to this algorithm in correctness and performance. By tests we see that different node orders bring different performances and different community structures. We find some node swings in different communities that influence the performance. So we design some strategies on the sweeping order of node to reduce the computing cost made by repetition swing. We introduce a new concept of overlapping degree （OV） that shows the strength of connection between nodes. Three improvement strategies are proposed that are based on constant OV, adaptive OV, and adaptive weighted OV, respectively. Experiments on synthetic datasets and real datasets are made, showing that our improved strategies can improve the performance and correctness.展开更多
A system model based on joint layer mechanism is formulated for optimal data scheduling over fixed point-to-point links in OFDMA ad-hoc wireless networks. A distributed scheduling algorithm （DSA） for system model op...A system model based on joint layer mechanism is formulated for optimal data scheduling over fixed point-to-point links in OFDMA ad-hoc wireless networks. A distributed scheduling algorithm （DSA） for system model optimization is proposed that combines the randomly chosen subcarrier according to the channel condition of local subcarriers with link power control to limit interference caused by the reuse of subcarrier among links. For the global fairness improvement of algorithms, a global power control scheduling algorithm （GPCSA） based on the proposed DSA is presented and dynamically allocates global power according to difference between average carrier-noise-ratio of selected local links and system link protection ratio. Simulation results demonstrate that the proposed algorithms achieve better efficiency and fairness compared with other existing algorithms.展开更多
In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algori...In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algorithm（GA） is proposed to optimize the sub-carriers and bits allocation. In the algorithm, a random velocity between the maximum and minimum particle velocity is used as the updating velocity instead of maximum or minimum velocity when the updated particle velocity is higher than the maximum particle velocity or lower than the minimum particle velocity. Then, the convergence population is used as the initial population of the genetic algorithm to optimize the subcarriers and bits allocation further. Simulation results show that the transmitted power of the proposed algorithm is about 2 d B to 10 d B lower than that of the genetic algorithm, particle swarm optimization algorithm, and Zhang＇s algorithm.展开更多
This paper investigates the blind algorithm for channel estimation of Orthogonal Frequency Division Multiplexing-Multiple Input Multiple Output (OFDM-MIMO) wireless communication system using the subspace decompositio...This paper investigates the blind algorithm for channel estimation of Orthogonal Frequency Division Multiplexing-Multiple Input Multiple Output (OFDM-MIMO) wireless communication system using the subspace decomposition of the channel received complex baseband signals and proposes a new two-stage blind algorithm. Exploited the second-order cyclostationarity inherent in OFDM with cyclic prefix and the characteristics of the phased antenna, the practical HIPERLAN/2 standard based OFDM-MIMO simulator is established with the sufficient consideration of statistical correlations between the multiple antenna channels under wireless wideband multipath fading environment, and a new two-stage blind algorithm is formulated using rank reduced subspace channel matrix approximation and adaptive Constant Modulus (CM)criterion. Simulation results confirm the theoretical analysis and illustrate that the proposed algorithm is capable of tracking matrix channel variations with fast convergence rate and improving acceptable overall system performance over various common wireless and mobile communication links.展开更多
基金This work was supported by the National Natural Science and Technology Innovation 2030 Major Project of Ministry of Science and Technology of China(2018AAA0101200)the National Natural Science Foundation of China(61502522,61502534)+4 种基金the Equipment Pre-Research Field Fund(JZX7Y20190253036101)the Equipment Pre-Research Ministry of Education Joint Fund(6141A02033703)Shaanxi Provincial Natural Science Foundation(2020JQ-493)the Military Science Project of the National Social Science Fund(WJ2019-SKJJ-C-092)the Theoretical Research Foundation of Armed Police Engineering University(WJY202148).
文摘It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clustering tasks according to spatio-temporal attributes,the clustered groups are linked into task sub-chains according to similarity.Then,based on the correlation between clusters,the child chains are connected to form a task chain.Therefore,the limitation is solved that the task chain in the bee colony algorithm can only be connected according to one dimension.When a sudden task occurs,a method of inserting a small number of tasks into the original task chain and a task chain reconstruction method are designed according to the relative relationship between the number of sudden tasks and the number of remaining tasks.Through the above improvements,the algorithm can be used to process tasks with spatio-temporal coupling and burst tasks.In order to reflect the efficiency and applicability of the algorithm,a task allocation model for the unmanned aerial vehicle(UAV)group is constructed,and a one-to-one correspondence between the improved bee colony double suppression division algorithm and each attribute in the UAV group is proposed.Task assignment has been constructed.The study uses the self-adjusting characteristics of the bee colony to achieve task allocation.Simulation verification and algorithm comparison show that the algorithm has stronger planning advantages and algorithm performance.
文摘A new control mode is proposed for a networked control system whose network-induced delay is longer than a sampling period. A time-division algorithm is presented to implement the control and for the mathematical modeling of such networked control system. The infinite horizon controller is designed, which renders the networked control system mean square exponentially stable.Simulation results show the validity of the proposed theory.
文摘The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to support massive network nodes, the common participation over all nodes in the consensus mechanism would lead to increased communication complexity, and the arbitrary selection of master nodes would also lead to inefficient consensus. This paper offered a PBFT consensus method (Role Division-based Practical Byzantine Fault Tolerance, RD-PBFT) to address the above problems based on node role division. First, the nodes in the system voted with each other to divide the high reputation group and low reputation group, and determined the starting reputation value of the nodes. Then, the mobile node in the group was divided into roles according to the high reputation value, and a total of three roles were divided into consensus node, backup node, and supervisory node to reduce the number of nodes involved in the consensus process and reduced the complexity of communication. In addition, an adaptive method was used to select the master nodes in the consensus process, and an integer value was introduced to ensure the unpredictability and equality of the master node selection. Experimentally, it was verified that the algorithm has lower communication complexity and better decentralization characteristics compared with the PBFT consensus algorithm, which improved the efficiency of consensus.
基金supported in part by the Ministry of Higher Education Malaysia(MOHE)through Fundamental Research Grant Scheme(FRGS)Ref:FRGS/1/2024/ICT02/UTM/02/10,Vot.No:R.J130000.7828.5F748the Scientific Research Project of Education Department of Hunan Province(Nos.22B1046 and 24A0771).
文摘Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.
基金This study was co-supported by stable funding from the National Key Laboratory of Aerofoil and Grille Aerodynamics,China.
文摘Near-space airship is a frontier and hotspot in current military research and development,and the near-space composite propeller is the key technology for its development.In order to obtain higher aerodynamic efficiency at an altitude of 22 km,a certain near-space composite propeller is designed as a long and slender aerodynamic shape with a 10 m diameter,which brings many challenges to the composite structure design.The initial design is obtained by the composite structure variable stiffness design method using based on fixed region division blending model.However,it weighs 23.142 kg,exceeding the required 20 kg.In order to meet the structural design requirements of the propeller,a variable stiffness design method using the adaptive region division blending model is proposed in this paper.Compared with the methods using the fixed region division blending model,this method optimizes region division,stacking thickness and stacking sequence in a single level,considering the coupling effect among them.Through a more refined region division,this method can provide a more optimal design for composite tapered structures.Additionally,to improve the efficiency of optimization subjected to manufacturing constraints,a hierarchical penalty function is proposed to quickly filter out the solutions that do not meet manufacturing constraints.The above methods combined with a Genetic Algorithm(GA)using specific encoding are adopted to optimize the near-space composite propeller.The optimal design of the structure weighs 18.831 kg,with all manufacturing constraints and all structural response constraints being satisfied.Compared with the initial design,the optimal design has a more refined region division,and achieves a weight reduction of 18.6%.This demonstrates that a refined region division can significantly improve the mechanical performance of the composite tapered structure.
基金Supported by the Natural Science Foundation of Chongqing(General Program,NO.CSTB2022NSCQ-MSX0884)Discipline Teaching Special Project of Yangtze Normal University(csxkjx14)。
文摘In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.
文摘A novel divider based on dual-bit algorithm and its VLSI implementation are presented.Compared with the divider of MIPS microprocessor,it decreases the average executing cycles by 52.5% while its maximum delay is almost the same and its transistor count increases by 60%.Furthermore,the simulation result indicates that the power consumption decreases to 11.3% with the same processing ability.
文摘In order to increase the transmission efficiency,a subspace-based algorithm for blind channel estimation using second-order statistics is proposed in orthogonal frequency division multiplexing (OFDM) systems.Because the transmission equation of OFDM systems does not exactly have the desired structure to directly derive a subspace algorithm,the algorithm first divides the OFDM signals into three parts,then,by exploiting the redundancy introduced by the cyclic prefix (CP) in OFDM signals,a new equation with Toeplitz channel matrix is derived.Based on the equation,a new blind subspace algorithm is developed.Toeplitz structure eases the derivation of the subspace algorithm and practical computation.Moreover the algorithm does not change the existing OFDM system,is robust to channel order overdetermination,and the channel zero locations.The performances are demonstrated by simulation results.
基金Project(60532030) supported by the National Natural Science Foundation of China
文摘In an orthogonal frequency division multiplexing(OFDM) system,a time and frequency domain least mean square algorithm(TF-LMS) was proposed to cancel the frequency offset(FO).TF-LMS algorithm is composed of two stages.Firstly,time domain least mean square(TD-LMS) scheme was selected to pre-cancel the frequency offset in the time domain,and then the interference induced by residual frequency offset was eliminated by the frequency domain mean square(FD-LMS) scheme in frequency domain.The results of bit error rate(BER) and quadrature phase shift keying(QPSK) constellation figures show that the performance of the proposed suppression algorithm is excellent.
基金supported by the National Natural Science Foundation of China(61671468)。
文摘This paper investigates the problem of synchronization for offset quadrature amplitude modulation based orthogonal frequency division multiplexing(OFDM/OQAM) systems based on the genetic algorithm. In order to increase the spectrum efficiency,an improved preamble structure without guard symbols is derived at first. On this basis, instead of deriving the log likelihood function of power spectral density, joint estimation of the symbol timing offset and carrier frequency offset based on the preamble proposed is formulated into a bivariate optimization problem. After that, an improved genetic algorithm is used to find its global optimum solution. Conclusions can be drawn from simulation results that the proposed method has advantages in the joint estimation of synchronization.
基金Supported by the National Natural Science Foundation of China （No. 61001105）, the National Science and Technology Major Projects （No. 2011ZX03001- 007- 03） and Beijing Natural Science Foundation （No. 4102043）.
文摘A new channel estimation and data detection joint algorithm is proposed for multi-input multi-output （MIMO） - orthogonal frequency division multiplexing （OFDM） system using linear minimum mean square error （LMMSE）- based space-alternating generalized expectation-maximization （SAGE） algorithm. In the proposed algorithm, every sub-frame of the MIMO-OFDM system is divided into some OFDM sub-blocks and the LMMSE-based SAGE algorithm in each sub-block is used. At the head of each sub-flame, we insert training symbols which are used in the initial estimation at the beginning. Channel estimation of the previous sub-block is applied to the initial estimation in the current sub-block by the maximum-likelihood （ML） detection to update channel estimatjon and data detection by iteration until converge. Then all the sub-blocks can be finished in turn. Simulation results show that the proposed algorithm can improve the bit error rate （BER） performance.
基金Project supported by the Major State Basic Research Development Program of China (Grant Nos.2013CB329602 and 2012CB316303)the Science Research Foundation for the Returned Overseas Chinese Scholars,China (Grant No.2010-31)+1 种基金the International Collaborative Project of Shanxi Province,China (Grant No.2011081034)the National Natural Science Foundation of China (Grant Nos.61232010 and 61202215)
文摘Community detection methods have been used in computer, sociology, physics, biology, and brain information science areas. Many methods are based on the optimization of modularity. The algorithm proposed by Blondel et al. （Blondel V D, Guillaume J L, Lambiotte R and Lefebvre E 2008 J. Star. Mech. 10 10008） is one of the most widely used methods because of its good performance, especially in the big data era. In this paper we make some improvements to this algorithm in correctness and performance. By tests we see that different node orders bring different performances and different community structures. We find some node swings in different communities that influence the performance. So we design some strategies on the sweeping order of node to reduce the computing cost made by repetition swing. We introduce a new concept of overlapping degree （OV） that shows the strength of connection between nodes. Three improvement strategies are proposed that are based on constant OV, adaptive OV, and adaptive weighted OV, respectively. Experiments on synthetic datasets and real datasets are made, showing that our improved strategies can improve the performance and correctness.
文摘A system model based on joint layer mechanism is formulated for optimal data scheduling over fixed point-to-point links in OFDMA ad-hoc wireless networks. A distributed scheduling algorithm （DSA） for system model optimization is proposed that combines the randomly chosen subcarrier according to the channel condition of local subcarriers with link power control to limit interference caused by the reuse of subcarrier among links. For the global fairness improvement of algorithms, a global power control scheduling algorithm （GPCSA） based on the proposed DSA is presented and dynamically allocates global power according to difference between average carrier-noise-ratio of selected local links and system link protection ratio. Simulation results demonstrate that the proposed algorithms achieve better efficiency and fairness compared with other existing algorithms.
基金supported by the National Natural Science Foundation of China under Grant No.61371112
文摘In order to minimize the transmitted power in the multi-user orthogonal frequency division multiplexing（OFDM） system, a scheme combining the improved particle swarm optimization（POS） algorithm with genetic algorithm（GA） is proposed to optimize the sub-carriers and bits allocation. In the algorithm, a random velocity between the maximum and minimum particle velocity is used as the updating velocity instead of maximum or minimum velocity when the updated particle velocity is higher than the maximum particle velocity or lower than the minimum particle velocity. Then, the convergence population is used as the initial population of the genetic algorithm to optimize the subcarriers and bits allocation further. Simulation results show that the transmitted power of the proposed algorithm is about 2 d B to 10 d B lower than that of the genetic algorithm, particle swarm optimization algorithm, and Zhang＇s algorithm.
文摘This paper investigates the blind algorithm for channel estimation of Orthogonal Frequency Division Multiplexing-Multiple Input Multiple Output (OFDM-MIMO) wireless communication system using the subspace decomposition of the channel received complex baseband signals and proposes a new two-stage blind algorithm. Exploited the second-order cyclostationarity inherent in OFDM with cyclic prefix and the characteristics of the phased antenna, the practical HIPERLAN/2 standard based OFDM-MIMO simulator is established with the sufficient consideration of statistical correlations between the multiple antenna channels under wireless wideband multipath fading environment, and a new two-stage blind algorithm is formulated using rank reduced subspace channel matrix approximation and adaptive Constant Modulus (CM)criterion. Simulation results confirm the theoretical analysis and illustrate that the proposed algorithm is capable of tracking matrix channel variations with fast convergence rate and improving acceptable overall system performance over various common wireless and mobile communication links.
