For assigning channel in a cellular sireless network, we purpose satisfying constraints with a related probability between cells and channels on the channel interference matrix formed by m terminals and n channels. And we purpose to get efficient channel assigning to limited channels in a wireless cell using parallelism of neural networks. In this paper, we solve the problem according to the number of requeirements when channel change with 11-533 procession elements. We demonstrate efficiency of proposed algorithm through same simulations in a specific time period.