本文提出了一个通用的数字电路的多块划分的算法．该算法能适用于不同的优化目标函数．我们在基于组迁移算法线网割（ｎｅｔｃｕｔｍｏｄｅｌ）模型基础上，在费用函数中引进一个有效的离散罚函数以考虑单元移动的潜在增益．使新算法较原来的Ｆ－Ｍ算法有较大的提高，同时还一定程度上减少了组迁移算法所固有的漂移性．由于采用了改进的桶排序技术，新算法还保持了Ｆ－Ｍ算法原有的线性时间复杂性．因而能适用于ＶＬＳＩ以及ＵＬＳＩ电路线网的划分． This paper presents a common multi-block digital circuit algorithm. The algorithm can be applied to different optimization objective function. Based on the netcutmodel model based on the group migration algorithm, we introduce an effective discrete penalty function into the cost function to consider the potential gain of the cell movement. The new algorithm is greatly improved compared with the original F-M algorithm, and at the same time, the inherent drift of the group migration algorithm is reduced to a certain extent. Due to the improved bucket sorting technique, the new algorithm also preserves the original linear time complexity of the F-M algorithm. Which can be applied to VLSI and ULSI circuit network division.