CN110622529A - Communication method of broadcast channel - Google Patents

Communication method of broadcast channel Download PDF

Info

Publication number
CN110622529A
CN110622529A CN201780090646.5A CN201780090646A CN110622529A CN 110622529 A CN110622529 A CN 110622529A CN 201780090646 A CN201780090646 A CN 201780090646A CN 110622529 A CN110622529 A CN 110622529A
Authority
CN
China
Prior art keywords
time index
block
encoded
index indication
information block
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.)
Granted
Application number
CN201780090646.5A
Other languages
Chinese (zh)
Other versions
CN110622529B (en
Inventor
彭佛才
陈梦竹
谢赛锦
许进
徐俊
韩翠红
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Publication of CN110622529A publication Critical patent/CN110622529A/en
Application granted granted Critical
Publication of CN110622529B publication Critical patent/CN110622529B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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/0072—Error control for data other than payload data, e.g. control data
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
    • H03M13/356—Unequal error protection [UEP]
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6508—Flexibility, adaptability, parametrability and configurability of the implementation
    • H03M13/6516—Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/204—Multiple access
    • H04B7/212—Time-division multiple access [TDMA]
    • H04B7/2125—Synchronisation
    • 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
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/136—Reed-Muller [RM] codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals

Abstract

Methods, systems, and apparatuses for facilitating wireless communication over a broadcast channel are disclosed. In one example aspect, a method for wireless communication is disclosed. The method comprises the following steps: the method includes encoding an information block and a time index indication, forming a message using the encoded information block and the encoded time index indication, and transmitting the message over a broadcast channel. The time index indication indicates a transmission time of the information block.

Description

Communication method of broadcast channel
Technical Field
This patent document relates generally to wireless communications.
Background
Mobile communication technology is moving the world towards increasingly connected and networked society. Next generation systems and wireless communication technologies will need to support a wider range of use case characteristics and provide more sophisticated network access techniques than existing wireless networks.
Disclosure of Invention
This patent document relates to techniques, systems, and apparatuses for facilitating wireless communication over a broadcast channel.
In one example aspect, a method for wireless communication is disclosed. The method comprises the following steps: the method includes encoding an information block and a time index indication, forming a message using the encoded information block and the encoded time index indication, and transmitting the message over a broadcast channel. The time index indication indicates a transmission time of the information block.
In another example aspect, a method for wireless communication is disclosed. The method comprises the following steps: receiving a message over a broadcast channel; identifying an encoded information block and an encoded time index indication in the message, decoding the encoded information block to obtain an information block, and decoding the encoded time index indication to obtain a time index indication. The time index indication indicates a transmission time of the information block.
In another example aspect, a wireless communications apparatus is disclosed. The device includes: a memory storing codewords, and a processor in communication with the memory and operable to execute codewords to cause the wireless communication device to: encoding an information block and a time index indication, wherein the time index indication indicates a transmission time of the information block; forming a message using the encoded information block and the encoded time index indication; and transmitting the message through a broadcast channel.
In yet another example aspect, a wireless communications apparatus is disclosed. The device includes: a memory storing codewords, and a processor in communication with the memory and operable to execute codewords to cause the wireless communication device to: receiving a message over a broadcast channel; identifying an encoded information block and an encoded time index indication in the message; decoding the encoded information block to obtain an information block; and decoding the encoded time index indication to obtain a time index indication, wherein the time index indication indicates a transmission time of the information block.
The above and other aspects and embodiments thereof are described in more detail in the accompanying drawings, the description and the claims.
Drawings
Fig. 1 shows an example of forming a message using an encoded Master Information Block (MIB) and an encoded Synchronization Signal (SS) block time index.
Fig. 2 shows an example of a bit block including MIB and SS block time indices.
Fig. 3A shows an example of dividing the codeword bits into two blocks.
Fig. 3B illustrates an example of transmission of a block.
Fig. 3C shows another example of transmission of a block.
Fig. 4 illustrates an example of a wireless communication system in which techniques in accordance with one or more embodiments of the present technology may be applied.
Fig. 5 is a block diagram representation of a portion of a radio station.
Fig. 6 is a flow chart representation of a method of wireless communication.
Fig. 7 is another flow chart representation of a method of wireless communication.
Detailed Description
The rapid growth of wireless communications and advances in technology have partially met the demand for greater capacity and higher data rates. Other aspects, such as energy consumption, device cost, spectrum resource allocation, and latency, are also factors in future network success.
In a wireless communication system, a Master Information Block (MIB) refers to a piece of information broadcast by a base station regardless of whether any user equipment exists in a network. The MIB is transmitted using a physical layer channel such as a Physical Broadcast Channel (PBCH). In a Long Term Evolution (LTE) communication system, the MIB has a generation period of 40 milliseconds — the physical layer receives a new MIB for encoding every 40 milliseconds. The physical layer typically sends the encoded MIB once every 10 milliseconds. As a result, the content of the MIB encoded within four consecutive transmissions will remain the same, since the MIB changes only after a 40 ms period. A different scrambling code is applied to each of the four successive transmissions to include timing information of the transmissions so that a receiving transmitting node (e.g., a user entity) can distinguish the transmission times of the MIB. For example, when a User Entity (UE) wants to access the network after receiving a plurality of encoded MIBs through PBCH, it can determine correct timing information by checking one of the scrambling codes as long as the encoded MIB and the scrambling code are correctly decoded.
SUMMARY
For 5G new radio (5G-NR) access technologies, it has been proposed that PBCH may employ a longer transmission period of 80 milliseconds. The NR-PBCH may transmit the encoded MIB with the same content multiple times (e.g., more than four times) within an 80ms transmission period of the NR-PBCH. Synchronization Signal (SS) block time indices have also been proposed to carry relevant timing information.
In 5G-NR, the MIB and SS block time index are transmitted by NR-PBCH. The total length of the MIB and error detection coding (e.g., cyclic redundancy check) of the MIB may be less than 100 bits, and the SS block time index may be less than 10 bits in length. For purposes of illustration, the MIBs referred to in this document include MIBs with their error detection codes.
Several types of techniques may be used to indicate the relevant time information for MIB transmissions using SS block time indices.
Implicit indication
The implicit indication technique uses a similar approach as described above for the LTE communication system. For example, a scrambling code or an error detection code such as a Cyclic Redundancy Check (CRC) code may be used to indicate the value of the SS block time index. However, such an approach may be undesirable for long SS block time indices that include many bits. For example, when the SS block time index includes K bits, the UE will need to make 2K guesses before knowing the transmission time of the MIB. If the SS block time index includes seven bits, the UE may have to experience 128 possibilities. Accordingly, there remains a need for improved techniques to address the inefficiencies of implicit indications.
Explicit indication
Explicit indication of SS block time index means explicit coding of SS block time index. For example, a Polar code (Polar code) may be applied to the SS block time index to be individually encoded. Alternatively, the SS block time index may be added to the MIB to form a bit block, and a polarization code may be applied to the bit block to complete the encoding. The explicit indication method does not require the UE to check various possibilities embedded in the coded bits, thereby eliminating the inefficiencies of the implicit indication method.
In some embodiments, the SS block time indices are encoded separately. Various coding schemes may be used for SS block time indices of different lengths:
1. and (6) repeating. If the SS block time index has a length of one bit, the one bit may be repeated multiple times to form an encoded SS block time index.
2. Simple (Simplex). The simple coding scheme maps the short code to the SS block time index and repeats the short code word multiple times to form a coded SS block time index.
3. A polarization code alone or Reed-Muller (Reed-Muller) code. If the SS block time index has more than three bits, a repetition-based coding scheme (such as a repetition or simple coding scheme) may not be effective. Alternatively, polarization codes having SS time indices of the same or different lengths may be applied thereto to generate encoded SS block time indices.
In some embodiments, the SS block time index is encoded with the MIB. Some of the following coding schemes may be used for SS block time indices of different lengths:
1. a single polarization code. If the SS block time index is short (e.g., one bit), it may be concatenated to the end of the MIB to form a new bit block. A single polarization code may be applied to the entire block of bits.
2. Two or more polarization codes. If the SS block time index is long (e.g., greater than two bits), two or more polar codes may be applied. The polarization codes may have the same length or different lengths.
Combination of explicit and implicit indications
In some cases, the content of the SS block time index is variable, while the content of the MIB remains relatively constant. For example, if the SS block time index contains multiple bits, the upper bits of the SS block time index may be changed infrequently, while the lower bits of the SS block time index are subject to frequent changes. Therefore, the upper bits can be encoded implicitly by adding the upper bits to the stable MIB, and the lower bits can be encoded explicitly by encoding the lower bits separately.
The above indication techniques are further illustrated in the following examples.
Example embodiment 1
In this example, the length of the SS block time index is one bit, and the length of the encoded SS block time index after encoding is 32 bits. It should be noted that the length of the encoded SS block time index may vary depending on the amount of available resources.
In this particular example, a repetition coding scheme is used. One bit included in the SS block time index is repeated 32 times to generate an encoded SS block time index. For example, if the SS block time index is binary "0", the encoded SS block time index is binary "0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0. If the SS block time index is binary "1", the encoded SS block time index is binary "1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1.
The MIB may be encoded with different encoding schemes, e.g. applying a polar code of length N512. The message may then be formed using the encoded MIB and the encoded SS block time index. The encoded SS block time index may be located before or after the encoded MIB to form a bit block. In some embodiments, the encoded MIB and the encoded SS block time index may be interleaved in a message. For example, fig. 1 shows an encoded MIB 110 having a subset 101 and a subset 102. Fig. 1 also shows an encoded SS block time index 120 having subset 103 and subset 104. As shown in fig. 1, in bit block 130, a first subset 101 of the encoded MIB is followed by a first subset 103 of the encoded SS block. The concatenated subset is then followed by a second subset of encoded MIB 102 and a second subset of encoded SS blocks 104. Then, the base station transmits the bit block 130 to the UE through PBCH.
Upon receiving the bit block, the UE identifies the encoded MIB and the encoded SS block time index in the bit block. The UE decodes the encoded MIB and the encoded SS block time index separately. If the UE cannot successfully decode the MIB, the UE may store the MIB for later use. The UE may also combine the MIB with earlier versions of the MIB with smaller SS block time indices that were not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB. For example, if the currently decoded SS block time index is binary "1" and the corresponding MIB cannot be successfully decoded, the UE may combine the previously stored version of the MIB with an SS block time index equal to binary "0" (if that previously stored version of the MIB was not successfully decoded).
Example embodiment 2
In this particular embodiment, the SS block time index is 3 bits in length and the encoded SS block time index is 36 bits in length. It should be noted, however, that the same technique may be applied to SS block time indices having different lengths. The length of the encoded SS block time index may also vary depending on the amount of available resources.
In this particular embodiment, the SS block time index is encoded using a simple coding scheme. A simple coding scheme maps a short code (e.g., 1-4 bits) to an SS block time index and repeats the short code multiple times to generate a coded SS block time index. For example, the encoded SS block time index may be generated according to table 1. If the SS block time index is binary "011" (3 decimal), the short binary code "0, 1" will be repeated 18 times to generate a coded SS block time index.
The MIB may be encoded with different encoding schemes, e.g. a polar code of length N512. The message may then be formed using the encoded MIB and the encoded SS block time index. The encoded SS block time index may be located before or after the encoded MIB to form a bit block. In some embodiments, the encoded MIB and the encoded SS block time index may be interleaved in a message. For example, as shown in fig. 1, in bit block 130, a first subset 101 of the encoded MIB is followed by a first subset 103 of the encoded SS block. The concatenated subset is then followed by a second subset of encoded MIB 102 and a second subset of encoded SS blocks 104. Then, the base station transmits the bit block 130 to the UE through PBCH.
Upon receiving the bit block, the UE identifies the encoded MIB and the encoded SS block time index in the bit block. The UE decodes the encoded MIB and the encoded SS block time index separately. If the UE cannot successfully decode the MIB, the UE may store the MIB for later use. The UE may also combine the MIB with earlier versions of the MIB with smaller SS block time indices that were not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB. For example, if the currently decoded SS block time index is binary "011" and the corresponding MIB cannot be successfully decoded, the UE may combine the previously stored version of the MIB with an SS block time index equal to binary "010" (if the previously stored version of the MIB is not successfully decoded).
TABLE 1 coding scheme for SS block time indexing
Example embodiment 3
In this example, the SS block time index is 7 bits in length. The lower two bits of the SS block time index are subject to frequent changes while the upper five bits of the SS block time index remain relatively constant. Thus, the SS block time index may be divided into two subsets: a first subset including the upper five bits and a second subset including the lower two bits. Note that the SS block time index may have different lengths, and the division of the SS block time index may also vary in different cases. A combination of implicit and explicit indications may be used to encode the first subset and the second subset in different ways.
In some embodiments, the lower two bits may be encoded separately as information block a. The information block a in this particular example is 32 bits in length. The length of the information block a may also vary depending on the amount of available resources. A simple coding scheme may be applied to the lower two bits of the SS block time index. For example, an encoded subset of the SS block time index is generated according to table 2. If the subset (e.g., lower two bits) of the SS block time index is binary "11" (decimal 3), the encoded subset of the SS block time index (i.e., information block a) is binary "0, 1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0, 1".
TABLE 2. alternative coding scheme for SS block time indexing
The upper five bits of the SS block time index may be concatenated with the MIB to form information block B. For example, these bits may be appended to the MIB or located before the MIB. A separate coding scheme (e.g., polar coding) may be applied to information block B to generate information block C, which represents a subset of the encoded MIB and encoded SS block time indices.
The message may be formed by using the information block a and the information block C. For example, the information block a may be concatenated to the end of the information block C. The information block a may also be placed before the information block C. In some embodiments, the encoded MIB and the encoded SS block time index may be interleaved in a message. Then, the base station transmits a message to the UE through PBCH.
After receiving the bit block, the UE identifies information block C, which represents a subset of the encoded MIB and encoded SS block time indices, and information block a, which represents other encoded subsets SS block time indices. The UE decodes information block a and information block C separately. If the UE cannot successfully decode the MIB contained in information Block A, the UE may store the MIB for later use. The UE may also combine the MIB with an earlier version of the MIB with the lower two bits in the SS block time index that was not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB. For example, if the currently decoded two bits of the SS block time index are binary "11" and the corresponding MIB cannot be successfully decoded, the UE may combine the previously stored version of the MIB with an SS block time index equal to binary "10" (if the previously stored version of the MIB was not successfully decoded).
Example embodiment 4
In this example, the SS block time index is 3 bits in length. The length of the encoded SS block time index is 32 bits. It should be noted, however, that the same technique may be applied to SS block time indices having different lengths. The length of the encoded SS block time index may also vary depending on the amount of available resources.
In this particular embodiment, the SS block time index is encoded with a polar code of length N-32 to generate an encoded SS block time index having 32 bits. The MIB may be encoded using a separate encoding scheme (e.g., polar encoding). For example, the MIB is encoded with a polar code of length N512.
The message may then be formed using the encoded MIB and the encoded SS block time index. The encoded SS block time index may be positioned before or after the encoded MIB to form a 544-bit block of bits as a message. In some embodiments, the encoded MIB and the encoded SS block time index may be interleaved in a message. Then, the base station transmits a message to the UE through PBCH.
Upon receiving the bit block, the UE identifies the encoded MIB and the encoded SS block time index in the bit block. The UE decodes the encoded MIB and the encoded SS block time index separately. If the UE cannot successfully decode the MIB, the UE may store the MIB for later use. The UE may also combine the MIB with earlier versions of the MIB with smaller SS block time indices that were not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB. For example, if the currently decoded SS block time index is binary "011" and the corresponding MIB cannot be successfully decoded, the UE may combine the previously stored version of the MIB with an SS block time index equal to binary "010" (if the previously stored version of the MIB was not successfully decoded).
Example 5
In this example, the SS block time index is 3 bits in length. The length of the encoded SS block time index is 32 bits. It should be noted, however, that the same technique may be applied to SS block time indices having different lengths. The length of the encoded SS block time index may also vary depending on the amount of available resources.
In this particular embodiment, the MIB is encoded with a polar code of length N512 to generate an encoded MIB of length N512 bits. The SS block time index may be encoded using the same coding scheme (e.g., the same polar code with length N of 512). After the polarization code is applied, code word bits with the length of 512 bits are obtained. The codeword bits may then be shortened (e.g., punctured) to generate an encoded SS block time index having a length of 32 bits.
The message may then be formed using the encoded MIB and the encoded SS block time index. The encoded SS block time index may be located before or after the encoded MIB to form a bit block as a message. In some embodiments, the concatenation of the encoded MIB and the encoded SS block time index may be interleaved in a message. Then, the base station transmits a message to the UE through PBCH.
Upon receiving the bit block, the UE identifies the encoded MIB and the encoded SS block time index in the bit block. The UE decodes the encoded MIB and the encoded SS block time index separately. If the UE cannot successfully decode the MIB, the UE may store the MIB for later use. The UE may also combine the MIB with earlier versions of the MIB with smaller SS block time indices that were not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB. For example, if the currently decoded SS block time index is binary "011" and the corresponding MIB cannot be successfully decoded, the UE may combine the previously stored version of the MIB with an SS block time index equal to binary "010" (decimal 2) (if the previously stored version of the MIB was not successfully decoded).
Example 6
In this example, the SS block time index is 7 bits long. The length of the encoded SS block time index is 32 bits. It should be noted, however, that the same technique may be applied to SS block time indices having different lengths. The length of the encoded SS block time index may also vary depending on the amount of available resources.
In this particular example, the SS block time index is encoded with a reed-muller (RM) code of length N-32 (e.g., RM (32, O)) to obtain an encoded SS block time index that includes b0, b1, b2, … …, b 31. The coding scheme can be expressed as follows:
in equation (1), i is 0,1, 2, … …, 31. biIs the bits generated after RM encoding, and K is the length of the SS block time index. onAre the bits of the SS block time index. Mi,nIs the basic sequence of the RM code as shown in table 3.
The MIB may be encoded with different encoding schemes, e.g. a polar code of length N512. The message is then formed using the encoded MIB and the encoded SS block time index. The encoded SS block time index may be positioned before or after the encoded MIB to form a bit block having a length of 544 bits as a message. In some embodiments, the encoded MIB and the encoded SS block time index may be interleaved in a message. Then, the base station transmits a message to the UE through PBCH.
After receiving the bit block, the UE decodes the encoded MIB and the encoded SS block time index separately. If the UE cannot successfully decode the MIB, the UE may store the MIB for later use. The UE may also combine the MIB with earlier versions of the MIB with smaller SS block time indices that were not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB. For example, if the currently decoded SS block time index is binary "0000011" and the corresponding MIB cannot be successfully decoded, the UE may combine the previously stored version of the MIB with an SS block time index equal to binary "0000010" (if the previously stored version of the MIB was not successfully decoded).
TABLE 3 basic sequence of RM codes
Example embodiment 7
In this example, the SS block time index is one bit in length. Note that the length of the SS block time index may also be another small value.
Since the SS block time index is short, it can be added to the MIB before being encoded. For example, as shown in fig. 2, one bit of the SS block time index u511 is concatenated to the end of the MIB to form a bit block { u0, u 1. The bit block is then encoded using an encoding scheme (e.g., polar encoding). For example, a polar code having a length of N512 is used, and after the polar code, codeword bits { x0, x 1.., x511} having a length of N512 are obtained.
As shown in fig. 2, the one-bit SS block time index is placed in the bit block as the last bit u 511. After polar coding, the coded bits remain as the last bit x511 in the codeword bits. Its relative position in its block does not change so that the receiving UE can easily recognize the bit(s) representing the encoded SS block time index. The base station then transmits a bit block { x0, x 1.., x511} to the UE through PBCH. In some embodiments, the value of the encoded bit is equal to the value of the original bit: x511 is u 511.
After receiving the bit block, the UE identifies information block C, which represents a subset of the encoded MIB and encoded SS block time indices, and information block a, which represents other encoded subsets SS block time indices. The UE decodes the encoded MIB and the encoded SS block time index separately. If the UE cannot successfully decode the MIB, the UE may store the MIB for later use. The UE may also combine the MIB with earlier versions of the MIB with smaller SS block time indices that were not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB. For example, if the currently decoded SS block time index is binary "1" and the corresponding MIB cannot be successfully decoded, the UE may combine the previously stored version of the MIB with an SS block time index equal to binary "0" (if the previously stored version of the MIB was not successfully decoded).
Example embodiment 8
In this example, the SS block time index is two bits in length. It may be divided into a first subset having one bit and a second subset having one bit. Note that the same technique can also be applied to SS block time indices having different lengths.
A first subset (i.e., a first bit) of the MIB and SS block time indices may be encoded using a coding scheme such as polar coding. A polar code of length N512 may be used to derive the first block a with coded bits of length N512. The first subset of SS block time indices may be concatenated to the end of the MIB, such as shown in fig. 2. As described above, after polarization encoding, the encoded bits remain as the last bit in the codeword bits. Its relative position in its block does not change so that the receiving UE can easily recognize the bit(s) representing the encoded SS block time index. In some embodiments, the value of the encoded bit is equal to the value of the original bit: x511 is u 511.
Similarly, the second subset of MIB and SS block time indices may be encoded using a coding scheme such as polar coding. A polar code with length N512 may be used to derive the second block B of coded bits with length N512. In some embodiments, the same polarization code used for the MIB and the first subset of SS block time indices are reused. A second subset of the SS block time indices may be concatenated to the end of the MIB, such as shown in fig. 2. Similarly, after polar encoding, the encoded bits remain as the last bit in the codeword bits. Its relative position in its block does not change so that the receiving UE can easily recognize the bit(s) representing the encoded SS block time index. In some embodiments, the value of the encoded bit is equal to the value of the original bit: x511 is u 511.
A block C of 1024 bits may be formed using a first block a of coded bits and a second block B of coded bits. Then, the base station transmits the 1024-bit block to the UE through PBCH.
The redundancy of the encoded MIB allows for more accurate decoding at the UE side. After receiving the bit block, the UE identifies information block C, which represents a subset of the encoded MIB and encoded SS block time indices, and information block a, which represents other encoded subsets SS block time indices. The UE decodes the first 512 bits of the encoded first subset including the encoded MIB and SS block time index. The UE then decodes the second 512 bits of the encoded second subset including the encoded MIB and SS block time index. The redundancy of the MIB allows more accurate decoding of the MIB without reference to previously stored MIB.
However, if the UE still cannot successfully decode the MIB, the UE may store the MIB for later use. The UE may also combine the MIB with earlier versions of the MIB with smaller SS block time indices that were not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB. For example, if the currently decoded SS block time index is binary "01" and the corresponding MIB cannot be successfully decoded, the UE may combine the previously stored version of the MIB with an SS block time index equal to binary "00" (if the previously stored version of the MIB was not successfully decoded).
Example embodiment 9
In this example, the SS block time index is two bits in length. It can be divided into a first subset having one high bit and a second subset having one low bit. Note that the same technique can also be applied to SS block time indices having different lengths.
The MIB and the first subset (i.e., upper bits) of the SS block time index may be encoded using a coding scheme such as polar coding. A polar code of length N512 may be used to derive a block a with coded bits of length N512. The first subset of SS block time indices may be concatenated to the end of the MIB, such as shown in fig. 2. As described above, after polarization encoding, the encoded bits remain as the last bit in the codeword bits. Its relative position in its block does not change so that the receiving UE can easily recognize the bit(s) representing the encoded SS block time index. In some embodiments, the value of the encoded bit is equal to the value of the original bit: x511 is u 511.
The block a of coded bits is then divided into two blocks B and C of the same length. As shown in fig. 3A, block a 300 is divided into two parts: block B301 has a length of 256 bits and block C302 has a length of 256 bits.
The base station then transmits block B or block C based on the values of the second subset of SS block time indices (i.e., the lower bits). For example, when the lower bit is 0, the base station transmits block B. When the lower bit is 1, the base station transmits block C.
In some embodiments, the base station sends multiple copies of the block to create additional redundancy to facilitate decoding of the data bits. For example, as shown in fig. 3B, when the lower bit is 0, the base station transmits two copies of block B (512 bits in total). When the lower bit is 1, the base station transmits two copies of block C (512 bits in total).
In some embodiments, the base station transmits a different copy of block B or block C based on the value of the second subset of SS block time indices (i.e., the lower bits). The B and C blocks may be combined in different orders. For example, as shown in fig. 3C, when the lower bit is 0, the base station transmits block B and block C (512 bits in total). When the lower bit is 1, the base station transmits block C and block B (512 bits in total).
In some embodiments, the base station may apply two different scrambling codes based on block a to generate two different information blocks. The base station then transmits a different copy based on the values of the second subset of SS block time indices (i.e., the lower bits). For example, when the lower bit is 0, the first scrambling code is applied to the block a to generate a1, and a1 is transmitted. When the lower bit is 1, a second scrambling code is applied to a to generate a2, and a2 is transmitted.
Upon receiving the bit block, the UE identifies the encoded MIB and the encoded subset of SS block time indices in the bit block. The UE decodes the encoded MIB and the encoded subset SS block time index separately. If the UE cannot successfully decode the MIB, the UE may store the MIB for later use. The UE may also combine the MIB with earlier versions of the MIB with smaller SS block time indices that were not successfully decoded, if such MIB is available. After combining, the UE may attempt to decode the combined MIB.
Fig. 4 illustrates an example of a wireless communication system in which techniques in accordance with one or more embodiments of the present technology may be applied. The wireless communication system 400 may include one or more Base Stations (BSs) 405a, 405b, one or more wireless devices 410a, 410b, 410c, 410d, and an access network 425. Base stations 405a, 405b may provide wireless service to wireless devices 410a, 410b, 410c, and 410d in one or more wireless sectors. In some embodiments, the base stations 405a, 405b include directional antennas to generate two or more directional beams to provide wireless coverage in different sectors.
The access network 425 may communicate with one or more base stations 405a, 405 b. In some embodiments, the access network 425 includes one or more base stations 405a, 405 b. In some embodiments, the access network 425 communicates with a core network (not shown in fig. 4) that provides connectivity with other wireless and wired communication systems. The core network may include one or more service subscription databases to store information about subscribed wireless devices 410a, 410b, 410c, and 410 d. The first base station 405a may provide wireless services based on a first radio access technology, while the second base station 405b may provide wireless services based on a second radio access technology. Depending on the deployment scenario, the base stations 405a and 405b may be co-located or may be separately installed in the field. Access network 425 may support a plurality of different radio access technologies.
In some embodiments, a wireless communication system may include multiple networks using different wireless technologies. A dual-mode or multi-mode wireless device includes two or more wireless technologies that may be used to connect to different wireless networks.
Fig. 5 is a block diagram representation of a portion of a radio station. A radio station 505, such as a base station or a wireless device (or UE), may include processor electronics 510, such as a microprocessor, that implements one or more of the wireless technologies set forth in this document. The radio station 505 may include transceiver electronics 515 to transmit and/or receive wireless signals over one or more communication interfaces, such as antenna 520. The radio station 505 may include other communication interfaces for transmitting and receiving data. The radio station 505 may include one or more memories (not explicitly shown) configured to store information such as data and/or instructions. In some embodiments, the processor electronics 510 may include at least a portion of the transceiver electronics 515. In some embodiments, at least some of the disclosed techniques, modules, or functions are implemented using a radio station 505.
Fig. 6 is a flowchart representation of a wireless communication method 600. The method 600 comprises: at 602, an information block and a time index indication are encoded, wherein the time index indication indicates a transmission time of the information block; at 604, a message is formed using the encoded information block and the encoded time index indication; and at 606, the message is sent over a broadcast channel.
In some embodiments, the encoding of the information block and the time index indication comprises: the first coding scheme is applied to the information block to generate a coded information block, and the second coding scheme is applied to the time index indication to generate a coded time index indication. The second coding scheme may be a simple coding scheme. A simple coding scheme may include mapping a codeword to a time index indication and repeating the codeword a plurality of times to form a coded time index indication.
In some embodiments, the first coding scheme uses a first polarization code and the second coding scheme uses a second polarization code. The first polarization code may have a longer length than the second polarization code. The first polarization code may also be the same as the second polarization code. The method also includes reducing a length of the encoded time index indication. The reduced length is shorter than the length of the second polarization code. In some embodiments, the second coding scheme uses reed-muller codes.
In some embodiments, the encoding of the information block and the time index indication comprises: a first coding scheme is applied to a subset of the information blocks and time index indications to generate codeword bits comprising the coded information blocks, and a second coding scheme is applied to the remaining time index indications to generate coded time index indications. The forming of the message comprises: concatenating the codeword bits and the encoded time index indication. The second coding scheme is a simple coding scheme that includes mapping a codeword to a time index indication and repeating the codeword a plurality of times to form a coded time index indication.
In some embodiments, the encoding of the information block and the time index indication comprises: the method further includes forming a bit block using the information block and a time index indication, wherein the time index indication is positioned at a first position in the bit block, and applying a coding scheme to the bit block to generate codeword bits comprising the coded information block and the coded time index indication. The encoded time index indicates a second position located in the codeword bit that corresponds to the first position in the bit block.
In some embodiments, the encoding of the information block and the time index indication comprises: the coding scheme is applied to a first bit block formed by the information block and a subset of the time index indications, and the coding scheme is applied to a second bit block formed by the information block and the remaining time index indications. A subset of the time index indications is positioned after the information block in the first bit block and the remaining time index indications are positioned after the information block in the second bit block. The forming of the message includes concatenating the first block of bits and the second block of bits in the message.
In some embodiments, the encoding of the information block and the time index indication comprises: the method comprises forming a bit block by concatenating the information block and a subset of time index indications, wherein the time index indications are positioned at a first position in the bit block, and applying a coding scheme to the bit block to generate codeword bits comprising the encoded information block and the encoded time index indications, wherein the encoded time index indications are positioned at a second position in the codeword bits, which corresponds to the first position in the bit block. The forming of the message comprises: the bit block is divided into a plurality of portions and a subset of the plurality of portions is selected into the message based on the remaining time index indications.
Fig. 7 is another flowchart representation of a method 700 of wireless communication. The method 700 comprises: at 702, a message is received over a broadcast channel; at 704, an encoded information block and an encoded time index indication in the message are identified; at 706, decoding the encoded information block to obtain an information block; and at 708, the encoded time index indication is decoded to obtain a time index indication, wherein the time index indication indicates a transmission time of the information block.
In some embodiments, decoding the encoded information block comprises decoding a first polar code, and decoding the encoded time index indication comprises decoding a second polar code. The first polarization code may have a longer length than the second polarization code. The first polarization code may also be the same as the second polarization code.
In some embodiments, the decoding of the encoded time index indication comprises using a simplex decoding scheme. The simplex decoding scheme maps a time index indication to a codeword and repeats the codeword a plurality of times in the encoded time index indication.
In some embodiments, the decoding of the encoded time index indication comprises using a reed-muller code.
In some embodiments, the method further comprises: the information block is combined with information obtained in other messages whose transmission time precedes the transmission time indicated in the message.
It will be appreciated that techniques for transmitting control data using a broadcast channel are disclosed. The technique allows for explicit coding of at least a subset of the SS block time indices so that the received communication code can more efficiently derive the relevant transmission time of the MIB.
Some embodiments described herein are described in the general context of methods or processes, which may be implemented in one embodiment by a computer program product, embodied in a computer-readable medium, including computer-executable instructions, such as program code, executed by computers in networked environments. The computer readable medium may include removable and non-removable storage devices including, but not limited to, Read Only Memory (ROM), Random Access Memory (RAM), Compact Discs (CDs), Digital Versatile Discs (DVDs), and the like. Thus, a computer-readable medium may include a non-transitory storage medium. Generally, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-or processor-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps or processes.
Some disclosed embodiments may be implemented as a device or module using hardware circuitry, software, or a combination thereof. For example, a hardware circuit implementation may include separate analog and/or digital components, e.g., integrated as part of a printed circuit board. Alternatively or additionally, the disclosed components or modules may be implemented as Application Specific Integrated Circuits (ASICs) and/or as Field Programmable Gate Array (FPGA) devices. Some embodiments may additionally or alternatively include a Digital Signal Processor (DSP), which is a special-purpose microprocessor having an architecture optimized for the operational requirements of digital signal processing associated with the disclosed functionality of the present application. Similarly, various components or sub-components within each module may be implemented in software, hardware, or firmware. Connectivity between modules and/or components within modules may be provided using any of a variety of connection methods and media known in the art, including, but not limited to, communication over the internet, wired, or wireless networks using an appropriate protocol.
Although this patent document contains many specifics, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular inventions. Certain features that are described in this patent document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in this patent document should not be understood as requiring such separation in all embodiments.
Only some embodiments and examples are described, and other embodiments, enhancements and variations can be made based on what is described and illustrated in this patent document.

Claims (54)

1. A method for wireless communication, comprising:
encoding an information block and a time index indication, wherein the time index indication indicates a transmission time of the information block;
forming a message using the encoded information block and the encoded time index indication; and
the message is sent over a broadcast channel.
2. The method of claim 1, wherein the encoding of the information block and the time index indication comprises:
applying a first coding scheme to the information block to generate the coded information block, an
Applying a second coding scheme to the time index indication to generate the encoded time index indication.
3. The method of claim 2, wherein the second coding scheme is a simple coding scheme.
4. The method of claim 3, wherein the simple coding scheme comprises: mapping a codeword to the time index indication, and repeating the codeword a plurality of times to form the encoded time index indication.
5. The method of claim 2, wherein the first coding scheme uses a first polarization code and the second coding scheme uses a second polarization code.
6. The method of claim 5, wherein the first polarization code has a length longer than a length of the second polarization code.
7. The method of claim 5, wherein the first polarization code is the same as the second polarization code.
8. The method of claim 7, further comprising: reducing a length of the encoded time index indication, wherein the reduced length is shorter than a length of the second polarization code.
9. The method of claim 2, wherein the second coding scheme uses Reed-Muller codes.
10. The method of claim 1, wherein encoding the information block and the time index indication comprises:
applying a first coding scheme to the information block and the subset of the time index indications to generate codeword bits comprising the coded information block, an
Applying a second coding scheme to a remaining portion of the time index indication to generate the encoded time index indication.
11. The method of claim 10, wherein forming the message comprises:
concatenating the codeword bits and the encoded time index indication.
12. The method of claim 10, wherein the second coding scheme is a simple coding scheme comprising mapping a codeword to the time index indication and repeating the codeword a plurality of times to form the encoded time index indication.
13. The method of claim 1, wherein encoding the information block and the time index indication comprises:
forming a bit block using the information block and the time index indication, wherein the time index indication is placed at a first position in the bit block; and
applying a coding scheme to the block of bits to generate codeword bits, the codeword bits comprising the encoded block of information and the encoded time index indication.
14. The method of claim 13, wherein the encoded time index indicates a second position placed in the codeword bit, the second position corresponding to a first position in the block of bits.
15. The method of claim 1, wherein encoding the information block and the time index indication comprises:
applying a coding scheme to a first block formed by the information block and the subset indicated by the time index, an
Applying the coding scheme to a second block of bits formed by the information block and the remainder indicated by the time index.
16. The method of claim 15, wherein a subset of the time index indications is placed after the information block in the first bit block and a remaining portion of the time index indications is placed after the information block in the second bit block.
17. The method of claim 16, wherein forming the message comprises:
concatenating the first block of bits and the second block of bits in the message.
18. The method of claim 1, wherein the encoding of the information block and the time index indication comprises:
forming a bit block by concatenating the information block and a subset of the time index indications, wherein the time index indication is placed at a first position in the bit block, an
Applying a coding scheme to the bit block to generate codeword bits comprising the encoded information block and the encoded time index indication, wherein the encoded time index indication is placed at a second position in the codeword bits, the second position corresponding to the first position in the bit block.
19. The method of claim 18, wherein forming the message comprises:
dividing the block of bits into a plurality of portions, an
Selecting a subset of the plurality of portions into the message based on a remaining portion of the time index indication.
20. A method for wireless communication, comprising:
receiving a message over a broadcast channel;
identifying an encoded information block and an encoded time index indication in the message;
decoding the encoded information block to obtain an information block; and
decoding the encoded time index indication to obtain a time index indication, wherein the time index indication indicates a transmission time of the information block.
21. The method of claim 20, wherein the decoding of the encoded information block comprises decoding a first polarization code, and the decoding of the encoded time index indication comprises decoding a second polarization code.
22. The method of claim 21, wherein the first polarization code has a longer length than the second polarization code.
23. The method of claim 21, wherein the first polarization code is the same as the second polarization code.
24. The method of claim 20, wherein decoding the encoded time index indication comprises using a simple decoding scheme.
25. The method of claim 24, wherein the simple decoding scheme maps the time index indication to a codeword and repeats the codeword a plurality of times in the encoded time index indication.
26. The method of claim 20, wherein the decoding of the encoded time index indication comprises using a reed-muller code.
27. The method of claim 20, further comprising:
concatenating the information block with information obtained in other messages having a transmission time prior to the transmission time indicated in the message.
28. A wireless communications apparatus, comprising:
a processor operable to execute the codeword to:
encoding an information block and a time index indication, wherein the time index indication indicates a transmission time of the information block, an
Forming a message using the encoded information block and the encoded time index indication; and a transceiver in communication with the processor to transmit the message over a broadcast channel.
29. The apparatus of claim 28, wherein the processor is operable to encode the information block and time index indication by:
applying a first coding scheme to the information block to generate the coded information block, an
Applying a second coding scheme to the time index indication to generate the encoded time index indication.
30. The apparatus of claim 29, wherein the second coding scheme is a simple coding scheme.
31. The apparatus of claim 30, wherein the simple coding scheme comprises: a codeword is mapped to the time index indication and repeated a plurality of times to form the encoded time index indication.
32. The apparatus of claim 28, wherein the first coding scheme uses a first polarization code and the second coding scheme uses a second polarization code.
33. The apparatus of claim 32, wherein the first polarization code has a length longer than a length of the second polarization code.
34. The apparatus of claim 32, wherein the first polarization code is the same as the second polarization code.
35. The apparatus of claim 34, wherein the processor is operable to reduce a length of the encoded time index indication, the reduced length being shorter than a length of the second polarization code.
36. The apparatus of claim 29, wherein the second coding scheme uses reed-muller codes.
37. The apparatus of claim 28, wherein the processor is operable to encode the information block and the time index indication by:
applying a first coding scheme to the information block and the subset of the time index indications to generate codeword bits comprising the coded information block, an
Applying a second coding scheme to a remaining portion of the time index indication to generate the encoded time index indication.
38. The apparatus of claim 37, wherein the processor is operable to form the message by:
concatenating the codeword bits and the encoded time index indication.
39. The apparatus of claim 37, wherein the second coding scheme is a simple coding scheme comprising mapping a codeword to the time index indication and repeating the codeword a plurality of times to form the encoded time index indication.
40. The apparatus of claim 28, wherein the processor is operable to encode the information block and the time index indication by:
forming a bit block by concatenating the information block and the time index indication, wherein the time index indication is placed at a first location in the bit block; and
applying a coding scheme to the block of bits to generate codeword bits comprising the encoded block of information and the encoded time index indication.
41. The apparatus of claim 40, wherein the encoded time index indicates a second position placed in the codeword bit, the second position corresponding to the first position in the bit block.
42. The apparatus of claim 28, wherein the processor is operable to encode the information block and the time index indication by:
applying a coding scheme to a first block of bits formed by the information block and the subset indicated by the time index, an
Applying the coding scheme to a second block of bits formed by the information block and the remainder indicated by the time index.
43. The apparatus of claim 42, wherein a subset of the time index indications are placed after an information block in the first bit block and a remaining portion of the time index indications are placed after an information block in the second bit block.
44. The apparatus of claim 43, wherein the processor is operable to form the message by:
concatenating the first block of bits and the second block of bits in the message.
45. The apparatus of claim 28, wherein the processor is operable to encode the information block and the time index indication by:
forming a bit block by concatenating the information block and a subset of the time index indications, wherein the time index indication is placed at a first position in the bit block, an
Applying a coding scheme to the bit block to generate codeword bits comprising the encoded information block and the encoded time index indication, wherein the encoded time index indication is placed at a second position in the codeword bits, the second position corresponding to the first position in the bit block.
46. The apparatus of claim 45, wherein the processor is operable to form the message by:
dividing the block of bits into a plurality of portions, an
Selecting a subset of the plurality of portions into the message based on a remaining portion of the time index indication.
47. A wireless communications apparatus, comprising:
a transceiver configured to receive a message through a broadcast channel; and
a processor in communication with the transceiver and operable to execute a codeword to:
identifying an encoded information block and an encoded time index indication in the message;
decoding the encoded information block to obtain an information block; and
decoding the encoded time index indication to obtain a time index indication, wherein the time index indication indicates a transmission time of the information block.
48. The apparatus of claim 47, wherein the processor is operable to decode the encoded information block by decoding a first polarization code, and the processor is operable to decode the encoded time index indication by decoding a second polarization code.
49. The apparatus of claim 48, wherein the first polarization code has a longer length than the second polarization code.
50. The apparatus of claim 48, wherein the first polarization code is the same as the second polarization code.
51. The apparatus of claim 47, wherein the processor is operable to decode the encoded time index indication by using a simple decoding scheme.
52. The apparatus of claim 51, wherein the simple decoding scheme maps the time index indication to a codeword and repeats the codeword a plurality of times in the encoded time index indication.
53. The apparatus of claim 47, wherein the processor is operable to decode the encoded time index indication using Reed-Muller codes.
54. The apparatus of claim 47, wherein the processor is operable to concatenate the information block with information derived in other messages having a transmission time prior to a transmission time indicated in the message.
CN201780090646.5A 2017-06-14 2017-06-14 Communication method of broadcast channel Active CN110622529B (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/088301 WO2018227442A1 (en) 2017-06-14 2017-06-14 Communication methods for broadcast channel

Publications (2)

Publication Number Publication Date
CN110622529A true CN110622529A (en) 2019-12-27
CN110622529B CN110622529B (en) 2024-02-23

Family

ID=64658873

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201780090646.5A Active CN110622529B (en) 2017-06-14 2017-06-14 Communication method of broadcast channel

Country Status (2)

Country Link
CN (1) CN110622529B (en)
WO (1) WO2018227442A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022261984A1 (en) * 2021-06-18 2022-12-22 华为技术有限公司 Communication method and communication apparatus

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1333961A (en) * 1999-01-22 2002-01-30 艾利森公司 Methods and systems for coding of broadcast messages
WO2006104334A2 (en) * 2005-03-28 2006-10-05 Lg Electronics Inc. Method and apparatus for transmitting/receiving mbms transport blocks
WO2010002319A2 (en) * 2008-07-03 2010-01-07 Telefonaktiebolaget L M Ericsson (Publ) Methods and arrangements in a wireless communication system
CN104919852A (en) * 2013-01-14 2015-09-16 高通股份有限公司 Broadcast and system information for machine type communication
CN105453602A (en) * 2013-08-09 2016-03-30 阿尔卡特朗讯 Communication technique for delivering information to users experiencing high attenuation
US20170094688A1 (en) * 2015-09-24 2017-03-30 Kt Corporation Method and apparatus for receiving random access response for mtc ue
WO2017077015A1 (en) * 2015-11-05 2017-05-11 Nokia Solutions And Networks Oy Flexible transmission of combined system information blocks
WO2017091244A1 (en) * 2015-11-23 2017-06-01 Intel IP Corporation Hybrid arq schemes based on low density parity check codes

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI109252B (en) * 1999-04-13 2002-06-14 Nokia Corp Transmission process with soft combination in a telecommunication system
TWI395502B (en) * 2005-04-25 2013-05-01 Samsung Electronics Co Ltd Method for transmitting/receiving data in a communication system

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1333961A (en) * 1999-01-22 2002-01-30 艾利森公司 Methods and systems for coding of broadcast messages
WO2006104334A2 (en) * 2005-03-28 2006-10-05 Lg Electronics Inc. Method and apparatus for transmitting/receiving mbms transport blocks
WO2010002319A2 (en) * 2008-07-03 2010-01-07 Telefonaktiebolaget L M Ericsson (Publ) Methods and arrangements in a wireless communication system
CN104919852A (en) * 2013-01-14 2015-09-16 高通股份有限公司 Broadcast and system information for machine type communication
CN105453602A (en) * 2013-08-09 2016-03-30 阿尔卡特朗讯 Communication technique for delivering information to users experiencing high attenuation
US20170094688A1 (en) * 2015-09-24 2017-03-30 Kt Corporation Method and apparatus for receiving random access response for mtc ue
WO2017077015A1 (en) * 2015-11-05 2017-05-11 Nokia Solutions And Networks Oy Flexible transmission of combined system information blocks
WO2017091244A1 (en) * 2015-11-23 2017-06-01 Intel IP Corporation Hybrid arq schemes based on low density parity check codes

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
A: "N2-99726", 3GPP TSG_CN\\WG2_CAMEL *
NOKIA: "N1-010316 "Handling of MM / GMM information PDU errors"", 3GPP TSG_CN\\WG1_MM-CC-SM, no. 1 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022261984A1 (en) * 2021-06-18 2022-12-22 华为技术有限公司 Communication method and communication apparatus

Also Published As

Publication number Publication date
CN110622529B (en) 2024-02-23
WO2018227442A1 (en) 2018-12-20

Similar Documents

Publication Publication Date Title
US11700545B2 (en) Method and device for transmitting data
CN108347302B (en) Coding and decoding method and terminal
CN108880566B (en) Polar code transmission method and device
US11581931B2 (en) Channel state information feedback methods and systems
KR20190052054A (en) Method and apparatus for encoding data using polarity codes
CN108737021B (en) Polar code transmission method and device
CN110402554B (en) Method of performing encoding based on parity check matrix of Low Density Parity Check (LDPC) code in wireless communication system and terminal using the same
RU2019124482A (en) METHOD OF INFORMATION PROCESSING, DEVICE AND COMMUNICATION SYSTEM
CN110690941B (en) Polar code rate matching method and device
US11342945B2 (en) Method and apparatus for processing rate matching of polar codes
KR20120079922A (en) Method and apparatus for channel encoding and decoding in a communication system with low density parity-check codes
JP2020533855A (en) Coding method and equipment
CN106464455A (en) Information transmission method, terminal device, network device and device
CN112448724B (en) Data coding method and device
CN107733554B (en) Rate matching method and device for polar code
US11451324B2 (en) Bit selection for hybrid automatic repeat requests
KR100429536B1 (en) Apparatus for optimal (11, 5) codeword coding/decoding in mobile communication system and method thereof
CN110622529B (en) Communication method of broadcast channel
EP3602797A1 (en) Puncturing of polar codes with complementary sequences
KR20190116394A (en) Method and apparatus for constructing coding sequence
KR100320431B1 (en) optimal method for encoding TFCI
CN110167154B (en) Method for transmitting uplink signal, communication device and computer readable storage medium
CN112753178B (en) Bit selection for hybrid automatic repeat request
CN113472476B (en) Rate de-matching method, device, computer equipment and storage medium
KR102601339B1 (en) Method and apparatus for coding using block code of variable I/O length

Legal Events

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