Same rate and pattern recognition search of orthogonal variable spreading factor code tree for wideband code division multiple access networks

Abstract

Orthogonal variable spreading factor-based code division multiple access systems allocate vacant codes when new call (s) arrive. This study proposes a same rate assignment scheme which allocates a new call to most favourable code in the region crowded by same rate calls. This does not add to blocked codes because of previous calls but utilise the unused scattered capacity created by previous calls. A vacant code whose parent code is handling maximum number of ongoing calls of same rate is the most favourable code for new call assignment under that sub tree. This reduces higher rate blocking because of scattering of lower rate calls due to the fact that same rate calls will be assigned in the same portion of code tree. If a tie occurs for two parent codes it is resolved using pattern recognition of codes. In the proposed scheme, the most favourable search starts from higher layers that reduce number of code searches before assignment significantly. The proposed single code and multi code schemes are compared with other schemes based on code blocking probability, throughput and number of code searches required before assignment. Simulation results indicate that the proposed scheme outperforms other schemes for various traffic distributions.