US10951746B2 - Method and device in UE and base station used for wireless communication - Google Patents
Method and device in UE and base station used for wireless communication Download PDFInfo
- Publication number
- US10951746B2 US10951746B2 US16/407,187 US201916407187A US10951746B2 US 10951746 B2 US10951746 B2 US 10951746B2 US 201916407187 A US201916407187 A US 201916407187A US 10951746 B2 US10951746 B2 US 10951746B2
- Authority
- US
- United States
- Prior art keywords
- time window
- bit block
- radio signal
- block
- 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, expires
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/324—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/042—Public Land Mobile systems, e.g. cellular systems
Definitions
- the present disclosure relates to methods and devices in wireless communication systems, and in particular to a method and a device in a wireless communication system of Cyclic Redundancy Check (CRC).
- CRC Cyclic Redundancy Check
- Cyclic Redundancy Check is a hash function that generates short and fixed-digit CRC codes based on data such as network packet or computer files.
- CRC is mainly used for detecting or checking errors possibly occurred after data transmission or data storage, and it performs error detection using the general division and the remainder theorem.
- LTE Long Term Evolution
- Ultra-Reliable and Low Latency Communications becomes one of three major application scenarios in New Radio (NR) system.
- URLLC a typical scenario is presented by smaller quantity of data transmitted each time, and higher demand on transmission defer and transmission reliability.
- 3GPP 3 rd Generation Partner Project
- RAN Radio Access Network
- the inventors have found through researches that in order to meet the requirement of URLLC for high reliability, the precision of error check on URLLC transmission must be very high.
- the precision of error check provided by a maximum number of CRC bits that the present system can support is not always sufficient for reliability required by URLLC. Since the amount of information transmitted by URLLC each time is smaller, a redundancy further caused by an increasing number of CRC bits will remarkably reduce transmission efficiency. Therefore, how to improve error check precision of URLLC without rising excessive redundancy has been a problem needed to be solved.
- the present disclosure provides a solution. It should be noted that though originally targeted at URLLC, the present disclosure is also applicable to other business types and application scenarios.
- the embodiments of a first node in the present disclosure and the characteristics in the embodiments may be applied to a second node if no conflict is incurred, and vice versa.
- the embodiments of the present disclosure and the characteristics in the embodiments may be mutually combined if no conflict is incurred.
- the present disclosure provides a method in a first node for wireless communication, comprising:
- the first time window is any time window out of M time windows, the first radio signal carries a first check bit block;
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- a problem needed to be solved in the present disclosure is how to improve the precision of error check for URLLC without increasing total amount of CRC bits.
- the above method solves this problem by generating different check bit blocks for the first bit block in separate time windows of the M time windows.
- the above method is characterized in that the first node transmits radio signals generated by the first bit block in each time window of the M time windows, but generates check bit blocks for the first bit block using different CRC Cyclic Generator Polynomials in different time windows.
- An advantage of the above method is that check bit blocks in different time windows can be jointly used for error check for the first bit block, which is equivalent to increasing a total number of effective CRC bits, thus enhancing precision of error check for the first bit block. In the meanwhile, there is no increase in the number of CRC bits in actual transmission, hence the avoidance of excessive redundancy.
- the second time window is any time window out of M1 time window(s), the second radio signal carries the first bit block;
- the M1 time window(s) is(are) a subset of the M time windows, the M1 is a positive integer not greater than the M.
- the second radio signal carries a second bit block and a third check bit block
- an information bit block corresponding to the third check bit block comprises the second bit block
- the first check bit block is not related to the second bit block
- a code rate of the first coding is related to a position of the second time window in the M1 time window(s).
- the above method is advantageous in that a total number of bits output from the first coding is not related to the length of check bit block of the first bit block in the second time window, which prevents impacts on resources allocation and resources mapping caused by utilizing different numbers of CRC bits in different time windows of the M time windows, thus reducing complexity of practice.
- the above method is advantageous in that in a time window with lower number of CRC bits, a code rate of channel coding will be lower, so that transmission reliability for radio signals in these time windows will be higher.
- a target receiver of the first radio signal can correctly recover the first bit block out of radio signals received within these time windows, so as to recover a check bit block of the first bit block, for example, the first check bit block, subsequently.
- a first post-coding bit block is acquired after a third coding of a first pre-coding bit block
- the first pre-coding bit block comprises the first bit block and the first check bit block
- the first post-coding bit block comprises a first post-coding bit sub-block and a second post-coding bit sub-block
- the first check bit block comprises a first check bit sub-block and a second check bit sub-block
- the first post-coding bit sub-block is not related to the second check bit sub-block
- the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- the first node only transmits a radio signal carrying the first bit block in the M1 time window(s) out of the M time windows.
- the M2 time window(s) and the M3 time window(s) are two subsets of the M time windows not intersected with each other, the M2 and the M3 are positive integers less than the M, respectively.
- the above method is advantageous in that different CRC Cyclic Generator Polynomials are used for generating CRC bits in different time windows of the M time windows, which increases effective/workable CRC length and improves precision of error check for the first bit block.
- the first check bit block comprises Q check bit sub-block(s), an information bit block corresponding to each Check bit sub-block out of the Q check bit sub-block(s) comprises the first bit block; the Q is a positive integer.
- any time resource group of the K time resource group(s) comprises a positive integer number of time window(s)
- any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s)
- the M time windows are a time resource group of the K time resource group(s); the K is a positive integer.
- the first information is used for determining the K time resource group(s).
- the second information is used for determining at least one of the M and the M1.
- the first node is a User Equipment (UE); or, the first node is a base station.
- UE User Equipment
- the present disclosure provides a method in a second node for wireless communication, comprising:
- the first time window is any time window out of M time windows, the first radio signal carries a first check bit block;
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the second time window is any time window out of M1 time window(s), the second radio signal carries the first bit block;
- the M1 time window(s) is(are) a subset of the M time windows, the M1 is a positive integer not greater than the M.
- the second radio signal carries a second bit block and a third check bit block
- an information bit block corresponding to the third check bit block comprises the second bit block
- the first check bit block is not related to the second bit block
- a first post-coding bit block is acquired after a third coding of a first pre-coding bit block
- the first pre-coding bit block comprises the first bit block and the first check bit block
- the first post-coding bit block comprises a first post-coding bit sub-block and a second post-coding bit sub-block
- the first check bit block comprises a first check bit sub-block and a second check bit sub-block
- the first post-coding bit sub-block is not related to the second check bit sub-block
- the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- the second node only receives a radio signal carrying the first bit block in the M1 time window(s) out of the M time windows.
- the M2 time window(s) and the M3 time window(s) are two subsets of the M time windows not intersected with each other, the M2 and the M3 are positive integers less than the M, respectively.
- the first check bit block comprises Q check bit sub-block(s)
- an information bit block corresponding to each Check bit sub-block of the Q check bit sub-block(s) comprises the first bit block
- the Q is a positive integer
- any time resource group of the K time resource group(s) comprises a positive integer number of time window(s)
- any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s)
- the M time windows are a time resource group of the K time resource group(s)
- the K is a positive integer.
- the first information is used for determining the K time resource group(s).
- the second information is used for determining at least one of the M and the M1.
- the second node is a base station; or, the second node is a UE.
- the present disclosure provides a device in a first node for wireless communication, comprising:
- a first processor transmitting a first radio signal in a first time window, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block;
- an information bit block corresponding to the first Check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the above device in a first node for wireless communication is characterized in that the first processor transmits a second radio signal in a second time window, the second time window is any time window out of the M1 time window(s), the second radio signal carries the first bit block; wherein the M1 time window(s) is(are) a subset of the M time windows, the M1 is a positive integer not greater than the M.
- the above device in a first node for wireless communication is characterized in that the second radio signal carries a second bit block and a third check bit block, an information bit block corresponding to the third check bit block comprises the second bit block, the first check bit block is not related to the second bit block.
- the above device in a first node for wireless communication is characterized in that a bit block output after the first bit block is subjected to a first coding is used for generating the second radio signal, a code rate of the first coding is related to a position of the second time window in the M1 time window(s).
- the above device in a first node for wireless communication is characterized in that a first post-coding bit block is acquired after a third coding of a first pre-coding bit block, the first pre-coding bit block comprises the first bit block and the first check bit block, the first post-coding bit block comprises a first post-coding bit sub-block and a second post-coding bit sub-block, the first check bit block comprises a first check bit sub-block and a second check bit sub-block, the first post-coding bit sub-block is not related to the second check bit sub-block, the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- the above device in a first node for wireless communication is characterized in that the M1 is less than the M, the first processor only transmits a radio signal carrying the first bit block in the M1 time window(s) out of the M time windows.
- the above device in a first node for wireless communication is characterized in that if the first time window is a time window out of M2 time window(s), a first generation polynomial is used for generating the first check bit block; if the first time window is a time window out of M3 time window(s), a second generation polynomial is used for generating the first check bit block; the M2 time window(s) and the M3 time window(s) are two subsets of the M time windows not intersected with each other, the M2 and the M3 are positive integers less than the M, respectively.
- the above device in a first node for wireless communication is characterized in that the first check bit block comprises Q check bit sub-block(s), an information bit block corresponding to each check bit sub-block out of the Q check bit sub-block(s) comprises the first bit block; the Q is a positive integer.
- the above device in a first node for wireless communication is characterized in that the first processor repeatedly transmits K radio signal group(s) in K time resource group(s) respectively; wherein any time resource group of the K time resource group(s) comprises a positive integer number of time window(s), any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s); the M time windows are a time resource group of the K time resource group(s); the K is a positive integer.
- the above device in a first node for wireless communication is characterized in that the first processor receives first information; wherein the first information is used for determining the K time resource group(s).
- the above device in a first node for wireless communication is characterized in that the first processor transmits first information; wherein the first information is used for determining the K time resource group(s).
- the above device in a first node for wireless communication is characterized in that the first processor receives second information; wherein the second information is used for determining at least one of the M and the M1.
- the above device in a first node for wireless communication is characterized in that the first processor transmits second information; wherein the second information is used for determining at least one of the M and the M1.
- the above device in a first node for wireless communication is characterized in that a device in the first node is a UE.
- the above device in a first node for wireless communication is characterized in that a device in the first node is a base station.
- the present disclosure provides a device in a second node for wireless communication, comprising:
- a second processor receiving a first radio signal in a first time window, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block;
- an information bit block corresponding to the first Check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the above device in a second node for wireless communication is characterized in that the second processor receives a second radio signal in a second time window, the second time window is any time window out of M1 time window(s), the second radio signal carries the first bit block; wherein the M1 time window(s) is(are) a subset of the M time windows, the M1 is a positive integer not greater than the M.
- the above device in a second node for wireless communication is characterized in that the second radio signal carries a second bit block and a third check bit block, an information bit block corresponding to the third check bit block comprises the second bit block, the first check bit block is not related to the second bit block.
- the above device in a second node for wireless communication is characterized in that a bit block output after the first bit block is subjected to a first coding is used for generating the second radio signal, a code rate of the first coding is related to a position of the second time window in the M1 time window(s).
- the above device in a second node for wireless communication is characterized in that a first post-coding bit block is acquired after a third coding of a first pre-coding bit block, the first pre-coding bit block comprises the first bit block and the first check bit block, the first post-coding bit block comprises a first post-coding bit sub-block and a second post-coding bit sub-block, the first check bit block comprises a first check bit sub-block and a second check bit sub-block, the first post-coding bit sub-block is not related to the second check bit sub-block, the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- the above device in a second node for wireless communication is characterized in that the M1 is less than the M, the second processor only receives a radio signal carrying the first bit block in the M1 time window(s) out of the M time windows.
- the above device in a second node for wireless communication is characterized in that if the first time window is a time window out of M2 time window(s), a first generation polynomial is used for generating the first check bit block; if the first time window is a time window out of M3 time window(s), a second generation polynomial is used for generating the first check bit block; the M2 time window(s) and the M3 time window(s) are two subsets of the M time windows not intersected with each other, the M2 and the M3 are positive integers less than the M, respectively.
- the above device in a second node for wireless communication is characterized in that the first check bit block comprises Q check bit sub-block(s), an information bit block corresponding to each check bit sub-block of the Q check bit sub-block(s) comprises the first bit block, the Q is a positive integer.
- the above device in a second node for wireless communication is characterized in that the second processor receives repeatedly transmitted K radio signal group(s) in K time resource group(s) respectively; wherein any time resource group of the K time resource group(s) comprises a positive integer number of time window(s), any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s), the M time windows are a time resource group of the K time resource group(s); the K is a positive integer.
- the above device in a second node for wireless communication is characterized in that the second processor transmits first information; wherein the first information is used for determining the K time resource group(s).
- the above device in a second node for wireless communication is characterized in that the second processor receives first information; wherein the first information is used for determining the K time resource group(s).
- the above device in a second node for wireless communication is characterized in that the second processor transmits second information, wherein the second information is used for determining at least one of the M and the M1.
- the above device in a second node for wireless communication is characterized in that the second processor receives second information, wherein the second information is used for determining at least one of the M and the M1.
- the above device in a second node for wireless communication is characterized in that the second node is a base station.
- the above device in a second node for wireless communication is characterized in that the second node is a UE.
- the present disclosure has the following advantages over conventional schemes:
- check bit blocks in multiple transmissions can be used in combination, which is equivalent to increasing a total number of effective CRC bits, thereby enhancing precision of error check without increasing redundancy.
- FIG. 1 illustrates a flowchart of a first radio signal according to one embodiment of the present disclosure
- FIG. 2 illustrates a schematic diagram of a network architecture according to one embodiment of the present disclosure
- FIG. 3 illustrates a schematic diagram of a radio protocol architecture of a user plane and a control plane according to one embodiment of the present disclosure
- FIG. 4 illustrates a schematic diagram of a New Radio (NR) node and a UE according to one embodiment of the present disclosure
- FIG. 5 illustrates a flowchart of wireless transmission according to one embodiment of the present disclosure
- FIG. 6 illustrates a flowchart of wireless transmission according to one embodiment of the present disclosure
- FIG. 7 illustrates a schematic diagram of a relationship between M time windows and M1 time window(s) according to one embodiment of the present disclosure
- FIG. 8 illustrates a schematic diagram of a relationship between M time windows and M1 time window(s) according to one embodiment of the present disclosure
- FIG. 9 illustrates a schematic diagram of a relationship between M time windows and M1 time window(s) according to one embodiment of the present disclosure
- FIG. 10 illustrates a block diagram of a circuit used for generating check bit blocks according to one embodiment of the present disclosure
- FIG. 11 illustrates a schematic diagram of a first radio signal carrying a first check bit block according to one embodiment of the present disclosure
- FIG. 12 illustrates a schematic diagram of a first radio signal carrying a first check bit block according to one embodiment of the present disclosure
- FIG. 13 illustrates a schematic diagram of a second radio signal carrying a first bit block according to one embodiment of the present disclosure
- FIG. 14 illustrates a schematic diagram of an information bit block corresponding to a first check bit block according to one embodiment of the present disclosure
- FIG. 15 illustrates a schematic diagram of an information bit block corresponding to a first check bit block according to one embodiment of the present disclosure
- FIG. 16 illustrates a schematic diagram of a relationship between a total number of bits comprised in a first check bit block and a position of a first time window in M time windows according to one embodiment of the present disclosure
- FIG. 17 illustrates a schematic diagram of a relationship between a code rate of a first coding and a position of a second time window in M time windows according to one embodiment of the present disclosure
- FIG. 18 illustrates a schematic diagram of a relationship between a generation polynomial for a first check bit block and a position of a first time window in M time windows according to one embodiment of the present disclosure
- FIG. 19 illustrates a schematic diagram of a relationship between Q check bit sub-block(s) and a position of a first time window in M time windows according to one embodiment of the present disclosure
- FIG. 20 illustrates a schematic diagram of a first check bit block comprising Q check bit sub-block(s) according to one embodiment of the present disclosure
- FIG. 21 illustrates a schematic diagram of a first check bit block comprising Q check bit sub-block(s) according to one embodiment of the present disclosure
- FIG. 22 illustrates a schematic diagram of K time resource group(s) according to one embodiment of the present disclosure
- FIG. 23 illustrates a structure block diagram of a processing device in a first node according to one embodiment of the present disclosure
- FIG. 24 illustrates a structure block diagram of a processing device in a second node according to one embodiment of the present disclosure
- FIG. 25 illustrates a schematic diagram of a first post-coding bit sub-block and a second post-coding bit sub-block used for generating a first radio signal and a second radio signal respectively according to one embodiment of the present disclosure
- FIG. 26 illustrates a schematic diagram of a second radio signal carrying a second bit block and a third check bit block according to one embodiment of the present disclosure.
- Embodiment 1 illustrates a flowchart of a first radio signal; as shown in FIG. 1 .
- the first node in the present disclosure transmits a first radio signal in a first time window, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, and a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows.
- values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows.
- a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows.
- the M is equal to 2.
- the M is greater than 2.
- the first check bit block comprises a positive integer number of bit(s).
- the first bit block comprises a positive integer number of bit(s).
- all bits in the first check bit block are arranged in sequence.
- all bits in the first bit block are arranged in sequence.
- the first bit block comprises at least one of downlink data and downlink control information
- the first node is a base station.
- the first bit block comprises at least one of uplink data and uplink control information
- the first node is a UE.
- an information bit block corresponding to the first check bit block is the first bit block.
- the first check bit block is generated by a Cyclic Redundancy Check (CRC) bit block of the first bit block.
- CRC Cyclic Redundancy Check
- an information bit block corresponding to the first check bit block comprises the first bit block and a second check bit block, an information bit block corresponding to the second check bit block is the first bit block.
- the first check bit block is generated by a check bit block of the first bit block and a second check bit block, an information bit block corresponding to the second check bit block is the first bit block.
- the first radio signal carries the first bit block.
- the first radio signal does not carry the first bit block.
- Embodiment 2 illustrates a schematic diagram of a network architecture, as shown in FIG. 2 .
- FIG. 2 is a diagram illustrating a network architecture 200 of Long-Term Evolution (LTE), Long-Term Evolution Advanced (LTE-A) and NR 5G systems.
- the LTE network architecture 200 may be called an Evolved Packet System (EPS) 200 .
- the EPS 200 may comprise one or more UEs 201 , an E-UTRAN-NR 202 , a 5G-Core Network/Evolved Packet Core (EPC/5G-CN) 210 , a Home Subscriber Server (HSS) 220 and an Internet Service 230 .
- EPC/5G-CN 5G-Core Network/Evolved Packet Core
- HSS Home Subscriber Server
- UMTS refers to Universal Mobile Telecommunications System.
- the EPS 200 may be interconnected with other access networks. For simple description, the entities/interfaces are not shown. As shown in FIG.
- the E-UTRAN-NR 202 comprises an NR node B (gNB) 203 and other gNBs 204 .
- the gNB 203 provides UE 201 oriented user plane and control plane terminations.
- the gNB 203 may be connected to other gNBs 204 via an X2 interface (for example, backhaul).
- the gNB 203 may be called a base station, a base transceiver station, a radio base station, a radio transceiver, a transceiver function, a Base Service Set (BBS), an Extended Service Set (ESS), a Transmitter Receiver Point (TRP) or some other applicable terms.
- the gNB 203 provides an access point of the 5G-CN/EPC 210 for the UE 201 .
- Examples of UE 201 include cellular phones, smart phones, Session Initiation Protocol (SIP) phones, laptop computers, Personal Digital Assistant (PDA), Satellite Radios, Global Positioning Systems (GPSs), multimedia devices, video devices, digital audio players (for example, MP3 players), cameras, games consoles, unmanned aerial vehicles, air vehicles, narrow-band physical network equipment, machine-type communication equipment, land vehicles, automobiles, wearable equipment, or any other devices having similar functions.
- SIP Session Initiation Protocol
- PDA Personal Digital Assistant
- GPSs Global Positioning Systems
- multimedia devices video devices
- digital audio players for example, MP3 players
- cameras games consoles
- unmanned aerial vehicles unmanned aerial vehicles, air vehicles, narrow-band physical network equipment, machine-type communication equipment, land vehicles, automobiles, wearable equipment, or any other devices having similar functions.
- Those skilled in the art also can call the UE 201 a mobile station, a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless device, a radio communication device, a remote device, a mobile subscriber station, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, a handset, a user proxy, a mobile client, a client or some other appropriate terms.
- the gNB 203 is connected to the 5G-CN/EPC 210 via an 51 interface.
- the 5G-CN/EPC 210 comprises an MME 211 , other MMES 214 , a Service Gateway (S-GW) 212 and a Packet Date Network Gateway (P-GW) 213 .
- the MME 211 is a control node for processing a signaling between the UE 201 and the 5G-CN/EPC 210 .
- the MME 211 provides bearer and connection management. All user Internet Protocol (IP) packets are transmitted through the S-GW 212 , the S-GW 212 is connected to the P-GW 213 .
- the P-GW 213 provides UE IP address allocation and other functions.
- the P-GW 213 is connected to the Internet Service 230 .
- the Internet Service 230 comprises IP services corresponding to operators, specifically including Internet, Intranet, IP Multimedia Subsystem (IMS) and Packet Streaming Services (PSSs).
- IMS IP Multimedia Subsystem
- PSSs Packet Streaming Services
- the gNB 203 corresponds to a first node in the present disclosure
- the UE 201 corresponds to the second node in the present disclosure.
- the gNB 203 corresponds to a second node in the present disclosure
- the UE 201 corresponds to the first node in the present disclosure.
- Embodiment 3 illustrates a schematic diagram of a radio protocol architecture of a user plane and a control plane, as shown in FIG. 3 .
- FIG. 3 is a schematic diagram illustrating a radio protocol architecture of a user plane and a control plane.
- the radio protocol architecture for a UE and a gNB is represented by three layers, which are a layer 1, a layer 2 and a layer 3, respectively.
- the layer 1 (L1) is the lowest layer and performs signal processing functions of various PHY layers.
- the L1 is called PHY 301 in the present disclosure.
- the layer 2 (L2) 305 is above the PHY 301 , and is in charge of the link between the UE and the gNB via the PHY 301 .
- L2 305 comprises a Medium Access Control (MAC) sublayer 302 , a Radio Link Control (RLC) sublayer 303 and a Packet Data Convergence Protocol (PDCP) sublayer 304 . All the three sublayers terminate at the gNBs of the network side.
- the UE may comprise several protocol layers above the L2 305 , such as a network layer (i.e., IP layer) terminated at a P-GW 213 of the network side and an application layer terminated at the other side of the connection (i.e., a peer UE, a server, etc.).
- the PDCP sublayer 304 provides multiplexing among variable radio bearers and logical channels.
- the PDCP sublayer 304 also provides a header compression for a higher-layer packet so as to reduce a radio transmission overhead.
- the PDCP sublayer 304 provides security by encrypting a packet and provides support for UE handover between gNBs.
- the RLC sublayer 303 provides segmentation and reassembling of a higher-layer packet, retransmission of a lost packet, and reordering of a packet so as to compensate the disordered receiving caused by Hybrid Automatic Repeat reQuest (HARQ).
- HARQ Hybrid Automatic Repeat reQuest
- the MAC sublayer 302 provides multiplexing between a logical channel and a transport channel.
- the MAC sublayer 302 is also responsible for allocating between UEs various radio resources (i.e., resources block) in a cell.
- the MAC sublayer 302 is also in charge of HARQ operation.
- the radio protocol architecture of the UE and the gNB is almost the same as the radio protocol architecture in the user plane on the PHY 301 and the L2 305 , but there is no header compression for the control plane.
- the control plane also comprises a Radio Resource Control (RRC) sublayer 306 in the layer 3 (L3).
- RRC sublayer 306 is responsible for acquiring radio resources (i.e., radio bearer) and configuring the lower layer using an RRC signaling between the gNB and the UE.
- the radio protocol architecture in FIG. 3 is applicable to the first node in the present disclosure.
- the radio protocol architecture in FIG. 3 is applicable to the second node in the present disclosure.
- the first radio signal in the present disclosure is generated by the PHY 301 .
- bit block in the present disclosure is generated by the RRC sublayer 306 .
- the first bit block in the present disclosure is generated by the MAC sublayer 302 .
- the first bit block in the present disclosure is generated by the PHY 301 .
- the first check bit block in the present disclosure is generated by the PHY 301 .
- the second radio signal in the present disclosure is generated by the PHY 301 .
- any radio signal out of the K radio signal group(s) in the present disclosure is generated by the PHY 301 .
- the first information in the present disclosure is generated by the RRC sublayer 306 .
- the first information in the present disclosure is generated by the MAC sublayer 302 .
- the second information in the present disclosure is generated by the RRC sublayer 306 .
- the second information in the present disclosure is generated by the MAC sublayer 302 .
- the second information in the present disclosure is generated by the PHY 301 .
- Embodiment 4 illustrates a schematic diagram of a New Radio (NR) node and a UE, as shown in FIG. 4 .
- FIG. 4 is a block diagram illustrating a UE 450 and a gNB 410 that are in communication with each other in access network.
- NR New Radio
- the gNB 410 comprises a controller/processor 475 , a memory 476 , a receiving processor 470 , a transmitting processor 416 , a channel encoder 477 , a channel decoder 478 , a transmitter/receiver 418 and an antenna 420 .
- the UE 450 comprises a controller/processor 459 , a memory 460 , a data source 467 , a transmitting processor 468 , a receiving processor 456 , a channel encoder 457 , a channel decoder 458 , a transmitter/receiver 454 and an antenna 452 .
- a higher-layer packet from a core network is provided to the controller/processor 475 .
- the controller/processor 475 provides a function of the L2 layer.
- the controller/processor 475 provides header compression, encryption, packet segmentation and reordering, and multiplexing between a logical channel and a transport channel, and radio resource allocation for the UE 450 based on various priorities.
- the controller/processor 475 is also in charge of HARQ operation, retransmission of a lost packet, and a signaling to the UE 450 .
- the transmitting processor 416 and the channel encoder 477 perform signal processing functions used for the L1 layer (that is, PHY).
- the channel encoder 477 performs coding and interleaving so as to ensure an FEC (Forward Error Correction) at the UE 450 side.
- the transmitting processor 416 implements the mapping to signal clusters corresponding to each modulation scheme (i.e., BPSK, QPSK, M-PSK, M-QAM, etc.) and performs spatial precoding/beamforming on encoded and modulated symbols to generate one or more spatial streams.
- the transmitting processor 416 then maps each spatial stream into a subcarrier.
- the mapped symbols are multiplexed with a reference signal (i.e., pilot frequency) in time domain and/or frequency domain, and then they are assembled through Inverse Fast Fourier Transform (IFFT) to generate a physical channel carrying time-domain multi-carrier symbol streams.
- IFFT Inverse Fast Fourier Transform
- Each transmitter 418 converts a baseband multicarrier symbol stream provided by the transmitting processor 416 into a radio frequency (RF) stream.
- RF radio frequency
- each receiver 454 receives a signal via a corresponding antenna 452 .
- Each receiver 454 recovers information modulated to the RF carrier, converts the radio frequency stream into a baseband multicarrier symbol stream to be provided to the receiving processor 456 .
- the receiving processor 456 and the channel decoder 458 perform radio processing functions of the L1 layer.
- the receiving processor 456 converts the baseband multicarrier symbol stream from time domain into frequency domain using FFT.
- a physical layer data signal and a reference signal are de-multiplexed by the receiving processor 456 , wherein a reference signal is used for channel estimation, while physical layer data is subjected to multi-antenna detection in the receiving processor 456 to recover any UE 450 -targeted spatial stream. Symbols on each spatial stream are demodulated and recovered in the receiving processor 456 to generate a soft decision. Then the channel decoder 458 decodes and de-interleaves the soft decision to recover the higher-layer data and control signal transmitted on the physical channel by the gNB 410 . Next, the higher-layer data and control signal are provided to the controller/processor 459 . The controller/processor 459 performs functions of the L2 layer.
- the controller/processor 459 can be connected to a memory 460 that stores program code and data.
- the memory 460 can be called a computer readable medium.
- the controller/processor provides demultiplexing between a transport channel and a logical channel, packet reassembling, decryption, header decompression and control signal processing so as to recover a higher-layer packet from the core network.
- the higher-layer packet is later provided to all protocol layers above the L2 layer, or various control signals can be provided to the L3 layer for processing.
- the controller/processor 459 also performs error detection using ACK and/or NACK protocols as a way to support HARQ operation.
- the data source 467 is configured to provide a higher-layer packet to the controller/processor 459 .
- the data source 467 represents all protocol layers above the L2 layer. Similar to a transmitting function of the gNB 410 described in DL transmission, the controller/processor 459 performs header compression, encryption, packet segmentation and reordering, and multiplexing between a logical channel and a transport channel based on radio resource allocation of the gNB 410 so as to provide the L2 layer functions used for the user plane and the control plane.
- the controller/processor 459 is also responsible for HARQ operation, retransmission of a lost packet, and a signaling to the gNB 410 .
- the channel encoder 457 performs channel coding. Encoded data is modulated into multicarrier/single-carrier symbol streams through modulation and multi-antenna spatial precoding/beamforming performed by the transmitting processor 468 , and then modulated symbol streams are provided from the transmitters 454 to each antenna 452 . Each transmitter 454 first converts a baseband symbol stream provided by the transmitting processor 468 into a radio frequency symbol stream, and then provides the radio frequency symbol stream to the antenna 452 .
- the function of the gNB 410 is similar to the receiving function of the UE 450 described in DL transmission.
- Each receiver 418 receives a radio frequency signal via a corresponding antenna 420 , converts the received radio frequency signal into a baseband signal, and provides the baseband signal to the receiving processor 470 .
- the receiving processor 470 and the channel decoder 478 jointly provide functions of the L1 layer.
- the controller/processor 475 provides functions of the L2 layer.
- the controller/processor 475 can be connected with the memory 476 that stores program code and data.
- the memory 476 can be called a computer readable medium.
- the controller/processor 475 provides de-multiplexing between a transport channel and a logical channel, packet reassembling, decryption, header decompression, control signal processing so as to recover a higher-layer packet from the UE 450 .
- the higher-layer packet coming from the controller/processor 475 may be provided to the core network.
- the controller/processor 475 can also perform error detection using ACK and/or NACK protocols to support HARQ operation.
- the UE 450 comprises at least one processor and at least one memory.
- the at least one memory includes computer program codes.
- the at least one memory and the computer program codes are configured to be used in collaboration with the at least one processor.
- the UE 450 at least receives the first radio signal of the present disclosure in the first time window of the present disclosure, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the UE 450 comprises a memory that stores a computer readable instruction program.
- the computer readable instruction program generates an action when executed by at least one processor.
- the action includes: receiving the first radio signal of the present disclosure in the first time window of the present disclosure, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the gNB 410 comprises at least one processor and at least one memory.
- the at least one memory includes computer program codes.
- the at least one memory and the computer program codes are configured to be used in collaboration with the at least one processor.
- the gNB 410 at least transmits the first radio signal of the present disclosure in the first time window of the present disclosure, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the gNB 410 comprises a memory that stores a computer readable instruction program.
- the computer readable instruction program generates an action when executed by at least one processor.
- the action includes: transmitting the first radio signal of the present disclosure in the first time window of the present disclosure, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the UE 450 comprises at least one processor and at least one memory.
- the at least one memory includes computer program codes.
- the at least one memory and the computer program codes are configured to be used in collaboration with the at least one processor.
- the UE 450 at least transmits the first radio signal of the present disclosure in the first time window of the present disclosure, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the UE 450 comprises a memory that stores a computer readable instruction program.
- the computer readable instruction program generates an action when executed by at least one processor.
- the action includes: transmitting the first radio signal of the present disclosure in the first time window of the present disclosure, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the gNB 410 comprises at least one processor and at least one memory.
- the at least one memory includes computer program codes.
- the at least one memory and the computer program codes are configured to be used in collaboration with the at least one processor.
- the gNB 410 at least receives the first radio signal of the present disclosure in the first time window of the present disclosure, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the gNB 410 comprises a memory that stores a computer readable instruction program.
- the computer readable instruction program generates an action when executed by at least one processor.
- the action includes: receiving the first radio signal of the present disclosure in the first time window of the present disclosure, the first time window is any time window out of M time windows, the first radio signal carries a first check bit block.
- an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the UE 450 corresponds to the first node in the present disclosure
- the gNB 410 correspond to the second node in the present disclosure.
- the UE 450 corresponds to the second node in the present disclosure
- the gNB 410 correspond to the first node in the present disclosure.
- At least one of the antenna 420 , the transmitter 418 , the transmitting processor 416 , the channel encoder 477 , the controller/processor 475 , or the memory 476 is used for transmitting the first radio signal of the present disclosure in the first time window of the present disclosure; at least one of the antenna 452 , the receiver 454 , the receiving processor 456 , the channel decoder 458 , the controller/processor 459 , the memory 460 , or the data source 467 is used for receiving the first radio signal of the present disclosure in the first time window of the present disclosure.
- At least one of the antenna 452 , the transmitter 454 , the transmitting processor 468 , the channel encoder 457 , the controller/processor 459 , the memory 460 , or the data source 467 is used for transmitting the first radio signal of the present disclosure in the first time window of the present disclosure; at least one of the antenna 420 , the receiver 418 , the receiving processor 470 , the channel decoder 478 , the controller/processor 475 , or the memory 476 is used for receiving the first radio signal of the present disclosure in the first time window of the present disclosure.
- At least one of the antenna 420 , the transmitter 418 , the transmitting processor 416 , the channel encoder 477 , the controller/processor 475 , or the memory 476 is used for transmitting the second radio signal of the present disclosure in the second time window of the present disclosure; at least one of the antenna 452 , the receiver 454 , the receiving processor 456 , the channel decoder 458 , the controller/processor 459 , the memory 460 , or the data source 467 is used for receiving the second radio signal of the present disclosure in the second time window of the present disclosure.
- At least one of the antenna 452 , the transmitter 454 , the transmitting processor 468 , the channel encoder 457 , the controller/processor 459 , the memory 460 , or the data source 467 is used for transmitting the second radio signal of the present disclosure in the second time window of the present disclosure; at least one of the antenna 420 , the receiver 418 , the receiving processor 470 , the channel decoder 478 , the controller/processor 475 , or the memory 476 is used for receiving the second radio signal of the present disclosure in the second time window of the present disclosure.
- At least one of the antenna 420 , the transmitter 418 , the transmitting processor 416 , the channel encoder 477 , the controller/processor 475 , or the memory 476 is used for repeatedly transmitting K radio signal group(s) of the present disclosure in K time resource group(s) of the present disclosure respectively; at least one of the antenna 452 , the receiver 454 , the receiving processor 456 , the channel decoder 458 , the controller/processor 459 , the memory 460 , or the data source 467 is used for receiving the repeatedly transmitted K radio signal group(s) of the present disclosure in K time resource group(s) of the present disclosure respectively.
- At least one of the antenna 452 , the transmitter 454 , the transmitting processor 468 , the channel encoder 457 , the controller/processor 459 , the memory 460 , or the data source 467 is used for repeatedly transmitting K radio signal group(s) of the present disclosure in K time resource group(s) of the present disclosure respectively; at least one of the antenna 420 , the receiver 418 , the receiving processor 470 , the channel decoder 478 , the controller/processor 475 , or the memory 476 is used for receiving the repeatedly transmitted K radio signal group(s) of the present disclosure in K time resource group(s) of the present disclosure respectively.
- At least one of the antenna 420 , the transmitter 418 , the transmitting processor 416 , the channel encoder 477 , the controller/processor 475 , or the memory 476 is used for transmitting the first information of the present disclosure; at least one of the antenna 452 , the receiver 454 , the receiving processor 456 , the channel decoder 458 , the controller/processor 459 , the memory 460 , or the data source 467 is used for receiving the first information of the present disclosure.
- At least one of the antenna 452 , the transmitter 454 , the transmitting processor 468 , the channel encoder 457 , the controller/processor 459 , the memory 460 , or the data source 467 is used for transmitting the second information of the present disclosure; at least one of the antenna 420 , the receiver 418 , the receiving processor 470 , the channel decoder 478 , the controller/processor 475 , or the memory 476 is used for receiving the second information of the present disclosure.
- Embodiment 5 illustrates a flowchart of wireless transmission, as shown in FIG. 5 .
- a base station N 1 is the first node in the present disclosure
- a UE U 2 is the second node in the present disclosure.
- the base station N 1 is a maintenance base station for a serving cell of the UE U 2 .
- steps in boxes F 1 and F 2 are optional, respectively.
- the base station N 1 transmits first information in step S 101 ; transmits second information in step S 102 ; transmits a second radio signal in a second time window in step S 11 ; and transmits a first radio signal in a first time window in step S 12 .
- the UE U 2 receives first information in step S 201 ; receives second information in step S 202 ; receives a second radio signal in a second time window in step S 21 ; and receives a first radio signal in a first time window in step S 22 .
- the first time window is any time window out of M time windows
- the first radio signal carries a first check bit block
- an information bit block corresponding to the first check bit block comprises a first bit block.
- Values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows.
- the first bit block is not related to a position of the first time window in the M time windows.
- the M is a positive integer greater than 1.
- the second time window is any time window out of M1 time window(s), the second radio signal carries the first bit block; the M1 time window(s) is(are) a subset of the M time windows, the M1 is a positive integer not greater than the M.
- the M time windows are a time resource group of the K time resource group(s), any time resource group out of the K time resource group(s) comprises a positive integer number of time window(s), the K is a positive integer.
- the first information is used by the UE U 2 for determining the K time resource group(s).
- the second information is used by the UE U 2 for determining at least one of the M and the M1.
- the M1 is fixed.
- the M1 is configurable.
- the second radio signal carries a second bit block and a third check bit block, an information bit block corresponding to the third check bit block comprises the second bit block, the first check bit block is not related to the second bit block.
- a bit block output after the first bit block is subjected to a first coding is used for generating the second radio signal, a code rate of the first coding is related to a position of the second time window in the M1 time window(s).
- a first post-coding bit block is acquired after a third coding of a first pre-coding bit block;
- the first pre-coding bit block comprises the first bit block and the first check bit block;
- the first post-coding bit block comprises a first post-coding bit sub-block and a second post-coding bit sub-block;
- the first check bit block comprises a first check bit sub-block and a second check bit sub-block, the first post-coding bit sub-block is not related to the second check bit sub-block;
- the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- the M1 is less than the M
- the base station N 1 only transmits a radio signal carrying the first bit block in the M1 time window(s) out of the M time windows.
- the first time window is a time window out of M2 time window(s)
- a first generation polynomial is used for generating the first check bit block
- the first time window is a time window out of M3 time window(s)
- a second generation polynomial is used for generating the first check bit block
- the M2 time window(s) and the M3 time window(s) are two subsets of the M time windows not intersected with each other, the M2 and the M3 are positive integers less than the M, respectively.
- the first generation polynomial and the second generation polynomial are CRC Cyclic Generator Polynomials respectively.
- the specific meaning of the CRC Cyclic Generator Polynomial can be found in 3GPP Technical Specification (TS) 36.212, chapter 5, and 3GPP TS 38.212, chapter 5.
- the first check bit block comprises Q check bit sub-block(s), an information bit block corresponding to each check sub-block out of the Q check bit sub-block(s) comprises the first bit block; the Q is a positive integer.
- the Q is related to a position of the first time window in the M time windows.
- the base station N 1 repeatedly transmits K radio signal group(s) in K time resource group(s) respectively; wherein any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s).
- the base station N 1 transmits M radio signals in the M time windows respectively, any radio signal group of the K radio signal group(s) is a repetition of the M radio signals.
- the K is equal to 1.
- the K is greater than 1.
- the first information is carried by a higher-layer signaling.
- the first information is carried by a Radio Resource Control (RRC) signaling.
- RRC Radio Resource Control
- the first information is carried by a Medium Access Control layer Control Element (MAC CE) signaling.
- MAC CE Medium Access Control layer Control Element
- the first information is UE-specific.
- the first information is specific to a terminal group, the terminal group comprises a positive integer number of terminal(s); a target receiver of the first radio signal in the present disclosure is a terminal of the terminal group, the first node is a base station, the second node is a UE.
- the UE U 2 is a terminal out of the terminal group.
- the first information indicates the K time resource group(s).
- the first information explicitly indicates the K time resource group(s).
- the second information is carried by a higher-layer signaling.
- the second information is carried by an RRC signaling.
- the second information is carried by a MAC CE signaling.
- the second information is carried by a dynamic signaling.
- the first information and the second information are carried by a same signaling.
- the first information and the second information are carried by varied signaling.
- the second information is UE-specific.
- the second information is specific to a terminal group, the terminal group comprises a positive integer number of terminal(s).
- a target receiver of the first radio signal in the present disclosure is a terminal of the terminal group, the first node is a base station, the second node is a UE.
- the UE U 2 is a terminal out of the terminal group.
- the second information indicates the M and the M1.
- the second information indicates the M.
- the second information indicates the M1.
- the second information is used for determining the M1 time window(s) out of the M time windows.
- the first node is a base station, the first node transmits the first information.
- the first node is a base station, the first node transmits the second information.
- the second node is a UE, the second node receives the first information.
- the second node is a UE, the second node receives the second information.
- the first radio signal is transmitted on a downlink physical layer control channel (i.e., a downlink channel that can only be used for carrying physical layer signaling), the first node is a base station, the second node is a UE.
- a downlink physical layer control channel i.e., a downlink channel that can only be used for carrying physical layer signaling
- the first node is a base station
- the second node is a UE.
- the downlink physical layer control channel is a Physical Downlink Control Channel (PDCCH).
- PDCH Physical Downlink Control Channel
- the downlink physical layer control channel is a short PDCCH (sPDCCH).
- the downlink physical layer control channel is a New Radio PDCCH (NR-PDCCH).
- NR-PDCCH New Radio PDCCH
- the downlink physical layer control channel is a Narrow Band PDCCH (NB-PDCCH).
- NB-PDCCH Narrow Band PDCCH
- the first radio signal is transmitted on a downlink physical layer data channel (i.e., a downlink channel that can be used for carrying physical layer data), the first node is a base station, the second node is a UE.
- a downlink physical layer data channel i.e., a downlink channel that can be used for carrying physical layer data
- the first node is a base station
- the second node is a UE.
- the downlink physical layer data channel is a Physical Downlink Shared Channel (PDSCH).
- PDSCH Physical Downlink Shared Channel
- the downlink physical layer data channel is a short PDSCH (sPDSCH).
- sPDSCH short PDSCH
- the downlink physical layer data channel is a New Radio PDSCH (NR-PDSCH).
- NR-PDSCH New Radio PDSCH
- the downlink physical layer data channel is a Narrow Band PDSCH (NB-PDSCH).
- NB-PDSCH Narrow Band PDSCH
- a transmission channel for the first radio signal is a Downlink Shared Channel (DL-SCH)
- the first node is a base station
- the second node is a UE.
- DL-SCH Downlink Shared Channel
- the first radio signal and the second radio signal are both transmitted on a downlink physical layer control channel
- the first node is a base station
- the second node is a UE.
- the first radio signal and the second radio signal are both transmitted on a downlink physical layer data channel
- the first node is a base station
- the second node is a UE.
- the first radio signal and the second radio signal both correspond to a transmission channel that is DL-SCH
- the first node is a base station
- the second node is a UE.
- all radio signals in the K radio signal group(s) are transmitted on a downlink physical layer control channel
- the first node is a base station
- the second node is a UE.
- all radio signals in the K radio signal group(s) are transmitted on a downlink physical layer data channel
- the first node is a base station
- the second node is a UE.
- all radio signals in the K radio signal group(s) correspond to a transmission channel that is DL-SCH, the first node is a base station, the second node is a UE.
- the first information is transmitted on a downlink physical layer data channel (i.e., a downlink channel that can be used for carrying physical layer data).
- a downlink physical layer data channel i.e., a downlink channel that can be used for carrying physical layer data.
- the downlink physical layer data channel is a PDSCH.
- the downlink physical layer data channel is a sPDSCH.
- the downlink physical layer data channel is a NR-PDSCH.
- the downlink physical layer data channel is a NB-PDSCH.
- the second information is transmitted on a downlink physical layer control channel (i.e., a downlink channel that can be used for carrying physical layer signaling)
- a downlink physical layer control channel i.e., a downlink channel that can be used for carrying physical layer signaling
- the downlink physical layer control channel is a PDCCH.
- the downlink physical layer control channel is a sPDCCH.
- the downlink physical layer control channel is a NR-PDCCH.
- the downlink physical layer control channel is a NB-PDCCH.
- Embodiment 6 illustrates a flowchart of wireless transmission, as shown in FIG. 6 .
- a base station N 3 is the second node in the present disclosure
- a UE U 4 is the first node in the present disclosure.
- the base station N 3 is a maintenance base station for a serving cell of the UE U 4 .
- steps in boxes F 3 and F 4 are optional, respectively.
- the base station N 3 transmits first information in step S 301 ; transmits second information in step S 302 ; receives a first radio signal in a first time window in step S 31 ; and receives a second radio signal in a second time window in step S 32 .
- the UE U 4 receives first information in step S 401 ; receives second information in step S 402 ; transmits a first radio signal in a first time window in step S 41 ; and transmits a second radio signal in a second time window in step S 42 .
- the first time window is any time window out of M time windows
- the first radio signal carries a first check bit block
- an information bit block corresponding to the first check bit block comprises a first bit block.
- Values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows.
- the first bit block is not related to a position of the first time window in the M time windows.
- the M is a positive integer greater than 1.
- the second time window is any time window out of M1 time window(s), the second radio signal carries the first bit block; the M1 time window(s) is(are) a subset of the M time windows, the M1 is a positive integer not greater than the M.
- the M time windows are a time resource group of the K time resource group(s), any time resource group out of the K time resource group(s) comprises a positive integer number of time window(s), the K is a positive integer.
- the first information is used by the UE U 4 for determining the K time resource group(s).
- the second information is used by the UE U 4 for determining at least one of the M and the M1.
- a first post-coding bit block is acquired after a third coding of a first pre-coding bit block;
- the first pre-coding bit block comprises the first bit block and the first check bit block;
- the first post-coding bit block comprises a first post-coding bit sub-block and a second post-coding bit sub-block;
- the first check bit block comprises a first check bit sub-block and a second check bit sub-block, the first post-coding bit sub-block is not related to the second check bit sub-block;
- the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- the M1 is less than the M
- the UE U 4 only transmits a radio signal carrying the first bit block in the M1 time window(s) out of the M time windows.
- the UE U 4 repeatedly transmits K radio signal group(s) in the K time resource group(s) respectively; wherein any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s).
- the UE U 4 transmits M radio signals in the M time windows respectively, any radio signal group of the K radio signal group(s) is a repetition of the M radio signals.
- the first information is specific to a terminal group, the terminal group comprises a positive integer number of terminal(s), the first node in the present disclosure is a terminal out of the terminal group, the first node is a UE, the second node is a base station.
- the UE U 4 is a terminal of the terminal group.
- the second information is specific to a terminal group, the terminal group comprises a positive integer number of terminal(s), the first node in the present disclosure is a terminal out of the terminal group, the first node is a UE, the second node is a base station.
- the first node is a UE, the first node receives the first information.
- the first node is a UE, the first node receives the second information.
- the second node is a base station, the second node transmits the first information.
- the second node is a base station, the second node transmits the second information.
- the first radio signal is transmitted on an uplink physical layer control channel (i.e., an uplink channel that can only be used for carrying physical layer signaling), the first node is a UE, the second node is a base station.
- an uplink physical layer control channel i.e., an uplink channel that can only be used for carrying physical layer signaling
- the first node is a UE
- the second node is a base station.
- the uplink physical layer control channel is a Physical Uplink Control Channel (PUCCH).
- PUCCH Physical Uplink Control Channel
- the uplink physical layer control channel is a short PUCCH (sPUCCH).
- the uplink physical layer control channel is a New Radio PUCCH (NR-PUCCH).
- NR-PUCCH New Radio PUCCH
- the uplink physical layer control channel is a Narrow Band PUCCH (NB-PUCCH).
- NB-PUCCH Narrow Band PUCCH
- the first radio signal is transmitted on an uplink physical layer data channel (i.e., an uplink channel that can be used for carrying physical layer data), the first node is a UE, the second node is a base station.
- an uplink physical layer data channel i.e., an uplink channel that can be used for carrying physical layer data
- the first node is a UE
- the second node is a base station.
- the uplink physical layer data channel is a Physical Uplink Shared Channel (PUSCH).
- PUSCH Physical Uplink Shared Channel
- the uplink physical layer data channel is a short PUSCH (sPUSCH).
- the uplink physical layer data channel is a New Radio PUSCH (NR-PUSCH).
- NR-PUSCH New Radio PUSCH
- the uplink physical layer data channel is a Narrow Band PUSCH (NB-PUSCH).
- NB-PUSCH Narrow Band PUSCH
- a transmission channel for the first radio signal is an Uplink Shared Channel (UL-SCH)
- the first node is a UE
- the second node is a base station.
- UL-SCH Uplink Shared Channel
- the first radio signal and the second radio signal are both transmitted on an uplink physical layer control channel
- the first node is a UE
- the second node is a base station.
- the first radio signal and the second radio signal are both transmitted on an uplink physical layer data channel
- the first node is a UE
- the second node is a base station.
- the first radio signal and the second radio signal both correspond to a transmission channel that is UL-SCH, the first node is a UE, the second node is a base station.
- all radio signals in the K radio signal group(s) are transmitted on an uplink physical layer control channel, the first node is a UE, the second node is a base station.
- all radio signals in the K radio signal group(s) are transmitted on an uplink physical layer data channel, the first node is a UE, the second node is a base station.
- all radio signals in the K radio signal group(s) correspond to a transmission channel that is UL-SCH, the first node is a UE, the second node is a base station.
- Embodiment 7 illustrates a schematic diagram of a relationship between M time windows and M1 time window(s); as shown in FIG. 7 .
- the first node of the present disclosure transmits the first radio signal of the present disclosure in the first time window of the present disclosure, and transmits the second radio signal of the present disclosure in the second time window of the present disclosure.
- the first time window is any time window out of the M time windows
- the second time window is any time window out of the M1 time window(s);
- the M1 time window(s) is(are) a subset of the M time windows.
- the M1 is equal to the M.
- the first radio signal carries the first check bit block in the present disclosure
- the second radio signal carries the first bit block in the present disclosure.
- An information bit block corresponding to the first check bit block comprises the first bit block.
- indices for the M time windows are #0 . . . , and #M ⁇ 1, respectively, a box filled with slashes represents a time window out of the M1 time window(s).
- any time window out of the M time windows is a consecutive time duration.
- any time window out of the M time windows is a slot.
- any time window out of the M time windows is a sub-frame.
- any time window out of the M time windows is 1 ms.
- any time window out of the M time windows comprises a positive integer number of consecutive multicarrier symbols.
- any time window out of the M time windows is made up of 7 consecutive multicarrier symbols.
- any time window out of the M time windows is made up of 14 consecutive multicarrier symbols.
- the M time windows are pairwise orthogonal (not overlapping) in time domain.
- any two time windows out of the M time windows occupy time resources of a same length.
- the M is equal to 2.
- the M is greater than 2.
- the M time windows are consecutive in time domain.
- the M is equal to 2.
- the multicarrier symbol is an Orthogonal Frequency Division Multiplexing (OFDM) symbol.
- OFDM Orthogonal Frequency Division Multiplexing
- the multicarrier symbol is a Single Carrier—Frequency Division Multiple Access (SC-FDMA) symbol.
- SC-FDMA Single Carrier—Frequency Division Multiple Access
- the multicarrier symbol is a Discrete Fourier Transform Spread OFDM (DFT-S-OFDM) symbol.
- DFT-S-OFDM Discrete Fourier Transform Spread OFDM
- the first node transmits M radio signals in the M time windows respectively, at least two radio signals of the M radio signals are duplicate (the same).
- the first node transmits M radio signals in the M time windows respectively, at least two radio signals of the M radio signals are distinct from one another.
- the first node transmits M radio signals in the M time windows respectively, any two radio signals of the M radio signals are distinct from each other.
- the second node in the present disclosure receives M radio signals in the M time windows respectively, the second node then merges the M radio signals received and recovers the first bit block from a combined signal.
- the second node performs symbol-level combination on duplicate (same) radio signals out of the received M radio signals.
- the second node performs bit-level combination on distinct radio signals out of the received M radio signals.
- the M1 is equal to the M.
- Embodiment 8 illustrates a schematic diagram of a relationship between M time windows and M1 time window(s), as shown in FIG. 8 .
- the first node of the present disclosure transmits the first radio signal of the present disclosure in the first time window of the present disclosure, and transmits the second radio signal of the present disclosure in the second time window of the present disclosure.
- the first time window is any time window out of the M time windows
- the second time window is any time window out of the M1 time window(s);
- the M1 time window(s) is(are) a subset of the M time windows.
- the M1 is less than the M.
- the first radio signal carries the first check bit block in the present disclosure
- the second radio signal carries the first bit block in the present disclosure.
- An information bit block corresponding to the first check bit block comprises the first bit block.
- indices for the M time windows are #0, #1 . . . , and #M ⁇ 1, respectively.
- a box filled with slashes represents a time window out of the M1 time window(s).
- the M1 is less than the M.
- the M1 is fixed.
- the M1 is configurable.
- position(s) of the M1 time window(s) in the M time windows is(are) fixed, so there is no need for configuration.
- the M1 time window(s) is(are) earliest M1 time window(s) out of the M time windows.
- the M1 time windows are consecutive in the M time windows.
- the M1 is equal to a difference between the M and 1.
- the M1 is equal to a difference between the M and 2.
- the first node repeatedly transmits M1 radio signal(s) within the M1 time window(s) respectively, the second radio signal is a radio signal of the M1 radio signal(s).
- any two radio signals out of the M1 radio signals are the same.
- the second node in the present disclosure performs combination on the M1 radio signal(s) received and recovers the first bit block from a combined signal.
- the combination is symbol-level combination.
- the first node transmits a given radio signal in the any given time window, a bit block output after a given check bit block is subjected to a given coding is used for generating the given radio signal.
- An information bit block corresponding to the given check bit block comprises the first bit block, an input of the given coding does not comprise the first bit block.
- the given coding includes channel coding and rate matching.
- the given radio signal is an output after a bit block output from a given coding of the given check bit block is sequentially subjected to part of or all processes of concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- Embodiment 9 illustrates a schematic diagram of a relationship between M time windows and M1 time window(s), as shown in FIG. 9 .
- the first node of the present disclosure transmits the first radio signal of the present disclosure in the first time window of the present disclosure, and transmits the second radio signal of the present disclosure in the second time window of the present disclosure.
- the first time window is any time window out of the M time windows
- the second time window is any time window out of the M1 time window(s)
- the M1 time window(s) is(are) a subset of the M time windows.
- the M1 is less than the M.
- indices for the M time windows are #0, #1 . . . , and #M ⁇ 1, respectively.
- a box filled with slashes represents a time window out of the M time windows.
- any two time windows of the M time windows are not consecutive in time domain.
- At least two adjacent time windows out of the M time windows are not consecutive in time domain.
- At least two adjacent time windows out of the M1 time windows are not consecutive in the M time windows.
- Embodiment 10 illustrates a block diagram of a circuit used for generating check bit blocks; as shown in FIG. 10 .
- a check bit block of a given information bit block is an output after the given information bit block is subjected to CRC Cyclic Generator Polynomial.
- a block diagram of a circuit for check bit block is shown in FIG. 10 .
- the CRC Cyclic Generator Polynomial is described as: g L D L + . . . + g 1 D+g 0 , wherein g L , . . . , g 1 , and g 0 are coefficients of the CRC Cyclic Generator Polynomial, the L is a total number of bits comprised in the check bit block of the given information bit block, a value of any coefficient out of coefficients of the CRC Cyclic Generator Polynomial is equal to 0 or 1.
- a circuit in FIG. 10 comprises a shift-register sequence consisting of L shift registers, a switch, L+1 taps, and L exclusive or (Xor) operators.
- the L+1 taps are located at both sides of the L shift registers respectively, as shown in FIG. 10 .
- Indices for the L shift registers are #0, #1 . . . , and #L ⁇ 1, respectively.
- the L+1 taps respectively correspond to L+1 coefficients of the CRC Cyclic Generator Polynomial, which are g L , . . . , g 1 , and g 0 .
- Home position of a switch in FIG. 10 is located at position 1 in FIG. 10 , bits in the given information bit block are sequentially input to a shift register sequence consisting of L shift registers, and are sequentially output at the same time. After all bits in the given information bit block have been input to the shift register sequence consisting of L shift registers, the switch is shifted to position 2 in FIG. 10 , and then begins to output values in the L shift registers in sequence, starting from shift register #L ⁇ 1. Values in the L shift registers that are output constitute the check bit block of the given information bit block.
- a polynomial consisting of the given information bit block and the check bit block of the given information bit block can be divided by the CRC Cyclic Generator Polynomial on GF(2), namely, a polynomial consisting of the given information bit block and the check bit block of the given information bit block yields a remainder equal to 0 when divided by the CRC Cyclic Generator Polynomial.
- a polynomial consisting of the given information bit block and the check bit block of the given information bit block is: a 0 D L+A ⁇ 1 + . . . + a A ⁇ 1 D L +p 0 D L ⁇ 1 +p 1 D L ⁇ 2 + . . . p L ⁇ 2 D+p L ⁇ 1 , wherein the A is the number of bits comprised in the given information bit block; the a 0 , a 1 , . . . , and a A ⁇ 1 are A bits comprised in the given information bit block; the p 0 , p 1 , . . . and p L ⁇ 1 are L bits comprised in the check bit block of the given information bit block.
- the CRC Cyclic Generator Polynomial is D 24 +D 23 +D 18 +D 17 +D 14 +D 11 +D 10 +D 7 +D 6 +D 5 +D 4 +D 3 +D+1.
- the CRC Cyclic Generator Polynomial is D 24 +D 23 +D 6 +D 5 +D+1.
- the CRC Cyclic Generator Polynomial is D 24 +D 23 +D 21 +D 20 +D 17 +D 15 +D 13 +D 12 +D 8 +D 4 +D 2 +D+1.
- the CRC Cyclic Generator Polynomial is D 16 +D 12 +D 5 +1.
- the CRC Cyclic Generator Polynomial is D 8 +D 7 +D 4 +D 3 +D+1.
- the CRC Cyclic Generator Polynomial is D 11 +D 10 +D 9 +D 5 +1.
- the CRC Cyclic Generator Polynomial is D 6 +D 5 +1.
- an initial value for each of the L shift registers is 0.
- an initial value for each of the L shift registers is 1.
- an initial value for at least one the L shift registers is not 0.
- initial values for the L shift registers are pre-configured.
- the given information bit block is the first bit block in the present disclosure
- the check bit block of the given information bit block is used for generating the first check bit block in the present disclosure
- the given information bit block comprises all bits of the first bit block and all bits of a second check bit block in the present disclosure; the check bit block of the given information bit block is used for generating the first check bit block in the present disclosure, an information bit block corresponding to the second check bit block is the first bit block.
- the given information bit block is the first bit block in the present disclosure
- the check bit block of the given information bit block is used for generating a check bit sub-block of the Q check bit sub-block(s) in the present disclosure.
- the given information bit block comprises all bits of the first bit block and all bits of a third check bit sub-block in the present disclosure; the check bit block of the given information bit block is used for generating a fourth Check bit sub-block; the third check bit sub-block and the fourth check bit sub-block are respectively check bit sub-blocks of the Q check bit sub-blocks in the present disclosure, an information bit block corresponding to the third check bit sub-block is the first bit block.
- Embodiment 11 illustrates a schematic diagram of a first radio signal carrying a first check bit block; as shown in FIG. 11 .
- the first node of the present disclosure transmits the first radio signal of the present disclosure in the first time window of the present disclosure
- the first time window is any time window out of the M time windows
- the first radio signal carries the first check bit block.
- the first radio signal is an output after the first check bit block is sequentially subjected to part of or all processes of channel coding, rate matching, concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- processing steps in dotted boxes F 1101 and F 1102 are optional, respectively.
- the phrase that the first radio signal carries a first check bit block refers to: the first radio signal is an output after the first check bit block is sequentially subjected to part of or all processes of channel coding, rate matching, concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- the multicarrier symbol generation is OFDM symbol generation.
- the multicarrier symbol generation is SC-FDMA symbol generation.
- the multicarrier symbol generation is DFT-S-OFDM symbol generation.
- the first radio signal does not carry the first bit block in the present disclosure.
- an input of channel coding in FIG. 11 does not comprise the first bit block in the present disclosure.
- channel coding and rate matching in FIG. 11 constitute a second coding
- a code rate of the second coding is related to a position of the first time window in the M time windows.
- the channel coding is a polar code.
- the specific method of implementing polar code can be found in 3GPP TS 38.212, chapter 5.3.
- the channel coding is Low Density Parity Check (LDPC) code.
- LDPC Low Density Parity Check
- the specific method of implementing LDPC code can be found in 3GPP TS 38.212, chapter 5.3.
- Embodiment 12 illustrates a schematic diagram of a first radio signal carrying a first check bit block; as shown in FIG. 12 .
- the first radio signal carries the first check bit block and the first bit block of the present disclosure, an information bit block corresponding to the first check bit block comprises the first bit block.
- the first radio signal is an output after all bits in the first bit block and the first check bit block are sequentially subjected to part of or all processes of channel coding, rate matching, concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- processing steps in dotted boxes F 1201 and F 1202 are optional, respectively.
- the first radio signal carries the first bit block.
- Embodiment 13 illustrates a schematic diagram of a second radio signal carrying a first bit block; as shown in FIG. 13 .
- the first node of the present disclosure transmits the second radio signal in the second time window of the present disclosure
- the second time window is any time window out of the M time windows
- the M1 time window(s) is(are) a subset of the M time windows.
- the second radio signal carries the first bit block and a fourth check bit block, an information bit block corresponding to the fourth check bit block comprises the first bit block.
- the second radio signal is an output after all bits in the first bit block and the fourth check bit block are sequentially subjected to part of or all processes of channel coding, rate matching, concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- processing steps in dotted boxes F 1301 and F 1302 are optional, respectively.
- the phrase that the second radio signal carries the first bit block refers to: the second radio signal is an output after the first bit block is sequentially subjected to part of or all processes of channel coding, rate matching, concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- the second radio signal carries the first bit block and a fourth check bit block, an information bit block corresponding to the fourth check bit block comprises the first bit block.
- the fourth check bit block is generated by a check bit block of the first bit block.
- the second radio signal is an output after all bits in the first bit block and the fourth check bit block are sequentially subjected to part of or all processes of channel coding, rate matching, concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- values of bits comprised in the fourth check bit block are related to a position of the second time window in the M1 time window(s).
- a total number of bits comprised in the fourth check bit block are related to a position of the second time window in the M1 time window(s).
- the first check bit block is a CRC (Cyclic Redundancy Check) bit block of the first bit block.
- the first check bit block is a bit block after a CRC bit block of the first bit block is subject to scrambling.
- a total number of bits comprised in the fourth check bit block are not related to a position of the second time window in the M1 time window(s).
- the first coding in the present disclosure includes channel coding and rate matching in FIG. 13 .
- channel coding and rate matching in FIG. 13 constitute the first coding in the present disclosure.
- an input of the first coding comprises the first bit block and the fourth check bit block.
- the channel coding is a polar code.
- the channel coding is a LDPC code.
- the second radio signal is an output after the bit block output from the first coding in the present disclosure of the first bit block is sequentially subjected to part of or all processes of concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- Embodiment 14 illustrates a schematic diagram of an information bit block corresponding to a first check bit block according; as shown in FIG. 14 .
- an information bit block corresponding to a first check bit block consists of the first bit block in the present disclosure.
- an information bit block corresponding to the first check bit block is the first bit block.
- the first check bit block is generated by a check bit block of the first bit block.
- the first check bit block is a check bit block of the first bit block.
- the first check bit block is a bit block output from scrambling of a check bit block of the first bit block.
- a scrambling code sequence employed by the scrambling is related to an identifier for the first node in the present disclosure.
- the first node is a UE
- the identifier for the first node is Cell-Radio Network Temporary Identifier (C-RNTI).
- C-RNTI Cell-Radio Network Temporary Identifier
- the first node is a base station
- the identifier for the first node is a Physical Cell Identifier (PCI).
- PCI Physical Cell Identifier
- a scrambling code sequence employed by the scrambling is related to an identifier for a target receiver of the first radio signal.
- the first node is a UE
- the identifier for the target receiver of the first radio signal is C-RNTI.
- the first node is a UE
- the identifier for the target receiver of the first radio signal is PCI
- a check bit block of the first bit block is an output after the first bit block is subjected to CRC Cyclic Generator Polynomial.
- bits in the first bit block are sequentially input to a shift register sequence corresponding to the CRC Cyclic Generator Polynomial.
- a polynomial consisting of the first bit block and a check bit block of the first bit block can be divided by a CRC Cyclic Generator Polynomial on GF(2), namely, a polynomial consisting of the first bit block and a check bit block of the first bit block yields a remainder equal to 0 when divided by the CRC Cyclic Generator Polynomial.
- the first bit block is a Transport Block (TB).
- TB Transport Block
- the first bit block comprises a TB.
- the first bit block comprises Downlink Control Information (DCI), the first node is a base station.
- DCI Downlink Control Information
- the first bit block comprises Uplink Control Information (UCI), the first node is a UE.
- UCI Uplink Control Information
- the UCI includes one or more of Hybrid Automatic Repeat request-Acknowledgement (HARQ-ACK), Scheduling Request (SR), Channel State Information (CSI), a Channel-state information reference signals Resource Indicator (CRI), a Rank Indicator (RI), a Precoding Matrix Indicator (PMI), Reference Signal Received Power (RSRP), Reference Signal Received Quality (RSRQ), or a Channel Quality Indicator (CQI).
- HARQ-ACK Hybrid Automatic Repeat request-Acknowledgement
- SR Scheduling Request
- CSI Channel State Information
- CRI Channel-state information reference signals Resource Indicator
- RI Rank Indicator
- PMI Precoding Matrix Indicator
- RSRP Reference Signal Received Power
- RSRQ Reference Signal Received Quality
- CQI Channel Quality Indicator
- the first bit block comprises a first bit sub-block and a second bit sub-block, values of all bits in the second bit sub-block are fixed.
- the first bit sub-block is a TB.
- the first bit sub-block comprises DCI
- the first node is a base station.
- the first bit sub-block comprises UCI
- the first node is a UE.
- values of all bits in the second bit sub-block are equal to 1.
- the number of bits comprised in the second bit sub-block is 24.
- the second bit sub-block is located at the forefront of the first bit block.
- bits in the first bit block are sequentially input to a shift register sequence corresponding to a CRC Cyclic Generator Polynomial
- bits in the second bit sub-block are input to a shift register sequence corresponding to the CRC Cyclic Generator Polynomial ahead of those in the first bit sub-block.
- Embodiment 15 illustrates a schematic diagram of an information bit block corresponding to a first check bit block; as shown in FIG. 15 .
- an information bit block corresponding to a first check bit block comprises the first bit block and a second check bit block in the present disclosure, an information bit block corresponding to the second check bit block is the first bit block.
- an information bit block corresponding to a first check bit block comprises the first bit block and a second check bit block, an information bit block corresponding to the second check bit block is the first bit block.
- the first check bit block is generated by a check bit block of the first bit block and the second check bit block.
- a check bit block of the first bit block and the second check bit block is an output after all bits in the first bit block and the second check bit block are subjected to a CRC Cyclic Generator Polynomial.
- a radio signal carrying the second check bit block is transmitted in a time window ahead of the first time window within the M time windows.
- the first radio signal does not carry the second check bit block.
- Embodiment 16 illustrates a schematic diagram of a relationship between a total number of bits comprised in a first check bit block and a position of a first time window in M time windows; as shown in FIG. 16 .
- the first node of the present disclosure transmits the first radio signal of the present disclosure in the first time window, the first time window is any time window of the M time windows.
- the first radio signal carries the first check bit block, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows.
- the first time window is a time window out of M4 time window(s), a total number of bits comprised in the check bit block is equal to a first value; if the first time window is a time window out of M5 time window(s), a total number of bits comprised in the check bit block is equal to a second value; the M4 time window(s) and the M5 time window(s) are two non-intersecting subsets of the M time windows, the M4 and the M5 are respectively positive integers less than the M, the first value and the second value are two positive integers that are mutually unequal.
- indices for the M time windows are #0 . . . , and #M ⁇ 1, respectively; a box filled with slashes represents a time window of the M4 time window(s), a box filled with crosses represents a time window of the M5 time window(s).
- the first time window is a time window of M4 time window(s)
- a total number of bits comprised in the check bit block is equal to a first value
- the first time window is a time window out of M5 time window(s)
- a total number of bits comprised in the check bit block is equal to a second value
- the M4 time window(s) and the M5 time window(s) are two non-intersecting subsets of the M time windows, the M4 and the M5 are respectively positive integers less than the M, the first value and the second value are two positive integers that are mutually unequal.
- a sum of the M4 and the M5 is equal to the M.
- the M4 time windows are consecutive in the M time windows
- the M5 time windows are consecutive in the M time windows.
- the M4 time windows are non-consecutive in the M time windows
- the M5 time windows are non-consecutive in the M time windows.
- the first value and the second value are configured by a higher-layer signaling respectively.
- the first value and the second value are configured by an RRC signaling respectively.
- position(s) of the M4 time window(s) in the M time windows is(are) fixed, so there is no need for configuration.
- position(s) of the M5 time window(s) in the M time windows is(are) fixed, so there is no need for configuration.
- the M4 is equal to 1.
- the M4 is greater than 1.
- the M5 is equal to 1.
- the M5 is greater than 1.
- the first information in the present disclosure is used for determining the first value and the second value.
- the second information in the present disclosure is used for determining at least one of the M4 time window(s), the M5 time window(s), the M4, or the M5.
- Embodiment 17 illustrates a schematic diagram of a relationship between a code rate of a first coding and a position of a second time window in M time windows; as shown in FIG. 17 .
- the first node of the present disclosure transmits the second radio signal of the present disclosure in the second time window
- the second time window is any time window of the M time windows
- the M1 time windows are a subset of the M time windows in the present disclosure
- the second radio signal carries the first bit block in the present disclosure.
- a bit block output after the first bit block is subjected to the first coding is used for generating the second radio signal, a code rate of the first coding is related to a position of the second time window in the M1 time windows.
- a code rate of the first coding is a first code rate
- a code rate of the first coding is a second code rate
- the M6 time window(s) and the M7 time window(s) are two non-intersecting subsets of the M1 time windows, the M6 and the M7 are respectively positive integers less than the M1, the first code rate and the second code rate are respectively positive real numbers less than 1, the first code rate is not equal to the second code rate.
- indices for the M time windows are #0 . . . , and #M ⁇ 1, respectively; a box filled with slashes represents a time window of the M6 time window(s), a box filled with crosses represents a time window of the M7 time window(s).
- the M1 is equal to the M
- a code rate of the first coding is related to a position of the second time window in the M1 time windows.
- the first coding includes channel coding and rate matching.
- channel coding in the first coding is a polar code.
- channel coding in the first coding is a LDPC code.
- the specific method of implementing polar code can be found in 3GPP TS 38.212, chapter 5.3.
- the specific method of implementing LDPC code can be found in 3GPP TS 38.212, chapter 5.3.
- the bit block output after the first bit block is subjected to a first coding is an output bit block of the first coding.
- a total number of bits comprised in a bit block output after the first bit block is subjected to the first coding is not related to a position of the second time window in the M1 time windows.
- a code rate of the first coding is equal to a total number of bits comprised in an input bit block of the first coding divided by a total number of bits comprised in an output bit block of the first coding.
- all bits in the first bit block are sequentially input to a channel encoder corresponding to channel coding in the first coding.
- an input of the first coding is the first bit block.
- an input of the first coding comprises the first bit block and a fourth check bit block
- an information corresponding to the fourth check bit block comprises the first bit block
- a total number of bits comprised in the fourth check bit block related to a position of the second time window in the M1 time windows.
- a code rate of the first coding is related to a total number of bits comprised in the fourth check bit block.
- an input of the first coding comprises the second bit block and the third check bit block.
- a total number of bits comprised in the third check bit block is related to a position of the second time window in the M1 time windows.
- an input of the first coding comprises the first bit block, the second bit block and the third check bit block.
- an information bit block corresponding to the third check bit block comprises the first bit block.
- a code rate of the first coding is a first code rate
- a code rate of the first coding is a second code rate
- the M6 time window(s) and the M7 time window(s) are two non-intersecting subsets of the M1 time windows, the M6 and the M7 are respectively positive integers less than the M1, the first code rate and the second code rate are respectively positive real numbers less than 1, the first code rate is not equal to the second code rate.
- a sum of the M6 and the M7 is equal to the M1.
- the M6 time windows are consecutive in the M1 time windows
- the M7 time windows are consecutive in the M1 time windows.
- the M6 time windows are non-consecutive in the M1 time windows
- the M7 time windows are non-consecutive in the M1 time windows.
- position(s) of the M6 time window(s) in the M1 time windows is(are) fixed, so there is no need for configuration.
- position(s) of the M7 time window(s) in the M1 time windows is(are) fixed, so there is no need for configuration.
- the second information in the present disclosure is used for determining at least one of the M6 time window(s), the M7 time window(s), the M6, or the M7.
- Embodiment 18 illustrates a schematic diagram of a relationship between a generation polynomial for a first check bit block and a position of a first time window in M time windows; as shown in FIG. 18 .
- the first node of the present disclosure transmits the first radio signal of the present disclosure in the first time window, the first time window is any time window of the M time windows.
- the first radio signal carries the first check bit block, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows.
- the first generation polynomial is used for generating the first check bit block; if the first time window is a time window out of M3 time window(s), the second generation polynomial is used for generating the first check bit block; the M2 time window(s) and the M3 time window(s) are two non-intersecting subsets of the M time windows, the M2 and the M3 are respectively positive integers less than the M.
- indices for the M time windows are #0 . . . , and #M ⁇ 1, respectively; a box filled with slashed represents a time window of the M2 time window(s), a box filled with crosses represents a time window of the M3 time window(s).
- a sum of the M2 and the M3 is equal to the M.
- the M2 time windows are consecutive in the M time windows
- the M3 time windows are consecutive in the M time windows.
- the M2 time windows are non-consecutive in the M time windows
- the M3 time windows are non-consecutive in the M time windows.
- position(s) of the M2 time window(s) in the M time windows is(are) fixed, so there is no need for configuration.
- position(s) of the M3 time window(s) in the M time windows is(are) fixed, so there is no need for configuration.
- the first generation polynomial and the second generation polynomial are CRC Cyclic Generator Polynomials respectively.
- the specific meaning of the CRC Cyclic Generator Polynomial can be found in 3GPP Technical Specification (TS) 36.212, chapter 5, and 3GPP TS 38.212, chapter 5.
- the first check bit block is generated by a check bit block of a first information bit block, the first information bit block is an information bit block corresponding to the first check bit block, the first information bit block comprises the first bit block in the present disclosure. If the first time window is a time window out of M2 time window(s), the check bit block of the first information bit block is an output after the first information bit block is subjected to the first generation polynomial; if the first time window is a time window out of M3 time window(s), the check bit block of the first information bit block is an output after the first information bit block is subjected to the second generation polynomial.
- the first generation polynomial and the second generation polynomial are respectively configured by a higher-layer signaling.
- the first generation polynomial and the second generation polynomial are respectively configured by an RRC signaling.
- the first generation polynomial and the second generation polynomial correspond to different CRC bit lengths.
- the first generation polynomial and the second generation polynomial correspond to a same CRC bit length.
- the first information in the present disclosure is used for determining the first generation polynomial and the second generation polynomial.
- the second information in the present disclosure is used for determining at least one of the M2 time window(s), the M3 time window(s), the M2, or the M3.
- Embodiment 19 illustrates a schematic diagram of a relationship between Q check bit sub-block(s) and a position of a first time window in M time windows; as shown in FIG. 19 .
- the first node of the present disclosure transmits the first radio signal of the present disclosure in the first time window, the first time window is any time window of the M time windows.
- the first radio signal carries the first check bit block in the present disclosure, the first check bit block comprises Q check bit sub-block(s), the Q is related to a position of the first time window in the M time windows.
- the Q is equal to Q1; if the first time window is a time window out of M9 time window(s), the Q is equal to Q2; the M8 time window(s) and the M9 time window(s) are two non-intersecting subsets of the M time windows, the M8 and the M9 are respectively positive integers less than the M; the Q1 and the Q2 are positive integers that are mutually unequal.
- indices for the M time windows are #0 . . . , and #M ⁇ 1, respectively; a box filled with slashes represents a time window of the M8 time window(s), a box filled with crosses represents a time window of the M9 time window(s).
- the Q is related to a position of the first time window in the M time windows.
- the Q belongs to a collection of 1 and 2.
- the Q is equal to Q1; if the first time window is a time window out of M9 time window(s), the Q is equal to Q2; the M8 time window(s) and the M9 time window(s) are two non-intersecting subsets of the M time windows, the M8 and the M9 are respectively positive integers less than the M; the Q1 and the Q2 are positive integers that are mutually unequal.
- a sum of the M8 and the M9 is equal to the M.
- the Q1 is equal to 2.
- the Q2 is equal to 1.
- the M8 time windows are consecutive in the M time windows
- the M9 time windows are consecutive in the M time windows.
- the M8 time windows are non-consecutive in the M time windows
- the M9 time windows are non-consecutive in the M time windows.
- position(s) of the M8 time window(s) in the M time windows is(are) fixed, so there is no need for configuration.
- position(s) of the M9 time window(s) in the M time windows is(are) fixed, so there is no need for configuration.
- a target CRC sub-block is a check bit sub-block of the Q check bit sub-block(s); the first check bit block comprises the target CRC sub-block all the time no matter what position of the first time window is in the M time windows.
- Embodiment 20 illustrates a schematic diagram of a first check bit block comprising Q check bit sub-block(s); as shown in FIG. 20 .
- the first check bit block comprises the Q check bit sub-block(s), the Q is equal to 1.
- An information bit block corresponding to each check bit sub-block of the Q check bit sub-block(s) comprises the first bit block in the present disclosure.
- an index for the Q check bit sub-block(s) is #0.
- the Q is equal to 1.
- the Q is equal to 1, each check bit sub-block of the Q check bit sub-block(s) is generated by a check bit block of the first bit block.
- Embodiment 21 illustrates a schematic diagram of a first check bit block comprising Q check bit sub-block(s); as shown in FIG. 21 .
- the first check bit block comprises the Q check bit sub-blocks, the Q is greater than 1.
- An information bit block corresponding to each check bit sub-block of the Q check bit sub-blocks comprises the first bit block in the present disclosure.
- indices for the Q check bit sub-blocks are #0, . . . , and #Q ⁇ 1, respectively.
- the Q is greater than 1.
- the Q is equal to 2.
- the Q is equal to 2
- the Q check bit sub-blocks comprise a third check bit sub-block and a fourth check bit sub-block.
- An information bit block corresponding to the third check bit sub-block is the first bit block
- an information bit block corresponding to the fourth check bit sub-block are the first bit block and the third check bit sub-block.
- the third check bit sub-block is generated by a check bit block of the first bit block.
- the fourth check bit sub-block is generated by a check bit block of the first bit block and the third check bit sub-block.
- a CRC Cyclic Generator Polynomial for the fourth check bit sub-block is g CRC24C (D)
- a CRC Cyclic Generator Polynomial for the third check bit sub-block is not g CRC24C (D); the specific meaning of g CDC24C (D) can be found in 3GPP TS 38.212 (V15.1.1), chapter 5.1.
- a CRC Cyclic Generator Polynomial for the third check bit sub-block is g CRC24C (D)
- a CRC Cyclic Generator Polynomial for the fourth check bit sub-block is not g CRC24C (D).
- a third bit block is generated after the first bit block and the third check bit sub-block are subjected to a first interleaver, a bit block output after the third bit block and the fourth check bit sub-block are subjected to a third channel coding is used for generating the first radio signal in the present disclosure.
- the third channel coding is a polar code; the specific method of implementing the first interleaver can be found in 3GPP TS 38.212, chapter 5.3.1.1, the specific method of implementing the third channel coding can be found in 3GPP TS 38.212, chapter 5.3.1.2.
- the Q is greater than 1, any two check bit sub-blocks of the Q check bit sub-blocks are generated by distinct CRC Cyclic Generator Polynomials.
- the Q is greater than 1, any two check bit sub-blocks of the Q check bit sub-blocks comprise different numbers of bits.
- Embodiment 22 illustrates schematic diagram of K time resource group(s); as shown in FIG. 22 .
- the first node in the present disclosure repeatedly transmits K radio signal group(s) in K time resource group(s) respectively; wherein any time resource group of the K time resource group(s) comprises a positive integer number of time window(s), any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s); the M time windows in the present disclosure constitute a target time resource group, the target time resource group is a time resource group of the K time resource group(s).
- indices for the K time resource groups are #0 . . . , and #K ⁇ 1, respectively
- indices for the M time windows are #0 . . . , and #M ⁇ 1, respectively.
- the first radio signal in the present disclosure is a radio signal of a radio signal group transmitted in the M time windows among the K radio signal group(s).
- the second radio signal in the present disclosure is a radio signal of a radio signal group transmitted in the M time windows among the K radio signal group(s).
- the first node transmits M radio signals in the M time windows respectively, any radio signal group of the K radio signal group(s) is a repetition of the M radio signals.
- the first node transmits M radio signals in the M time windows respectively, any radio signal group of the K radio signal group(s) consists of a repetition of the M radio signals.
- any two time resource groups of the K time resource groups comprise an equal number of time window(s).
- any two time resource groups of the K time resource groups comprise an equal number of time window(s), which is the M.
- time resources occupied by the K time resource group(s) are mutually orthogonal (non-overlapping).
- all time windows in any time resource group of the K time resource group(s) are mutually orthogonal (non-overlapping) in time domain.
- the K is equal to 1.
- the K is greater than 1.
- the second node in the present disclosure performs combination on radio signals carrying the first bit block in the present disclosure among the K radio signal group(s) received, and recovers the first bit block from a combined signal.
- the second node performs symbol-level combination on repeatedly transmitted (same) radio signals of the K radio signal group(s), the second node performs bit-level combination on distinct radio signals carrying the first bit block of the K radio signal group(s).
- the second node in the present disclosure performs combination on radio signals carrying the first check bit block in the present disclosure among the K radio signal group(s) received, and recovers the CRC first bit block from a combined signal.
- the combination is a symbol-level combination.
- Embodiment 23 illustrates a structure block diagram of a processing device in a first node; as shown in FIG. 23 .
- a processing device 2300 in a first node mainly comprises a first processor 2301 .
- a first processor 2301 transmits a first radio signal in a first time window.
- the first time window is any time window out of M time windows
- the first radio signal carries a first check bit block; wherein an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the first processor 2301 transmits a second radio signal in a second time window, the second time window is any time window of the M1 time window(a), the second radio signal carries the first bit block; wherein the M1 time window(s) is(are) a subset of the M time windows, the M1 is a positive integer not greater than the M.
- the second radio signal carries a second bit block and a third check bit block, an information bit block corresponding to the third check bit block comprise the second bit block, the first check bit block is not related to the second bit block.
- a bit block output after the first bit block is subjected to a first coding is used for generating the second radio signal, a code rate of the first coding is related to a position of the second time window in the M1 time window(s).
- a first post-coding bit block is acquired after a third coding of a first pre-coding bit block
- the first pre-coding bit block comprises the first bit block and the first check bit block
- the first post-coding bit block comprises a first post-coding bit sub-block and a second post-coding bit sub-block
- the first check bit block comprises a first check bit sub-block and a second check bit sub-block
- the first post-coding bit sub-block is not related to the second check bit sub-block
- the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- the M1 is less than the M
- the first processor 2301 only transmits a radio signal carrying the first bit block in the M1 time window(s) out of the M time windows.
- the first time window is a time window out of M2 time window(s)
- a first generation polynomial is used for generating the first check bit block
- the first time window is a time window out of M3 time window(s)
- a second generation polynomial is used for generating the first check bit block
- the M2 time window(s) and the M3 time window(s) are two subsets of the M time windows not intersected with each other, the M2 and the M3 are positive integers less than the M, respectively.
- the first check bit block comprises Q check bit sub-block(s), an information bit block corresponding to each check bit sub-block out of the Q check bit sub-block(s) comprises the first bit block; the Q is a positive integer.
- the first processor 2301 repeatedly transmits K radio signal group(s) in K time resource group(s) respectively; wherein any time resource group of the K time resource group(s) comprises a positive integer number of time window(s), any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s); the M time windows are a time resource group of the K time resource group(s); the K is a positive integer.
- the first processor 2301 receives first information; wherein the first information is used for determining the K time resource group(s).
- the first processor 2301 transmits first information; wherein the first information is used for determining the K time resource group(s).
- the first processor 2301 receives second information; wherein the second information is used for determining at least one of the M and the M1.
- the first processor 2301 transmits second information; wherein the second information is used for determining at least one of the M and the M1.
- a device in the first node is a UE.
- a device in the first node is a base station.
- a device in the first node is a UE, the first processor 2301 receives the first information.
- a device in the first node is a UE, the first processor 2301 receives the second information.
- a device in the first node is a base station, the first processor 2301 transmits the first information.
- a device in the first node is a base station, the first processor 2301 transmits the second information.
- the first processor 2301 comprises at least one of an antenna 452 , a transmitter/receiver 454 , a transmitting processor 468 , a receiving processor 456 , a channel encoder 457 , a channel decoder 458 , a controller/processor 459 , a memory 460 , or a data source 467 in Embodiment 4, a device in the first node is a UE.
- the first processor 2301 comprises at least one of an antenna 420 , a transmitter 418 , a transmitting processor 416 , a channel encoder 477 , a controller/processor 475 , or a memory 476 in Embodiment 4, a device in the first node is a base station.
- Embodiment 24 illustrates a structure block diagram of a processing device in a second node; as shown in FIG. 24 .
- a processing device 2400 in a second node mainly comprises a second processor 2401 .
- a second processor 2401 receives a first radio signal in a first time window.
- the first time window is any time window out of M time windows
- the first radio signal carries a first check bit block; wherein an information bit block corresponding to the first check bit block comprises a first bit block; values of bits comprised in the first check bit block are related to a position of the first time window in the M time windows, or, a total number of bits comprised in the first check bit block is related to a position of the first time window in the M time windows; the first bit block is not related to a position of the first time window in the M time windows, the M is a positive integer greater than 1.
- the second processor 2401 receives a second radio signal in a second time window, the second time window is any time window of the M1 time window(a), the second radio signal carries the first bit block; wherein the M1 time window(s) is(are) a subset of the M time windows, the M1 is a positive integer not greater than the M.
- the second radio signal carries a second bit block and a third check bit block, an information bit block corresponding to the third check bit block comprises the second bit block, the first check bit block is not related to the second bit block.
- a bit block output after the first bit block is subjected to a first coding is used for generating the second radio signal, a code rate of the first coding is related to a position of the second time window in the M1 time window(s).
- a first post-coding bit block is acquired after a third coding of a first pre-coding bit block
- the first pre-coding bit block comprises the first bit block and the first check bit block
- the first post-coding bit block comprises a first post-coding bit sub-block and a second post-coding bit sub-block
- the first check bit block comprises a first check bit sub-block and a second check bit sub-block
- the first post-coding bit sub-block is not related to the second check bit sub-block
- the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- the M1 is less than the M
- the first processor 2401 only receives a radio signal carrying the first bit block in the M1 time window(s) out of the M time windows.
- the first time window is a time window out of M2 time window(s)
- a first generation polynomial is used for generating the first check bit block
- the first time window is a time window out of M3 time window(s)
- a second generation polynomial is used for generating the first check bit block
- the M2 time window(s) and the M3 time window(s) are two subsets of the M time windows not intersected with each other, the M2 and the M3 are positive integers less than the M, respectively.
- the first check bit block comprises Q check bit sub-block(s), an information bit block corresponding to each check bit sub-block out of the Q check bit sub-block(s) comprises the first bit block; the Q is a positive integer.
- the first processor 2401 receives repeatedly transmitted K radio signal group(s) in K time resource group(s) respectively; wherein any time resource group of the K time resource group(s) comprises a positive integer number of time window(s), any radio signal group of the K radio signal group(s) comprises a positive integer number of radio signal(s); the M time windows are a time resource group of the K time resource group(s); the K is a positive integer.
- the second processor 2401 transmits first information; wherein the first information is used for determining the K time resource group(s).
- the second processor 2401 receives first information; wherein the first information is used for determining the K time resource group(s).
- the second processor 2401 transmits second information; wherein the second information is used for determining at least one of the M and the M1.
- the second processor 2401 receives second information; wherein the second information is used for determining at least one of the M and the M1.
- a device in the second node is a base station.
- a device in the second node is a UE.
- a device in the second node is a UE, the second processor 2401 receives the first information.
- a device in the second node is a UE, the second processor 2401 receives the second information.
- a device in the second node is a base station, the second processor 2401 transmits the first information.
- a device in the second node is a base station, the second processor 2401 transmits the second information.
- the second processor 2401 comprises at least one of an antenna 452 , a receiver 454 , a receiving processor 456 , a channel decoder 458 , a controller/processor 459 , a memory 460 , or a data source 467 in Embodiment 4, a device in the second node is a UE.
- the second processor 2401 comprises at least one of an antenna 420 , a transmitter/receiver 418 , a transmitting processor 416 , a receiving processor 470 , a channel encoder 477 , a channel decoder 478 , a controller/processor 475 , or a memory 476 in Embodiment 4, a device in the second node is a base station.
- Embodiment 25 illustrates a schematic diagram of a first post-coding bit sub-block and a second post-coding bit sub-block used for generating a first radio signal and a second radio signal respectively, as shown in FIG. 25 .
- the first post-coding bit block in the present disclosure is acquired after the third coding in the present disclosure of the first pre-coding bit block in the present disclosure;
- the first pre-coding bit block comprises the first bit block and the first check bit block in the present disclosure;
- the first post-coding bit block comprises the first post-coding bit sub-block and the second post-coding bit sub-block;
- the first check bit block comprises a first check bit sub-block and a second check bit sub-block, the first post-coding bit sub-block is not related to the second check bit sub-block;
- the first post-coding bit sub-block and the second post-coding bit sub-block are used for generating the first radio signal and the second radio signal respectively.
- processing steps in dotted boxes F 2501 , F 2502 and F 2503 are optional, respectively.
- the first radio signal is an output after the first post-coding bit sub-block is sequentially subjected to part of or all processes of scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- the second radio signal is an output after the second post-coding bit sub-block is sequentially subjected to part of or all processes of scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- the first post-coding bit sub-block and the second post-coding bit sub-block constitute the first post-coding bit block.
- the first post-coding bit sub-block is related to the first check bit sub-block.
- the second post-coding bit sub-block is related to the second check bit sub-block.
- the third coding is based on a polar code.
- the third coding comprises channel coding and rate matching.
- the third coding is based on a LDPC code.
- the first post-coding bit sub-block is acquired after a fourth coding of a second pre-coding bit block
- the second pre-coding bit block comprises the first bit block and the first check bit sub-block
- the second pre-coding bit block does not comprise the second check bit sub-block.
- the fourth coding is based on a polar code.
- the fourth coding comprises channel coding and rate matching.
- the fourth coding is based on a LDPC code.
- the second pre-coding bit block consists the first bit block and the first check bit sub-block.
- Embodiment 26 illustrates a schematic diagram of a second radio signal carrying a second bit block and a third check bit block; as shown in FIG. 26 .
- the first node of the present disclosure transmits the second radio signal in the second time window of the present disclosure
- the second time window is any time window out of the M time windows
- the M1 time window(s) is(are) a subset of the M time windows in the present disclosure.
- the second radio signal carries the first bit block, the second bit block and the third check bit block, an information bit block corresponding to the third check bit block comprises the second bit block.
- the second radio signal is an output after all bits in the first bit block, the second bit block and the third check bit block are sequentially subjected to part of or all processes of channel coding, rate matching, concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- processing steps in dotted boxes F 2601 and F 2602 are optional, respectively.
- an information corresponding to the third check bit block comprises the first bit block.
- an information corresponding to the third check bit block does not comprise the first bit block.
- the first bit block and the second bit block constitute an information bit block corresponding to the third check bit block.
- the phrase that the second radio signal carries a second bit block and a third check bit block refers to: the second radio signal is an output after all bits in the second bit block and the third check bit block are sequentially subjected to part of or all processes of channel coding, rate matching, concatenation, scrambling, a modulation mapper, a layer mapper, a transform precoder, precoding, a resource element mapper, multicarrier symbol generation, and modulation and upconversion.
- the third check bit block is generated by a check bit block of the second bit block.
- the third check bit block is generated by a check bit block of the first bit block and the second bit block.
- values of bits comprised in the third check bit block are related to a position of the second time window in the M1 time window(s).
- a total number of bits comprised in the third check bit block is related to a position of the second time window in the M1 time window(s).
- values of bits comprised in the third check bit block are related to a position of the second time window in the M1 time window(s), and a total number of bits comprised in the third check bit block is related to a position of the second time window in the M1 time window(s).
- values of bits comprised in the third check bit block are not related to a position of the second time window in the M1 time window(s).
- a total number of bits comprised in the third check bit block is not related to a position of the second time window in the M1 time window(s).
- the first coding in the present disclosure includes channel coding and rate matching in FIG. 26 .
- channel coding and rate matching in FIG. 26 constitute the first coding in the present disclosure.
- an input of the first coding comprises the first bit block, the second bit block and the third check bit block.
- the third coding in the present disclosure includes channel coding and rate matching in FIG. 26 .
- channel coding and rate matching in FIG. 26 constitute the third coding in the present disclosure.
- an input of the third coding comprises the first bit block, the second bit block and the third check bit block.
- the UE and terminal in the present disclosure include but are not limited to unmanned aerial vehicles, communication modules on unmanned aerial vehicles, telecontrolled aircrafts, aircrafts, diminutive airplanes, mobile phones, tablet computers, notebooks, vehicle-mounted communication equipment, wireless sensor, network cards, terminals for Internet of Things, RFID terminals, NB-IOT terminals, Machine Type Communication (MTC) terminals, enhanced MTC (eMTC) terminals, data cards, low-cost mobile phones, low-cost tablet computers, etc.
- the base station or system device in the present disclosure includes but is not limited to macro-cellular base stations, micro-cellular base stations, home base stations, relay base station, gNB (NR node B), Transmitter Receiver Point (TRP), and other radio communication equipment.
Abstract
Description
Claims (20)
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810449205 | 2018-05-11 | ||
CN201810449205.6 | 2018-05-11 | ||
CN201810593400.6 | 2018-06-11 | ||
CN201810593400.6A CN110474712B (en) | 2018-05-11 | 2018-06-11 | Method and device used in user equipment and base station for wireless communication |
Publications (2)
Publication Number | Publication Date |
---|---|
US20190349457A1 US20190349457A1 (en) | 2019-11-14 |
US10951746B2 true US10951746B2 (en) | 2021-03-16 |
Family
ID=68464349
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/407,187 Active 2039-05-24 US10951746B2 (en) | 2018-05-11 | 2019-05-09 | Method and device in UE and base station used for wireless communication |
Country Status (1)
Country | Link |
---|---|
US (1) | US10951746B2 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11304227B2 (en) * | 2019-04-08 | 2022-04-12 | Lg Electronics Inc. | Method and apparatus for validating time alignment for preconfigured uplink resource in a wireless communication system |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110167186B (en) * | 2018-02-13 | 2020-06-30 | 上海朗帛通信技术有限公司 | Method and device in communication node for wireless communication |
CN114900276A (en) * | 2019-11-25 | 2022-08-12 | 上海朗帛通信技术有限公司 | Method and apparatus in a node used for wireless communication |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040228320A1 (en) * | 2003-02-19 | 2004-11-18 | Rajiv Laroia | Efficient automatic repeat request methods and apparatus |
US20160261283A1 (en) * | 2015-03-02 | 2016-09-08 | Samsung Electronics Co., Ltd. | Transmitter and shortening method thereof |
-
2019
- 2019-05-09 US US16/407,187 patent/US10951746B2/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040228320A1 (en) * | 2003-02-19 | 2004-11-18 | Rajiv Laroia | Efficient automatic repeat request methods and apparatus |
US20160261283A1 (en) * | 2015-03-02 | 2016-09-08 | Samsung Electronics Co., Ltd. | Transmitter and shortening method thereof |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11304227B2 (en) * | 2019-04-08 | 2022-04-12 | Lg Electronics Inc. | Method and apparatus for validating time alignment for preconfigured uplink resource in a wireless communication system |
Also Published As
Publication number | Publication date |
---|---|
US20190349457A1 (en) | 2019-11-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20230198704A1 (en) | Method and device in ue and base station used for wireless communication | |
US11363621B2 (en) | Method and device for dynamically adjusting a number of resource elements in uplink control information | |
US11283576B2 (en) | Method and device in UE and base station used for wireless communication | |
US20210400659A1 (en) | Method and device for use in wireless communication nodes | |
US11711164B2 (en) | Method and device in UE and base station used for channel coding | |
US11750215B2 (en) | Method and device in UE and base station for channel coding | |
US10951746B2 (en) | Method and device in UE and base station used for wireless communication | |
US20210144796A1 (en) | Method and device in ue and base station used for wireless communication | |
US10992500B2 (en) | Method and device in UE and base station used for wireless communication | |
CN110474712B (en) | Method and device used in user equipment and base station for wireless communication | |
US11736120B2 (en) | Method and device in UE and base station for wireless communication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: SHANGHAI LANGBO COMMUNICATION TECHNOLOGY COMPANY L Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WU, KEYING;ZHANG, XIAOBO;YANG, LIN;SIGNING DATES FROM 20190507 TO 20190508;REEL/FRAME:049121/0234 Owner name: SHANGHAI LANGBO COMMUNICATION TECHNOLOGY COMPANY LIMITED, CHINA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WU, KEYING;ZHANG, XIAOBO;YANG, LIN;SIGNING DATES FROM 20190507 TO 20190508;REEL/FRAME:049121/0234 |
|
FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY |
|
FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO SMALL (ORIGINAL EVENT CODE: SMAL); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: HONOR DEVICE CO., LTD., CHINA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SHANGHAI LANGBO COMMUNICATION TECHNOLOGY COMPANY LIMITED;REEL/FRAME:061622/0047 Effective date: 20221026 |
|
FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |