Cell registration method and apparatus, storage medium, and terminal

By recording and updating the secondary synchronization signal (SSS) information, the terminal can reselect a serving cell after a cell registration failure, thus solving the problem of cell registration failure, improving the success rate, and reducing latency.

CN115802478BActive Publication Date: 2026-04-10BEIJING XIAOMI MOBILE SOFTWARE CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
BEIJING XIAOMI MOBILE SOFTWARE CO LTD
Filing Date
2022-11-23
Publication Date
2026-04-10

AI Technical Summary

Technical Problem

After a terminal fails to register in a cell, it selects the same cell again, which results in a prolonged inability to complete cell registration and affects mobile network usage.

Method used

The terminal records the secondary synchronization signal (SSS) information found, deletes the information of failed cells, searches for and records new SSS information again, and determines a new serving cell for registration based on the updated list.

Benefits of technology

It improved the success rate of community registration, reduced the registration latency, and avoided registration failures caused by repeatedly selecting unsuccessful communities.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115802478B_ABST
    Figure CN115802478B_ABST
Patent Text Reader

Abstract

The present disclosure provides a cell registration method and device, a storage medium and a terminal. The method comprises: performing cell search, recording the information of the searched secondary SSS in a first list; in response to determining that the first cell registration fails, deleting the information of the first SSS in the first list to obtain an updated first list; performing the cell search operation again, recording the information of the searched new SSS in a second list; determining a second SSS based on the updated first list and the second list; and performing the cell registration on the second cell again. The present disclosure can effectively avoid the problem that the terminal determines the original service cell as the service cell again when performing the cell search again, leading to the failure of the cell registration again, improve the success rate of the cell registration, and reduce the time delay of the cell registration.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of communication, and particularly relates to a cell registration method and device, a storage medium and a terminal. BACKGROUND

[0002] At present, when a terminal performs cell registration, the terminal can select a serving cell based on a signal energy value of a searched synchronization signal, and then perform cell registration on the selected serving cell. If the serving cell is abnormal, the cell registration can fail. After the cell registration fails, the terminal reselects a serving cell, and the reselected serving cell is still the same as the previously selected serving cell, which causes the cell registration to fail again, so that the terminal cannot complete the cell registration for a long time, and the terminal cannot normally use the mobile network. SUMMARY

[0003] Therefore, the present application discloses a cell registration method and device, a storage medium and a terminal.

[0004] According to a first aspect of an embodiment of the present disclosure, a cell registration method is provided, the method is performed by a terminal, and the method comprises the following steps.

[0005] Performing a cell search operation, and recording information of a searched secondary synchronization signal (SSS) in a first list;

[0006] In response to determining that cell registration in a first cell fails, deleting information of a first SSS in the first list to obtain an updated first list; wherein the first cell is a serving cell determined based on the information of the first SSS;

[0007] Performing a cell search operation again, and recording information of a searched new SSS in a second list;

[0008] Determining a second SSS from the updated first list and the second list;

[0009] Performing cell registration on a second cell again; wherein the second cell is a new serving cell determined based on the information of the second SSS.

[0010] Optionally, the determining that the cell registration in the first cell fails comprises any one of the following:

[0011] In response to not receiving a registration response message returned by a network device of the first cell after initiating a registration request message to the network device, it is determined that the cell registration in the first cell fails;

[0012] After initiating the registration request message to the network device, a rejection message returned by the network device for rejecting the registration request is received, and it is determined that the cell registration in the first cell fails.

[0013] In response to a failure of initiating random access in the first cell, determining a failure of registration in the first cell.

[0014] Optionally, before deleting the information of the first SSS in the first list, the method further comprises:

[0015] Determining that a number of failures of registration in the first cell reaches a preset number.

[0016] Optionally, the information of the SSS comprises at least one of:

[0017] an identity of the SSS;

[0018] a signal energy value of the SSS.

[0019] Optionally, the determining the second SSS in the updated first list and the second list comprises:

[0020] establishing a third list based on the updated first list and the second list, wherein the third list is used to record information of SSSs common to the updated first list and the second list;

[0021] if the third list is not empty, determining the SSS with the largest signal energy value in the third list as the second SSS;

[0022] if the third list is empty, determining the SSS with the largest signal energy value in the second list as the second SSS.

[0023] Optionally, after determining the second SSS, the method further comprises:

[0024] determining a target physical cell identity (PCI) based on the signal energy value of the second SSS and a signal energy value of a primary synchronization signal (PSS) searched by the terminal;

[0025] determining a cell indicated by the target PCI at a current frequency point as the second cell.

[0026] Optionally, the method further comprises:

[0027] in response to determining a failure of registration in the second cell, deleting information of the second SSS in the second list to obtain an updated second list;

[0028] The updated second list is taken as the updated first list again, and the steps of performing the re-executed cell search operation, recording information of a new SSS searched in the second list, until cell registration succeeds or until registration fails on all cells determined based on information of each SSS searched.

[0029] Optionally, the method further comprises:

[0030] In response to determining that registration fails on all cells determined based on information of each SSS searched, starting a system sweep operation or a band sweep operation.

[0031] According to a second aspect of the embodiments of the present disclosure, a cell registration apparatus is provided, the apparatus is applied to a terminal, and the apparatus comprises:

[0032] A first search module, configured to perform a cell search operation, and record information of a secondary synchronization signal (SSS) searched in a first list;

[0033] A first execution module, configured to, in response to determining that a first cell registration fails, delete information of a first SSS in the first list to obtain an updated first list; wherein the first cell is a serving cell determined based on the information of the first SSS;

[0034] A second search module, configured to re-perform a cell search operation, and record information of a new SSS searched in a second list;

[0035] A determination module, configured to determine a second SSS in the updated first list and the second list;

[0036] A second execution module, configured to re-perform cell registration on a second cell; wherein the second cell is a new serving cell determined based on the information of the second SSS.

[0037] According to a third aspect of the embodiments of the present disclosure, a computer readable storage medium is provided, and the computer readable storage medium stores a computer program, the computer program is executed by a processor to implement the steps of the cell registration method in any of the above aspects.

[0038] According to a fourth aspect of the embodiments of the present disclosure, a terminal is provided, and the terminal comprises:

[0039] A processor;

[0040] A memory for storing processor executable instructions;

[0041] The processor is configured to execute the executable instructions to implement the steps of the cell registration method in any of the above aspects.

[0042] The technical scheme provided by the embodiments of the present disclosure can include the following beneficial effects:

[0043] In the present disclosure, if the terminal fails to register in the first cell, the terminal can delete the information of the signal energy value of the first SSS in the first list of signal energy values recorded previously. The first cell is the serving cell determined by the terminal based on the information of the first SSS. Further, the terminal performs the cell search operation again, and records the information of the signal energy value of the newly searched second SSS in the second list. Based on the updated first list and the second list, the second SSS is determined together, and the cell registration is performed again in the second cell determined based on the information of the second SSS. The present disclosure can effectively avoid the problem that the terminal determines the original serving cell as the serving cell again when performing the cell search again, and causes the cell registration to fail again, thereby improving the success rate of the cell registration and reducing the time delay of the cell registration.

[0044] It should be understood that the foregoing general description and the following detailed description are only exemplary and explanatory, and are not limiting to the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0045] The accompanying drawings, which are incorporated into and form part of the specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the present disclosure.

[0046] Figure 1 is a flowchart of a cell registration method according to an exemplary embodiment of the present disclosure;

[0047] Figure 2 is a flowchart of another cell registration method according to an exemplary embodiment of the present disclosure;

[0048] Figure 3 is a flowchart of another cell registration method according to an exemplary embodiment of the present disclosure;

[0049] Figure 4 is a flowchart of another cell registration method according to an exemplary embodiment of the present disclosure;

[0050] Figure 5 is a flowchart of another cell registration method according to an exemplary embodiment of the present disclosure;

[0051] Figure 6 is a flowchart of another cell registration method according to an exemplary embodiment of the present disclosure;

[0052] Figure 7 is a block diagram of a cell registration device according to an exemplary embodiment of the present disclosure;

[0053] Figure 8is a block diagram of a terminal according to an exemplary embodiment. DETAILED DESCRIPTION

[0054] The exemplary embodiments will be described in detail with reference to the drawings. The following description is made with reference to the accompanying drawings, in which like reference numerals refer to like elements throughout. The following detailed description is not intended to limit the exemplary embodiments to particular embodiments described. Other exemplary embodiments can be derived from the following description by applying current knowledge of the art and modifying aspects of the particular embodiments described.

[0055] Mobile communication technology is currently developing rapidly around the world. Currently, the mobile communication networks mainly used are the fourth generation mobile communication network (4th Generation Mobile Communication Technology, 4G) and the fifth generation mobile communication network (5th Generation Mobile Communication Technology, 5G). With the development of mobile communication networks, there will be the sixth generation mobile communication network and the seventh generation mobile communication network, etc. When a terminal wants to obtain the service of a mobile communication network, it needs to register to a cell in the mobile network first.

[0056] Taking the cell registration process after the terminal is powered on as an example, it needs to go through several steps as shown in Figure 1 , including:

[0057] First, the terminal is powered on.

[0058] Second, the terminal is initialized.

[0059] Third, the terminal performs Public Land Mobile Network (PLMN) selection.

[0060] Fourth, the terminal performs a frequency sweeping operation.

[0061] Fifth, the terminal performs a cell search operation.

