Abstract: The present invention provides an authorized shared access (ASA) assisted interference coordination method in a heterogeneous time-division duplexing (TDD) relay network. In a TDD relay system architecture, an ASA controller assists a secondary system to perform an interference coordination mechanism by adjusting a time slot structure configuration and synchronization information, and a mobility management entity (MME) obtains a time slot configuration and the synchronization information of a primary system through ASA, and selects, according to relevant information of a relay node inside a management range, an optimal time slot configuration and a working mode for the relay node.

Abstract: Disclosed is a network frequency spectrum sharing method, a user terminal of the present network sending a network signal strength measurement report of the different network to a home base station; an operation management node of the present network, based on the network signal strength measurement report, calculating a network overlapping level indicator of the different network, and obtaining network overlapping topology-based information of the different network; and the two networks exchanging the network overlapping topology-based information, and calculating a policy for allocating shared frequency spectrum resources therebetween. The present invention can enable different networks to fairly and reasonably share frequency spectrum resources within a specified range, thus increasing a frequency spectrum utilization rate.

Abstract: A spectrum allocation method for a cellular network is presented. The method includes: abstracting a cellular network into an interference pattern using a graph theory-based spectrum distribution model; a network node establishing a stakeholder list to represent whether a spectrum can be shared with other network nodes; by obtaining stakeholder lists from other network nodes, calculating a fairness coefficient and determining a lower bound value for the number of spectrum resources which are used; meanwhile, each network node sending out a value related to the fairness coefficient, thereby enables calculate an upper bound value for the number of resources which can be obtained according to the obtained information, to effectively compete for free resources.

Abstract: The present invention provides a system and method for avoiding mobile relay interference to a primary system on an authorized frequency spectrum.

Abstract: The invention provides an uplink and downlink slot time resource configuration method based on interference perception in a TDD system, which is applied to a communication network comprising a source base station, a target base station, as well as a user terminal in the source base station and a user terminal in the target base station, and the method comprises: judging whether the base station-to-base station interference is larger than a preset threshold value or not, if yes, canceling the uplink and downlink slot time resource configuration, and if no, continuously executing the next step; judging whether the interference measurement of the target base station on the user terminal in the source base station is larger than a preset threshold value or not, if no, executing the uplink and downlink slot time resource configuration, and if yes, executing the next step; judging whether the interference measurement of the source base station on the user terminal in the target base station is larger than a preset

Abstract: A channel decoding method and decoder are disclosed. The decoding method is based on a Circular Viterbi Algorithm (CVA), rules out impossible initial states one by one through iterations according the received soft information sequence, and finally finds the global optimal tail-biting path. In the present invention, all impossible iterations are ruled out through multiple iterations, and only the initial state having most likelihood with the received sequence survives. The algorithm is finally convergent to an optimal tail-biting path to be output. In addition, the method also updates a metric of a maximum likelihood tail-biting path (MLTBP) or rules out impossible initial states through the obtained surviving tail-biting path, thereby effectively solving the problem that the algorithm is not convergent due to a circular trap, providing a practical optimal decoding algorithm for a tail-biting convolutional code, reducing the complexity of an existing decoding scheme, and saving the storage space.

Abstract: A spectrum allocation method for a cellular network is presented. The method includes: abstracting a cellular network into an interference pattern using a graph theory-based spectrum distribution model; a network node establishing a stakeholder list to represent whether a spectrum can be shared with other network nodes; by obtaining stakeholder lists from other network nodes, calculating a fairness coefficient and determining a lower bound value for the number of spectrum resources which are used; meanwhile, each network node sending out a value related to the fairness coefficient, thereby enables calculate an upper bound value for the number of resources which can be obtained according to the obtained information, to effectively compete for free resources.

Abstract: The present invention discloses a cluster head assisted method for converting a user terminal from device-to-device (D2D) communication to cellular communication. When quality of a D2D link between a user terminal and a cluster head is lower than a predetermined threshold, if the user terminal has to leave the cluster but still expects to continue an original the service, the user terminal performs cell search and random access, and establishes a radio resource control (RRC) connection with a target base station of a cellular network. Switching from D2D communication to cellular communication is implemented with the assistance of the cluster head, and a communication manner after the switching is provided. The present invention implements mobile switching from D2D communication in distributed cluster communication to cellular communication, which can reduce route search delay and save wireless resources.

Abstract: The present invention discloses a cluster head assisted method for converting a user terminal from device-to-device (D2D) communication to cellular communication. When quality of a D2D link between a user terminal and a cluster head is lower than a predetermined threshold, if the user terminal has to leave the cluster but still expects to continue an original the service, the user terminal performs cell search and random access, and establishes a radio resource control (RRC) connection with a target base station of a cellular network. Switching from D2D communication to cellular communication is implemented with the assistance of the cluster head, and a communication manner after the switching is provided. The present invention implements mobile switching from D2D communication in distributed cluster communication to cellular communication, which can reduce route search delay and save wireless resources.

Abstract: A channel decoding method and decoder are disclosed. The decoding method is based on a Circular Viterbi Algorithm (CVA), rules out impossible initial states one by one through iterations according the received soft information sequence, and finally finds the global optimal tail-biting path. In the present invention, all impossible iterations are ruled out through multiple iterations, and only the initial state having most likelihood with the received sequence survives. The algorithm is finally convergent to an optimal tail-biting path to be output. In addition, the method also updates a metric of a maximum likelihood tail-biting path (MLTBP) or rules out impossible initial states through the obtained surviving tail-biting path, thereby effectively solving the problem that the algorithm is not convergent due to a circular trap, providing a practical optimal decoding algorithm for a tail-biting convolutional code, reducing the complexity of an existing decoding scheme, and saving the storage space.