Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Scrambling code resolution

A code division multiple access and base station technology, applied in the direction of multiplexing code distribution, code division multiplexing system, signaling distribution, etc., can solve problems such as SHO failure

Active Publication Date: 2015-04-01
TELEFON AB LM ERICSSON (PUBL)
View PDF3 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This is typical of poor SC planning, which also causes SHO to fail

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Scrambling code resolution
  • Scrambling code resolution
  • Scrambling code resolution

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0089] A node (eg, RNC 30 ) receives a first type of measurement report (MR) reporting a scrambling code (SC)=450. It is known that SC=450 belongs to the sectors of the active set, so it is guaranteed to be sector 254. The node also receives a second type of measurement report (MR) with report scrambling code (SC)=48. There are two possible candidates for SC=48. The candidates are sector 751 and sector 79 .

[0090] The timing reference for each sector 254, 751 and 79 is known (via Figure 6 The timing of is obtained with reference to recovery step 101). MR received from terminal carries T for SC=450 and SC=48 m value. Timing reference for sector 254 = 10000 chips. Timing reference for sector 751 = 500 chips. Timing reference for sector 79 = 9351 chips. T for SC=48 m The value of is 2852 chips. T for SC=450 m The value of is 3500 chips.

[0091] Applying equation (2) above:

[0092] (5)

[0093] Candidate sectors = 751.

[0094] d[ i,j ]=(10000-500)–(3500-28...

example 2

[0102] Robust SC parsing. Unlike distance-based SC parsing, which assumes geometry to clarify uncertainty, the proposed scheme based on analyzing the relative distances between candidates is a robust approach, since it relies on the actual Network measurement. Figure 12 and Table 2 shows that SC=447 has two candidates, sectors 1242 and 1309. By comparing the relative distances between the two candidates (obtained using the method described above) and the reference sector, it is clear that sector 1309 is the correct choice for the candidate. However, relying only on the physical distance between sectors will lead to wrong decisions.

[0103]

[0104] Table 2. Example of radio distance dependence

example 3

[0106] Detect sectors that do not exist in the network topology. If the relative distance is not in the proper range, this means that there are some missing sectors in the network topology due to, for example, insufficient buffers. In Table 3, SC=172 has two candidates: sectors 308 and 1258. The relative distances for the two candidates are far from plausible, indicating that there are missing sectors for SC 172 .

[0107]

[0108] Table 3. Examples of missing sectors

[0109] Yet another use of the method is to detect SC collisions. When the SC rules are not designed properly, the terminal may measure two different sectors with the same SC. This is an undesirable situation which results in SHO failure and possible dropped connections. Embodiments of the present invention are able to detect this situation by noticing that MRs refer to two different sectors with the same SC at different times.

[0110] In the above example, the time-dependent quantity T m Reported by t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A code division multiple access wireless network (10) comprises a plurality of base stations (11-14) which operate asynchronously with respect to one another. A set of scrambling codes are allocated to the base stations for scrambling signals transmitted from the base stations. A node (30) of the wireless network receives (102) a first type of measurement report from wireless terminals (20), which comprises an observed time difference measurement acquired by the wireless terminal (20) for a signal received from one of an active set of base stations (11, 12, 13) that currently serve the wireless terminal. A timing reference is determined (103) for each of the base stations using a plurality of the observed time difference measurements. A second type of measurement report is received (105) from a wireless terminal (20) which comprises an observed time difference measurement acquired by the wireless terminal for a signal received from a base station (14) which is not currently serving the wireless terminal and a scrambling code of the received signal. An identity of the base station (14) in the second type of measurement report is determined by using the scrambling code of the signal received from the base station (14) which is not currently serving the wireless terminal and the observed time difference measurement in the second type of measurement report and the determined timing reference for that base station.

Description

technical field [0001] The present invention relates to code division multiple access wireless systems using a scrambling code to scramble transmitted signals. Background technique [0002] In Code Division Multiple Access (CDMA) wireless systems such as Universal Mobile Telecommunications System (UMTS), scrambling codes (SC) are used to distinguish signals transmitted from different wireless base stations. [0003] The wireless terminal measures properties of signals received from surrounding base stations and reports back to the network the measurements and the corresponding scrambling codes for each received signal. Measurements reported by wireless terminals are handled by the network. By using the scrambling code as the identifier of the cell / sector, each measurement reported by the wireless terminal is mapped to a specific and unique cell / sector of the network. This process is often referred to as scrambling code resolution. Scrambling code resolution can be perform...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W36/04
CPCH04W36/0094H04W56/001H04J13/18H04J2013/0096H04L5/0053H04W36/0061H04W36/32
Inventor C. 尤贝达卡斯特拉诺斯J. 罗密欧加西亚O. 穆诺兹阿拉贡
Owner TELEFON AB LM ERICSSON (PUBL)
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com