[0062] Sixth, the terminal demodulates system messages.

[0063] Seventh, the terminal performs cell selection or camping.

[0064] Finally, the terminal completes cell registration.

[0065] Wherein, after the terminal completes the frequency sweeping, the terminal will perform cell search on the scanned frequency point. The main process of the cell search includes: searching the primary synchronization signal (PSS) and the secondary synchronization signal (SSS), and the process of searching the SSS is determined according to the signal energy value of the searched SSS.

[0066] Generally, the terminal will search the signal energy value corresponding to the PSS (the number of PSS is 1), and will also search multiple signal energy values corresponding to multiple SSS respectively. The terminal will select the SSS with the largest signal energy value, and determine the physical cell identifier (PCI) according to the following formula 1:

[0067] PCI = 3 × SSS + PSS Formula 1

[0068] Wherein, SSS is the identifier of the SSS with the largest signal energy value, and PSS is the identifier of PSS. The value range of the identifier of PSS can be 0, 1, 2, and the value range of the identifier of SSS is [0, 167].

[0069] After calculating the PCI by using the above formula 1, the terminal can complete the downlink synchronization process. After the downlink synchronization is completed, the terminal will perform cell camping on the cell corresponding to the PCI, and initiate the cell registration process.

[0070] The terminal can identify the serving cell of the terminal according to the frequency point obtained by the frequency sweeping and the calculated PCI. However, the serving cell may be abnormal in many cases. If the terminal cannot register to the current abnormal serving cell, the terminal can perform cell selection again after the network search timer (timer) expires. However, if the terminal still determines the PCI according to the above formula 1, the terminal will still determine the PCI according to the maximum value in the multiple signal energy values corresponding to the multiple SSS respectively. In this way, the obtained PCI is the same as the previously calculated PCI. The terminal will continue to register on the problem cell, which will cause the registration failure again. After multiple cell registration failures, the terminal may perform system scan operation or band scan operation again, which will cause the terminal to be unable to use the mobile network normally for a long time.

[0071] To solve the above technical problems, the present disclosure provides a cell registration method and device, storage medium and terminal, which effectively avoids the problem that the terminal determines the original serving cell as the serving cell again when re-performing cell search, leading to the failure of cell registration again, improves the success rate of cell registration, and reduces the time delay of cell registration.

[0072] Figure 2 is a flow chart of a cell registration method according to an exemplary embodiment of the present application, which is described from the terminal side. The terminal includes but is not limited to mobile phones, notebook computers, desktop computers, tablet computers, etc. As shown in Figure 2 The cell registration method includes the following steps:

[0073] In step 201, a cell search operation is performed, and the information of the searched secondary synchronization signal (SSS) is recorded in a first list.

[0074] In the embodiments of the present disclosure, the terminal can perform a cell search operation and record the information of each searched SSS in the form of a list. The information of the SSS includes but is not limited to the identification of the SSS and the signal energy value of the SSS.

[0075] It should be understood that the present disclosure takes the recording of the searched SSS information into the list as an example for illustration, and in actual application, the searched SSS information can also be recorded into an array or a database, which is not limited by the present disclosure.

[0076] In step 202, in response to determining that the first cell registration fails, the information of the first SSS is deleted from the first list, and an updated first list is obtained.

[0077] In the embodiments of the present disclosure, the first cell is a serving cell determined based on the information of the first SSS. The information of the SSS includes but is not limited to at least one of the following: the identification of the SSS; and the signal energy value of the SSS.

[0078] The terminal can take the SSS with the largest signal energy value in the first list as the first SSS, and determine a PCI based on the identification of the first SSS and the identification of the PSS according to the above formula 1. The cell indicated by the PCI is determined as the first cell. The terminal performs cell registration in the first cell.

[0079] In a possible implementation, after initiating the registration request message to the network device of the first cell, if a registration response message returned by the network device is not received within a preset time length, the terminal can determine that the registration in the first cell fails; if the registration response message returned by the network device is received within the preset time length, the terminal can determine that the registration in the first cell succeeds. The preset time length can be set according to actual needs, and the size of the preset time length is not limited herein.

[0080] In another possible implementation, after initiating the registration request message to the network device, the terminal receives a rejection message returned by the network device for rejecting the registration request, and can also determine that the registration in the first cell fails. After initiating the registration request message to the network device, the terminal receives an acceptance message returned by the network device for accepting the registration request, and can determine that the terminal registers in the first cell successfully.

[0081] In another possible implementation, if the terminal fails to initiate random access in the first cell, it can be determined that the registration in the first cell fails; if the terminal succeeds in initiating random access in the first cell, it can be determined that the terminal registers in the first cell successfully.

[0082] Of course, the above is only an example, and in actual applications, the terminal can determine whether the registration in the first cell fails in other manners.

