CN110062461B - Method and device for signal transmission - Google Patents

Method and device for signal transmission Download PDF

Info

Publication number
CN110062461B
CN110062461B CN201810055716.XA CN201810055716A CN110062461B CN 110062461 B CN110062461 B CN 110062461B CN 201810055716 A CN201810055716 A CN 201810055716A CN 110062461 B CN110062461 B CN 110062461B
Authority
CN
China
Prior art keywords
paging
random access
occasion
period
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810055716.XA
Other languages
Chinese (zh)
Other versions
CN110062461A (en
Inventor
高宽栋
黄煌
颜矛
邵华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201810055716.XA priority Critical patent/CN110062461B/en
Priority to PCT/CN2019/071062 priority patent/WO2019141123A1/en
Publication of CN110062461A publication Critical patent/CN110062461A/en
Application granted granted Critical
Publication of CN110062461B publication Critical patent/CN110062461B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W68/00User notification, e.g. alerting and paging, for incoming communication, change of service or the like
    • H04W68/02Arrangements for increasing efficiency of notification or paging channel
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access, e.g. scheduled or random access
    • H04W74/08Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access, e.g. scheduled or random access
    • H04W74/08Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0833Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure

Abstract

The application provides a signal transmission method and device. The network equipment sends paging indication messages to a plurality of terminal equipment, wherein a first terminal equipment in the plurality of terminal equipment receives at least one paging indication message at a first paging occasion, and determines a first random access occasion period corresponding to the first paging occasion according to a first mapping relation comprising the at least one paging occasion and at least one random access occasion period, and then sends a first random access preamble at the first random access occasion in the first random access occasion period, so that the network equipment receives at least one random access preamble at the at least one random access occasion period, determines at least one paging occasion according to the at least one random access occasion period or the at least one random access preamble, and sends paging messages to the terminal equipment corresponding to the at least one paging occasion, thereby avoiding sending paging messages to the plurality of terminal equipment and saving the overhead of signal transmission.

Description

Method and device for signal transmission
Technical Field
The present application relates to the field of communications, and more particularly, to a method and apparatus for signal transmission.
Background
The fifth generation (5th Generation,5G) of the future communication of the system adopts carrier frequencies higher than those of long term evolution (Long Term Evolution, LTE), such as carrier frequencies above 6GHz, e.g. 38GHz, 72GHz, etc., so as to realize wireless communication with larger bandwidth and higher transmission rate. Due to the higher carrier frequency, the wireless signal experiences more severe fading during spatial propagation, and even the receiving end may have difficulty detecting the wireless signal. For this reason, beamforming (beamforming) technology will be used in the 5G communication system to obtain a beam with good directivity. Beamforming techniques are used to limit the ability to transmit signals within a certain beam direction, thereby increasing the efficiency of signal transmission and reception.
Because the beam coverage using the beamforming technique is narrow and the network device does not know the specific location of the terminal device, the network device may send broadcast information (e.g., paging message (paging)) to perform beam scanning to cover the location of the unknown terminal device. In order to reduce the cost of beam scanning in the paging message transmission process, when paging information comes, the network device can send a paging indication message (paging indication) in advance, after receiving the paging indication message broadcast by the network device, the terminal device feeds back a beam with better signal quality by random access preamble (preamble), and the network device sends the paging information according to the beam reported by the terminal device, so that the network device can avoid sending paging to the terminal device in a poor receiving direction, thereby reducing the cost of beam scanning.
In the conventional scheme, the terminal device may feed back the random access preamble at any random access occasion after receiving the paging indication message, and in the case that there are multiple terminal devices corresponding to different paging occasions feeding back the random access preamble, the network device cannot distinguish which terminal device corresponding to the paging occasion a certain random access preamble belongs to, so that the network device cannot exclude terminal devices that cannot be paged, that is, paging messages are still sent to each terminal device, which causes a large overhead of paging message transmission.
Disclosure of Invention
The application provides a signal transmission method and device, which can reduce the transmission overhead.
In a first aspect, a method of signal transmission is provided, the method comprising: the terminal equipment receives paging indication information on a first paging occasion; the terminal equipment determines a first random access opportunity period corresponding to the first paging opportunity according to a first mapping relation, wherein the first mapping relation is a mapping relation between at least one paging opportunity and at least one random access opportunity period; the terminal device transmits a first random access preamble on a first random access occasion in the first random access occasion period.
The network equipment sends paging indication messages to a plurality of terminal equipment, wherein a first terminal equipment in the plurality of terminal equipment receives at least one paging indication message at a first paging occasion, and determines a first random access occasion period corresponding to the first paging occasion according to a first mapping relation comprising the at least one paging occasion and at least one random access occasion period, and then sends a first random access preamble at the first random access occasion in the first random access occasion period, so that the network equipment receives at least one random access preamble at the at least one random access occasion period, determines at least one paging occasion according to the at least one random access occasion period or the at least one random access preamble, and sends paging messages to the terminal equipment corresponding to the at least one paging occasion, thereby avoiding sending paging messages to the plurality of terminal equipment and saving the overhead of signal transmission.
In some possible implementations, the first mapping relationship is a mapping relationship of the at least one paging occasion to the at least one random access occasion period in a one-to-one correspondence; or the first mapping relationship is a mapping relationship between each random access opportunity period in the at least one random access opportunity period and at least one paging opportunity; or the first mapping relationship is a mapping relationship between each paging occasion of the at least one paging occasion and at least one random access occasion period.
In some possible implementations, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is a kth random access opportunity period after the random access opportunity period in which the second paging opportunity is located, where K is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relationship.
In some possible implementations, the random access occasion period corresponding to the second paging occasion in the at least one paging occasion in the first mapping relationship is an L-th random access occasion period after a preset time threshold after the second paging occasion, where L is an integer greater than or equal to 0, and the second paging occasion is any paging occasion in the first mapping relationship.
After a period of time, it may be ensured that all terminal devices have time to process the received paging indication message and transmit the random access preamble.
In some possible implementations, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is a Q-th random access opportunity period in a plurality of random access opportunity periods between the second paging opportunity and an nth paging opportunity subsequent to the second paging opportunity, where N is an integer greater than 0, Q is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relationship.
In some possible implementations, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is a P-th random access opportunity period after the second paging opportunity and a J-th paging opportunity after the second paging opportunity, where J is an integer greater than 0, P is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relationship.
In some possible implementations, the random access occasion period corresponding to the second paging occasion in the first mapping relationship is M consecutive random access occasion periods among a plurality of random access occasion periods between the second paging occasion and an I-th paging occasion after the second paging occasion, where I is an integer greater than or equal to 0, M is a positive integer, and the second paging occasion is any paging occasion in the first mapping relationship.
In some possible implementations, the method further includes: and the terminal equipment determines the value of M according to the number of the synchronous signal blocks corresponding to the first random access time.
In some possible implementations, before the terminal device sends the first random access preamble on the first random access occasion in the first random access occasion period, the method further includes: the terminal equipment determines the first random access preamble according to a second mapping relation and the first paging occasion, wherein the second mapping relation is the mapping relation between the at least one paging occasion and the at least one random access preamble.
In some possible implementations, before the terminal device sends the first random access preamble on the first random access occasion in the first random access occasion period, the method further includes: the terminal equipment determines the first random access preamble according to a third mapping relation and at least one synchronous signal block corresponding to the first random access opportunity, wherein the third mapping relation is the mapping relation between the at least one synchronous signal block and the at least one random access preamble.
In some possible implementations, in a case where the paging indication message carries at least one paging packet identifier and the terminal device belongs to a first paging packet corresponding to the at least one paging packet identifier, before the terminal device sends the first random access preamble on a first random access occasion in the first random access occasion period, the method further includes: the terminal equipment determines the first random access preamble according to a fourth mapping relation and the first paging packet, wherein the fourth mapping relation is the mapping relation of at least one paging packet and at least one random access preamble.
In some possible implementations, before the terminal device sends the first random access preamble on the first random access occasion in the first random access occasion period, the method further includes: the terminal equipment determines the first random access opportunity according to a fifth mapping relation, a sixth mapping relation and the paging indication message, wherein the fifth mapping relation is the mapping relation between at least one paging indication message received by the first paging opportunity and at least one synchronous signal block, and the sixth mapping relation is the mapping relation between the at least one synchronous signal block and random access opportunity in a random access opportunity period.
In some possible implementations, before the terminal device determines the first random access occasion corresponding to the first paging occasion according to the first mapping relationship, the method further includes: the terminal equipment receives configuration information, wherein the configuration information carries the first mapping relation.
In some possible implementations, the method further includes: the terminal device receives second configuration information, where the second configuration information includes at least one of a number of paging packets, a number of paging occasions in a random access occasion period, a time interval of adjacent paging occasions, and a number of synchronization signal blocks corresponding to the random access occasions, and the second configuration information is determined according to a number of random access preamble categories, where the number of random access preamble categories is determined according to a priority level of at least two of the paging packets, the random access occasions, and the synchronization signal blocks.
In a second aspect, a method for signal transmission is provided, where a network device sends paging indication messages to a plurality of terminal devices; the network device receiving at least one random access preamble on a random access occasion in at least one random access occasion period; the network device determining at least one paging occasion according to the at least one random access occasion period or the at least one random access preamble; the network device sends a paging message to at least one terminal device, where the at least one terminal device is a terminal device corresponding to the at least one paging occasion.
The terminal equipment receives at least one paging indication message at a first paging occasion, determines a first random access occasion period corresponding to the first paging occasion according to a first mapping relation comprising the at least one paging occasion and the at least one random access occasion period, and further sends a first random access preamble at the first random access occasion in the first random access occasion period, so that the network equipment receives at least one random access preamble at the at least one random access occasion period, determines at least one paging occasion according to the at least one random access occasion period or the at least one random access preamble, and sends paging messages to the terminal equipment corresponding to the at least one paging occasion, thereby avoiding sending paging messages to a plurality of terminal equipment and saving the expenditure of signal transmission.
In some possible implementations, the network device determining at least one paging occasion from the at least one random access occasion period includes: the network device determines the at least one paging occasion according to the first mapping relation and the at least one random access occasion period, wherein the first mapping relation is a mapping relation between the at least one random access occasion period and the at least one paging occasion.
In some possible implementations, the first mapping relationship is a mapping relationship of the at least one paging occasion to the at least one random access occasion period in a one-to-one correspondence.
In some possible implementations, the first mapping relationship is a mapping relationship of each random access occasion period of the at least one random access occasion period and at least one paging occasion.
In some possible implementations, the first mapping relationship is a mapping relationship of each paging occasion of the at least one paging occasion with at least one random access occasion period.
In some possible implementations, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is a kth random access opportunity period after the random access opportunity period in which the second paging opportunity is located, where K is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relationship.
In some possible implementations, the random access occasion period corresponding to the second paging occasion in the at least one paging occasion in the first mapping relationship is an L-th random access occasion period after a preset time threshold after the second paging occasion, where L is an integer greater than or equal to 0, and the second paging occasion is any paging occasion in the first mapping relationship.
After a period of time, it may be ensured that all terminal devices have time to process the received paging indication message and transmit the random access preamble.
In some possible implementations, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is a Q-th random access opportunity period in a plurality of random access opportunity periods between the second paging opportunity and an nth paging opportunity subsequent to the second paging opportunity, where N is an integer greater than 0, Q is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relationship.
In some possible implementations, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is a P-th random access opportunity period after the second paging opportunity and a J-th paging opportunity after the second paging opportunity, where J is an integer greater than 0, P is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relationship.
In some possible implementations, the random access occasion period corresponding to the second paging occasion in the first mapping relationship is M consecutive random access occasion periods among a plurality of random access occasion periods between the second paging occasion and an I-th paging occasion after the second paging occasion, where I is an integer greater than or equal to 0, M is a positive integer, and the second paging occasion is any paging occasion in the first mapping relationship.
In some possible implementations, the method further includes: the network equipment determines a first paging packet according to the random access preamble and a third mapping relation, wherein the third mapping relation is the mapping relation between at least one paging packet and the random access preamble; wherein the network device sending the paging message to the at least one terminal device comprises: the network device sends the paging message to the terminal device in the first paging packet.
In some possible implementations, the network device determining at least one paging occasion according to the at least one random access preamble includes: the network device determines the at least one paging occasion according to the at least one random access preamble and the second mapping relation, wherein the second mapping relation is a mapping relation between the at least one random access preamble and the at least one paging occasion.
In some possible implementations, before the network device sends the paging indication message on the at least one first paging occasion, the method further includes: the network device sends first configuration information, wherein the first configuration information carries the first mapping relation.
In a third aspect, a method for signal transmission is provided, where a network device sends paging indication messages to a plurality of terminal devices; the network device receives at least one random access preamble on a random access occasion in at least one random access occasion period, the at least one random access occasion period is determined by the terminal device according to a first mapping relationship, the first mapping relationship is a mapping relationship between the at least one random access occasion period and at least one paging occasion, and the network device sends a paging message according to the at least one random access preamble.
In some possible implementations, the network device may implement each of the possible implementations of the second aspect described above.
In a fourth aspect, a signal detection apparatus is provided, where the apparatus may be a terminal device or a chip in the terminal device. The device has the functions of implementing the embodiments of the first aspect described above. The functions can be realized by hardware, and can also be realized by executing corresponding software by hardware. The hardware or software includes one or more units corresponding to the functions described above.
In one possible design, when the apparatus is a terminal device, the terminal device includes: the processing unit may be, for example, a processor, and the transceiver unit may be, for example, a transceiver including radio frequency circuitry. Optionally, the terminal device further comprises a storage unit, which may be a memory, for example. When the terminal device includes a storage unit, the storage unit is configured to store computer-executable instructions, and the processing unit is connected to the storage unit, and the processing unit executes the computer-executable instructions stored in the storage unit, so that the terminal device performs the method for detecting a signal according to any one of the above first aspects.
In another possible design, when the device is a chip in a terminal device, the chip includes: a processing unit, which may be, for example, a processor, and a transceiver unit, which may be, for example, an input/output interface, pins or circuitry on the chip. The processing unit may execute computer-executable instructions stored by the storage unit to cause a chip within the terminal to perform the method of signal detection of any of the above-described first aspects. Alternatively, the storage unit is a storage unit in the chip, such as a register, a cache, or the like, and the storage unit may also be a storage unit in the terminal device that is located outside the chip, such as a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a random access memory (random access memory, RAM), or the like.
The processor mentioned in any of the above may be a general purpose Central Processing Unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the program of the method for signal detection according to the above first aspect.
In a fifth aspect, the present application provides a signal detection apparatus, where the apparatus may be a terminal device, or may be a chip in the terminal device. The device has the function of implementing the embodiments of the second aspect described above. The functions can be realized by hardware, and can also be realized by executing corresponding software by hardware. The hardware or software includes one or more units corresponding to the functions described above.
In one possible design, when the apparatus is a terminal device, the terminal device includes: the terminal device may further comprise a processing unit, which may be, for example, a processor, and a transceiver, which may be, for example, a transceiver comprising radio frequency circuitry, and optionally a storage unit, which may be, for example, a memory. When the terminal device includes a storage unit, the storage unit is configured to store computer-executable instructions, and the processing unit is connected to the storage unit, and the processing unit executes the computer-executable instructions stored in the storage unit, so that the terminal device performs the method for detecting a signal according to any one of the second aspects.
In another possible design, when the device is a chip in a terminal device, the chip includes: a processing unit, which may be, for example, a processor, and a transceiver unit, which may be, for example, an input/output interface, pins or circuitry on the chip. The processing unit may execute the computer-executable instructions stored by the storage unit to cause a chip within the terminal device to perform the method of signal detection of any of the above second aspects. Alternatively, the storage unit is a storage unit in the chip, such as a register, a cache, and the like, and the storage unit may also be a storage unit in the terminal device that is located outside the chip, such as a ROM or other type of static storage device that may store static information and instructions, a RAM, and the like.
The processor mentioned in any of the above may be a CPU, microprocessor, ASIC, or one or more integrated circuits for controlling the execution of the program of the method for signal detection in the above second aspect.
In a sixth aspect, there is provided a communication system comprising: the apparatus of the fourth aspect above and the apparatus of the fifth aspect above.
In a seventh aspect, a computer storage medium is provided, in which program code is stored for instructing the execution of the instructions of the method in any one of the above-mentioned first, second and third aspects or any possible implementation thereof.
In an eighth aspect, there is provided a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of any one of the above-described first, second and third aspects or any possible implementation thereof.
Based on the above scheme, the network device sends the paging indication message to the plurality of terminal devices, and the first terminal device in the plurality of terminal devices receives at least one paging indication message at a first paging occasion, and determines a first random access occasion period corresponding to the first paging occasion according to a first mapping relation comprising at least one paging occasion and at least one random access occasion period, and further sends a first random access preamble at the first random access occasion in the first random access occasion period, so that the network device receives at least one random access preamble at the at least one random access occasion period, determines at least one paging occasion according to the at least one random access occasion period or the at least one random access preamble, and sends the paging message to the terminal device corresponding to the at least one paging occasion, thereby avoiding sending the paging message to the plurality of terminal devices and saving the overhead of signal transmission.
Drawings
FIG. 1 is a schematic diagram of an application scenario according to an embodiment of the present application;
FIG. 2 is a schematic flow chart of one application scenario of an embodiment of the present application;
fig. 3 is a schematic structural diagram of a paging occasion according to an embodiment of the present application;
FIG. 4 is a schematic flow chart diagram of a method of signaling in accordance with one embodiment of the present application;
FIG. 5 is a schematic diagram of a method of signaling in accordance with another embodiment of the present application;
fig. 6 is a schematic diagram of a method of signal transmission according to yet another embodiment of the present application;
fig. 7 is a schematic diagram of a method of signal transmission according to yet another embodiment of the present application;
fig. 8 is a schematic diagram of a method of signal transmission according to yet another embodiment of the present application;
fig. 9 is a schematic diagram of a method of signal transmission according to yet another embodiment of the present application;
FIG. 10 is a schematic block diagram of an apparatus for signal transmission of one embodiment of the present application;
FIG. 11 is a schematic block diagram of an apparatus for signal transmission according to one embodiment of the present application;
FIG. 12 is a schematic block diagram of an apparatus for signaling in accordance with another embodiment of the present application;
fig. 13 is a schematic structural view of an apparatus for signal transmission according to another embodiment of the present application;
fig. 14 is a schematic block diagram of a communication system of signal detection of an embodiment of the present application.
Detailed Description
The technical solutions in the present application will be described below with reference to the accompanying drawings.
The technical solution of the embodiment of the application can be applied to various communication systems, for example: global system for mobile communications (Global System of Mobile communication, GSM), code division multiple access (Code Division Multiple Access, CDMA), wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA) systems, general packet Radio service (General Packet Radio Service, GPRS), long term evolution (Long Term Evolution, LTE) systems, LTE frequency division duplex (Frequency Division Duplex, FDD) systems, LTE time division duplex (Time Division Duplex, TDD), universal mobile telecommunications system (Universal Mobile Telecommunication System, UMTS), worldwide interoperability for microwave access (Worldwide Interoperability for Microwave Access, wiMAX) communication systems, 5G systems or New Radio (NR), and the like.
The terminal device in the embodiments of the present application may refer to a user device, an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent, or a user apparatus. The terminal device may also be a cellular telephone, a cordless telephone, a session initiation protocol (Session Initiation Protocol, SIP) phone, a wireless local loop (Wireless Local Loop, WLL) station, a personal digital assistant (Personal Digital Assistant, PDA), a handheld device with wireless communication capabilities, a computer device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a future 5G network or a terminal device in a future evolved public land mobile network (Public Land Mobile Network, PLMN), etc., as the embodiments of the application are not limited in this respect.
The network device in this embodiment of the present application may be a device for communicating with a terminal device, where the network device may be a base station (Base Transceiver Station, BTS) in a global system for mobile communications (Global System of Mobile communication, GSM) or code division multiple access (Code Division Multiple Access, CDMA), a base station (NodeB, NB) in a wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA) system, an evolved base station (eNB or eNodeB) in an LTE system, a wireless controller in a cloud wireless access network (Cloud Radio Access Network, CRAN) scenario, or the network device may be a relay station, an access point, a vehicle-mounted device, a wearable device, a network device in a future 5G network, or a network device in a future evolved PLMN network, etc., which is not limited in this application.
Fig. 1 is a schematic diagram of a communication system of the present application. The communication system in fig. 1 may comprise a user equipment 10 and a network device 20. The network device 20 is configured to provide a communication service for the user device 10 and access the core network, and the user device 10 accesses the network by searching for a synchronization signal, a broadcast signal, etc. transmitted by the network device 20, thereby performing communication with the network. The arrows shown in fig. 1 may represent uplink/downlink transmissions over the cellular link between the user equipment 10 and the network device 20.
Fig. 2 shows a schematic diagram of an application scenario of the present application.
The network device may detect 201 the paging message in real time.
The network device may send the paging message directly using the beams in different directions, i.e. step 206 is performed directly. It should be appreciated that the paging mechanism that performs step 206 directly after performing step 201 may be referred to as a "beam scanning paging mechanism" in the embodiments described below.
202, when detecting that the paging message arrives, the network device sends a paging indication message to the corresponding terminal device by adopting a Paging Occasion (PO) corresponding to each terminal device.
Specifically, the paging indication message may include control resource information and/or data resource information, or may be a control resource set (Control Resource Set, CORESET), or may be downlink control information (Down link control information, DCI), where the control resource information may be a physical downlink control channel (Physical Down Link Control Channel, PDCCH); the data resource information may be a physical downlink shared channel (Physical Downlink Shared Channel, PDSCH).
The data bit in the paging indication message may carry UE packet information, or may carry truncated Identity (ID) information of a part of the paged UE, or may carry UE ID information of a part or all of the paged UE, or may carry all of the UE packet information. The paging indication message may also be referred to as a paging index, or a part of information in the paging indication message may also be referred to as a paging index. The paging packet may be a UE packet, a packet based on a UE ID, a packet based on a different SS/PBCH block, or a packet based on a paging index.
As shown in fig. 3, the terminal device may wake up to receive signals with a discontinuous (discontinuous reception, DRX) cycle, which may include at least one paging occasion, at least one terminal device may signal on the same paging occasion, and different paging occasions are used to serve different terminal devices, respectively, within one DRX cycle. That is, the paging occasion of the network device for signal transmission with a certain terminal device is fixed. For example, paging occasions for serving a certain terminal device in different DRX cycles in fig. 3 are paging occasions numbered 5. In particular, the network device may transmit signals over a portion of the time units in each paging occasion.
The number of the random access preamble types described in the present application may be the number of random access preambles at one random access opportunity in one random access period, and the random access preamble and the random access opportunity may have a binding relationship. The random access preamble may be referred to as a random access resource, and the random access opportunity may be a random access resource.
It should be understood that, in the embodiment of the present application, the signal transmitted in the paging occasion may be a paging indication message or a paging message, which is not limited in this application.
It should also be appreciated that the time units may be frames, subframes, slots, or mini-slots, which are not limited in this application.
That is, each paging occasion may be used for paging a plurality of terminal devices, and one terminal device may receive paging messages only on one paging occasion within one DRX cycle.
Optionally, before step 202, the network device may send, to the terminal device, the mapping relationship between the information in the paging occasion or the time-frequency resource and the synchronization signal block (Synchronous signal blocks, SS blocks)/physical broadcast channel (Physical Broadcast Channel, PBCH) block, and the mapping relationship between the SS/PBCH block and the random access occasion in the random access occasion period, through the configuration information. The information in the paging occasion may be a paging indication message, control information of the paging indication message, data information of the paging message, or control information of the paging message. The time-frequency resource in the paging occasion may be a control information time-frequency resource of the paging indication message, or may be a data information time-frequency resource of the paging indication message, or may be a control information time-frequency resource of the paging information, or may be a data information time-frequency resource of the paging information.
It should be appreciated that the paging occasion includes at least one paging indication message or paging message, and the paging indication message or paging message in the paging occasion may be in a one-to-one correspondence with the SS/PBCH block, or may be one-to-many, or may be many-to-one.
It should be understood that the random access opportunity and the SS/PBCH block may be in one-to-one correspondence, one-to-many, or many-to-one relationship.
Alternatively, the paging indication message or paging message having a mapping relationship with the SS/PBCH block may be understood that the beam used for transmitting the paging indication message or paging message in the first paging occasion is the same as the beam used for transmitting the SS/PBCH in the SS/PBCH block.
The association in this application is related to what may also be referred to as mapping, correspondence. When the random access period or the random access set is related to the paging occasion, the terminal device of the paging occasion can send a random access preamble on the random access occasion in the random access period, and can be used for requesting a paging message or reporting a beam, and when the random access occasion is related to the paging message or the paging indication in the SS/PBCHblock or the paging occasion, the terminal device of the paging occasion and the paging message or the paging indication in the SS/PBCHblock or the paging occasion can also indicate that the terminal device of the paging occasion has a quasi-co-located (QCL) relation, can adopt the same time delay expansion or the same Doppler expansion or the same average gain, the same average time delay or the same airspace parameter to send or receive signals, or adopt the same beam to send or receive signals.
Where the index of item 1 associated with the jth item 2 is expressed using the form i0+i0+ (i+1) p1-1, where i0 may represent the starting index of item 1, when there is a multi-tier association, may be associated with multiple items, P1 may represent the number of items 1, may represent the number of items 1 associated with item 2, may represent the number of items 2 associated with item 1, and there is another expression, i.e., i=j0+floor (j/P1) or i=j0+ceil (j/P1) or i=j0+j/P1, where j0 may represent the starting index of item 2, j0 may be associated with i0, and i=j1+j or j=i0+i when P1 is equal to 1; the index of item 3 associated with the ith item 1 and the jth item 2 may be denoted i1+i+j P2, may be denoted i1+floor (i/Q1) +j P2 or i8+ceil (i/P2) +j P3, may be also expressed as the index of item 4 associated with the ith item 1, the jth item 2 and the kth item 3 may be denoted i2+i+j P2+k P3P 2, and may be expressed as i2+floor (i/Q1) +j P2+k P3+i2+ceil (i/Q1) +j P2+k P3, where P2 is the number of items 4 associated with item 1 and P3 is the number of items 4 associated with item 2. Wherein, item 1 is paging packet, Q1 represents the number of item 1 sharing item 4, any one of SS/PBCH block, PO, random access preamble, window of paging message, item 2 can be any one of paging packet, SS/PBCH block, PO, random access preamble, item 3 can be any one of paging packet, SS/PBCH block, PO, random access preamble, item 4 can be any one of paging packet, SS/PBCH block, PO, random access preamble.
Definition g (X, Y) may be expressed as X/Y, as floor (X/Y), or as ceil (X/Y).
It should be appreciated that the synchronization signal block of embodiments of the present application may include SS and/or PBCH. The SS may include PSS, SSs, or both PSS and SSs.
Optionally, the paging indication message may carry an Identity (ID) of the paging packet. Each paging packet may include a plurality of terminal devices, and each paging packet specifically includes which terminal devices may be preconfigured or pre-agreed with the network device. For example, the paging indication message corresponds to a different paging packet or a different paging packet by data bit order, for example, the paging indication message corresponds to a different paging packet or a different paging packet by data bit order.
Alternatively, the terminal device may directly perform step 204 in case the received paging indication message does not carry the ID of the paging packet. It should be appreciated that the paging mechanism that performs steps 201, 202, 205, 206 may be referred to as a "feedback-based paging mechanism" in the embodiments described below.
203, after receiving the paging indication message, the terminal device detects whether the terminal device is in a paging packet.
In case the paging indication message carries the ID of the paging packet, the terminal device determines whether itself is within the group according to the ID of the paging packet.
And 204, the terminal equipment determines the random access time according to the paging indication message received in the paging time corresponding to the terminal equipment.
Specifically, the paging indication message that can be received in the paging occasion corresponds to an SS/PBCH block, and the SS/PBCH block has a mapping relationship with a random access occasion in the random access occasion period. The terminal equipment determines an SS/PBCH block corresponding to the paging indication message received at the first paging occasion according to the received paging indication message, and then determines a first random access occasion in a random access occasion period (Random access channel occasion, RO) according to the SS/PBCH block.
It should be noted that the random access opportunity period may include at least one random access opportunity. In the case where a plurality of random access opportunities are included in the random access opportunity period, the random access opportunity included in the random access time period may be referred to as a "random access time group" or a "random access opportunity set". The first random access occasion may be at the same position in any random access occasion period.
It should be understood that the random access opportunity period may be a random access resource association period, or may be a random access resource allocation period, or may be a part of a random access resource association period, or may be a part of a random access resource allocation period. And (5) a random access opportunity period resource allocation period. The random access opportunity period can be understood as the amount of time or the time width occupied by transmitting random access resources; or the number of ROs sent.
It should be appreciated that the period of the random access opportunity in embodiments of the present application may be any of 10ms, 20ms, 40ms, 80ms, and 160 ms.
The terminal device sends 205 a random access preamble to the network device.
The terminal device transmits a random access preamble on a first random access occasion in any one or more random access occasion periods after receiving the paging indication message.
Optionally, after step 203, if the terminal device is not in the paging packet, the terminal device may go to a sleep state; if the terminal device is in the paging packet, a random access preamble is sent to the network device, and the random access preamble can be used for indicating the paging packet where the terminal device is located.
The network device transmits 206 a paging message to the at least one terminal device based on the random access preamble.
Specifically, the network device may determine for which terminal device each random access preamble is sent, and may further send paging messages to the terminal device feeding back the random access preamble, where each paging message carries an ID of the terminal device.
Optionally, the paging message may also carry a disaster early warning message such as a system update message, an earthquake disaster message, a volcanic disaster message, a tsunami disaster message, and the like.
It should be appreciated that the feedback mechanism performing steps 201-206 will be referred to as a "paging mechanism based on paging packets and feedback" in the embodiments described below.
In the conventional scheme, if the paging mechanism based on feedback and the paging mechanism based on paging packet and feedback as shown in fig. 2 are adopted, the terminal device may feed back the random access preamble at any random access opportunity after receiving the paging indication message, and in the case that there are multiple terminal devices corresponding to different paging opportunities for feeding back the random access preamble, the network device cannot distinguish which terminal device corresponding to the paging opportunity a certain random access preamble belongs to, so that the network device cannot exclude terminal devices that cannot be paged, that is, paging messages are still sent to each terminal device, which causes a large overhead of signal transmission.
Fig. 4 shows a schematic flow chart of a method of signal transmission according to an embodiment of the present application.
The network device sends 401 a paging indication message to a plurality of terminal devices. Accordingly, the terminal device receives the paging indication message on a first paging occasion corresponding to the terminal device.
Specifically, as shown in fig. 3, the first paging occasion includes transmitting at least one paging indication message, different paging occasions within one DRX cycle may be used to serve different terminal devices, and the network device may send one or more paging indication messages to the plurality of terminal devices on the at least one paging occasion. And receiving the paging indication message by one of the plurality of terminal devices on the paging occasion corresponding to the terminal device. The following embodiments take the paging occasion corresponding to the terminal device as the first paging occasion as an example.
Alternatively, the time-frequency resource location used for transmitting the paging indication message or the time period for transmitting all paging indication messages corresponding to all the SS/PBCH blocks actually transmitted or possibly transmitted in the field, or the time-frequency resource location used for transmitting the paging message or the time period for transmitting all paging messages corresponding to the SS/PBCH blocks of a plurality of or one in the field in the embodiment of the present application may be referred to as "paging occasion".
Optionally, in the embodiment of the present application, the time-frequency resource location used for transmitting the paging indication message and the time-frequency resource location used for transmitting the paging message are referred to as "paging occasions", and a first part of the time-frequency resource locations in the paging occasions are used for transmitting the paging indication message, and a second part of the time-frequency resource locations in the paging occasions are used for transmitting the paging message, where the first part of the time-frequency resource locations and the second part of the time-frequency resource locations do not overlap, and the paging occasions may include other time-frequency resources besides the first part of the time-frequency resource and the second part of the time-frequency resource, that is, the network device sends the paging indication message and the paging message to the terminal device on the same paging occasion.
It should be understood that the paging indication message or the time-frequency resource location of the paging message in the embodiments of the present application may correspond to a plurality or one SS/PBCH block, or may correspond to all SS/PBCH blocks in a field.
Optionally, the paging occasion of sending the paging indication message and the paging occasion of sending the paging message in the embodiment of the present application may also be paging occasions corresponding to the terminal device in different DRX cycles.
It should be understood that the paging indication messages sent by the network device over different time units may be the same or different.
It should also be appreciated that the terminal device corresponding to each paging occasion may include one or more.
It should also be appreciated that each paging occasion includes at least one time unit, which may be a frame, a subframe, a slot, or a mini-slot, which is not limited in this application.
And 402, the terminal equipment determines a first random access opportunity period according to a first mapping relation and a first paging opportunity, wherein the first mapping relation is the mapping relation of at least one paging opportunity and at least one random access opportunity period.
Optionally, the first mapping relationship may include a mapping relationship in which at least one paging occasion corresponds to at least one random access occasion period one to one. I.e. the network device or the terminal device can determine a corresponding or unique random access occasion period according to any paging occasion.
For example, as shown in fig. 5, paging occasion PO1 corresponds to random access occasion period 2, and paging occasion PO2 corresponds to random access occasion period 3. In this embodiment of the present application, the random access opportunity period may be from the start position of the ROS1 to the start position of the ROS2, where the ROS included in the random access opportunity period is the ROS included in the ROS1, so the embodiment of the present application may not distinguish between the "random access opportunity period" and the "random access opportunity set (ROS)".
It is to be appreciated that the number of at least one paging occasion in the first mapping relationship may be a number of all paging occasions included in one DRX cycle.
Alternatively, the first mapping relationship may include a mapping relationship of each of the at least one random access occasion period with the at least one paging occasion. That is, one or more paging occasions may correspond to the same random access occasion period, and the network device or the terminal device may determine a corresponding random access occasion period according to any paging occasion. The one or more paging occasions may be paging occasions within one random access occasion period or paging occasions within a plurality of random access time periods.
Alternatively, the first mapping relationship may be pre-agreed or defined according to a standard by the network device and the terminal device, or pre-sent by the network device, which is not limited in this application.
Optionally, the first mapping relationship may include a mapping relationship of each of the at least one paging occasion with at least one random access occasion period. That is, one paging occasion may correspond to one or more random access occasion periods.
Specifically, one paging occasion corresponds to a plurality of random access occasion periods, and different random access occasion periods can also be used to distinguish different SS/PBCH blocks or different paging packets.
Alternatively, the network device may send, before step 402, for example, between step 401 and step 403, or before step 401, second configuration information to the terminal device, where the second configuration information may carry the first mapping relation.
In one embodiment, if the paging occasions in the first mapping relationship correspond to the random access occasion periods one by one, the random access occasion period corresponding to the second paging occasion in the first mapping relationship may be a kth random access occasion period after the random access occasion period in which the second paging occasion is located, where K may be any positive integer. For example, when two adjacent paging occasions are the same as the random access occasion period, the paging occasions correspond to the random access occasion period one by one.
Specifically, the second paging occasion may be any one paging occasion included in the first mapping relation, and the second paging occasion may be the same paging occasion as the first paging occasion. That is, each paging occasion in the first mapping relationship has a feature corresponding to the second paging occasion, and for convenience of description, the second paging occasion in the first mapping relationship is taken as an example, which is not limited in the present application.
The random access opportunity period corresponding to the second paging opportunity in the first mapping relationship may be any random access opportunity period after the random access opportunity period where the second paging opportunity is located. Specifically, in the first mapping relationship, the second paging occasion corresponds to the kth random access occasion period after the second paging occasion, the value of K may be predetermined by the network device and the terminal device (for example, the value of K is any one of 0,1 and 2), or may be dynamically changed through the configuration of the second configuration information, and in the case of configuration through the second configuration information, the value of K may be at least one value of 0 to 16. Where k=0 indicates that the second paging occasion corresponds to a random access occasion period in which the second paging occasion is located. The correspondence may be association, mapping, or determining that the paging terminal of the paging occasion sends a random access preamble at a random access occasion on a corresponding random access occasion period, and requests or triggers a paging message.
For example, taking PO1 as the second paging occasion as an example, as shown in fig. 5, ROS2 corresponding to PO1 is the 2 nd random access occasion period after ROS1 where PO1 is located.
Alternatively, if the paging occasions correspond to the same random access occasion period, the random access occasion period may be the kth random access occasion period after the random access occasion period in which one (e.g., the last or first) paging occasion of the paging occasions is located.
It should be noted that the value of K may be the same as that of K in the above embodiment, and in order to avoid repetition, a detailed description is omitted here.
In another embodiment, if the paging occasions in the first mapping relationship correspond to the random access occasions one by one, the random access occasion period corresponding to the second paging occasion in the first mapping relationship may be an L-th random access occasion period after a preset time threshold after the second paging occasion, where L is an integer greater than or equal to 0.
Specifically, the preset time threshold may be a time period in units of a slot, ms, subframe, frame, symbol, or sampling interval, or the like, which is not limited in the present application. For example, the preset time threshold may be any one of 1 slot, 2 slots, 3-640 slots, or any one of 1ms, 2ms, 3-80ms, or any one of 1 subframe, 2 subframe, 3-40 subframe, or any one of 0.5 frame, 1 frame, 1.5 frame-8.5 frame, or any one of 1 symbol, 2 symbol, 3-1024 symbol, or any one of 1 sampling interval, 2 sampling interval, 3-2048 sampling interval. The time threshold may be related to the time interval of the paging occasion, may be related to the size of the random access period, may be related to the duration of the paging occasion, or may be related to the duration of the random access period. The paging occasion interval may be an adjacent paging occasion interval or a non-adjacent paging occasion interval. The time threshold may be a multiple of the paging occasion interval or a multiple of the random access period size.
For example, as shown in fig. 6, PO1 may correspond to the first ROS after a time threshold t after PO1, ROS2.
It should be understood that the second paging occasion may be counted from a starting position of the second paging occasion, may be counted from an ending position of the second paging occasion, or may be counted from a starting position of a time slot in the second paging occasion, where the paging indication message is received, which is not limited in this application.
It should be noted that the value of L may be the same as that of K in the above embodiment, and in order to avoid repetition, a detailed description is omitted here. Optionally, the value of L may be determined according to any one of a period of DRX, a time interval of adjacent paging occasions, a period of SS/PBCH block, and a subcarrier interval.
Alternatively, the specific value of the preset time threshold T may be determined according to any one of a random access opportunity period T, a time interval of adjacent paging opportunities, and a period T of SS/PBCH blocks. For example, if the subcarrier spacing is u, t=2 u
Specifically, the value of T may be a random access opportunity period T, or may be a multiple of T, for example, t=2t, 3T, or 4T.
Optionally, if the paging occasions in the first mapping relationship correspond to the random access occasion periods one by one, the random access occasion period corresponding to the second paging occasion in the first mapping relationship is a Q-th random access occasion period among a plurality of random access occasion periods between the second paging occasion and an nth paging occasion after the second paging occasion.
Specifically, in the case where there is a plurality of random access opportunity periods between the second paging opportunity and the nth paging opportunity subsequent to the second paging opportunity, the second paging opportunity may correspond to a first random access opportunity period of the plurality of random access opportunity periods, may correspond to a second random access opportunity period of the plurality of random access opportunity periods, or may correspond to the qth random access opportunity period, and may also correspond to a last random access opportunity period. When N is 1, that is, the random access opportunity periods are random access opportunity periods between the second paging opportunity and the next paging opportunity. For example, when the time interval of the adjacent paging occasion is greater than the random access occasion period, the second paging occasion may correspond to a first random access occasion period of the plurality of random access occasion periods, may correspond to a second random access occasion period of the plurality of random access occasion periods, may correspond to a Q-th random access occasion period, may also correspond to a last random access occasion period, and may also correspond to a plurality of random access periods of the plurality of random access occasion periods. The one or more random access occasion periods may be one or more random access occasion periods in a kth time interval after the time interval of the paging occasion. The value of K is any one of 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16. The plurality of random access occasion periods may be M random access occasion periods.
It should be noted that, the value of Q is less than or equal to the number of random access opportunity periods between the second paging opportunity and the nth paging opportunity.
For example, if N is taken to be 1 and q is taken to be 4, as shown in fig. 7, PO1 corresponds to ROS5 of 4 ROS between PO1 and PO 2.
Optionally, if the paging occasions in the first mapping relationship correspond to the random access occasion periods one by one, the second paging occasion in the first mapping relationship may correspond to the nth random access occasion period in the kth 1 time interval.
Specifically, the time interval between the second paging occasion and the next paging occasion (e.g., referred to as a third paging occasion) may be referred to as a current time interval, that is, k1=0, and the time interval between the third paging occasion and the next paging occasion (e.g., referred to as a fourth paging occasion) may be referred to as a second time interval. The second paging occasion may correspond to a first random access occasion period of the plurality of random access occasion periods in the kth 1 time interval, or to a second random access occasion period in the kth 1 time interval, or to a last random access occasion period in the kth 1 time interval. The time intervals of the different paging occasions may also be referred to as periods of the paging occasions.
Optionally, if the paging occasions in the first mapping relationship correspond to the random access occasion periods one by one, the second paging occasion in the first mapping relationship may correspond to the nth random access occasion period in the kth 1 time interval.
In particular, the time interval between the second paging occasion and the next paging occasion or occasions (e.g., referred to as a third paging occasion) may be referred to as a current time interval, k1=0, and the time interval between the third paging occasion and the next paging occasion or occasions (e.g., referred to as a fourth paging occasion) may be referred to as a second time interval, k1=2. The second paging occasion may correspond to a first random access occasion period of the plurality of random access occasion periods in a K1 th time interval after the first paging occasion period, or to a second random access occasion period in the K1 st time interval, or to a last random access occasion period in the K1 st time interval. The time interval of the different paging occasions may also be referred to as the period of the paging occasion, and the value of K1 may be any one or more of 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16. The correspondence here means that the terminal device of the paging occasion transmits the random access preamble on the random access occasion within the corresponding random access period.
Alternatively, the paging occasions within a period of time t1 may be associated with one or more random access periods within the random access period within a period of time t2. For example, t1 may be equal to t2. For example, t1 is 160ms and t2 is 160ms. the paging occasion within t1 may be associated with a random access period of the K2 t2 period after it.
It should be noted that the value of N may be the same as that of N in the above embodiment, and in order to avoid repetition, a detailed description is omitted here.
Optionally, the second paging occasion in the first mapping relationship may correspond to a P-th random access occasion period after a J-th paging occasion after the second paging occasion, where J, P is a positive integer or 0, or the second paging occasion in the first mapping relationship may correspond to a P-th random access occasion period after the second paging occasion.
For example, as shown in fig. 8, PO1 corresponds to a first random access opportunity period (i.e., ROS 6) of a first PO (i.e., PO 2) subsequent to the PO 1.
Alternatively, the second paging occasion may correspond to M random access occasion periods among a plurality of random access occasion periods between the second paging occasion and an I-th paging occasion after the second paging occasion, or the second paging occasion may correspond to the first M random access occasion periods after an I-th paging occasion interval after the second paging occasion time interval, or the second paging occasion may correspond to the first M random access occasion periods after an I-th paging occasion interval after the second paging occasion.
The time interval of the paging occasion may be the time interval between the paging occasion and the next adjacent paging occasion, or may be the time interval between the paging occasion and the M2 th paging occasion after the paging occasion, where M2 may be any one or more values in 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,20,24,28,32,36,40,44,48,52,56,60,64. The value of M may be related to the number of SS/PBCH blocks associated with one RO, for example, may be a multiple of the number of SS/PBCH blocks associated with one RO, may be the same, may be two times, may be four times, may be three times, may be 1/2, may be 1/3, and may be 1/4. The value of I may be 1,2, 0, 3, or one or more values of 4,5,6,7,8,9,10,11,12,13,14,15,16.
The second paging occasion may also correspond to an M3 rd random access period after the second paging occasion time threshold T2ms or an M3 rd random access period after the I2 th paging occasion after the second paging occasion, where the value of I2 or T2 may be one or more of the values of 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16. The value of M3 may be 0,1,2,3,4 or the last.
For example, as shown in fig. 7, PO1 may correspond to 3 random access opportunity periods (i.e., ROS3, ROS4, and ROS 5) of a plurality of random access opportunity periods between PO1 and a first PO (i.e., PO 2) following PO1, e.g., PO1 may correspond to a plurality of random access opportunity periods of a plurality of random access opportunity periods within a first PO paging opportunity interval following a paging opportunity interval of PO 1.
Alternatively, the value of M may be determined according to the number Q1 of random access occasion cycles in the time interval between the second paging occasion and the ith paging occasion. For example, the value of M may be any value less than or equal to Q1.
Alternatively, the value of M may be determined according to the number Q2 of SS/PBCH blocks corresponding to the random access opportunity period or the number Q3 of SS/PBCH blocks corresponding to the random access opportunity, for example, m=nq3, where n may be any positive number, for example, 1,2,1/2.
Optionally, the paging indication message may carry an ID of the paging packet, and if the terminal device does not belong to a terminal device included in the paging packet corresponding to the ID of the paging packet, the terminal device may enter a sleep state. If the terminal device belongs to the terminal device included in the paging packet corresponding to the ID of the paging packet, the terminal device may feed back the random access preamble to the network device.
Optionally, the value of M may be determined according to the number of paging packets corresponding to the second paging occasion.
In particular, the network device may communicate with a plurality of terminal devices on the second paging occasion, which may be divided into at least two paging packets. The value of M may be the number of paging packets to which all terminal devices capable of communicating with the network device on the second paging occasion belong, or a multiple (e.g., integer multiple, fractional multiple) of the number of paging packets.
In the embodiment of the present application, the paging packet is a packet of a plurality of terminal devices included in a region or a plurality of terminal devices corresponding to a paging occasion according to a certain rule.
It should be understood that the number of terminal devices in different paging packets may be the same or different.
It should also be understood that this "paging packet" may also be referred to as a "terminal packet," and the name of each packet that divides a plurality of terminal devices into different packets is not limited in this application.
Optionally, in the case where the value of M is determined according to the number of paging packets corresponding to the second paging occasion, the random access occasion period corresponding to the second paging occasion is the current paging occasion or the random access occasion period in the kth 1 time interval after the current paging occasion time interval, where the value of K1 may be any one of values 0 to 40.
Optionally, the terminal device determines the first random access opportunity in the first random access opportunity period according to a fifth mapping relationship, a sixth mapping relationship and a received paging indication message, where the fifth mapping relationship is a mapping relationship between the paging indication message received in the paging opportunity and at least one SS block/PBCH block, and the sixth mapping relationship is a mapping relationship between at least one SSblock/PBCH block and at least one random access opportunity.
Specifically, the fifth mapping relationship may be a mapping relationship between the received paging indication message and the SS block/PBCH block in each paging occasion in the plurality of paging occasions, or the fifth mapping relationship may be a mapping relationship between the received paging indication message and the SS block/PBCH block in the first paging occasion corresponding to the terminal device. The terminal equipment determines a corresponding SS block/PBCH block according to the received paging indication message and the fifth mapping relation, and determines a first random access opportunity in a first random access opportunity period according to the determined SS block/PBCH block and the sixth mapping relation.
It should be understood that, in the embodiment of the present application, the mapping relationship between the SS block/PBCH block and the random access opportunity may be that the beam used for transmitting the SS signal in the SSblock/PBCH is the same as the beam used for transmitting the signal in the random access opportunity.
Alternatively, the fifth mapping relationship and the sixth mapping relationship may be pre-agreed or defined according to a standard by the network device and the terminal device, or pre-sent by the network device, which is not limited in this application.
Alternatively, the first configuration information may be carried in any one of a physical broadcast channel (Physical Broadcast Channel, PBCH), remaining minimum system information (remaining minimum system information, RMSI), a system information block (System Information Block, SIB) 1, SIB2, a medium access control element (MAC-CE), downlink control information (Down link control information, DCI), radio resource control (Radio Resource Control, RRC), and system information 3-20.
Specifically, SIB1 may carry first configuration information of a paging message, or may also carry first configuration information of transmitting a random access preamble, and SIB1 information may also be referred to as RMSI information. The SIB1 transmissions are transmitted using consecutive small time periods, each of which may be associated with one SS/PBCH block. One or more time periods constitute a time window for SIB1 transmission.
In order to distinguish the SIB1 message from other system messages, two methods may be adopted, where the first method is that the RNTI of SIB1 is different from the RNTI of other messages, the RNTI of SIB1 may be defined as SIB1-RNTI separately, the RNTI may scramble the CRC of the PDCCH of the control resource of SIB1, and the RNTI of other system messages may be SI-RNTI, OSI-RNTI, or an RNTI corresponding to each system message. In this way, the network device can also send other system messages within the time window of the SIB1, and the system messages of the SIB1 are distinguished from other system messages by using different RNTI. The RNTI may be used to distinguish when the base station detects other system messages within the message window of SIB 1. Another is to use different times to distinguish, and not transmit other system information in the time window of the RMSI transmission. Each system information has its own time window for transmitting the corresponding system information. To distinguish SIB1 information from other system information, the time window of SIB1 may not overlap with other information, and the time window of SIB1 may be placed in temporal succession with the time window of other system messages. The time window of SIB1 is the position in the first time window, which is the starting position for the time window placement of the respective system message.
When the content of the SIB1 is relatively large, the SIB1 can be divided into a plurality of transport blocks for transmission, the plurality of transport blocks can be transmitted at different times in the SIB1 period, indication information can be carried in DCI of the SIB1 or data information of the SIB1, and the number of transport blocks of the SIB1 is indicated, for example, the number of transport blocks of the SIB1 can be indicated to be 1 or two, 1bit can be adopted for indication, and other data bits can be multiplexed for indication. It may also indicate whether the number of transport blocks of SIB1 is one or more, e.g. with 1bit, and may also multiplex other data for transmission. The indication of the plurality of transport blocks of SIB1 may be indicated in the data information or DCI of the first transport block, or the information may be carried in the data information or DCI of all the transport blocks, or the information may be carried in the data information or DCI of a part of the data blocks, or the information may be carried by RV version, or the DMRS may carry the information. These transport blocks may be transmitted on different frequencies or at different times. Multiple transport blocks of SIB1 may be transmitted in one time slot or may be transmitted in multiple time slots, for example, in two time slots; or may be sent in a supervision occasion of one control resource, or may be sent in a supervision occasion of a plurality of control resources, for example, in a supervision occasion of two control resources; it may also be transmitted in different periods, for example in 2 adjacent periods, or in 3 adjacent periods, or in 4 adjacent periods. Each transport block may have separate control resource information or may share control resource information.
Optionally, the second configuration information may further carry a DRX cycle, a number of paging frames in the DRX cycle, a number of paging occasions in the paging frame, a time interval of the paging occasions, and a starting position for receiving the paging indication message.
Specifically, the time interval of the paging occasion may be in units of frames or in units of time slots, which is not limited in the present application. For example, the time interval of the paging occasion may be 1 frame, 2 frames, 4 frames, 8 frames, or the like, or may be 1 slot, 2 slots, 3 slots, or 4 slots, or the like. The period of the paging occasions may be that a plurality of paging occasions are repeatedly defined as the period of the paging occasions in the same mode after being distributed according to time domain positions with equal intervals or unequal intervals in time, for example, the positions of 4 paging occasions in one paging frame are respectively a number 0 time slot, a number 4 time slot, a number 5 time slot and a number 9 time slot, and then the 4 paging occasions are at the same time-frequency resource position in each paging frame, that is, the period of the paging occasion is one paging frame. The time interval between two adjacent paging occasions may be a time interval between two paging occasions separated by K4, where K4 may be 1, 2, 3, 4, 8, 6, 16, 12, or 10.
The time intervals of paging occasions in one DRX cycle may be the same or different. If the time interval of each pair of adjacent paging occasions is the same, the time interval of the paging occasion can be regarded as a period of the paging occasion.
Alternatively, the terminal device may directly calculate the location of the RO according to the UE ID, for example, a calculation method SFN mod t2= (T2 div N) (UE ID mod N), where N may represent the number of frames in one or more RO periods, may also represent the number of frames in a time interval of adjacent POs, may also add an offset SFN mod t2= (T2 div N) +k4 to the formula, where the offset may be a positive integer, may also be a negative integer, may also be a value of 0, k4 may be related to the starting location of the RO period associated with the PO, or related to the RO period index after the RO period where the PO is located. T2 may represent the size of the RO cycle, the time interval between adjacent POs's, and the size of a plurality of RO cycles.
Alternatively, the time domain starting position of the paging indication message in the configuration information may be configured by the network device in an explicit manner or may be configured by the network device in an implicit manner.
Specifically, the paging indication message transmitted at the first paging occasion has a mapping relationship with the SS/PBCH block, and different SS/PBCH blocks may correspond to different beams. The network device configures the time domain starting position of the paging indication message in an explicit mode, which may be configured based on the SS/PBCH block index, may be configured based on a separate field by adopting data bits, or may be configured in combination with other information. The network device implicitly configures the time domain starting position of the paging indication message may be implicitly indicated by multiplexing other information, such as information of frequency band, demodulation reference signal (demodulationreference signal, DMRS), modulation and coding strategy (Modulation and Coding Scheme, MCS), port, scrambling, cyclic redundancy check (Cyclic Redundancy Check, CRC), etc.
It should be noted that, the network device indicates the time domain start position of the paging indication message through the SS/PBCH block index, where the SS/PBCH block index may be an index that is numbered based on the SS/PBCH block that may be transmitted, or an index that is numbered based on the SS/PBCH block that is actually transmitted. Wherein, the actually transmitted SS/PBCH block index indicates an SS/PBCH block index of the opportunity transmission SS/PBCH among SS/PBCH block indexes that may be used to transmit the SS/PBCH. For example, the SS/PBCH block index of the possible SS/PBCH transmission below 3GHz is 0,1,2,3, and the SS/PBCH block index of the actual SS/PBCH transmission in one network device is 0,1,3, that is, if the time domain start position of the paging indication message is indicated in the latter way, the network device does not encode the SS/PBCH block with the SS/PBCH block index of 2, so that the SS/PBCH block index of the actual SS/PBCH transmission is 0,1,2. The network device may pre-configure which index method is used to indicate the time domain starting position of the paging indication message, or may use a fixed method or a method agreed by both parties.
Alternatively, the network device configures the time domain start position of the paging indication message through the second configuration information may be directly configures the time domain start position of the paging indication message, for example, indicates the time domain start position of the paging indication message through the SS/PBCH block index.
Alternatively, the time domain offset and the fixed time domain position may be determined by the position of the SS/PBCH block.
Specifically, if the SS/PBCH is frequency division multiplexed with the paging indication message, the time domain locations for transmitting the SS/PBCH block and the paging indication message may be the same.
Alternatively, the network device may configure the time domain start position of the paging indication message through the second configuration information by configuring only the time domain offset. That is, the network device and the terminal device agree on a fixed time domain position in advance, and the time domain start position of the paging indication message can be determined through the time domain offset and the fixed time domain position.
It should be appreciated that the time domain offset may be based on a slot, field, subframe, frame, symbol, or small slot (mini-slot), etc. The fixed time domain position may be a certain time domain position, a start position or an end position in a period of time, which in turn may be a frame, a subframe, a slot, a symbol or a sample within a DRX cycle, etc.
Alternatively, the time domain offset and the fixed time domain position may be determined by a subcarrier spacing.
Specifically, if the subcarrier spacing is 15KHz, the time domain offset and the fixed time domain position may be any one of time slots 0-9; if the subcarrier spacing is 30KHz, the time domain offset and fixed time domain position may be any one of slots 0-20.
It should be understood that the time domain start position of the paging indication message may be the time domain start position of the control resource (for example, PDCCH), or may be the time domain start position of the data resource (for example, PDSCH), or may be the start position of the control resource and the data resource, which is not limited in this application.
Optionally, the second configuration information may include at least one of a number of paging packets, a number of paging occasions within a random access occasion period, a time interval of adjacent paging occasions, and a number of synchronization signal blocks corresponding to the random access occasions.
Specifically, the network device may configure each of the number of paging packets, the number of paging occasions in the random access occasion period, the time interval of adjacent paging occasions, and the number of synchronization signal blocks corresponding to the random access occasions for the terminal device through the second configuration information. Or the network device can configure part of information in the number of paging packets, the number of paging occasions in the random access occasion period, the time interval of adjacent paging occasions and the number of synchronous signal blocks corresponding to the random access occasions for the terminal device through the second configuration information, and the rest part of information can be determined through the configured information.
Alternatively, in the case where the types of random access preambles are all different, the number of random access preamble types may be the number of random access preambles.
Alternatively, the number of random access preamble categories may be the number of random access preambles.
Optionally, the second configuration information includes the number of random access preamble categories within one RO and the number of POs within an RO period.
Specifically, the terminal device may derive the number of paging packets in the POs and the number of random access preamble types per PO from the number of random access preamble types in one RO and the number of POs in the RO period. For example, the number of POs in one RO period is K1, the number of random access preambles for paging in one RO is N5, and the number of random access preamble types per PO is q=floor (N5/K1) or q=ceil (N5/K1) or q=n5/K1.
Optionally, the second configuration information includes a number of paging packets within the PO and a number of POs within the RO period.
Specifically, the terminal device may determine the number of random access preamble categories within the RO and the number of random access preamble categories per PO according to the number of paging packets within the PO and the number of POs within the RO period.
Optionally, the second configuration information includes the number of random access preamble categories per PO and the number of POs in the RO period.
Specifically, the terminal device may determine the number of random access preamble categories within the RO and the number of paging packets within the PO according to the number of random access preamble categories per PO and the number of POs within the RO period.
Optionally, the second configuration information includes a number of random access preamble categories for each PO, a number of paging packets within the PO, and a number of POs within the RO period.
Specifically, the terminal device may determine the number of random access preamble categories for paging in the RO according to the number of random access preamble categories of each PO, the number of paging packets in the PO, and the number of POs in the RO period.
Optionally, the second configuration information includes the number of random access preamble types for each PO and the number of the random access preamble types for paging in the RO and the number of the POs in the RO period, so that the terminal device can determine the number of paging packets in the POs according to the second configuration information.
Optionally, the second configuration information includes the number of random access preamble categories within the RO, the number of paging packets within the PO, and the number of POs within the RO period, so that the terminal device can derive the number of random access preamble categories for each PO.
Optionally, the second configuration information includes a number of random access preamble categories within the RO, a number of paging packets sharing one or a group of random access preambles within the POs, and a number of POs within the RO period, so that the terminal device can derive the number of random access preamble categories and the number of paging packets for each PO.
Optionally, the second configuration information includes a number of paging packets, a number of paging packets within the PO where the paging packets share one or a group of random access preambles, and a number of POs within the RO period, so that the terminal device can derive a number of random access preamble categories for each PO and a number of random access preamble categories within the RO for paging.
Optionally, the second configuration information includes a number of random access preamble categories for each PO, a number of paging packets sharing one or a group of random access preambles for paging packets within the PO, and a number of POs for RO periods, so that the terminal device can derive the number of paging packets and the number of random access preamble categories for paging within the RO.
It should be understood that in the above-described embodiments, the terminal device may not perform the operation of determining the number of random access preamble categories and/or the number of paging packets in the RO without the number of random access preamble categories and the number of paging packets in the RO being required for performing the related operation, which is not limited in this application.
Alternatively, the network device may configure the number of paging packets to be the same as the number of random access preamble categories, i.e. the network device may determine the number of paging packets from the number of random access preamble categories.
Alternatively, the network device may set the number of POs in one DRX cycle or set the time interval of adjacent POs according to the number of random access preamble types, or set the SS/PBCH block number associated to one RO according to the number of random access preamble types.
Optionally, the network device may determine the number of random access preamble types according to the priority level of at least two of the paging packet, the random access opportunity, and the synchronization signal block, and determine the second configuration information according to the number of random access preamble types, where the second configuration information may include at least one of the number of paging packets, the number of paging opportunities in the random access opportunity period, a time interval of adjacent paging opportunities, and the number of synchronization signal blocks corresponding to the random access opportunity.
Alternatively, the terminal devices of P (P.gtoreq.1) paging packets may share the same random access preamble, and the value of P is related to the number of SSblocks or to the number of paging occasions in one RO period.
Specifically, in the embodiment of the present application, when a value is related to the number of POs in one RO cycle or a value is related to the number of RO cycles in an adjacent PO interval, the value is related to the size of the RO cycle, that is, the size of the time interval of the adjacent PO, that is, the size of the DRX cycle, that is, the number nB of POs in the DRX cycle, that is, the number of POs in one paging frame. The network device may also limit the number of POs in one RO cycle to a maximum value of not more than 4 or 8, or 2 or 16, may limit the number of POs in a DRX cycle according to the RO cycle, or limit the DRX cycle size, for example, RO cycle is 160ms, the number of POs is 2 at maximum, and limit the number of POs in a DRX cycle is T/8 at maximum.
Optionally, the second configuration information includes a T value of the RO cycle, and the terminal device may determine the number of POs or a time interval of two adjacent POs in the DRX cycle according to the T value of the RO cycle.
Alternatively, the RO period may be the same as the interval of adjacent paging occasions, e.g. the RO period is 160ms and the number of paging occasions in the DRX period is T/16.
Alternatively, the RO period may be a multiple of the interval of adjacent paging occasions. For example, RO cycle is 160ms, and the number of paging occasions in drx cycle is T/8.
Alternatively, the network device may determine that the number of random access preamble categories for paging within the random access occasion within the RO period has a mapping relationship according to the number of items distinguished by the random access preamble. The item may be at least one of the number of paging packets, the number of paging occasions/time interval of adjacent paging occasions within the random access occasion period, the number of synchronization signal blocks corresponding to the random access occasions.
Specifically, there may be a correspondence between the number of paging occasions in the random access occasion period and the time interval of the adjacent paging occasions, so that the random access preamble may be used to distinguish one of the two, i.e. to learn about the other. The following description of the embodiments will be made with "the number of paging occasions in the random access occasion period" and "the time interval of adjacent paging occasions" as one item.
Alternatively, the priority level of each item may be pre-agreed or defined according to a standard by the network device and the terminal device, or pre-configured by the network device, which is not limited in this application.
Optionally, the network device may use a fixed priority order, or may use a configuration method to configure at least two priority orders, and for simplicity of presentation, in this embodiment, the highest priority is referred to as item 1, the next highest priority is referred to as item 2, and the lowest priority is referred to as item 3.
Note that, items 1, 2 and 3 may be referred to as items, each item has sub-items, for example, when K1 SS/PBCH blocks are associated with one RO, item 1 is SS/PBCH block, sub-items of item 1 are each SS/PBCH block, and i sub-items are i SS/PBCH blocks. For example, when K2 POs are associated with one RO cycle, item 2 is PO, the sub-items of item 2 are each PO, and the i-th sub-item is the i-th PO. For example, when one PO corresponds to K3 paging packets, item 3 is a paging packet, the sub-item of item 3 is each paging packet, and the i-th sub-item is the i-th paging packet.
Alternatively, the mapping relationship between the random access preamble and the at least three items may be a mapping relationship between an index of the random access preamble and an index of each item.
In a specific embodiment, if the random access preamble is used to distinguish each sub-item of the two items, the number of random access preamble categories can be obtained as follows:
for example, if the number of items 1 is M11 and the number of items 2 is M12, the number of random access preamble types for paging in the RO period n=m11×m12.
Optionally, in the case where n=m11×m12, the random access preamble index associated with the ith sub-item 1 in item 1 is i0+i×m12 to i0+ (i+1) ×m12-1, the random access preamble index N associated with the kth sub-item 2 in item 2 is n=j0+k, where i0 may represent a starting index of the random access preamble, the value of i0 may be a positive integer, or a negative integer, the value of j0 may be related to the index in item 1 where item 2 is located, or may be related to the number of items 2 or the number of items 2 that use the random access preamble to distinguish, or may be related to the number of items 1, or may be related to the initial index of the random access preamble used for paging packet, or may be related to the number of random access preamble types allocated in item 2, or may be related to the number of random access preamble types allocated in item 1, e.g., j 0=m12+i2, where i0 represents the index.
It should be understood that i0 may also be mapped to the starting index of the random access preamble on the corresponding PO, or may not be defined, meaning that a given value, being a constant, or other value, is not limited herein,
for example, item 1 is a PO,1 PO has a mapping relationship with 5 random access preambles, and if the index of the first PO is index0, the index of the random access preamble corresponding to index0 is 0,1,2,3,4. Thus, the index of the second PO is index1, the index of the random access preamble corresponding to index1 is 5-9, the index of the third PO is index2, the index of the random access preamble corresponding to index2 is 10-14, and the index of the random access preamble corresponding to the index of the ith PO is index0+i 5-index 0+ (i+1) 5-1.
For example, the number of random access preambles is 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14, item 1 is SS block, item 2 is PO, the number of SS blocks is 3, the number of POs is 4, the index of the random access preamble corresponding to index0 of the first SS block is 0,1,2,3, the index of the random access preamble corresponding to index1 of the second SS block is 4,5,6,7, the index of the random access preamble corresponding to index2 of the third SS block is 8,9,10,11, and the index of the random access preamble corresponding to index3 of the fourth SS block is 12,13,14,15. The index of the random access preamble corresponding to the first PO under index0 is 0, the index of the random access preamble corresponding to the second PO is 1, the index of the random access preamble corresponding to the third PO is 2, and the index of the random access preamble corresponding to the fourth PO is 3. The index of the random access preamble corresponding to the first PO under index1 is 4, the index of the random access preamble corresponding to the second PO is 5, the index of the random access preamble corresponding to the third PO is 6, the index of the random access preamble corresponding to the fourth PO is 7, and so on.
For another example, there is at least two sub-items sharing one random access preamble in item 2, the total number of sub-items in item 2 is M12, the number of items for distinction 2 is M13, the number of items for distinction 1 is M11, and then the number of random access preamble categories for paging in RO period n=m11×m13. If K9 sub-items in item 2 share one random access preamble, the total number M12 of items 2 and K9 satisfy the formula k9=m12/M13, k9=floor (M12/M13), or k9=ceil (M12/M13).
For another example, in item 2, there is a random access preamble shared by a plurality of sub-items, and the number of the shared random access preamble types is M13. Wherein the random access preamble index j allocated to the ith sub-item is j=i0+i mod M13.
Optionally, in the case of n=m11×m13, the random access preamble index associated with the ith sub-item 1 in item 1 is i0+im13 to i0+ (i+1) ×m13-1, and the random access preamble index N associated with the kth sub-item in item 2 is n=j1+floor (K/K4), where j1=im13+i0.
For another example, if the total number of sub-items in item 1 is M11, and the number of sub-items to be distinguished in item 1 is m14+.m11, all sub-items in item 2 are distinguished without using random access preambles, then the number of random access preamble categories for paging in RO period n=m14. If K10 sub-items in item 1 share one random access preamble, k10=m11/M14, k10=floor (M11/M14), or k10=ceil (M11/M14).
For another example, in item 1, there is a random access preamble shared by a plurality of sub-items, and the number of the shared random access preamble types is M13. Wherein the random access preamble index j allocated to the ith sub-item is j=i0+i mod M13.
Alternatively, in the case of n=m14, the random access preamble index N associated with the j-th sub-item in item 1 is n=i0+floor (K/K10).
In another specific embodiment, if the random access preamble is used to distinguish each sub-item of the three items, the number of random access preamble categories can be obtained as follows:
for example, if the random access preamble is used to distinguish three items, assuming that the number of item 1 is M1, or the number of random access preamble categories allocated to item 1 is M1, the number of item 2 is M2, the number of random access preamble categories allocated to item 2 is M2, the number of item 3 is M3, or the number of random access preamble categories allocated to item 3 is M3, then the number of random access preamble categories in the RO period is related to the three, or to two or one of the three, for example, the number n=m1×m2×m3 of random access preamble categories for paging in the RO period.
Optionally, in the case that the number n=m1×m2×m3 of random access preamble categories for paging in the RO period, the random access preamble index associated with the i-th sub-item 1 in item 1 is:
i0+i*M2*M3~i0+(i+1)*M2*M3-1;
The random access preamble index associated with the j-th sub-item 2 in item 2 is:
j0+j*M3~j0+(j+1)*M3-1;
the random access preamble index n associated with the kth sub-item 3 in item 3 is n=k0+k,
wherein i0 may represent a starting index of the random access preamble, may represent a starting index mapped to the random access preamble on the corresponding PO, may not be defined, i.e., represents a given value, and is constant, may be other values, and is not limited herein, and the value of i0 may be a positive integer, may be 0, or may be a negative integer;
wherein the values of j0, k0, k1, k2 may relate to the index in item 1 where item 2 is located, may relate to the number of items 2, may relate to the number of items 3, may relate to the initial index of the random access preamble for the paging packet, may relate to the number of random access preamble types allocated to item 3, may relate to the number of random access preamble types allocated to item 2, may relate to the number of random access preamble types allocated to item 1, for example, j0=i×m2×m3+i0, where i represents the index of item 2; for example k0=i×m2×m3+j×m3+i0.
For another example, if the total number of sub-items in item 3 is M3, the sub-items in the middle of item 3 may share one random access preamble, and the number of sub-items to be distinguished by the random access preamble in item 3 is M4, where M4 is equal to or less than M3, then the number of random access preamble types n=m1×m2×m4 for paging in the RO period, where K4 sub-items in item 3 share one random access preamble, k4=m3/M4, may be k4=floor (M3/M4), and may be k4=ceil (M3/M4).
For another example, in item 3, there is a random access preamble shared by a plurality of sub-items, and the number of the shared random access preamble types is M4. Wherein the random access preamble index j allocated to the ith sub-item is j=i0+imod M4.
Optionally, at this time, the random access preamble index associated with the ith sub-item 1 in item 1 is i0+i2m4×i0+ (i+1) ×m2×m4-1, the random access preamble index associated with the jth sub-item 2 in item 2 is j1+j×m4×j1+ (j+1) ×m4-1, and the random access preamble index n associated with the kth sub-item in item 3 is n=k1+floor (K/K4), where k1=im2×m4+j×m4+i0, e.g., j1=im2×m4+i0.
For another example, if the total number of sub-items in item 2 is M2, all the sub-items in item 3 may be distinguished without using a random access preamble, and the sub-items in item 2 may be distinguished by sharing one random access preamble, if the number of sub-items in item 2 for distinction by the random access preamble is M5 and M5 is less than or equal to M2, the number of random access preamble types n=m1×m5 for paging in the RO period may be assumed, where K5 sub-items in item 2 share one random access preamble, k5=m5/M2 may be k5=floor (M5/M2), or k5=ceil (M5/M2).
At this time, the random access preamble index associated with the ith sub-item 1 in item 1 is i0+i×m5 to i0+ (i+1) ×m5-1, and the random access preamble index n associated with the jth sub-item in item 2 is n=k2+floor (K/K5), where k2=i×m1+i0.
For another example, in item 2, there is a random access preamble shared by a plurality of sub-items, and the number of the shared random access preamble types is M5. Wherein the random access preamble index j allocated to the i-th sub-item 2 is j=i0+i mod M5.
For another example, if the total number of sub-items in item 1 is M1, all sub-items in item 3 and item 2 may be distinguished without using random access preambles, the sub-items in item 1 share one random access preamble for distinction, the number of random access preamble types allocated in item 1 is M6, and M6 is less than or equal to M1, then the number of random access preamble types for paging in the RO cycle or RO set is related to M1, for example, the number of random access preamble types for paging in the RO cycle or RO set n=m1. If the number of sub-items sharing one random access preamble in item 1 is K6, k6=m6/M1 may be k6=floor (M6/M1) or k6=ceil (M6/M1).
For another example, in item 1, there is a random access preamble shared by a plurality of sub-items, and the number of the shared random access preamble types is N. Wherein the random access preamble index j allocated to the i-th sub-item 1 is j=i0+i mod N.
Alternatively, in the case where the random access preamble is used to distinguish the above two items, the two items may be a PO and a paging packet.
Specifically, the priority order may include two kinds, the first order being a PO > paging packet; the second order is paging packet > PO. The first order is that PO is item 1 and paging packet is item 2. The second order is paging packet item 1 and PO item 2.
Alternatively, in the case where the random access preamble is used to distinguish the above two items, the two items may be SS/PBCH block and paging packet.
Specifically, the priority order may include two kinds, the first order being SS/PBCH block > paging packets; the second order is paging packet > SS/PBCH block.
Alternatively, in the case where the random access preamble is used to distinguish the two items described above, the two items may be SS/PBCH block and PO.
Specifically, the priority order may include two kinds, the first order being SS/PBCH block > PO; the second order is PO > SS/PBCH block.
Alternatively, in case the random access preamble is used to distinguish the above three items, the three items may be SS/PBCH block, PO and paging packet.
Specifically, the priority order may have 6 kinds in total, the first order is SS/PBCH block > PO > paging packet, the second order is SS/PBCH block > paging packet > PO, the third order is PO > SS/PBCH block > paging packet, the fourth order is PO > paging packet > SS/PBCH block, the fifth order is paging packet > PO > SS/PBCH block, and the sixth order is paging packet > SS/PBCH block > PO.
For example, for the second order, item 1 is SS/PBCH block, item 2 is paging packet, and item 3 is PO; for the third order, entry 1 is PO, entry 2 is SS/PBCH block, and entry 3 is paging packet. The content represented by each item is different for different priorities. There are SS/PBCH block packets, PO packets, and paging packets, which indicate that a terminal within multiple SS/PBCH blocks and/or multiple POs and/or multiple paging packets may use one or a set of random access preambles for uplink random access, may report beams and/or report paging packets and/or report POs and/or report SS/PBCH blocks.
The network device may configure or fix the number of random access preamble categories for paging within one RO, allocate the number of random access preambles according to the priority order of the respective items, for example, the number of random access preambles is P5, the number m6=g (P5, M1) of random access preamble categories of the respective sub-items associated with item 1, the number m5=g (P7, M2) of random access preamble categories of the respective sub-items associated with item 2, and the number m4=g (P8, M3) of random access preamble categories of the respective sub-items associated with item 3. When P7 is less than or equal to 1, items 2 and 3 are no longer distinguished, only items 1 are distinguished, when P8 is less than or equal to 1, items 3 are no longer distinguished, only items 1 are distinguished from items 2, and when P9 is less than or equal to 1, only items 1 and 2 are distinguished from items 3.
Alternatively, if paging indicators associated with one or more SS/PBCH blocks in one or more POs are associated with one of the ROs associated with the SS/PBCH block in a corresponding RO period, the random access preamble may distinguish the paging indicator of the PO associated therewith in one of the ROs.
For example, the paging indication on one PO corresponds to one RO, or may be multiple paging indications correspond to one RO, where the paging indications on different ROs may be distinguished by using the random access preamble, and the number of paging occasions associated to one RO may be n30=n28/N29, where n30=floor (N28/N29), where N30 is required to be associated or distinguished by using the random access preamble; or it may be that one paging indication corresponds to a plurality of ROs, where different ROs may associate or differentiate different paging packets, where paging packets in one PO may associate or differentiate using a random access preamble and/or associate or differentiate using different ROs.
Alternatively, the network device may configure the mapping relationship between the 3 items and the random access preamble, and send the mapping relationship to the terminal device, so that the terminal device determines the corresponding random access preamble according to the 3 items.
403, the terminal device sends a random access preamble to the network device on the first random access occasion in the first random access occasion period. Accordingly, the network device receives the random access preamble on a random access occasion in the first random access occasion period.
It should be noted that, if at least two terminal devices correspond to the same paging occasion and are in the same paging packet, the random access occasions determined by the at least two terminal devices may be the same, that is, the at least two terminal devices may send at least two random access preambles of the same type.
Optionally, the terminal device determines a location of a paging occasion corresponding to the terminal device.
Specifically, after the network device receives the random access preamble sent by the terminal device for paging, the paging message needs to be sent, and the paging message may be sent in the RAR window, or may be sent in other time periods. The embodiment of the application refers to a time period for sending down the paging message as a paging message time window. The paging message window may also be a PDCCH monitoring occasion of the paging occasion, which may also be referred to as a PDCCH detection occasion of the paging occasion. The message window may be used to issue control resource information, such as PDCCH or CORESET, for paging messages and/or paging message data resources, such as PDSCH.
Alternatively, when the PDCCH of the paging message is issued, it may coincide with a control resource such as the PDCCH that issues the paging indication, and if there is no indication that the terminal device may have no way to distinguish between them, the embodiments of the present application propose three methods to indicate this information, for distinguishing between them.
Specifically, the first method is to use different paging radio network temporary identifiers (paging radio network temporary indentify, P-RNTI), the paging message and the control resource of the paging indication are respectively distinguished by using different P-RNTIs, the RNTI of the paging message can be PM-RNTI, the PM-RNTI can be one or more, and their indexes can be continuous, for example, the number of RNTIs of the paging message represented by PM-RNTI0 to PM-RNTI0+mp, mp; the RNTI of the paging indication may be a PI-RNTI, and the PI-RNTI may be one or more, and their indexes may be consecutive, for example, the number of RNTIs of the paging indication represented by PI-RNTI0 to PI-RNTI0+mi, mi.
The second method is to distinguish in the content of PDCCH, the PDCCH can carry 1bit or more bits of information for indicating information, and distinguish PDCCH of paging message and PDCCH of paging indication, and also can multiplex indication with other fields, for example, field multiplexing indication of paging packet, paging indication or index value of RNTI of paging message can be related to index of SS/PBCH block, the SS/PBCH block can be related to SS/PBCH block on RO, can be related to index of PO, the PO can be related to PO on RO period, can be related to both; the index of the PO may be in a one-to-one relationship with the index of the RNTI of the paging message, or may be in a one-to-many relationship, for example, one PO may have 2 RNTIs, or the index of the SS/PBCH block may be in a one-to-one relationship with the RNTI of the paging message, or may be in a one-to-many relationship, for example, one SS/PBCH block has 4 RNTIs.
The third method is to use DMRS sequences of PDCCH or scrambling sequences of PDCCH to indicate the information, and these sequences may be different segments of the same sequence or different sequences generated using different initialization formulas, where the initialization formulas may include the information.
Alternatively, when one RO is associated with paging indicators of multiple POs, or one RO is associated with multiple SS/PBCH blocks, or multiple paging indicators of multiple POs are associated simultaneously, where multiple paging indicators correspond to different SS/PBCH blocks, i.e., the RO associates paging indicators of multiple POs and multiple SS/PBCH blocks simultaneously. Paging messages of a plurality of paging occasions can be requested on the RO, paging messages corresponding to a plurality of SS/PBCH blocks can be requested on the RO, and paging messages of a plurality of paging occasions and paging messages corresponding to a plurality of SS/PBCH blocks can be requested simultaneously. The method of item 1 and item 2 are also referred to herein as paging indication of SS/PBCH block and paging occasion or paging occasion, item 1 may refer to any one of the paging indication of SS/PBCH block and paging occasion or paging occasion, and item 2 may refer to any one of the paging indication of SS/PBCH block and paging occasion or paging occasion.
Optionally, when the paging message window only distinguishes paging occasions, item 1 indicates paging occasions or paging indication of paging occasions, when the paging message window only distinguishes SS/PBCH block, item 1 indicates SS/PBCH block, when both are distinguished, paging occasions and SS/PBCH block correspond to item 1 and item 2 according to priority order, for example paging occasions > SS/PBCH block, item 1 is paging occasion, item 2 is SS/PBCH block, for example paging occasion < SS/PBCH block, item 2 is paging occasion, and item 1 is SS/PBCH block. There may be multiple paging message windows associated with the RO, each of which may correspond to one or more items 1. The paging message windows of different items 1 on one RO may be consecutive adjacent and the paging message window duration of different items 1 on one RO may be the same.
Optionally, when a paging message window corresponds to an item 1, the paging message window of the ith item 1 associated with the RO has a position t0+f (i, x), and when the paging message window corresponds to both items 1 and 2, the paging message window associated with the ith item 1 and the jth item 2 may have a starting position t0+f (i, j, y, z), which may be slot-based, subframe-based, ms-based, or end position, or intermediate position. When index i or j represents an index of SS/PBCH, it may represent an SS/PBCH block index associated with one RO, or an SS/PBCH block index associated with a plurality of ROs. When index i or j represents an index of SS/PBCH, it may represent an SS/PBCH block index associated with one RO, or an SS/PBCH block index associated with a plurality of ROs.
Alternatively, t0 may have different values for different subcarrier spacing (SCS), one representation of t0 being t 0 *2 u Where u is related to the size of SCS, e.g., when scs=15 KHz, u=0, scs=30 KHz, u=1, scs=60 KHz, u=2, scs=120 KHz, u=3. t is t 0 May represent a fixed constant, may represent the starting position of the paging message window at 15KHz, and may represent the ms-based paging message window starting position. x, y, z denote the duration of the paging window, and may be a time slot, a subframe, or ms. The values of x, y and z can be any one of 1 to 80, for example, 0.5 time slot, 1 time slot, 2 time slots and 4 time slots. The values of x, y and z can be fixed or configured. the value of t0 may be configured or fixed. The value of y may be related to the value of z, or the value of z may be related to the value of x, one method of correlation being z=yxn4 or y=zxn4, where N4 may represent the number of items 1 or the number of supervision windows of items 1, or may represent the number of items 2 or the number of supervision windows of items 2.
Alternatively, when only item 1 is distinguished, when the message window of item 1 is transmitted in N2 frames, the position of item 1 in the frame may be calculated using (t0+f (i, x)) mod N3, where f (i, x) may be i x or floor (i x), N3 may represent the number of slots in one frame, the number of subframes used to transmit the paging message of the RO, and the number of slots used to transmit the paging message of the RO. F (i, j, y, z) can be defined as any of i x z+j x y, floor (i x z) +j x y, i x z+floor (j x y), floor (i x z+j x y), floor (i x z) +j x y), floor (i x z+floor (j x y)) can be used to calculate the position of item 1 in the frame when the message of item 1 and/or item 2 is transmitted in N2 frames by means of (t0+f (i, j, y, z)) mod N3.
In this case, a paging message window may be shared by a plurality of paging messages of item 1 or item 2, where t0 may be used to indicate a starting position of the paging message window, the number of item 1 or item 2 sharing a paging message window may be some or all of 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16, for example, 1,2,4,8, 16, and the number of item 1 or item 2 sharing a paging message window may be N, where the value of N may be configurable, or may be fixed, and one configuration method is to configure a specific value, namely, a specific value in 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16, and another configuration method is to configure an existing value, for example, the number of item 1 or item 2 associated with one RO cycle is M, and the value of N may be configured to be any part or all of 1 to M, for example, the configuration parameter is 1, M, or the configuration parameter is 1, M/2, M.
Alternatively, when N items 1 share one paging message window, f (i, x) may be any one of floor (i/N) x, floor (i x), i x. When N items 2 share a paging window, f (i, j, y, z) may be floor (i/N) z+j y, floor (i/N) z+floor (j y), floor (i/N) z+j y), floor (i/N) z+j y), floor (i/N) z+floor (j y), floor (i x z) +floor (j/N) ×, i x z+floor (j/N) × y), floor (i x z+floor (j/N) ×), floor (i x z) +floor (j/N) ×), floor (i x z+floor (j/N) ×), i x z+j, floor (i x z+j) +y), floor (i x z+j, i x z+floor (j x y), floor (i x z+j y), floor (i x z+j+y), floor (i x z) +j x y).
Alternatively, when all items 1 share one paging message reception period, the start position thereof is t0. When all items 1 and 2 share one paging message reception period, the start position thereof is t0. When a paging message window is shared by a plurality of items 1, it may be distinguished using a plurality of RNTIs, which may be PM-RNTIs or PI-RNTIs as described above.
Alternatively, when a paging message window is shared by a plurality of items 2, it may be discriminated using a plurality of RNTIs as described above.
Alternatively, when item 2 and item 1 share the same paging message window at the same time, they can also be distinguished using multiple RNTIs. When an item (item 1 or item 2) is distinguished using an RNTI, the index of the RNTI is related to the index of the item, and one related method is that the index of the RNTI of the paging message corresponding to the i-th item in the item is RNTI0+ i, and RNTI0 represents the value of the first RNTI of the paging message or paging indication. When the RNTI is used to distinguish between item 2 and item 1, the RNTI index of the ith sub-item in item 2 and the jth sub-item in item 1 is RNTI0+j×n6+i, where N6 represents the number of items or sub-items in item 2 distinguished by RNTI.
Alternatively, the paging messages may be distinguished by their location, and may be distinguished by their frequency location or time location, one way of distinguishing is to arrange the control resource locations or data resource locations of the paging messages in time-first order, and place the control resources or data resources of the paging messages in index order of item 1.
Alternatively, one method of distinguishing is to arrange the control resource locations or data resource locations of the paging messages in order of frequency priority, and place the control resources or data resources of the paging messages in the index order of item 1. The paging messages of different items 1 may be placed in frequency division or time division, i.e. there are multiple paging occasion resource elements on one orthogonal frequency division multiplexed symbol. When item 2 and item 1 are distinguished simultaneously, location distinction may also be used, as described above.
Optionally, the terminal device may determine the first random access preamble according to at least one synchronization signal block corresponding to the first random access opportunity and a third mapping relationship, where the third mapping relationship is a mapping relationship between at least one synchronization signal block and at least one random access preamble.
Optionally, in the case that the paging indication message carries at least one paging packet identifier and the terminal device belongs to a first paging packet corresponding to the at least one paging packet identifier, the terminal device may further determine the first random access preamble according to a fourth mapping relationship and the first paging packet, where the fourth mapping relationship is a mapping relationship between at least one paging packet and at least one random access preamble.
Alternatively, the fourth mapping relationship may be pre-agreed or defined according to a standard by the network device and the terminal device, or pre-sent by the network device, which is not limited in this application.
The network device determines 404 at least one paging occasion based on at least one random access occasion period or at least one random access preamble.
Note that, in the at least one paging occasion, the paging occasion corresponding to the first paging occasion may be the same paging occasion as the first paging occasion, or may be a paging occasion at the same position in different DRX cycles.
Optionally, the network device determines, according to the first mapping relationship and at least one random access opportunity period, a paging opportunity corresponding to the random access opportunity period for receiving the random access preamble.
Specifically, the first mapping relationship is a mapping relationship between at least one random access opportunity period and at least one paging opportunity, so that the network device can determine, according to the first mapping relationship, at least one paging opportunity corresponding to the random access opportunity period of the received random access preamble.
Optionally, the network device determines at least one paging occasion corresponding to the received at least one random access preamble according to the second mapping relationship and the at least one random access preamble.
Specifically, the second mapping relationship is a mapping relationship between at least one random access preamble and at least one paging occasion, so that the network device can determine the corresponding at least one paging occasion according to the received at least one random access preamble and the sixth mapping relationship.
Optionally, the second mapping relationship may be pre-agreed or defined according to a standard by the network device and the terminal device, or the network device sends second configuration information in advance, and the second mapping relationship is carried by the second configuration information, which is not limited in this application.
Alternatively, the association between the RO cycle in T and SS/PBCH block on one RO may be a many-to-one case, where different RO cycles may be used to distinguish different paging packets.
Specifically, assuming that the number of RO periods associated with one SS/PBCH block is N18 and the number of paging packets is N19, the values of the number of paging packets N20, N20 associated with one RO period may be obtained by configuration, may be obtained by calculation, and may be n20=n19/N18, may be n20=floor (N19/N18), may be n20=ceil (N19/N18), and may be the value of N20 which may be an integer or a fraction or 1.
And 405, the network equipment sends a paging message to the terminal equipment corresponding to the at least one paging occasion.
Therefore, in the signal transmission method of the embodiment of the present application, the network device sends the paging indication message to the plurality of terminal devices, the terminal devices receive at least one paging indication message at a first paging occasion, and determine a first random access occasion period corresponding to the first paging occasion according to a first mapping relationship including at least one paging occasion and at least one random access occasion period, and further send a first random access preamble at the first random access occasion in the first random access occasion period, and the network device may determine at least one paging occasion according to the first mapping relationship or the second mapping relationship, and send the paging message to the terminal device corresponding to the at least one paging occasion, thereby avoiding sending the paging message to the plurality of terminal devices, and saving the overhead of signal transmission.
Fig. 9 shows a schematic flow chart of another method of signal transmission of the present application.
901, the terminal device determines a supervision window according to a first mapping relationship, where the first mapping relationship is a mapping relationship between at least one paging message and at least one supervision window.
Specifically, the first mapping relationship may be a mapping relationship between at least one paging message and at least one supervision window, and the terminal device may determine the corresponding supervision window according to the paging message to be received. The correspondence between the paging message and the supervision window may be a correspondence between the paging message and the supervision window index, or a correspondence between the paging message index and the supervision window index.
Alternatively, when the paging message is detected by using the supervision window method, the calculation of the starting position of the ssb_ TIk supervision windows of the paging message may be based on the SS/PBCH block index of the actual transmission, or may be based on the SS/PBCH block index of the possible transmission, or may be based on the index of the supervision windows of the paging message, where ssb_ TIk may be any integer from 0 to 64, the time slot or subframe index of the supervision windows of the paging message is calculated, f (x, ssb_ TIk) is defined as x ssb_ TIk, floor (x ssb_ TIk), x_floor (ssb_ TIk/k)), any one of the following formulas (i+window offset+f (x, ssb_ TIk)) mod N, (i+f (x, ssb_ TIk)) mod N, i+window offset+f (x, ssb_ TIk) mod N, i+f (x, ssb_ TIk) mod N, wherein I represents the reference position of the paging message supervision window, may be configured, or may be fixed, as described in the previous embodiments; x denotes the duration of the supervision window of the paging message, configurable, the supervision window offset value (window offset) denotes the offset of the first supervision window within the paging message PO relative to the reference position, or the time offset of the first supervision window of the paging message relative to the reference position plus a fixed time offset, which may be due to the fact that some time resources are used for the transmission of other messages, e.g. for uplink transmission, within the duration of the PO, which fixed time offset may be derived from information configured by the network device.
It should be noted that, the window offset may be 0, which indicates that there is no related information, and I and window offset may be related to SCS; floor in the formula means rounding down and may not exist, but for example, when x is a positive integer, the formula may be changed to (i+window offset+x floor (ssb_ TIk/k)) mod N, k may be configured, the value of k may be 1 or other values, and when k is 1, the formula may be i+window offset+x ssb_ TIk. The method has the advantages that the window of the paging message is centralized, the detection time of the UE is short, and the UE is easy to find. N represents the number of time slots or subframes which can be used for transmitting paging messages in one system frame, and can be all time slots of the whole frame can be used for transmitting paging messages, wherein N is the same as the number of paging time slots or subframes in the frame, and can also be used for transmitting paging messages in part of time slots in the frame.
Alternatively, when the UE receives the SS/PBCH block index of possible transmission may be larger, for example, for 60KHz, the UE receives the SS/PBCH block index of 45, and if the window length of one supervision window is one slot, 45 slots are required, so that at least two frames are required to receive the paging message. To facilitate transmission of paging messages, the maximum number of supervision windows for transmission of paging messages in one frame may be set to K or the maximum number of subframes or slots used for transmission of paging messages in one frame may be set to N, and when the SS/PBCH block index (including the candidate SS/PBCH block time index and/or the actually transmitted SS/PBCH block index) of a paging message is greater than K or the number of slots or subframes of a paging message is greater than N, the transmission may be put into the next frame or M adjacent frames.
For example, when SS/PBCH block is TDM-transmitted with paging message, paging message may be placed in a different field than SS/PBCH block or placed after the last actual or possible transmission of SS/PBCH block. The values of K, M, and N may be determined according to the period of RMSI, the subcarrier interval, and the duration of the RMSI supervision window, or the number of nB of paging messages in the DRX period, or the time interval of paging occasions, the duration of the paging window, and the subcarrier interval, where the value of N may be x×k. The supervision window of paging messages is continuous or known to be continuous. The window offsets of different supervision windows may be different, at least two adjacent window offsets may be the same, at least two adjacent window offsets may be different, and the position of the frame where the paging message is located may be calculated using one of the following formulas: the formula may be floor ((i+window offset+f (x, ssb_ TIk))/N) when all slots and subframes of an entire frame are available for transmitting paging messages, and floor (f (x, ssb_ TIk)/N) when slots and subframes of a frame portion are available for transmitting paging messages. The value of N or the value of K can be determined according to the value of x, or can be determined according to the semi-static scheduling DL-UL period T4 and the uplink and downlink duration ratio. For example, when t4=10, the value of N may be 5, or 2*5, or 4*5, or 8*5.
Alternatively, when paging messages are frequency division multiplexed with SS/PBCH blocks, the number of paging message groups in DRX cycles may be related to the period of SS/PBCH blocks.
For example, the terminal device may derive the number of paging message groups in the DRX cycle according to the period of SS/PBCH block, for example, the period of SS/PBCH block is 20ms, the DRX cycle is 32 frames, and the number of paging message groups in the DRX cycle may be derived to be 320/20=16; or the time interval of two adjacent paging messages is related to, e.g., the same as, the period of the SS/PBCH block; or the number of paging message groups in DRX cycles may be related to, e.g., the same as, the number of DRX cycles of SS/PBCH block. The paging message group may represent a plurality of or one paging message associated with all SS/PBCH blocks within a field, and may also represent one or more paging messages associated with one or more SS/PBCH blocks.
The network device may indicate the location of the scheduling information of the paging message control resource information, the network device may configure the scheduling information of the paging message control resource information to be transmitted in SIB1, may also configure the scheduling information of SIB1 to be transmitted in PBCH, and the network device may also multiplex other data to transmit the indication information. A 1 bit may be used to indicate whether to transmit in SIB1 or PBCH. The scheduling information for indicating the paging message control resource may be transmitted in SIB1, SIB2, SIB3, or both. The control resource of the paging message may carry paging indication information, and may also carry location information and/or modulation policy information of the paging message. The scheduling information of the control resources of the paging message may be used to configure the control resource location and/or modulation coding information of the paging message. The control resource position may be a frequency position of the control resource, a time domain position of the control resource, or a position of both. The scheduling information of the paging message may be transmitted in part in the PBCH and in part in SIB1 and/or SIB2 and/or SIB 3. For example, the bandwidth information utilizes the bandwidth information of SIB1 in the PBCH, and the time information is transmitted among SIB1 and/or SIB2 and/or SIB 3. The network device may also configure this information or multiplex other information in an implicit way, e.g. when paging messages are frequency division multiplexed with SS/PBCH blocks, it may use the control resource configuration information of SIB1 in the PBCH, when time division multiplexed it may use its own configuration information, configuration information in SIB1 and/or SIB2 and/or SIB 3. The network device may use explicit means to indicate whether part of the scheduling information of the control resource information of the paging message is transmitted in the PBCH or in SIB1 and/or SIB2 and/or SIB 3. The indication may be made using 1 bit, and the scheduling information of the control resource of the paging message may be configured in the PBCH, SIB1, or both the PBCH and SIB 1. The indication may be made using 2 bits. The configuration is also an indication or carry.
At 902, the terminal device receives a paging message at the supervision window.
In one embodiment, the network device may also distinguish different SS/PBCH blocks and/or different paging packets by different random access opportunities.
Alternatively, when there are multiple RO periods in two adjacent PO time intervals, ROs in different RO periods may be used to distinguish different SS/PBCH blocks, or to distinguish different paging packets, or may distinguish SS/PBCH blocks first and then different paging packets.
For example, assuming that N15 RO periods can be used to distinguish between different SS/PBCH blocks in a time interval of two adjacent POs, assuming that the number of SS/PBCH blocks associated to one RO is K1, the K1 SS/PBCH blocks can be distinguished by which RO period the RO belongs to, that is, the number of SS/PBCH blocks associated to one RO period can be N16, n16=k1/N15, or n16=floor (K1/N15), or n16=ceil (K1/N15), where the value of N16 can be an integer, a fraction, or 1.
When N15 is greater than or equal to K1, K1 SS/PBCH blocks can be associated to N17 RO periods in two adjacent PO time intervals, the N17 periods can be the first N17 periods or the N17 periods can be the last N17 periods, namely N17 is the same as K1, and the SS/PBCH blocks and the RO periods can be in one-to-one correspondence.
It should be noted that, when SS/PBCH block and RO periods are in a one-to-one relationship, for example, there are 4 RO periods in a time interval T of two adjacent POs, each RO in each RO period is associated with 4 SS/PBCH blocks, and in the first RO period, the network device receives the random access preamble sent by the terminal device, which may indicate that the terminal device is on the beam coverage area associated with SS/PBCH block 0; the network device receiving the random access preamble sent by the terminal device in the second RO period may indicate that the terminal device is in the beam coverage area associated with SS/PBCH block 1; and so on, the network device may determine at least one beam that the terminal device is able to receive with a higher signal quality.
Alternatively, the RO cycle index indicates an RO cycle index within T, and the SS/PBCH block index indicates indexes within a plurality of SS/PBCH blocks associated with one RO. At this time, the index i of each RO-associated SS/PBCH block is associated with the RO period index j of the RO period within T, which is j=i+j 0 ,j 0 The value of (2) may be positive or negative or 0.
Alternatively, the association between the RO cycle in T and SS/PBCH block on one RO may be a many-to-one case, where different RO cycles may be used to distinguish different paging packets.
Specifically, assuming that the number of RO periods associated with one SS/PBCH block is N18 and the number of paging packets is N19, the values of the number of paging packets N20, N20 associated with one RO period may be obtained by configuration, may be obtained by calculation, and may be n20=n19/N18, may be n20=floor (N19/N18), may be n20=ceil (N19/N18), and may be the value of N20 which may be an integer or a fraction or 1.
If the indices are allocated sequentially, for example, the paging packet index associated with the ith RO period may be i6+in20 through i6+in20-1, and i6 may be 0 or another constant, positive integer, or negative integer.
Alternatively, different paging packets may be distinguished using random access preambles. When N15 is less than or equal to K1, K1 SS/PBCH blocks are associated with N18 RO cycles in two adjacent PO time intervals, wherein N15 may or may not be equal to N18, e.g., N18 is less than N15. The number of SS/pbchblocks associated with one RO cycle is N21, where the value of N21 may be obtained by configuration, or may be obtained by calculation, or may be n21=k1/N18, or may be n21=floor (K1/N18), or may be n21=ceil (K1/N18), and the value of N21 may be an integer, or may be a fraction, or may be 1.
Wherein, the SS/PBCH block index associated with the ith RO cycle is i7+i×n21 to i7+i×n21-1, and i7 may be 0 or other constant, positive integer, or negative integer. In this embodiment, when the index of j is expressed by using the form i8+i22 to i8+i8+i22-1, there is another expression, i.e. i=i9+floor (j/N22) or i=i9+ceil (j/N22) or i=i9+j/N22, where the two expressions are the same meaning, i9 is related to i8, for example, i8 = -i9, and may be expressed as the index of item 3 associated with the ith item 1 and the jth item 2 is i8+i+jjn22, or may be expressed as i8+floor (i/K5) +j+ceil (i/K5) +jn22, which are different in terms, but the expressions are the same meaning may be used in common. At this time, different SS/PBCH blocks and paging packets may be distinguished using random access preambles.
Optionally, the network device may further distinguish paging packets first and then distinguish different SS/PBCH blocks, assuming that the number of paging packets is N24, the number of paging packets associated with one RO cycle is N23, the value of N23 may be obtained by configuration, N23 may be obtained by calculation, a calculation method may be n23=n24/N15, or may be n23=floor (N24/N15), or may be n23=ceil (N24/N15), the value of N23 may be an integer, or may be a fraction, or may be 1, a paging packet index associated with the ith RO cycle is i10+i×n23+i10+i×n23-1, and i10 may be 0 or another constant, a positive integer, or a negative integer, and different paging packets may be distinguished using random access preambles.
Alternatively, when N24 is less than or equal to N15, one paging packet may be associated with N25 (N25. Gtoreq.1) RO periods, the value of N25 may be obtained by configuration, N25 may be obtained by calculation, the calculation method may be N25=n15/N24, or may be n25=floor (N15/N24) or n25=ceil (N15/N24), where the RO cycle index associated with the ith paging packet is i11+i×n25 to i11+i×n25-1, and i11 may be 0 or another constant, positive integer, or negative integer.
Alternatively, different RO periods may be used to distinguish between different SS/PBCH blocks. Assuming that the number of SS/PBCH blocks associated with one RO is K1, the number of SS/PBCH blocks associated with one RO cycle may be N26, the value of N26 may be an integer or a fraction, the value of N26 may be obtained by configuration or calculation, and the calculation method may be n26=k1/N25 or n26=floor (K1/N25) or n26=ceil (K1/N25).
Optionally, in the case where N25 is greater than or equal to K1, K1 SS/PBCH blocks may be associated with N27 RO periods, the first N27 or the second N27, and N27 may be the same as K1 or N25, where SS/PBCH blocks may be in one-to-one relationship with RO periods, and where SS/PBCH blocks are in one-to-many or many-to-one relationship with RO periods, in two adjacent PO time intervals.
In this case, the value of the RO cycle index j of the RO cycle associated with the index i of the SS/PBCH block associated with each RO to the RO cycle within T may be positive or negative or 0, j=i+j0. The association between the RO cycle in T and SS/PBCH block on one RO may be many-to-one, where different RO cycles may be used to distinguish different paging packets.
It should be understood that the specific examples in the embodiments of the present application are intended only to help those skilled in the art to better understand the embodiments of the present application and are not intended to limit the scope of the embodiments of the present application.
It should be understood that, in various embodiments of the present application, the sequence numbers of the foregoing processes do not mean the order of execution, and the order of execution of the processes should be determined by the functions and internal logic thereof, and should not constitute any limitation on the implementation process of the embodiments of the present application.
The method of signal transmission according to the embodiment of the present application is described in detail above, and the apparatus of signal transmission according to the embodiment of the present application will be described below.
Fig. 10 shows a schematic block diagram of an apparatus 1000 for signal transmission according to an embodiment of the present application.
It should be understood that the apparatus 1000 for signal transmission may correspond to the terminal device in the above embodiment of the method, and may have any function of the terminal device in the method.
The apparatus 1000 for signal transmission includes:
a transceiver module 1010 for receiving a paging indication message on a first paging occasion;
a processing module 1020, configured to determine a first random access opportunity period corresponding to the first paging opportunity according to a first mapping relationship, where the first mapping relationship is a mapping relationship between at least one paging opportunity and at least one random access opportunity period;
the transceiver module 1010 is further configured to send a first random access preamble on a first random access occasion in the first random access occasion period.
Optionally, the first mapping relationship is a mapping relationship of the at least one paging occasion and the at least one random access occasion period in a one-to-one correspondence; or the first mapping relationship is a mapping relationship between each random access opportunity period in the at least one random access opportunity period and at least one paging opportunity; or the first mapping relationship is a mapping relationship between each paging occasion of the at least one paging occasion and at least one random access occasion period.
Optionally, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is a kth random access opportunity period after the random access opportunity period where the second paging opportunity is located, where K is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relationship; or the random access time period corresponding to the second paging time in the at least one paging time in the first mapping relation is the L-th random access time period after a preset time threshold after the second paging time, wherein L is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or the random access time period corresponding to the second paging time in the first mapping relation is the Q random access time period in a plurality of random access time periods between the second paging time and the N paging time after the second paging time, wherein N is a positive integer, Q is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or the random access time period corresponding to the second paging time in the first mapping relation is the P-th random access time period after the second paging time and the J-th paging time after the second paging time, wherein J is an integer greater than 0, P is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation.
Optionally, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is M consecutive random access opportunity periods in a plurality of random access opportunity periods between the second paging opportunity and an I-th paging opportunity after the second paging opportunity, where I is an integer greater than or equal to 0, M is a positive integer, and the second paging opportunity is any paging opportunity in the first mapping relationship.
Optionally, the processing module is further configured to determine the value of M according to the number of synchronization signal blocks corresponding to the first random access opportunity.
Optionally, before the terminal device sends the first random access preamble on the first random access occasion in the first random access occasion period, the processing module 1020 is further configured to determine the first random access preamble according to a second mapping relationship and the first paging occasion, where the second mapping relationship is a mapping relationship between the at least one paging occasion and the at least one random access preamble.
Optionally, before the terminal device sends the first random access preamble on the first random access occasion in the first random access occasion period, the processing module 1020 is further configured to determine the first random access preamble according to a third mapping relationship and at least one synchronization signal block corresponding to the first random access occasion, where the third mapping relationship is a mapping relationship between at least one synchronization signal block and at least one random access preamble.
It should be understood that the third mapping relationship may be predefined or defined according to a standard between the network device and the terminal device, or the network device may send, in advance, second configuration information before step 402, where the second configuration information carries the first mapping relationship, which is not limited in this application.
Optionally, in the case that the paging indication message carries at least one paging packet identifier and the terminal device belongs to a first paging packet corresponding to the at least one paging packet identifier, before the terminal device sends the first random access preamble on a first random access occasion in the first random access occasion period, the processing module 1020 is further configured to determine the first random access preamble according to a fourth mapping relationship between the at least one paging packet and the at least one random access preamble and the first paging packet.
Optionally, before the terminal device sends the first random access preamble on the first random access occasion in the first random access occasion period, the processing module 1020 is further configured to determine the first random access occasion according to a fifth mapping relationship, a sixth mapping relationship and the paging indication message, where the fifth mapping relationship is a mapping relationship between at least one paging indication message received at the first paging occasion and at least one synchronization signal block, and the sixth mapping relationship is a mapping relationship between the at least one synchronization signal block and the random access occasion in the random access occasion period.
Alternatively, the fifth mapping relationship or the sixth mapping relationship may be pre-agreed or defined according to a standard by the network device and the terminal device, or pre-sent by the network device, which is not limited in this application.
Optionally, before the terminal device determines the first random access opportunity corresponding to the first paging opportunity according to the first mapping relationship, the transceiver module 1010 is further configured to receive configuration information, where the configuration information carries the first mapping relationship.
Optionally, the transceiver module 1010 is further configured to receive second configuration information, where the second configuration information includes at least one of a number of paging packets, a number of paging occasions in a random access occasion period, a time interval of adjacent paging occasions, and a number of synchronization signal blocks corresponding to the random access occasions, and the second configuration information is determined according to a number of random access preamble types, where the number of random access preamble types is determined according to a priority level of at least two of the paging packets, the random access occasions, and the synchronization signal blocks.
Alternatively, the signal transmission apparatus 1000 in the embodiment of the present application may be a terminal device, or may be a chip in the terminal device.
It should be understood that the apparatus 1100 for signal transmission according to the embodiment of the present application may correspond to a terminal device in the method for signal transmission in the embodiment of fig. 3, and that the foregoing and other management operations and/or functions of each module in the apparatus 1000 for signal transmission are respectively for implementing the corresponding steps of each foregoing method, which are not repeated herein for brevity.
Optionally, if the signal transmission apparatus 1000 is a terminal device, the transceiver module 1020 in this embodiment of the present application may include a receiving module and a transmitting module, and may also be implemented by the transceiver 1110, and the processing module 1010 may be implemented by the processor 1120. As shown in fig. 11, a signal transmitting apparatus 1100 may include a transceiver 1110, a processor 1120, and a memory 1130. The memory 1130 may be used for storing instruction information, and may also be used for storing code, instructions, etc. for execution by the processor 1120. The transceiver 1110 may comprise radio frequency circuitry and optionally the terminal device further comprises a memory unit.
The memory unit may be, for example, a memory. When the terminal device comprises a storage unit, the storage unit is used for storing computer-executable instructions, the processing unit is connected with the storage unit, and the processing unit executes the computer-executable instructions stored by the storage unit so as to enable the terminal device to execute the signal transmission method.
Optionally, if the signal transmission device 1000 is a chip in the terminal device, the chip includes a processing module 1010 and a transceiver module 1020. Transceiver module 1020 may be implemented by transceiver 1110 and processing module 1010 may be implemented by processor 1120. The transceiver module may be, for example, an input/output interface, pins or circuitry, etc. The processing module may execute computer-executable instructions stored by the memory unit. The storage unit is a storage unit in the chip, such as a register, a cache, etc., and the storage unit may also be a storage unit in the terminal located outside the chip, such as a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a random access memory (random access memory, RAM), etc.
Fig. 12 is an apparatus 1200 for signal transmission in an embodiment of the present application. The apparatus 1200 for signal transmission may be the network device described above.
It should be appreciated that the apparatus 1200 for signal transmission may correspond to a network device in each method embodiment, and may have any function of the network device in the method.
The apparatus 1200 for signal transmission includes:
a transceiver module 1210, configured to send paging indication messages to a plurality of terminal devices;
The transceiver module 1210 is further configured to receive at least one random access preamble on a random access occasion in the at least one random access occasion period;
a processing module 1220 configured to determine at least one paging occasion according to the at least one random access occasion period or the at least one random access preamble;
the transceiver module 1210 is further configured to send a paging message to at least one terminal device, where the at least one terminal device is a terminal device corresponding to the at least one paging occasion.
Optionally, the processing module 1220 is specifically configured to:
and determining the at least one paging occasion according to the first mapping relation and the at least one random access occasion period, wherein the first mapping relation is the mapping relation between the at least one random access occasion period and the at least one paging occasion.
Optionally, the first mapping relationship is a mapping relationship of the at least one paging occasion and the at least one random access occasion period in a one-to-one correspondence; or (b)
The first mapping relationship is a mapping relationship between each random access opportunity period in the at least one random access opportunity period and at least one paging opportunity; or (b)
The first mapping relationship is a mapping relationship between each paging occasion of the at least one paging occasion and at least one random access occasion period.
Optionally, the random access opportunity period corresponding to the second paging opportunity in the first mapping relationship is a kth random access opportunity period after the random access opportunity period where the second paging opportunity is located, where K is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relationship; or (b)
The random access opportunity period corresponding to a second paging opportunity in the at least one paging opportunity in the first mapping relation is an L-th random access opportunity period after a preset time threshold after the second paging opportunity, wherein L is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is the Q random access time period in a plurality of random access time periods between the second paging time and the N paging time after the second paging time, wherein N is a positive integer, Q is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is the P random access time period after the second paging time and the J-th paging time after the second paging time, wherein J is an integer greater than 0, P is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is M continuous random access time periods in a plurality of random access time periods between the second paging time and an I-th paging time after the second paging time, wherein I is an integer greater than or equal to 0, M is a positive integer, and the second paging time is any paging time in the first mapping relation.
Optionally, the processing module 1220 is further configured to determine the first paging packet according to the random access preamble and a third mapping relationship, where the third mapping relationship is a mapping relationship between at least one paging packet and the random access preamble;
the processing module 1220 is specifically configured to:
the paging message is sent to the terminal device in the first paging packet.
Optionally, the processing module 1220 is specifically configured to:
and determining the at least one paging occasion according to the at least one random access preamble and the second mapping relation, wherein the second mapping relation is the mapping relation of the at least one random access preamble and the at least one paging occasion.
Optionally, the transceiver module 1210 is further configured to send first configuration information, where the first configuration information carries the first mapping relationship.
Optionally, the processing module 1220 is specifically configured to:
determining the number of random access preamble categories according to the priority level of at least two of paging packets, random access opportunities and synchronous signal blocks;
determining second configuration information according to the number of the random access preamble types, wherein the second configuration information comprises at least one of the number of paging packets, the number of paging occasions in a random access occasion period, the time interval of adjacent paging occasions and the number of synchronous signal blocks corresponding to the random access occasions;
the transceiver module 1210 is further configured to send the second configuration information.
Alternatively, the signal transmission apparatus 1200 in the embodiments of the present application may be a network device, or may be a chip in the network device.
It should be understood that the apparatus 1200 for signal transmission according to the embodiment of the present application may correspond to a network device in the method for signal transmission of the embodiment of fig. 4, and that the foregoing and other management operations and/or functions of the respective modules in the apparatus 1200 for signal transmission are respectively for implementing the respective steps of the foregoing respective methods, which are not repeated herein for brevity.
Alternatively, if the apparatus 1200 for signal transmission is a network device, the transceiver module 1210 in the embodiment of the present application may include a receiving module and a transmitting module, and may also be implemented by the transceiver 1310, and the processing module 1220 may be implemented by the processor 1320. As shown in fig. 13, the apparatus 1350 may include a transceiver 1310, a processor 1320, and a memory 1330. The memory 1330 may be used to store instruction information, and may also be used to store code, instructions, and the like for execution by the processor 1320. The transceiver may comprise radio frequency circuitry and optionally the network device further comprises a memory unit.
The memory unit may be, for example, a memory. When the network device includes a storage unit, the storage unit is configured to store computer-executable instructions, and the processing module is connected to the storage unit, and the processing module executes the computer-executable instructions stored in the storage unit, so that the network device performs the signal transmission method.
Alternatively, if the signal transmission apparatus 1200 is a chip in a network device, the chip includes a processing module 1220 and a transceiver module 1210. The transceiver module 1210 may be, for example, an on-chip input/output interface, pins or circuitry, etc. The processing module 1220 may execute computer-executable instructions stored by the memory unit.
Alternatively, the storage unit is a storage unit in the chip, such as a register, a cache, or the like, and the storage unit may also be a storage unit in the terminal located outside the chip, such as a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a random access memory (random access memory, RAM), or the like. The storage unit is a storage unit in the chip, such as a register, a cache, etc., and the storage unit may also be a storage unit in the terminal located outside the chip, such as a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a random access memory (random access memory, RAM), etc.
It is to be appreciated that processor 1120 or processor 1320 may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the above method embodiments may be implemented by integrated logic circuits of hardware in a processor or instructions in software form. The processor may be a general purpose processor, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (application specific integrated circuit, ASIC), an off-the-shelf programmable gate array (field programmable gate array, FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. The disclosed methods, steps, and logic blocks in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in hardware, in a decoded processor, or in a combination of hardware and software modules in a decoded processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.
It is to be appreciated that memory 1230 or memory 1330 in embodiments of the application can be volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically Erasable EPROM (EEPROM), or a flash memory. The volatile memory may be random access memory (random access memory, RAM) which acts as an external cache. By way of example, and not limitation, many forms of RAM are available, such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), and direct memory bus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
Fig. 14 shows a communication system 1400 of an embodiment of the present application, the communication system 1400 comprising:
a device 1000 for signal transmission in the embodiment shown in fig. 10 and a device 1200 for signal transmission in the embodiment shown in fig. 12.
The embodiment of the application also provides a computer storage medium, which can store program instructions for indicating any one of the methods.
Alternatively, the storage medium may be specifically the memory 1130 or 1330.
The embodiments of the present application also provide a chip system, which includes a processor, for supporting a distributed unit, a centralized unit, and a terminal device and a network device to implement the functions involved in the above embodiments, for example, generating or processing data and/or information involved in the above methods.
In one possible design, the chip system further includes a memory for holding program instructions and data necessary for the distributed units, the centralized units, and the terminal devices and network devices. The chip system can be composed of chips, and can also comprise chips and other discrete devices.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes and substitutions are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (34)

