Abstract
In this paper, we propose a modified discrete Hopfield neural networks algorithm for the channel assignment problem. In opposition to previous work, we tried to apply the optimization locally on a per cell basis in order to reduce the CPU processing time and decrease the designed system complexity while obtaining a near-optimum solution. In addition, the research is extended to study the algorithm performance in a more realistic cellular system where the number of requested channels is continuously changing with time. In this paper, the channel assignment problem is formulated as an energy function which is at its minimum when all the defined compatibility constraints are satisfied and the assigned channel number (ACN) is equal to the requested channel number (RCN) in each cell.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