[0083] In the embodiments of the present disclosure, if the terminal determines that the registration in the first cell fails, the terminal can delete the information of the first SSS in the first list, including but not limited to deleting the identifier and the signal energy value of the first SSS, to obtain an updated first list.

[0084] In step 203, the cell search operation is performed again, and the information of the searched new SSS is recorded in a second list.

[0085] In the embodiments of the present disclosure, the terminal can perform the cell search operation again, and record the information of each new SSS searched again in the form of a list, including but not limited to recording the identifier of each new SSS and the second signal energy value of each new SSS in the second list. In the embodiments of the present disclosure, the first list and the second list can be in the form of a set.

[0086] In step 204, a second SSS is determined from the updated first list and the second list.

[0087] In the embodiments of the present disclosure, the terminal can determine the second SSS based on the information of the SSS included in the first list and the second list. The specific determination manner will be introduced in subsequent embodiments, which is not introduced herein.

[0088] In step 205, cell registration is performed again on the second cell.

[0089] In this embodiment of the disclosure, after the terminal determines the second SSS, it can determine the target PCI based on the information of the second SSS and the information of the primary synchronization signal PSS searched by the terminal, using the above formula 1.

[0090] Specifically, the target PCI can be calculated using Formula 1 above, based on the identifiers of the second SSS and the PSS.

[0091] Furthermore, the terminal identifies the cell indicated by the target PCI at the current frequency as the second cell, and performs cell registration again on the second cell.

[0092] In the above embodiments, when the terminal re-performs cell registration, since the first SSS used to determine the serving cell has been deleted, the newly determined serving cell will not be the same as the previous serving cell. This effectively avoids the problem that the terminal will re-determine the original serving cell as the serving cell when re-performing cell search, which would cause cell registration to fail again. This improves the success rate of cell registration and reduces the latency of cell registration.

[0093] In some alternative embodiments, the terminal may perform step 202 above in response to determining that the number of registration failures in the first cell has reached a preset number.

[0094] Optionally, the preset number of times can be a positive integer greater than or equal to 2, and this disclosure does not limit it.

[0095] In the above embodiments, if the terminal fails to register in the first cell multiple times, it can delete the information of the first SSS from the first list to obtain an updated first list, thereby re-determining a new registration cell in the future. This avoids the problem of misjudging that there is an anomaly in the registration process of the serving cell due to a registration failure, and improves the reliability of the cell registration process.

[0096] In some alternative embodiments, refer to Figure 3 As shown, Figure 3 Based on this application Figure 2 The flowchart of another cell registration method shown in the embodiment above, in step 204, the process of determining the second SSS in the updated first list and second list, may include the following steps:

[0097] In step 301, a third list is created based on the updated first list and the second list.

[0098] In this embodiment of the disclosure, the third list is used to record the SSS information shared by the updated first list and the second list, that is, the third list is the intersection of the first list and the second list.

[0099] For example, if the first list includes information for SSS#1, SSS#2, and SSS#3, and the second list includes information for SSS#1, SSS#2, and SSS#4, then the third list may include information for SSS#1 and SSS#2.

[0100] For example, if the first list includes information for SSS#1, SSS#2, and SSS#3, and the second list includes information for SSS#4, SSS#5, and SSS#6, then the third list is empty.

[0101] If the third list is not empty, proceed to step 302; if the third list is empty, proceed to step 303.

[0102] In step 302, the SSS with the largest signal energy value in the third list is determined as the second SSS.

[0103] For example, the third list includes information about SSS#1 and SSS#2. Assuming that the signal energy value of SSS#2 is greater than that of SSS#1, the terminal will identify SSS#2 as the second SSS.

[0104] In step 303, the SSS with the largest signal energy value in the second list is determined as the second SSS.

[0105] For example, the third list is empty. In the second list, SSS#5 has the highest signal energy value, so the terminal can identify SSS#5 as the second SSS.

[0106] In the above embodiments, if the lists searched by the terminal in both searches contain a common SSS, the terminal determines the SSS with the highest signal energy value among the common SSS as the second SSS. If the lists searched by the terminal in both searches do not contain a common SSS, the terminal determines the SSS with the highest signal energy value among the most recently searched SSS as the second SSS. A new registered cell can then be determined based on the second SSS. This improves the reliability of determining a new registered cell after a previous cell registration failure.

[0107] In some alternative embodiments, refer to Figure 4 As shown, Figure 4 Based on this application Figure 2 The flowchart of another cell registration method shown in the embodiment, after step 205, may further include the following steps:

[0108] In step 206, in response to determining that the registration in the second cell fails, the information of the second SSS is deleted from the second list, obtaining an updated second list.

[0109] In the embodiments of the present disclosure, once the terminal fails to perform cell registration in the second cell again, the terminal can delete the information of the second SSS from the second list, obtaining an updated second list.

[0110] In one possible implementation, when the number of registration failures of the terminal in the second cell reaches the preset number of times, the terminal can delete the information of the second SSS from the second list, obtaining an updated second list.

[0111] The preset number of times can be a positive integer greater than or equal to 2.

[0112] In step 207, the updated second list is taken as the updated first list again, and step 202 is performed until the cell registration succeeds or until the registration fails in all the cells determined based on the information of each searched SSS.

[0113] In the embodiments of the present disclosure, the terminal can take the updated second list as the updated first list again, perform the cell search operation again, record the information of the new SSS searched in the new second list, determine a new second SSS based on the updated first list and the new second list determined at this time, and perform cell registration in a new second cell determined based on the information of the new second SSS again.

[0114] The above process is repeatedly performed until the terminal registers successfully in a certain cell.

[0115] Alternatively, the above process is repeatedly performed until the terminal fails to register in all the cells determined based on all the SSS searched in the current frequency point.

[0116] In the above embodiments, the terminal can repeatedly perform the above process until the cell registration succeeds or until the registration fails in all the cells determined based on the information of each searched SSS, thereby improving the success rate of cell registration and reducing the time delay of cell registration.

[0117] In some optional embodiments, referring to FIG. 2, Figure 5 Figure 5 is a flowchart of another cell registration method illustrated based on the embodiments of the present disclosure, Figure 4 the above method can further include the following steps after step 207:

[0118] ​In step 208, in response to determining that registration fails on all cells determined based on information of each searched SSS, a system sweep operation or a band sweep operation is started.

[0119] In embodiments of the present disclosure, the system sweep operation refers to that the terminal sweeps the stored historical frequency points under the current frequency band. The band sweep operation refers to that all frequency bands supported by the terminal are swept.

[0120] In embodiments of the present disclosure, the terminal can start the system sweep operation or the band sweep operation in the case that registration fails on all cells determined based on information of each searched SSS.

[0121] In the above embodiments, the terminal can start the system sweep operation or the band sweep operation in the case that registration fails on all cells determined under the current frequency band, until the terminal successfully registers to a cell, or registration fails on all cells determined under all frequency bands, and the availability is high.

[0122] In some optional embodiments, Figure 6 FIG. 1 is a flowchart of a cell registration method according to an exemplary embodiment of the present disclosure. The embodiment is described from the terminal side, and the terminal includes but is not limited to a mobile phone, a notebook computer, a desktop computer, a tablet computer, etc. As shown in FIG. 1, the cell registration method includes the following steps: Figure 6

[0123] In step 601, a cell search operation is performed, and information of a searched secondary synchronization signal (SSS) is recorded in a first list.

[0124] The specific implementation of this step is similar to that of step 201 described above, and will not be described here again.

[0125] In step 602, it is listened whether the terminal is performing cell registration

[0126] If the terminal is performing cell registration, step 603 is continued, otherwise the cell registration process is ended.

[0127] In step 603, it is determined whether registration fails in a first cell.

[0128] In one possible implementation, in response to that no registration response message returned by a network device of the first cell is received after a registration request message is initiated to the network device, the terminal determines that registration fails in the first cell.

[0129] In another possible implementation, after the registration request message is initiated to the network device, a rejection message returned by the network device for rejecting the registration request is received, and the terminal determines that registration fails in the first cell. ​

[0130] In another possible implementation, in response to the random access initiated in the first cell failing, the terminal determines that the registration in the first cell fails.

[0131] If the terminal determines that the registration in the first cell fails, continue to perform 604, and if the terminal succeeds in the registration in the first cell, end the cell registration procedure.

[0132] In step 604, it is determined whether the number of registration failures in the first cell reaches a preset number.

[0133] In the embodiment of the present disclosure, the preset number is a positive integer greater than or equal to 2.

[0134] If the number of registration failures in the first cell reaches the preset number, continue to perform step 605, otherwise, perform the cell registration in the first cell again. If the terminal succeeds in the registration in the first cell before the preset number is reached, end the cell registration procedure.

[0135] In step 605, the information of the first SSS is deleted from the first list to obtain an updated first list.

[0136] In step 606, the cell search operation is performed again, and the information of a new SSS searched is recorded in a second list.

[0137] In step 607, a third list is established based on the updated first list and the second list.

[0138] In step 608, it is determined whether the third list is empty.

[0139] If not, continue to perform step 609, and if yes, continue to perform step 610.

[0140] In step 609, the SSS with the maximum signal energy value in the third list is determined as the second SSS.

[0141] In step 610, the SSS with the maximum signal energy value in the second list is determined as the second SSS.