1. A method of signal transmission, comprising:
the terminal equipment receives paging indication information on a first paging occasion;
the terminal equipment determines a first random access opportunity period corresponding to the first paging opportunity according to a first mapping relation, wherein the first mapping relation is a mapping relation between at least one paging opportunity and at least one random access opportunity period;
the terminal device sends a first random access preamble on a first random access occasion in the first random access occasion period, and the first random access occasion period and the first random access preamble are used for a network device to determine the first paging occasion.
2. The method of claim 1, wherein the first mapping relationship is a mapping relationship in which the at least one paging occasion corresponds to the at least one random access occasion period one to one; or (b)
The first mapping relationship is a mapping relationship between each random access opportunity period in the at least one random access opportunity period and at least one paging opportunity; or (b)
The first mapping relationship is a mapping relationship between each paging occasion of the at least one paging occasion and at least one random access occasion period.
3. The method according to claim 1 or 2, wherein the random access occasion period corresponding to the second paging occasion in the first mapping relation is a kth random access occasion period after the random access occasion period in which the second paging occasion is located, where K is an integer greater than or equal to 0, and the second paging occasion is any paging occasion in the first mapping relation; or (b)
The random access opportunity period corresponding to a second paging opportunity in the at least one paging opportunity in the first mapping relation is an L-th random access opportunity period after a preset time threshold after the second paging opportunity, wherein L is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is the Q-th random access time period in a plurality of random access time periods between the second paging time and the N-th paging time after the second paging time, wherein N is a positive integer, Q is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is the P-th random access time period after the second paging time and the J-th paging time after the second paging time, wherein J is an integer greater than 0, P is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation.
4. The method according to claim 1 or 2, wherein the random access occasion period corresponding to the second paging occasion in the first mapping relation is M consecutive random access occasion periods among a plurality of random access occasion periods between the second paging occasion and an I-th paging occasion after the second paging occasion, wherein I is an integer greater than or equal to 0, M is a positive integer, and the second paging occasion is any one paging occasion in the first mapping relation.
5. The method according to claim 4, wherein the method further comprises:
and the terminal equipment determines the value of M according to the number of the synchronous signal blocks corresponding to the first random access time.
6. The method according to claim 1 or 2, characterized in that before the terminal device transmits a first random access preamble on a first random access occasion in the first random access occasion period, the method further comprises:
And the terminal equipment determines the first random access preamble according to a second mapping relation and the first paging occasion, wherein the second mapping relation is the mapping relation between the at least one paging occasion and the at least one random access preamble.
7. The method according to claim 1 or 2, characterized in that before the terminal device transmits a first random access preamble on a first random access occasion in the first random access occasion period, the method further comprises:
the terminal equipment determines the first random access preamble according to a third mapping relation and at least one synchronous signal block corresponding to the first random access opportunity, wherein the third mapping relation is the mapping relation between at least one synchronous signal block and at least one random access preamble.
8. The method according to claim 1 or 2, wherein in case the paging indication message carries at least one paging packet identity and the terminal device belongs to a first paging packet corresponding to the at least one paging packet identity, before the terminal device sends a first random access preamble on a first random access occasion in the first random access occasion period, the method further comprises:
And the terminal equipment determines the first random access preamble according to a fourth mapping relation and the first paging packet, wherein the fourth mapping relation is the mapping relation of at least one paging packet and at least one random access preamble.
9. The method according to claim 1 or 2, characterized in that before the terminal device transmits a first random access preamble on a first random access occasion in the first random access occasion period, the method further comprises:
the terminal equipment determines the first random access opportunity according to a fifth mapping relation, a sixth mapping relation and the paging indication message, wherein the fifth mapping relation is a mapping relation between at least one paging indication message received by the first paging opportunity and at least one synchronous signal block, and the sixth mapping relation is a mapping relation between the at least one synchronous signal block and random access opportunity in a random access opportunity period.
10. The method according to claim 1 or 2, characterized in that the method further comprises:
the terminal device receives second configuration information, where the second configuration information includes at least one of a number of paging packets, a number of paging occasions in a random access occasion period, a time interval of adjacent paging occasions, and a number of synchronization signal blocks corresponding to the random access occasions, and the second configuration information is determined according to a number of random access preamble types, where the number of random access preamble types is determined according to a priority level of at least two of the paging packets, the random access occasions, and the synchronization signal blocks.
11. A method of signal transmission, comprising:
the network equipment sends a paging indication message;
the network device receiving at least one random access preamble on a random access occasion in at least one random access occasion period;
the network equipment determines at least one paging occasion according to the at least one random access occasion period or the at least one random access preamble;
the network device sends a paging message to at least one terminal device, where the at least one terminal device is a terminal device corresponding to the at least one paging occasion.
12. The method of claim 11, wherein the network device determining at least one paging occasion from the at least one random access occasion period comprises:
the network device determines the at least one paging occasion according to a first mapping relation and the at least one random access occasion period, wherein the first mapping relation is a mapping relation between the at least one random access occasion period and the at least one paging occasion.
13. The method according to claim 11 or 12, wherein the first mapping relationship is a mapping relationship in which the at least one paging occasion corresponds to the at least one random access occasion period one to one; or (b)
The first mapping relationship is a mapping relationship between each random access opportunity period in the at least one random access opportunity period and at least one paging opportunity; or (b)
The first mapping relationship is a mapping relationship between each paging occasion of the at least one paging occasion and at least one random access occasion period.
14. The method according to claim 11 or 12, wherein the random access occasion period corresponding to the second paging occasion in the first mapping relation is a kth random access occasion period after the random access occasion period in which the second paging occasion is located, where K is an integer greater than or equal to 0, and the second paging occasion is any paging occasion in the first mapping relation; or (b)
The random access opportunity period corresponding to a second paging opportunity in the at least one paging opportunity in the first mapping relation is an L-th random access opportunity period after a preset time threshold after the second paging opportunity, wherein L is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is the Q-th random access time period in a plurality of random access time periods between the second paging time and the N-th paging time after the second paging time, wherein N is a positive integer, Q is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or (b)
The random access time period corresponding to a second paging time in a first mapping relation is a P-th random access time period after the second paging time and a J-th paging time after the second paging time, wherein J is an integer greater than 0, P is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is M continuous random access time periods in a plurality of random access time periods between the second paging time and an I-th paging time after the second paging time, wherein I is an integer greater than or equal to 0, M is a positive integer, and the second paging time is any paging time in the first mapping relation.
15. The method of claim 11, wherein the network device determining at least one paging occasion from the at least one random access preamble comprises:
the network device determines the at least one paging occasion according to the at least one random access preamble and a second mapping relation, wherein the second mapping relation is a mapping relation between the at least one random access preamble and the at least one paging occasion.
16. The method according to claim 11 or 12, characterized in that before the network device sends the paging indication message to a plurality of terminal devices, the method further comprises:
the network device sends second configuration information, where the second configuration information includes at least one of a number of paging packets, a number of paging occasions in a random access occasion period, a time interval of adjacent paging occasions, and a number of synchronization signal blocks corresponding to the random access occasions, and the second configuration information is determined according to a number of random access preamble types, where the number of random access preamble types is determined according to a priority level of at least two of the paging packets, the random access occasions, and the synchronization signal blocks.
17. An apparatus for signal transmission, comprising:
a transceiver module for receiving a paging indication message on a first paging occasion;
the processing module is used for determining a first random access opportunity period corresponding to the first paging opportunity according to a first mapping relation, wherein the first mapping relation is a mapping relation between at least one paging opportunity and at least one random access opportunity period;
the transceiver module is further configured to send a first random access preamble on a first random access occasion in the first random access occasion period, where the first random access occasion period and the first random access preamble are used by a network device to determine the first paging occasion.
18. The apparatus of claim 17, wherein the first mapping relationship is a mapping relationship in which the at least one paging occasion corresponds to the at least one random access occasion period one to one; or (b)
The first mapping relationship is a mapping relationship between each random access opportunity period in the at least one random access opportunity period and at least one paging opportunity; or (b)
The first mapping relationship is a mapping relationship between each paging occasion of the at least one paging occasion and at least one random access occasion period.
19. The apparatus of claim 17 or 18, wherein the random access occasion period corresponding to the second paging occasion in the first mapping relationship is a kth random access occasion period after the random access occasion period in which the second paging occasion is located, where K is an integer greater than or equal to 0, and the second paging occasion is any paging occasion in the first mapping relationship; or (b)
The random access opportunity period corresponding to a second paging opportunity in the at least one paging opportunity in the first mapping relation is an L-th random access opportunity period after a preset time threshold after the second paging opportunity, wherein L is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is the Q-th random access time period in a plurality of random access time periods between the second paging time and the N-th paging time after the second paging time, wherein N is a positive integer, Q is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is the P-th random access time period after the second paging time and the J-th paging time after the second paging time, wherein J is an integer greater than 0, P is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation.
20. The apparatus of claim 17 or 18, wherein the random access occasion period corresponding to the second paging occasion in the first mapping relationship is M consecutive random access occasion periods among a plurality of random access occasion periods between the second paging occasion and an I-th paging occasion after the second paging occasion, wherein I is an integer greater than or equal to 0, M is a positive integer, and the second paging occasion is any one paging occasion in the first mapping relationship.
21. The apparatus of claim 20, wherein the processing module is further configured to determine the value of M according to a number of synchronization signal blocks corresponding to the first random access opportunity.
22. The apparatus according to claim 17 or 18, wherein the processing module is further configured to determine, before the terminal device sends the first random access preamble on a first random access occasion in the first random access occasion period, the first random access preamble according to a second mapping relationship and the first paging occasion, the second mapping relationship being a mapping relationship between the at least one paging occasion and at least one random access preamble.
23. The apparatus according to claim 17 or 18, wherein the processing module is further configured to determine, before the terminal device sends the first random access preamble on a first random access occasion in the first random access occasion period, the first random access preamble according to a third mapping relationship and at least one synchronization signal block corresponding to the first random access occasion, the third mapping relationship being a mapping relationship between at least one synchronization signal block and at least one random access preamble.
24. The apparatus according to claim 17 or 18, wherein, in case the paging indication message carries at least one paging packet identity and the terminal device belongs to a first paging packet corresponding to the at least one paging packet identity, the processing module is further configured to determine, before the terminal device sends a first random access preamble on a first random access occasion in the first random access occasion period, the first random access preamble according to a fourth mapping relation and the first paging packet, the fourth mapping relation being a mapping relation of at least one paging packet and at least one random access preamble.
25. The apparatus according to claim 17 or 18, wherein the processing module is further configured to determine, before the terminal device sends the first random access preamble on the first random access occasion in the first random access occasion period, the first random access occasion according to a fifth mapping relationship, a sixth mapping relationship and the paging indication message, the fifth mapping relationship being a mapping relationship between at least one paging indication message received at the first paging occasion and at least one synchronization signal block, and the sixth mapping relationship being a mapping relationship between the at least one synchronization signal block and a random access occasion in the random access occasion period.
26. The apparatus of claim 17 or 18, wherein the transceiver module is further configured to receive second configuration information, the second configuration information including at least one of a number of paging packets, a number of paging occasions within a random access occasion period, a time interval of adjacent paging occasions, a number of synchronization signal blocks corresponding to random access occasions, and the second configuration information is determined according to a number of random access preamble categories, wherein the number of random access preamble categories is determined according to a priority level of at least two of paging packets, random access occasions, synchronization signal blocks.
27. An apparatus for signal transmission, comprising:
the receiving and transmitting module is used for sending paging indication messages to a plurality of terminal devices;
the transceiver module is further configured to receive at least one random access preamble on a random access occasion in at least one random access occasion period;
the processing module is used for determining at least one paging occasion according to the at least one random access occasion period or the at least one random access preamble, and the second mapping relation is the mapping relation between the at least one random access preamble and the at least one paging occasion;
The transceiver module is further configured to send a paging message to at least one terminal device, where the at least one terminal device is a terminal device corresponding to the at least one paging occasion.
28. The apparatus of claim 27, wherein the processing module is specifically configured to:
and determining the at least one paging occasion according to a first mapping relation and the at least one random access occasion period, wherein the first mapping relation is the mapping relation between the at least one random access occasion period and the at least one paging occasion.
29. The apparatus according to claim 27 or 28, wherein the first mapping relationship is a mapping relationship in which the at least one paging occasion corresponds to the at least one random access occasion period one to one; or (b)
The first mapping relationship is a mapping relationship between each random access opportunity period in the at least one random access opportunity period and at least one paging opportunity; or (b)
The first mapping relationship is a mapping relationship between each paging occasion of the at least one paging occasion and at least one random access occasion period.
30. The apparatus of claim 27 or 28, wherein the random access occasion period corresponding to the second paging occasion in the first mapping relationship is a kth random access occasion period after the random access occasion period in which the second paging occasion is located, where K is an integer greater than or equal to 0, and the second paging occasion is any paging occasion in the first mapping relationship; or (b)
The random access opportunity period corresponding to a second paging opportunity in the at least one paging opportunity in the first mapping relation is an L-th random access opportunity period after a preset time threshold after the second paging opportunity, wherein L is an integer greater than or equal to 0, and the second paging opportunity is any paging opportunity in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is the Q-th random access time period in a plurality of random access time periods between the second paging time and the N-th paging time after the second paging time, wherein N is a positive integer, Q is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or (b)
The random access time period corresponding to a second paging time in a first mapping relation is a P-th random access time period after the second paging time and a J-th paging time after the second paging time, wherein J is an integer greater than 0, P is an integer greater than or equal to 0, and the second paging time is any paging time in the first mapping relation; or (b)
The random access time period corresponding to the second paging time in the first mapping relation is M continuous random access time periods in a plurality of random access time periods between the second paging time and an I-th paging time after the second paging time, wherein I is an integer greater than or equal to 0, M is a positive integer, and the second paging time is any paging time in the first mapping relation.
31. The apparatus of claim 27, wherein the processing module is specifically configured to:
and determining the at least one paging occasion according to the at least one random access preamble and the second mapping relation, wherein the second mapping relation is the mapping relation between the at least one random access preamble and the at least one paging occasion.
32. The apparatus according to claim 27 or 28, wherein the processing module is specifically configured to:
and transmitting second configuration information, wherein the second configuration information comprises at least one of the number of paging packets, the number of paging occasions in a random access occasion period, the time interval of adjacent paging occasions and the number of synchronous signal blocks corresponding to the random access occasions, and the second configuration information is determined according to the number of random access preamble types, and the number of random access preamble types is determined according to the priority level of at least two of the paging packets, the random access occasions and the synchronous signal blocks.
33. A computer storage medium having stored therein program code for instructing the execution of the method of any of the preceding claims 1 to 16.
34. A chip system comprising a processor for supporting distributed units, centralized units and terminal devices and network devices to implement the method of any of the preceding claims 1 to 16.
CN201810055716.XA 2018-01-19 2018-01-19 Method and device for signal transmission Active CN110062461B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201810055716.XA CN110062461B (en) 2018-01-19 2018-01-19 Method and device for signal transmission
PCT/CN2019/071062 WO2019141123A1 (en) 2018-01-19 2019-01-10 Signal transmission method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810055716.XA CN110062461B (en) 2018-01-19 2018-01-19 Method and device for signal transmission

