It is shown in this paper that the pole-assignment problem for a linear time-invariant system of order (n) having (p) number of inputs can be solved by seeking the solution of the same problem for a similar system of order (n−p−r) [where 1≤r≤p] having (r1) [withr1≤r] number of inputs. This operation can be repeated to simplify the pole-assignment problem in a recursive manner.