[0142] In step 611, a target PCI is determined based on the information of the second SSS and the information of a primary synchronization signal (PSS) searched by the terminal.

[0143] The terminal can calculate the target PCI based on the identity of the second SSS and the identity of the PSS by using the above formula 1.

[0144] In step 612, a cell indicated by the target PCI at a current frequency point is determined as the second cell.

[0145] In step 613, cell registration is performed again on the second cell.

[0146] If the second cell registration is successful, the cell registration process is ended, and if the second cell registration fails, the information of the second SSS is deleted from the second list, an updated second list is obtained, the updated second list is taken as the updated first list again, and the above step 606 is executed again until the cell registration is successful or until the registration fails on all the cells determined based on the information of each searched SSS.

[0147] In step 614, in response to determining that the registration fails on all the cells determined based on the information of each searched SSS, a system sweep operation or a frequency band sweep operation is started.

[0148] In the above embodiment, the problem that the terminal determines the original serving cell as the serving cell again when performing cell search again, leading to the failure of cell registration again, can be effectively avoided, the success rate of cell registration is improved, and the time delay of cell registration is reduced.

[0149] Corresponding to the foregoing application function implementation method embodiment, the disclosure further provides an application function implementation device embodiment.

[0150] Reference Figure 7 , Figure 7 is a block diagram of a cell registration device according to an exemplary embodiment, the device is applied to a terminal, and the device comprises:

[0151] A first search module 701 is configured to perform a cell search operation, and record the information of a searched secondary synchronization signal (SSS) in a first list.

[0152] A first execution module 702 is configured to, in response to determining that the first cell registration fails, delete the information of a first SSS from the first list to obtain an updated first list, wherein the first cell is a serving cell determined based on the information of the first SSS.

[0153] A second search module 703 is configured to perform a cell search operation again, and record the information of a searched new SSS in a second list.

[0154] A determination module 704 is configured to determine a second SSS from the updated first list and the second list.

[0155] A second execution module 705 is configured to perform cell registration on a second cell again, wherein the second cell is a new serving cell determined based on the information of the second SSS.

[0156] In some optional embodiments, the first execution module 702 comprises any one of the following:

[0157] The first determining submodule is configured to determine that the registration in the first cell fails in response to that no registration response message returned by the network device of the first cell is received after the registration request message is initiated to the network device of the first cell.

[0158] The second determining submodule is configured to determine that the registration in the first cell fails in response to that a rejection message returned by the network device for rejecting the registration request is received after the registration request message is initiated to the network device.

[0159] The third determining submodule is configured to determine that the registration in the first cell fails in response to that the random access initiated in the first cell fails.

[0160] In some optional embodiments, the apparatus further comprises:

[0161] The number of times determining module is configured to determine that the number of times of the registration failure in the first cell reaches a preset number of times.

[0162] In some optional embodiments, the information of the SSS comprises at least one of the following:

[0163] The identity of the SSS;

[0164] The signal energy value of the SSS.

[0165] In some optional embodiments, the determining module 704 comprises:

[0166] The establishing submodule is configured to establish a third list based on the updated first list and the second list, wherein the third list is used to record the information of the SSSs that are common between the updated first list and the second list.

[0167] The fourth determining submodule is configured to determine the SSS with the largest signal energy value in the third list as the second SSS if the third list is not empty.

[0168] The fifth determining submodule is configured to determine the SSS with the largest signal energy value in the second list as the second SSS if the third list is empty.

[0169] In some optional embodiments, the apparatus further comprises:

[0170] The PCI determining module is configured to determine a target physical cell identity (PCI) based on the information of the second SSS and the information of the primary synchronization signal (PSS) searched by the terminal.

[0171] The cell determining module is configured to determine a cell indicated by the target PCI at the current frequency point as the second cell.

[0172] In some optional embodiments, the apparatus further includes:

[0173] The third executing module is configured to, in response to determining that the registration in the second cell fails, delete the information of the second SSS from the second list to obtain an updated second list.

[0174] The control module is configured to control the updated second list to be the updated first list again, and control the second searching module to perform the cell searching operation again, and record the information of a new SSS searched in the second list until the cell registration succeeds or until the registration in all cells determined based on the information of each SSS searched fails.

[0175] In some optional embodiments, the apparatus further includes:

[0176] The sweeping module is configured to, in response to determining that the registration in all cells determined based on the information of each SSS searched fails, start a system sweeping operation or a frequency band sweeping operation.

[0177] For the apparatus embodiments, since they basically correspond to the method embodiments, the related parts can be referred to the part of the description of the method embodiments. The apparatus embodiments described above are merely illustrative, and the units described above as separate components can or can not be physically separate, and the components displayed as units can or can not be physical units, i.e., they can be located in one place, or distributed on multiple network units. Part or all of the modules can be selected to achieve the purpose of the present disclosure according to actual needs. Those skilled in the art can understand and implement it without creative labor.