Publications (2)

Publication Number Publication Date
CN110062461A CN110062461A (en) 2019-07-26
CN110062461B true CN110062461B (en) 2023-05-16

Family

ID=67301607

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810055716.XA Active CN110062461B (en) 2018-01-19 2018-01-19 Method and device for signal transmission

Country Status (2)

Country Link
CN (1) CN110062461B (en)
WO (1) WO2019141123A1 (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021031039A1 (en) * 2019-08-16 2021-02-25 华为技术有限公司 Method and apparatus for sending random access message
CN113329478A (en) * 2020-02-28 2021-08-31 华为技术有限公司 Random access response method and device
CN114071370B (en) * 2020-08-06 2023-07-18 华为技术有限公司 Information transmission method, device and system
CN114286428B (en) * 2020-09-28 2023-10-13 维沃移动通信有限公司 Channel detection method, device and user equipment
CN114501631A (en) * 2020-10-23 2022-05-13 大唐移动通信设备有限公司 Signal processing method and device
WO2023097532A1 (en) * 2021-12-01 2023-06-08 北京小米移动软件有限公司 Group paging method and apparatus, communication device, and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102655658A (en) * 2011-03-04 2012-09-05 华为技术有限公司 Paging method, paging device and paging system
CN105340329A (en) * 2013-04-03 2016-02-17 谷歌技术控股有限责任公司 Methods for cell discovery
CN107018497A (en) * 2017-03-24 2017-08-04 电信科学技术研究院 A kind of paging method and device

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8520698B2 (en) * 2007-09-04 2013-08-27 Qualcomm Incorporated Paging user devices in a wireless access network
US8934400B2 (en) * 2013-02-22 2015-01-13 General Dynamics C4 Systems, Inc. Apparatus and methods for relay-assisted uplink communication
EP3041302B1 (en) * 2013-10-16 2018-12-12 Huawei Technologies Co., Ltd. Methods and apparatuses for transmitting and receiving paging message
US9883480B2 (en) * 2014-07-11 2018-01-30 Apple Inc. Enhanced paging schemes and connected-state DRX
US20170230932A1 (en) * 2016-02-04 2017-08-10 Qualcomm Incorporated Paging conflict management for multi-sim wireless communication device
TWI661735B (en) * 2016-04-05 2019-06-01 新力股份有限公司 Terminal device, infrastructure equipment, methods and integrated circuitry

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102655658A (en) * 2011-03-04 2012-09-05 华为技术有限公司 Paging method, paging device and paging system
CN105340329A (en) * 2013-04-03 2016-02-17 谷歌技术控股有限责任公司 Methods for cell discovery
CN107018497A (en) * 2017-03-24 2017-08-04 电信科学技术研究院 A kind of paging method and device

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
CATT. "R2-1700980 Paging Mechanism in NR".3GPP tsg_ran\WG2_RL2.2017,全文. *
NTT DOCOMO, INC..R1-1702829 "Discussion on paging design for NR".3GPP tsg_ran\WG1_RL1.2017,(TSGR1_88),全文. *

Also Published As

Publication number Publication date
CN110062461A (en) 2019-07-26
WO2019141123A1 (en) 2019-07-25

Similar Documents

Publication Publication Date Title
CN110062461B (en) Method and device for signal transmission
CN107734693B (en) Method and apparatus for determining basic parameter bandwidth in wireless communication system
US10631308B2 (en) Methods and devices for data transmission without grant during measurement gap
CN107534460B (en) Method and apparatus for configuring frame structure and frequency hopping for MTC UE in wireless communication system
TWI713315B (en) Method of transmitting and receiving signal in wireless communication system and apparatus therefor
CN108307518B (en) Method and apparatus for controlling timing relationship between channels and data channels
CN110266454B (en) Apparatus for receiving system information block
JP2020145715A (en) Signal transmission configuration in wireless system
EP3042534B1 (en) Robust transmission on downlink discontinuous transmission carrier
EP3282628B1 (en) Method and device for transmitting and receiving plurality of d2d signals in wireless communication system
CN108141737B (en) System information transmission method, base station and user equipment
EP3499994A1 (en) Method whereby terminal transmits data to another terminal in wireless communication system
EP3383113B1 (en) User terminal, wireless base station, and wireless communication method
US10595344B2 (en) Method and device for transmitting or receiving multicasting control channel for bandwidth reduced low complexity / coverage enhancement (BL/CE) terminal
KR20170128132A (en) Method and apparatus for improving uplink grants in a shortened transmission time interval(TTI) in a wireless communication system
US20230063015A1 (en) NON-CODEBOOK BASED MULTI-TRP PUSCH RELIABILITY WITH MULTIPLE ASSOCIATED NZP CSI-RSs
JP6727562B2 (en) Method and node in a wireless communication network
KR20140037189A (en) Method for transmitiing or receiving pdcch and user equipment or base station for the method
CN109792672B (en) Data transmission method, network equipment and terminal equipment
US10813039B2 (en) Method and device for transmitting system information, user equipment and network device
CN113067693B (en) Information transmission method, terminal equipment and network equipment
EP4132191A1 (en) Method and apparatus for urllc in unlicensed band
CN112166637A (en) Channel state information transmission method and device
WO2020026213A1 (en) Dynamic adjustment of physical downlink control channel (pdcch) monitoring occasions
CN109644482B (en) Data transmission method, terminal equipment and network equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant