This paper presents the tree structure of the solution set for logic partitioning problem and some matrix inequalities relating to the total amount of pins.
本文给出了逻辑划分问题解集合的树结构以及有关总针数的若干矩阵不等式，建立了一个分枝限界算法。
Aiming at the problem of the large over-complete dictionary storage, a new method is proposed based on signal set partitioning method.
针对信号稀疏分解中过完备原子库存储量大的问题，本文提出了利用信号集合划分研究过完备原子库的新方法。
应用推荐