[0178] Correspondingly, the present disclosure also provides a computer readable storage medium for storing a computer program, wherein the computer program is executed by a processor to implement the steps of the cell registration method according to any one of the above.

[0179] Correspondingly, the present disclosure also provides a cell registration apparatus, including:

[0180] a processor;

[0181] a memory for storing processor executable instructions;

[0182] The processor is configured to execute the executable instructions to implement the steps of the cell registration method according to any one of the above.

[0183] Figure 8 is a block diagram of a cell registration apparatus according to an exemplary embodiment. The apparatus 800 can be a terminal such as a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, a fitness device, a personal digital assistant, and the like, for example.

[0184] Referring to Figure 8 The apparatus 800 can include one or more of the following components: a processing component 802, a memory 804, a power supply component 806, a multimedia component 808, an audio component 810, an input / output (I / O) interface 812, a sensor component 816, and a communication component 818.

[0185] The processing component 802 usually controls overall operations of the apparatus 800, such as operations associated with displaying, making phone calls, data communications, camera operations, and recording operations. The processing component 802 can include one or more processors 820 to execute instructions to complete all or part of steps of the above methods. In addition, the processing component 802 can include one or more modules to facilitate interaction between the processing component 802 and other components. For example, the processing component 802 can include a multimedia module to facilitate the interaction between the multimedia component 808 and the processing component 802.

[0186] One of the processors 820 in the processing component 802 can be configured to perform the above cell registration method.

[0187] The memory 804 is configured to store various types of data to support operations of the apparatus 800. Examples of these data include instructions for any applications or methods operating on the apparatus 800, contact data, phonebook data, messages, pictures, videos, and the like. The memory 804 can be realized by any type of volatile or non-volatile storage devices or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic or optical disk.

[0188] The power supply component 806 supplies electrical power for the various components of the apparatus 800. The power supply component 806 can include a power supply management system, one or more power supplies, and other components associated with generating, managing and distributing power for the apparatus 800.

[0189] The multimedia component 808 includes a screen providing an output interface between the device 800 and a user. In some embodiments, the screen includes a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen can be implemented as a touch screen to receive input signals from a user. The touch panel includes one or more touch sensors to sense touch, swiping, and gestures on the touch panel. The touch sensor can not only sense a boundary of a touching or swiping action, but also detect duration and pressure related to the touching or swiping action. In some embodiments, the multimedia component 808 includes a front camera and / or a rear camera. When the device 800 is in an operation mode, such as a shooting mode or a video mode, the front camera and / or the rear camera can receive external multimedia data. Each of the front and rear camera can be a fixed optical lens system or have a focal length and optical zooming capability.

[0190] The audio component 810 is configured to output and / or input audio signals. For example, the audio component 810 includes a microphone (MIC) configured to receive an external audio signal when the device 800 is in an operation mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signal can be further stored in the memory 804 or transmitted via the communication component 818. In some embodiments, the audio component 810 also includes a speaker for outputting audio signals.

[0191] The I / O interface 812 provides an interface between the processing component 802 and peripheral interface modules, which can be a keypad, a click wheel, buttons, and the like. The buttons can include, but are not limited to, a home button, a volume button, a start button, and a lock button.

[0192] The sensor component 816 includes one or more sensors to provide various state assessments for the device 800. For example, the sensor component 816 can detect an open / closed state of the device 800, relative positioning of components, such as a display and a keypad of the device 800, a change in position of the device 800 or a component of the device 800, presence or absence of user contact with the device 800, a change in orientation of the device 800 or acceleration / deceleration of the device 800, and a temperature change of the device 800. The sensor component 816 can include a proximity sensor configured to detect presence of a nearby object without any physical touch. The sensor component 816 can further include a light sensor, such as a CMOS or CCD image sensor, for use in an imaging application. In some embodiments, the sensor component 816 can further include an acceleration sensor, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.

[0193] The communication component 818 is configured to facilitate wired or wireless communication between the device 800 and other devices. The device 800 can access a wireless network based on a communication standard, such as WiFi, 3G, 4G, 5G, 6G, or a combination thereof. In an exemplary embodiment, the communication component 818 receives a broadcast signal or broadcast related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 818 also includes a Near Field Communication (NFC) module to facilitate short-range communication. For example, the NFC module can be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology and other technology.

[0194] In an exemplary embodiment, the device 800 can be implemented by one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), controllers, micro-controllers, microprocessors or other electronic elements, for performing the above-described methods.

[0195] In an exemplary embodiment, a non-transitory computer-readable storage medium including instructions, such as the memory 804 including instructions, is also provided, which can be executed by the processor 820 of the device 800 to complete the above-described methods. For example, the non-transitory computer-readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disc, and an optical data storage device, etc.

