通過(guò)分析單元從規(guī)則柵格中稀疏的稀疏直線陣列的綜合問(wèn)題，得出枚舉稀疏線陣所有可能的陣列結(jié)構(gòu)是稀疏陣窮舉綜合法的重要任務(wù)。提出了兩種可用于枚舉稀疏線陣陣列結(jié)構(gòu)的算法，即遞歸算法和二進(jìn)制序列窮舉法，并分析比較了稀疏線陣的陣列口徑和稀布率與算法性能的關(guān)系。計(jì)算機(jī)仿真結(jié)果顯示了它們各自的有效性和適用性，最后指明兩種算法在稀疏陣綜合中適用的場(chǎng)合。In the process of exhaustive synthesis of thinned arrays(whose elements are thinned from the uniform grid), enumerating the configuration of linear thinned arrays is main task of design. Followed by the analyses of element spacing synthesis, two enumerate algorithms of exhaustive study on configuration of linear thinned arrays are proposed in this paper, they are recursion algorithm and binary sequence enumerate algorithm. Some comparison studies on their performance are made in order to reveal the doable relations with the thinned ratio and aperture of the arrays. The results of computer simulation show the efficiency and applicability of the algorithms respectively. Finally, their performance trials reveal the applicability when they are applied to element spacing synthesis.