Abstract: In order to generate high-quality target code for the indirect addressing mode of digital signal processors, an address allocation adaptive genetic algorithm is proposed. The core idea of the algorithm is to encode the address allocation scheme in binary, calculate the fitness function by the inverse of the sum of non-adjacent marks of the address register change trajectory, and then use the adaptive strategy to perform sequential crossover and exchange mutation operations on individuals with high fitness with a lower probability, so that good genes can be protected and enter the next generation, and give individuals with low fitness a higher probability, so that poor genes are eliminated, so as to escape from the local optimum and converge quickly. Through simulation experiments on a large number of random variable access sequences, the results show that the algorithm has high operating efficiency, and the address calculation instruction cost is reduced by 11% and 8% compared with Liao\'s algorithm and Leupers\' algorithm respectively. Keywords: address allocation; adaptive genetic algorithm; increment/decrement
You Might Like
Recommended ContentMore
Live replay: Keysight's small probes, big knowledge, don't let the probes drag down your test results!
Control System Simulation and CAD
MIT 6.622 Power Electronics
Live playback: Wireless networking solution based on Infineon AIROC™ CYW20829 low-power Bluetooth chip
Live replay: ADI & WT·World Health MCU Pain Point Exploration Season: MCU application problems are solved with all our strength!
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore
EEWorld
subscription
account
EEWorld
service
account
Automotive
development
circle
About Us Customer Service Contact Information Datasheet Sitemap LatestNews
Room 1530, 15th Floor, Building B,
No.18 Zhongguancun Street,
Haidian District,
Beijing, Postal Code: 100190
China
Telephone: 008610 8235 0740
京公网安备 11010802033920号