[0196] It should be noted that, in this document, the terms such as first and second are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. The terms "comprises", "comprising", or any other variations thereof are intended to cover non-exclusive inclusions, so that a process, method, article, or apparatus including a list of elements does not only include those elements, but also includes other elements not explicitly listed, or further includes elements inherent in such a process, method, article, or apparatus. Without more limitations, an element defined by the statement "comprises a" does not exclude the presence of additional identical elements in the process, method, article, or apparatus including the element.

[0197] Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the features disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

[0198] It should be understood that the present disclosure is not limited to the precise structures as herein described and illustrated in the drawings, and that various modifications and changes can be made without departing from its scope. The scope of the present disclosure is limited only by the claims that follow.

Claims

1. A cell registration method, characterized by, The method is performed by a terminal, and the method comprises: performing a cell search operation, and recording information of a searched secondary synchronization signal (SSS) in a first list; in response to determining that registration in a first cell fails, deleting information of a first SSS in the first list to obtain an updated first list; wherein the first cell is a serving cell determined based on the information of the first SSS; performing a cell search operation again, and recording information of a searched new SSS in a second list; determining a second SSS in the updated first list and the second list; wherein the second SSS is an SSS common to the updated first list and the second list, or the second SSS is an SSS in the second list in a case that the updated first list and the second list have no common SSS; performing cell registration again on a second cell; wherein the second cell is a new serving cell determined based on information of the second SSS.

2. The method of claim 1, wherein, The determining that registration in the first cell fails comprises any one of: in response to not receiving a registration response message returned by a network device of the first cell after initiating a registration request message to the network device, determining that registration in the first cell fails; after initiating the registration request message to the network device, receiving a rejection message returned by the network device for rejecting the registration request, and determining that registration in the first cell fails; in response to initiating random access in the first cell failing, determining that registration in the first cell fails.

3. The method of claim 1, wherein, Before deleting the information of the first SSS in the first list, the method further comprises: determining that a number of times of registration failure in the first cell reaches a preset number of times.

4. The method according to any one of claims 1 to 3, characterized in that, The information of the SSS comprises at least one of: an identifier of the SSS; a signal energy value of the SSS.

5. The method of claim 4, wherein, The determining the second SSS in the updated first list and the second list comprises: establishing a third list based on the updated first list and the second list; wherein the third list is used to record information of an SSS common to the updated first list and the second list; if the third list is not empty, determining an SSS with a maximum signal energy value in the third list as the second SSS; if the third list is empty, determining an SSS with a maximum signal energy value in the second list as the second SSS.

6. The method according to any one of claims 1 to 3, characterized in that, After determining the second SSS, the method further comprises: determining a target physical cell identifier (PCI) based on information of the second SSS and information of a primary synchronization signal (PSS) searched by the terminal; determining a cell indicated by the target PCI at a current frequency point as the second cell.

7. The method according to any one of claims 1 to 3, characterized in that, The method further comprises: in response to determining that registration in the second cell fails, deleting information of the second SSS in the second list to obtain an updated second list. The updated second list is taken as the updated first list again, the step of performing the re-executing cell search operation again, and recording information of a new SSS searched in the second list is performed until cell registration succeeds or until registration fails on all cells determined based on information of each SSS searched.

8. The method of claim 7, wherein, The method further comprises: in response to determining that registration fails on all cells determined based on information of each SSS searched, starting a system sweep operation or a frequency band sweep operation.

9. A cell registration apparatus characterized by comprising: The apparatus is applied to a terminal, and the apparatus comprises: a first search module configured to perform a cell search operation and record information of a secondary synchronization signal (SSS) searched in a first list; a first execution module configured to, in response to determining that a first cell registration fails, delete information of a first SSS in the first list to obtain an updated first list; wherein the first cell is a serving cell determined based on information of the first SSS; a second search module configured to perform a cell search operation again and record information of a new SSS searched in a second list; a determination module configured to determine a second SSS in the updated first list and the second list; wherein the second SSS is an SSS common to the updated first list and the second list, or the second SSS is an SSS in the second list in the case that the updated first list and the second list have no common SSS; a second execution module configured to perform cell registration on a second cell again; wherein the second cell is a new serving cell determined based on information of the second SSS.

10. A computer-readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by a processor to implement steps of the cell registration method of any one of claims 1-8.

11. A terminal, characterized by comprising: comprises: a processor; a memory for storing processor-executable instructions; wherein the processor is configured to execute the executable instructions to implement steps of the cell registration method of any one of claims 1-8.

Citation Information

Patent Citations

  • Cell search method, communication device, readable storage medium and chip system

    CN114586418A

  • Method and appratus for searching a cell based on interference cancellation

    KR1020150074718A