WO2017093809A1 - Procédés et appareils de mappage de couches et de démappage de couches dans un système de communications sans fil - Google Patents

Procédés et appareils de mappage de couches et de démappage de couches dans un système de communications sans fil Download PDF

Info

Publication number
WO2017093809A1
WO2017093809A1 PCT/IB2016/001984 IB2016001984W WO2017093809A1 WO 2017093809 A1 WO2017093809 A1 WO 2017093809A1 IB 2016001984 W IB2016001984 W IB 2016001984W WO 2017093809 A1 WO2017093809 A1 WO 2017093809A1
Authority
WO
WIPO (PCT)
Prior art keywords
layer
mapping
data blocks
mapped
symbols
Prior art date
Application number
PCT/IB2016/001984
Other languages
English (en)
Inventor
Xun Li
Min Zhang
Tao Yang
Original Assignee
Alcatel Lucent
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 Alcatel Lucent filed Critical Alcatel Lucent
Publication of WO2017093809A1 publication Critical patent/WO2017093809A1/fr

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/02—Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
    • 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
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0697—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using spatial multiplexing
    • 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
    • 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/007—Unequal error protection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • 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
    • H04L2001/0098—Unequal error protection
    • 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/0001—Arrangements for dividing the transmission path
    • H04L5/0014—Three-dimensional division
    • H04L5/0023—Time-frequency-space

Definitions

  • the present invention relates to wireless communication technologies, and more specifically to a method and apparatus for layer mapping from symbols for codeword mapped onto the layer signals in a long-term evolution (LTE)-based wireless communication system, and a method and apparatus for layer demapping from the layer signals to symbols for codeword.
  • LTE long-term evolution
  • FD-MIMO full-dimensional MIMO
  • Massive MIMO may be used to achieve a better spectrum efficiency.
  • layer mapping is performed according to Table 6.3.3.2-1 of the TS36.211 ver.c3 protocol, as illustrated in the table below.
  • the number of codewords for one user is limited to 1 or 2.
  • Table 1 Codeword-to-layer mapping for spatial multiplexing
  • the maximum number of codewords for each user is 2, and the maximum number of layers mapped to one codeword is 4.
  • the maximum number of layers supported by each eNodeB will also increase, the maximum number of layers corresponding to each codeword and the maximum number of codewords for each user will also possibly increase.
  • the current layer mapping method cannot handle this situation. Meanwhile, because valid channel qualities between different layers are different, particularly for a spatial correlated wireless channel, the lower rank layers usually have better channel quality than the higher rank layers.
  • the present invention proposes a new method for layer mapping, which may adapt to the situation of increased number of codewords and layers and meanwhile may well adapt the channel quality inequality between different layers.
  • the present invention provides methods and apparatuses for downlink layer mapping and layer demapping applied on a wireless communication system according to a high-order MIMO LTE protocol.
  • a method for layer mapping of data blocks in a LTE protocol-based base station wherein a number of data blocks is q, a number of layers is v, where 1 - v i a number of symbols in each layer is m, wherein the method comprises:
  • mapping (q -v%q) + 1 ⁇ y ⁇ v , according to a value of the y element J y of a second mapping element set , mapping
  • a value of each element is an integer value ging [1, v] and different from one anothe
  • a value of each element is an integer value ranging [1, v] and different from one another;
  • an apparatus for layer mapping of data blocks in a LTE protocol-based base station wherein a number of data blocks is q, a number of layers is v, where 1 - v i a number of symbols in each layer is m, wherein the apparatus comprises:
  • - apping module configured to: from ⁇ v data blocks in q data blocks, obtain
  • a value of each element is an integer value ranging [1, v] and different from one another;
  • mapping module repeats the step for m times.
  • a demapping module configured to: for each element in a first mapping element set
  • v elements for the elements in the first mapping element set and the elements in the second mapping element set , respectively, a value of each element is an integer value ranging [1, v] and different from one another;
  • the demapping module repeats the step for m times.
  • the present invention has the following advantages: after the wireless communication system uses a high-order MIMO, the number of antenna ports increases possibly from 8 to 64 or more; therefore, the maximum number of layers of each eNodeB also possibly increases from the current 8 to 64 or more; a single user will have more code streams due to a higher throughput, and the maximum number of codewords possibly increases from 2 to 8 or more.
  • the layer mapping scheme proposed in the present invention can be well adapted to various situations with increased number of layers and codewords, such that the wireless communication system with a high order MIMO can have a better performance, and meanwhile may also be compatible with the layer mapping scheme in the current protocol.
  • Fig. 1 illustrates a schematic diagram of downlink physical layer channel processing in a LTE protocol-based base station
  • FIG. 2 illustrates a flow diagram of a method for layer mapping of data blocks in a LTE protocol-based base station according to one aspect of the present invention
  • FIG. 3 illustrates an exemplary diagram of symbols for data blocks mapped onto a symbol position of the layers according to the layer mapping method of the present invention
  • FIG. 4 illustrates an exemplary diagram of a preferred embodiment of a layer mapping method of the present invention exploiting an unequal error protection policy
  • FIG. 5 illustrates an exemplary diagram of a preferred embodiment of a layer mapping method of the present invention exploiting an equal error protection policy
  • FIG. 6 illustrates a flow diagram of a method for layer demapping in a LTE protocol-based user equipment to obtain data blocks according to another aspect of the present invention
  • Fig. 7 illustrates an exemplary diagram of demapping signals at a symbol position of layers to symbols of data blocks according to the layer demapping method of the present invention
  • FIG. 8 illustrates a schematic diagram of an apparatus for layer mapping of data blocks in a LIE protocol-based base station according to one aspect of the present invention
  • FIG. 9 illustrates a schematic diagram of an apparatus for layer demapping in a LTE protocol-based user equipment to obtain data blocks according to another aspect of the present invention.
  • exemplary embodiments may have various modified and alternative manners, one some embodiments thereof are illustrated exemplarily, which will be described in detail here. However, it should be understood that the exemplary embodiments are not intended to be limited to the disclosed specific forms; on the contrary, the exemplary embodiments are intended to cover all modifications, equivalent solutions, and alternative solutions within the scope of the claims. Same reference numerals constantly refer to same units in depiction of respective drawings.
  • wireless device or “device” used here may be regarded as synonymous to and will be sometimes referred to hereinafter as the following items: client, user equipment, mobile station, mobile user, mobile terminal, subscriber, user, remote station, access terminal, receiver, mobile unit, etc., which may also describe a remote user of wireless resources in a wireless communication network.
  • the term "base station” used here may be regarded as synonymous to and will be sometimes referred to hereinafter as the following items: node B, evolved node B, eNodeB, transceiver base station (BTS), RNC, etc, which may describe a transceiver that communicates with a mobile terminal and provide radio resources thereto in a wireless communication network that may span a plurality of technology generations. Besides the capability implemented by the method discussed here, the base station as discussed may have all functions associated with traditional well-known base stations. [26]
  • the methods discussed infra may be implemented through hardware, software, firmware, middleware, microcode, hardware description language or any combination thereof. When they are implemented with software, firmware, middleware or microcode, the program code or code segment for executing essential tasks may be stored in a machine or a computer readable medium (e.g., storage medium). (One or more) processors may implement essential tasks.
  • the program module or function processing comprises a routine, program, object, assembly and data structure and the like that implements a specific task or implements a specific abstract data type, and may be implemented using existing hardware at the existing network unit.
  • Such existing hardware may comprise one or more central processing units (CPUs), a digital signal processor (DSP), an application-specific integrated circuit, and a field programmable gate array (FPGA) computer, etc.
  • the software-implemented aspects of the exemplary embodiments are usually encoded on a certain form of program storage medium or implemented by a certain kind of transmission medium.
  • the program storage medium may be magnetic (e.g., floppy disk or hard disk driver) or optical (e.g., compact disk read-only storage memory or "CD-ROM”), and may be read-only or random access storage medium.
  • the transmission medium may be twisted pair, co-axial cable, optical fiber or some other appropriate transmission medium known in the art.
  • the exemplary embodiments are not limited to any of these aspects with given embodiments.
  • the processor and memory may operate together to run functions of the apparatus.
  • the memory may store code segments about the apparatus functions.
  • the code segments may also be executed by the processor.
  • the memory may store processing variables and constants for the processor to use.
  • Fig. 1 illustrates a schematic diagram of downlink physical channel processing in a LTE protocol-based base station.
  • the schematic diagram comes from the 3GPP TS36.211 protocol.
  • Input processed by the physical channel is codeword, i.e., the data block or data flow pre-processed by encoding and rate matching in transport channel. Because the number of codewords is unequal to the number of layers, the codewords, after scrambling and modulation processing, need to be subjected to layer mapping processing so as to map the codewords onto the layers.
  • the base station performs processing of precoding, physical resource mapping, generating OFDM symbols.
  • the layer mapping method and apparatus provided by the present invention may be applied to processing of the layer mapping portion in Fig.
  • the demapping method and apparatus are a reversed procedure with respect to layer mapping.
  • the layer mapping input is the codeword after scrambling and modulation, i.e., a data block or data stream comprised of to-be-mapped symbols.
  • a data block is used as an example of layer mapping input signal, and other possible data blocks or data streams as input signals, if applicable to the present invention, should also be included within the protection scope of the present invention.
  • Fig. 2 illustrates a flow diagram of a method for layer mapping of data blocks in a LTE protocol-based base station according to one aspect of the present invention, wherein the number of data blocks is q, and the number of layers is v, where 1 - v i the number of symbols in each layer is m. As illustrated in Fig. 2, the method comprises step S21 and step S22.
  • step S21 from v ⁇ 0 ⁇ i data blocks in q data blocks, obtaining first to-be-mapped symbols of each data block, and for each symbol S x in the obtained (q -v%q) to-be-mapped symbols
  • a value of each element is an integer value ranging [1, v] and different from one another;
  • % is a modular operation, rounding operation
  • the step is a procedure of extracting data from data blocks and according to an indication of a position mapping vector, mapping the data onto a next not-yet-mapped position of the layer.
  • the q ⁇ v %q data blocks in the q data blocks may be q ⁇ v %q data blocks of any index value in q data blocks, which may be determined as agreed between the base station and the user equipment.
  • [46] 4 to-be-mapped symbols are obtained in total from data block 1 and data block 3.
  • the 4 to-be-mapped symbols are expressed as [SI, S2, S3, S4] .
  • the first mapping element set [Jl, J2, J3, J4] [l,2,3,4], then according to the value of Jl in [Jl, J2, J3, J4] being 1, the symbol SI is mapped to a signal of the 1 st layer at the not-yet-mapped symbol position in the layer; likewise, S2 is mapped to the signal of the 2 nd layer according to the value of J 2 being 2, S3 is mapped to a signal of the 3 layer according to the value of J 3 being 3, and S4 is mapped to a signal of the 4 th layer according to the value of J 4 being 4.
  • V data blocks refer to remaining data blocks after having obtained the ⁇ v ⁇ data blocks of the data in the q data blocks.
  • the second mapping element set [J 5 , J 6 ,...
  • Fig. 3 illustrates an exemplary diagram of symbols for data blocks mapped onto a symbol position of the layers according to the layer mapping method of the present invention.
  • data block 1 and data block 3 are selected for the ( 1 ⁇ V / ° ( 1 data blocks, the first mapping element set is [1, 2, 3, 4], the second mapping element set is [5, 6, 10], S 1 1 ,S 2 1 ,... represent symbols of data block 1, S 1 2 ,S 2 2 ,S 3 2 ,. " represent symbols of data block 2, S ⁇ 2 ⁇ 2 ,... represent symbols of data block 4.
  • step S21 as illustrated in Fig.
  • S2 ! 1 is mapped to a signal of the 2 nd layer at the to-be-mapped symbol position of the layer
  • S 2 3 are mapped to signals of the 3 rd and 4 th layers at the to-be-mapped symbol positions of the layers
  • S! 2 ,S2 2 ,S 3 2 S! 4 ,S2 4 ,S 3 4 are signals of the 5 th - 10 th layers of the to-be-mapped symbol position of the layers.
  • the ⁇ - 17 "/ 0 ⁇ data blocks are first ⁇ - 17 "/ 0 ⁇ data blocks in the q data blocks, and the V data blocks are last v ⁇ 0 ⁇ data blocks in the q data blocks.
  • selection is made from the first one according to the index values of the q data blocks; when selecting the ⁇ data blocks, select the last ⁇ data blocks according to the index values of the q data blocks.
  • the procedures of layer mapping and layer demapping may be performed according to the above agreement at the base station transmitting side and the user equipment receiving side of the wireless communication system.
  • the present invention comprises a step of determining a position mapping vector [J 1( J 2 , JJ.
  • the elements in the position mapping vector [J 1( J 2 , J tent] are elements from the first mapping
  • the position mapping vector [Ji, J 2 , J Formula] may be completely generated as agreed between the base station and the user equipment in the communication system, and then the layer mapping and layer demapping procedures may be performed according to the manner above.
  • step S22 step S21 is repeated for m times, m denotes the number of symbols in each layer.
  • m denotes the number of symbols in each layer.
  • each layer comprises m symbols.
  • Step S21 is to complete mapping of v symbols obtained in the data block to a position of one symbol of the v layers.
  • Step S22 is to repeat step S21 for m times, such that respective symbols in the data blocks are mapped onto positions of m symbols of respective layers.
  • a valid channel quality of a designated layer is decided by an effective power of the layer.
  • Valid channel qualities between different layers are different, particularly for spatial correlated wireless channels.
  • a layer with a smaller index value usually has a better channel quality than a layer with a larger index value. This inequity between different layers will become more apparent in the high order MIMO. Therefore, the position mapping vector is related to the whole system performance.
  • the present invention provides two preferred embodiments of determining a position mapping vector: a layer mapping scheme employing a UEP (Unequal Error Protection) policy, and a layer mapping scheme employing an EEP (Equal Error Protection) policy.
  • to-be-mapped symbols from q data blocks are obtained according to the following manner: the Q ⁇ /oQ ⁇ aia blocks obtained from q data blocks are first Q v data blocks in the q data blocks, and the data blocks obtained from q data blocks are last " data blocks in the q data blocks.
  • the layer mapping method according to the present invention may adopt the unequal error protection (UEP) policy, which is illustrated in detail below:
  • UEP unequal error protection
  • the layer mapping scheme adopting the unequal error protection (UEP) policy is to maintain the position mapping vector J 2 , J Formula] unchanged during a layer mapping process.
  • the position mapping vector J 2 , J suitcase] is always a vector with a fixed value
  • the symbols in the data blocks are mapped onto a fixed index layer.
  • Symbols of data blocks transmitted on a layer with a smaller fixed index value will have a better channel quality. Therefore, unequal error protection is implemented between different data blocks.
  • a high-layer scheduler may use this unequal error protection characteristic and allocate data blocks with different channel quality requirements to be transmitted on different layers so as to obtain performance benefits.
  • the HARQ retransmission signal with high order modulation need high transmission channel quality.
  • the scheduler may allocate the HARQ retransmission signal with high order modulation on a data block corresponding to a layer with a low index value.
  • the position mapping vector [J ⁇ J 2 , J235] is a preferred embodiment of the solution. If the position mapping vector [J ⁇ J 2 , J235] is [1, 2, v], the data block with a lower index value is fixedly mapped to a layer with a lower index value. This manner can be compatible with the current LTE protocol; meanwhile, the solution of the present invention may also support high-order MIMO, and various situations wherein the numbers of data blocks and layers increase compared with the existing protocols.
  • the manner of obtaining the to-be-mapped symbols [S lt S2, S 8 ] from the three data blocks is: obtaining two to-be-mapped symbols from data block 1; obtaining 3 to-be-mapped symbols from data block 2 and data block 3, respectively.
  • S 1 1 ,S 2 1 ,... represent symbols in data block 1
  • S ! 2 ,S 2 2 ,S 3 2 ,... represent symbols in data block 2
  • S ! 3 ,S 2 3 ... represent symbols in data block 3.
  • the position mapping vector [J ⁇ J 2 , JJ is fixed to be [1, 2, 8].
  • the signals in respective layers shown in Fig. 4 are results from mapping the to-be-mapped symbols in the data blocks to symbol positions in the layers according to the layer mapping method adopting the unequal error protection policy.
  • the layer mapping solution according to the present invention may also employ an equal error protection (EEP) policy, which is specifically explained below:
  • EEP equal error protection
  • the UE needs to feed back an independent CQI (Channel Quality Indication) information to each data block; once the resource scheduling manner is changed, the previous reported CQI will be invalidated (e.g., random resource schedule).
  • CQI Channel Quality Indication
  • the CQI feedback signal of the UE will be invalidated, thereby degrading the performance of the whole system. Therefore, it is expected to generate a position mapping vector that enables to-be-mapped symbols in all data blocks to be evenly distributed onto different layers so as to achieve the effect of equal error protection EEP.
  • the position mapping vector J 2 , JJ is determined based on the position mapping vector [ , J' 2 , J'J determined in the last time, wherein the position mapping vector [J ⁇ J 2 , JJ is [( ⁇ +1)% ⁇ , (J' 2 +l)%v (J' v +l)%v].
  • the position mapping vector J 2 , JJ is [1, 2, v]; then the position mapping vector J 2 , JJ at the second symbol position of the layer is [2, 3, v, 1]; the position mapping vector J 2 , JJ at the third symbol position of the layer is [3, 4, v, 1, 2]; ....
  • the position mapping vector J 2 , J 8 ] is [4, 3, 1, 2, 5, 6, 7, 8]
  • the position mapping vector J 2 , J 8 ] of the second symbol position of the layer is [5,4,2,3,6,7,8,1]
  • the position mapping vector !, J 2 , J 8 ] of the third symbol position of the layer is [6,5,3,4,7,8,1,2], ....
  • symbols in respective data blocks may be evenly rotated onto each layer.
  • An advantage of the layer mapping solution adopting the equal error protection policy according to the present invention lies in evenly rotating symbols in all data blocks onto each layer within a measurement and feedback interval (e.g., CQI reporting interval) of a UE. If the maximum number of layers increases to 64, the minimum rotation cycle as needed is the time for symbols mapped to 64 to-be-mapped layers, which is far less than the minimum CQI reporting interval. Therefore, in the embodiment solution the probability for symbols in the data blocks mapped onto each layer is identical to each layer. This means the reported CQI based on the channel condition of one layer may also be applicable to other layers. In this way, the scheduler does not need to differentiate the reported CQI values of respective different layers when symbols of the same data block are mapped onto different layers. This is a major advantage of the layer mapping solution adopting the equal error protection policy. The reported CQI values of the UE are still valid even for a dynamic resource scheduling scheme, which thereby simplifies the design scheme of the feedback and scheduling mechanism of the whole system.
  • CQI reporting interval
  • the manner of obtaining the to-be-mapped symbols [S lt S2, S 8 ] from the three data blocks is: obtaining two to-be-mapped symbols from data block 1; obtaining 3 to-be-mapped symbols from data block 2 and data block 3, respectively.
  • S 1 1 ,S 2 1 , S3 1 ... represent symbols in data block 1, S ! 2 ,S 2 2 ,S 3 2 ,... represent symbols in data block 2; S ⁇ S ⁇ , S 3 3 ... represent symbols in data block 3.
  • the position mapping vector [i lt J 2 , J 8 ] of layer mapping for the first time is [1, 2, 3, 4, 5, 6, 7, 8].
  • the position vectors J 2 , J 8 ] for subsequently multiple times of layer mapping are [2,3,4,5,6,7,8,1], [3,4,5,6,7,8,1,2],....
  • the signals in respective layers shown in Fig. 5 are results from mapping the to-be-mapped symbols of the data blocks onto the symbol positions in the layers according to the layer mapping method adopting the equal error protection policy.
  • Fig. 6 illustrates a flow diagram of a method for layer demapping in a LTE protocol-based user equipment to obtain data blocks according to another aspect of the present invention. Particularly, a number of data blocks is q, a number of layers is v, where 1 - v i a number of symbols in each layer is m. As illustrated in Fig. 6, the method comprises step S61 and step S62.
  • step S61 for each element in a first mapping element set l ⁇ x ⁇ (q - v%q)
  • a value of each element is an integer value ranging [1, v] and different from one another;
  • the V ⁇ oC l data blocks in q data blocks may be q V%q data b
  • the layer demapping is performed according to the value of J x : finding a to-be-demapped signal C jx of the J x layer according to the value of J x , placing the signal C jx at a tail of the data block.
  • a tail of the each data block refer to positions for symbols continued with the last placed symbols at the tail of each data block.
  • the first mapping element set [J ⁇ J 2 , J 3 , J 4 ] [3,4,2,l].
  • the layer demapping procedure comprises: according to the value of Jl in [J ⁇ J 2 , J 3 , J 4 ] being 3, placing signal C 3 in the 3 layer at a not-yet-placed position at a tail of the data block 1; according to the value of J 2 being 4, placing signal C4 in the 4 th layer at a not-yet-placed position at a tail of the data block 1, i.e., placing at a continued position following the position of C 3 placed; according to the value of J 3 being 2, placing signal C2 in the 2 nd layer at a not-yet-placed position at a tail of data block 3; according to a value of J 4 being 1, placing the signal C x in the first layer to a not-yet-placed position at a tail of the data block 3, i.e., placing at a continued position following the position of C 2 placed.
  • the remaining ⁇ v / ° i Z data blocks in the q data blocks are data blocks remained after the ⁇ v / ° i Z with symbols having been placed in q data blocks, which are determined by the base station and the user equipment as agreed, and then the index values of the remaining v ° ⁇ data blocks are determined.
  • the layer demapping is performed according to the value of J y : finding the to-be-demapped signal C Jy of the J y layer according to the value of J y , and placing the signal C Jy at a tail of the v"/o( l data blocks.
  • not-yet-placed positions at a tail of each data block refer to positions for symbols following the last placed symbols at a tail of each data block.
  • the remaining v%q data blocks in q data blocks are remaining data block 2 and data block 4.
  • the second mapping element set [J 5 , The layer de-mapping procedure comprises: according to the value of J 5 in [J 5 , J 6 ,..J 10 ] being 8, placing signal C 8 in the eighth layer onto a not-yet-placed position at the tail of data block 2; according to the value of J 6 in [J 5 , J 6 ,..J 10 ] being 9, placing signal C 9 in the ninth layer onto a not-yet-placed position at the tail of data block 2, i.e., placing at continued position after the position of Qplaced; according to the value of J 7 in [J 5 , J 6 ,...J 10 ] being 10, placing signal C 10 in the tenth layer onto a not-yet-placed position at the tail of data block 2, i.e., placing at continued position after the position of C 9 placed; according to the value of J 8 in [J 5 , J 6 ,...J 10 ] being 5, placing signal C 5 in the fifth layer onto a not-yet
  • Fig. 7 illustrates an exemplary diagram of demapping signals at a symbol position of layers to symbols of data blocks according to the layer demapping method of the present invention.
  • data block 1 and data block 3 are selected for the Q v 0( 1 data blocks, while data block 2 and data block 4 are selected for the remaining data blocks.
  • the first mapping element set and the second mapping element set [J 5 ,J 6 ,...Jio] [5,6,7,8,9,10].
  • [0 ⁇ 2 , ...» C 10 ] refers to signals to-be-layer-demapped on a symbol position in layers.
  • the procedure of layer-demapping comprises: according to a value of Jl in the first mapping element set [J1J2J3J4] being 1, placing signal CI in the first layer onto a not-yet-placed position at a tail of data block 1; according to a value of J 2 being 2, placing signal C 2 in the second layer onto a not-yet-placed position at a tail of the data block 1, i.e., placing it onto the continued position following the position of C x placed; according to a value of J 3 being 3, placing signal C 3 in the third layer onto a not-yet-placed position at a tail of the data block 3; according to a value of J 4 being 4, placing signal C 4 in the fourth layer onto a not-yet-placed position at a tail of the data block 3, i.e., placing it onto the continued position following the position of C 3 placed.
  • the Q ⁇ v0//o( l data blocks are first ⁇ - ⁇ 0 ? data blocks in the q data blocks, and the V data blocks are last data blocks in the q data blocks.
  • the procedures of layer mapping and layer demapping may be performed according to the above agreement at the base station transmitting side and the user equipment receiving side of the wireless communication system.
  • the elements in the second mapping element set decide the positions of layer demapping symbols in the data blocks. Because the symbols in the data blocks cannot be demapped more than once and the demapping procedure is performed based on values of the elements, the values of elements J 1( J 2 ,..., J v are different from one another and are integer values ranged within [1, v].
  • the present invention comprises a step of determining a position mapping vector [J 1( J 2 , JJ.
  • the elements in the position mapping vector [J 1( J 2 , J tract] are elements from the first mapping element set and elements from the second mapping element set
  • the position mapping vector [Ji, J 2 , J Formula] may be completely generated as agreed between the base station and the user equipment in the communication system, and then the layer mapping and layer demapping procedures may be performed according to the manner above.
  • Step S62 repeats step S61 for m times, "m” denotes the number of symbols in each layer.
  • each layer comprises m symbols.
  • Step S61 is to complete layer demapping of v signals on one symbol position in v layers onto q data blocks.
  • Step S62 is to repeat step S61 for m times, so as to layer demap signals on m symbols positions of v layers onto q data blocks.
  • Fig. 8 illustrates a schematic diagram of an apparatus for layer mapping of data blocks in a LTE protocol-based base station according to one aspect of the present invention.
  • the number of data blocks is q
  • the number of layers is v, where 1 - v i the number of symbols in each layer is m.
  • the apparatus comprises a mapping module.
  • the processing proces of the mapping module comprises: from ⁇ v / ° i Z data blocks in q
  • a value of each element is an integer value ranging [1, v] and different from one another;
  • % is a modular operation, rounding operation
  • the mapping module performs processing including: extracting data from data blocks and according to an indication of a position mapping vector, mapping the data onto a next not-yet-mapped position of the layer.
  • the ⁇ - 17 "/ 0 ⁇ data blocks in the q data blocks may be ⁇ - 17 "/ 0 ⁇ data blocks of any index value in q data blocks, which may be determined as agreed between the base station and the user equipment.
  • V data blocks refer to remaining data blocks after having obtained the Q v ⁇ 0 ⁇ data blocks of the data in the q data blocks.
  • the second mapping element set [J 5 , J 6 ,...
  • Fig. 3 illustrates an exemplary diagram of layer mapping, by the layer mapping apparatus according to the present invention, symbols for data blocks onto a symbol position of the layers.
  • data block 1 and data block 3 are selected for the ( l ⁇ v ' / ° ( l data blocks, the first mapping element set is [1, 2, 3, 4], the second mapping element set is [5, 6, 10], S 1 1 ,S 2 1 ,... represent symbols of data block 1, S ⁇ 2 ⁇ 2 ,... represent symbols of data block 2, S! 2 ,S2 2 ,S 3 2 ,... represent symbols of data block 4.
  • step S21 as illustrated in Fig.
  • S ⁇ is mapped to a signal of the 1 st layer at a to-be-mapped symbol position of the layer
  • S2! 1 is mapped to a signal of the 2 nd layer at the to-be-mapped symbol position of the layer
  • S ⁇ and S 2 3 are mapped to signals of the 3 rd and 4 th layers at the to-be-mapped symbol positions of the layers
  • S ⁇ 2 ⁇ 2 S! 4 ,S2 4 ,S 3 4 are signals of the 5 th - 10 th layers of the to-be-mapped symbol position of the layers.
  • the Q ⁇ v0//o( l data blocks are first Q ⁇ v0//o( l data blocks in the q data blocks, and the V data blocks are last v ⁇ 0 ⁇ data blocks in the q data blocks.
  • selection is made from the first one according to the index values of the q data blocks; when selecting the ⁇ data blocks, select the last ° ⁇ data blocks according to the index values of the q data blocks.
  • the procedures of layer mapping and layer demapping may be performed according to the above agreement at the base station transmitting side and the user equipment receiving side of the wireless communication system.
  • elements in the second mapping element set decide the positions of mapping symbols in the data blocks to layer signals. Because the symbols in the data blocks cannot be mapped more than once and the mapping procedure is performed based on values of the elements, the values of elements i lt J 2 ,..., J v are different from one another and are integer values ranged within [1, v].
  • the apparatus for layer mapping according to the present invention further comprises a module configured to determine a position mapping vector J 2 , Jj.
  • the elements in the position mapping vector J 2 , J suitcase] are elements from the first mapping element set
  • the position mapping vector [Ji, J 2 , J Formula] may be completely generated as agreed between the base station and the user equipment in the communication system, and then the layer mapping and layer demapping procedures may be performed according to the manner above.
  • the processing process of the mapping module is repeated for m times, m denotes the number of symbols in each layer.
  • each layer comprises m symbols.
  • One processing process of the mapping module is to complete mapping of v symbols obtained in the data block to a position of one symbol of the v layers.
  • the processing process of the mapping module is repeated for m times, such that respective symbols in the data blocks are mapped onto positions of m symbols of respective layers.
  • a valid channel quality of a designated layer is decided by an effective power of the layer.
  • Valid channel qualities between different layers are different, particularly for spatial correlated wireless channels.
  • a layer with a smaller index value usually has a better channel quality than a layer with a larger index value. This inequity between different layers will become more apparent in the high order MIMO. Therefore, the position mapping vector is related to the whole system performance.
  • the present invention provides two preferred embodiments of determining a position mapping vector: a layer mapping scheme employing a UEP (Unequal Error Protection) policy, and a layer mapping scheme employing an EEP (Equal Error Protection) policy.
  • to-be-mapped symbols from q data blocks are obtained according to the following manner: the Q ⁇ /oQ ⁇ aia blocks obtained from q data blocks are first Q v data blocks in the q data blocks, and the data blocks obtained from q data blocks are last " data blocks in the q data blocks.
  • the layer mapping apparatus may adopt the unequal error protection (UEP) policy, which is illustrated in detail below:
  • UDP unequal error protection
  • the layer mapping apparatus adopting the unequal error protection (UEP) policy is an apparatus to maintain the position mapping vector J 2 , J Formula] unchanged during a layer mapping process.
  • the position mapping vector J 2 , J Cosmetic] is always a vector with a fixed value, the symbols in the data blocks are mapped onto a fixed index layer. Symbols of data blocks transmitted on a layer with a smaller fixed index value will have a better channel quality. Therefore, unequal error protection is implemented between different data blocks.
  • a high-layer scheduler may use this unequal error protection characteristic and allocate data blocks with different channel quality requirements to be transmitted on different layers so as to obtain performance benefits. For example, the HARQ retransmission signal with high order modulation need high transmission channel quality. The scheduler may allocate the HARQ retransmission signal with high order modulation on a data block corresponding to a layer with a low index value.
  • An apparatus for position mapping a vector J 2 , J Formula (2) to [1, 2, v] is a preferred embodiment of the apparatus above. If position mapping the vector J 2 , J235]to[l, 2, v], the data block with a lower index value is fixedly mapped to a layer with a lower index value.
  • This apparatus can be compatible with the current LTE protocol; meanwhile, the apparatus of the present invention may also support high-order MIMO, and various situations wherein the numbers of data blocks and layers increase compared with the existing protocols.
  • the manner of obtaining the to-be-mapped symbols [S lt S2, S 8 ] from the three data blocks is: obtaining two to-be-mapped symbols from data block 1; obtaining 3 to-be-mapped symbols from data block 2 and data block 3, respectively.
  • S 1 1 ,S 2 1 ,... represent symbols in data block 1
  • S ! 2 ,S 2 2 ,S 3 2 ,... represent symbols in data block 2
  • S ⁇ S ⁇ ,... represent symbols in data block 3.
  • the position mapping vector [J ⁇ J 2 , JJ is fixed to be [1, 2, 8] .
  • the signals in respective layers shown in Fig. 4 are results from mapping the to-be-mapped symbols in the data blocks to symbol positions in the layers in the layer mapping apparatus adopting the unequal error protection policy.
  • the layer mapping apparatus may also employ an equal error protection (EEP) policy, which is specifically explained below:
  • EEP equal error protection
  • the UE needs to feed back an independent CQI (Channel Quality Indication) information to each data block; once the resource scheduling manner is changed, the previous reported CQI will be invalidated (e.g., random resource schedule).
  • CQI Channel Quality Indication
  • the CQI feedback signal of the UE will be invalidated, thereby degrading the performance of the whole system. Therefore, it is expected to generate a position mapping vector that enables to-be-mapped symbols in all data blocks to be evenly distributed onto different layers so as to achieve the effect of equal error protection EEP.
  • the position mapping vector [J ⁇ J 2 , JJ is determined based on the position mapping vector [ , J' 2 , J' determined in the last time, wherein the position mapping vector (J' 2 +l)%v (J' v +l)%v].
  • the position mapping vector J 2 , JJ is [1, 2, v]; then the position mapping vector J 2 , JJ at the second symbol position of the layer is [2, 3, v, 1]; the position mapping vector J 2 , JJ at the third symbol position of the layer is [3, 4, v, 1, 2]; ....
  • the position mapping vector J 2 , J 8 ] is [4, 3, 1, 2, 5, 6, 7, 8]
  • the position mapping vector J 2 , J 8 ] of the second symbol position of the layer is [5,4,2,3,6,7,8,1]
  • the position mapping vector !, J 2 , J 8 ] of the third symbol position of the layer is [6,5,3,4,7,8,1,2], ....
  • symbols in respective data blocks may be evenly rotated onto each layer.
  • An advantage of the layer mapping apparatus adopting the equal error protection policy according to the present invention lies in evenly rotating symbols in all data blocks onto each layer within a measurement and feedback interval (e.g., CQI reporting interval) of a UE. If the maximum number of layers increases to 64, the minimum rotation cycle as needed is the time for symbols mapped to 64 to-be-mapped layers, which is far less than the minimum CQI reporting interval. Therefore, in the embodiment solution the probability for symbols in the data blocks mapped onto each layer is identical to each layer. This means the reported CQI based on the channel condition of one layer may also be applicable to other layers. In this way, the scheduler does not need to differentiate the reported CQI values of respective different layers when symbols of the same data block are mapped onto different layers. This is a major advantage of the layer mapping solution adopting the equal error protection policy. The reported CQI values of the UE are still valid even for a dynamic resource scheduling scheme, which thereby simplifies the design scheme of the feedback and scheduling mechanism of the whole system.
  • CQI reporting interval
  • FIG. 5 illustrates an exemplary diagram of a preferred embodiment of a layer mapping apparatus exploiting an equal error protection policy accordin to the resent invention.
  • the manner of obtaining the to-be-mapped symbols [S ⁇ S2, S 8 ] from the three data blocks is: obtaining two to-be-mapped symbols from data block 1; obtaining 3 to-be-mapped symbols from data block 2 and data block 3, respectively.
  • S 1 1 ,S 2 1 , S3 1 ... represent symbols in data block 1, S 1 2 ,S 2 2 ,S 3 2 ,. " represent symbols in data block 2;
  • S ⁇ S ⁇ , S 3 3 ... represent symbols in data block 3.
  • the position mapping vector [J 1( J 2 , J 8 ] of layer mapping for the first time is [1, 2, 3, 4, 5, 6, 7, 8].
  • the position vectors [J 1( J 2 , J 8 ] for subsequently multiple times of layer mapping are [2,3,4,5,6,7,8,1], [3,4,5,6,7,8,1,2],....
  • the signals in respective layers shown in Fig. 5 are results from mapping the to-be-mapped symbols of the data blocks onto the symbol positions in the layers in the layer mapping apparatus adopting the equal error protection policy.
  • Fig. 9 illustrates a schematic diagram of an apparatus for layer demapping in a LTE protocol-based user equipment to obtain data blocks according to another aspect of the present invention. Particularly, a number of data blocks is q, a number of layers is v, where 1 - v i a number of symbols in each layer is m. As illustrated in Fig. 9, the apparatus comprises a demapping module.
  • the processing procedure of the dema ping module includes: for each element in a
  • first mapping element set according to a value of x element J l ⁇ x ⁇ (q -v%q)
  • v elements there are totall v elements for the elements in the first mapping element and the elements in the second mapping element set , respectively, a value of each element is an integer value ranging [1, v] and different from one another;
  • the V /o ⁇ data blocks in q data blocks may be q v%q data blocks of any index values in the data blocks, which are determined by the base station and the user equipment as agreed.
  • the layer demapping is performed according to the value of J x : finding a to-be-demapped signal C jx of the J x layer according to the value of J x , placing the signal C jx at a tail of the data block. The consecutive not-yet-placed positions at
  • a tail of the each data block refer to positions for symbols continued with the last placed symbols at the tail of each data block.
  • the first mapping element set J 2 , J 3 , J 4 ] [3,4,2,l].
  • the layer demapping procedure comprises: according to the value of Jl in J 2 , J 3 , J 4 ] being 3, placing signal C 3 in the 3 layer at a not-yet-placed position at a tail of the data block 1; according to the value of J 2 being 4, placing signal C4 in the 4 th layer at a not-yet-placed position at a tail of the data block 1, i.e., placing at a continued position following the position of C 3 placed; according to the value of J 3 being 2, placing signal C2 in the 2 nd layer at a not-yet-placed position at a tail of data block 3; according to a value of J 4 being 1, placing the signal C x in the first layer to a not-yet-placed position at a tail of the data block 3, i.e., placing at a continued position following the position of C 2 placed.
  • the remaining ⁇ v / ° i Z data blocks in the q data blocks are data blocks remained after the ⁇ v / ° i Z with symbols having been placed in q data blocks, which are determined by the base station and the user equipment as agreed, and then the index values of the remaining v ⁇ data blocks are determined.
  • the layer demapping is performed according to the value of J y : finding the to-be-demapped signal C jy of the J y layer according to the value of J y , and placing the signal C jy at a tail of the v"/o( l data blocks.
  • the consecutive not-yet-placed positions at a tail of each data block refer to positions for symbols following the last placed symbols at a tail of each data block.
  • the remaining v%q data blocks in q data blocks are remaining data block 2 and data block 4.
  • the processing procedure of the demapping module comprises: according to the value of J 5 in [J 5 , J 6 ,..J 10 ] being 8, placing signal C 8 in the eighth layer onto a not-yet-placed position at the tail of data block 2; according to the value of J 6 in [J 5 , J 6 ,..J 10 ] being 9, placing signal C 9 in the ninth layer onto a not-yet-placed position at the tail of data block 2, i.e., placing at continued position after the position of C 8 placed; according to the value of J 7 in [J 5 , J 6 ,...J 10 ] being 10, placing signal C 10 in the tenth layer onto a not-yet-placed position at the tail of data block 2, i.e., placing at continued position after the position of C 9 placed; according to the value of J 8 in [J 5 , J 6 ,..J 10 ] being 85, placing signal C 5 in the fifth layer onto a not-y
  • data block 1 and data block 3 are selected for the ⁇ v /°3 ⁇ 4 f data blocks, while data block 2 and data block 4 are selected for the remaining v / °3 ⁇ 4 r data blocks.
  • the first mapping element set and the second mapping element set [J 5 ,J 6 ,...Jio] [5,6,7,8,9,10].
  • [C ⁇ Q, ...» C 10 ] refers to signals to-be-layer-demapped on a symbol position in layers.
  • the processing procedure of the layer demapping apparatus comprises: according to a value of Jl in the first mapping element set [Ji,J 2 ,J 3 ,J 4 ] being 1, placing signal CI in the first layer onto a not-yet-placed position at a tail of data block 1; according to a value of J 2 being 2, placing signal C 2 in the second layer onto a not-yet-placed position at a tail of the data block 1, i.e., placing it onto the continued position following the position of C x placed; according to a value of J 3 being 3, placing signal C 3 in the third layer onto a not-yet-placed position at a tail of the data block 3; according to a value of J 4 being 4, placing signal C 4 in the fourth layer onto a not-yet-placed position at a tail of the data block 3, i.e., placing it onto the continued position following the position of C 3 placed.
  • the ⁇ - ⁇ 0 ? data blocks are first ⁇ - ⁇ 0 ? data blocks in the q data blocks, and the V data blocks are last v ⁇ data blocks in the q data blocks.
  • selection is made from the first one according to the index values of the q data blocks; when selecting the ⁇ data blocks, select the last ⁇ data blocks according to the index values of the q data blocks.
  • the procedures of layer mapping and layer demapping may be performed according to the above agreement at the base station transmitting side and the user equipment receiving side of the wireless communication system.
  • the elements in the first mapping element set and the elements in the second mapping element set decide the positions of layer demapping symbols in the data blocks. Because the symbols in the data blocks cannot be demapped more than once and the demapping procedure is performed based on values of the elements, the values of elements
  • J 2 ,..., J Web are different from one another and are integer values ranged within [1, v].
  • the layer demapping apparatus further comprises a module configured to determine a position mapping vector J 2 , Jj.
  • the elements in the position mapping vector J 2 , Jont] are elements from the first mapping element set -v and elements from the second mapping element set
  • the position mapping vector [Ji, J 2 , J Formula] may be completely generated as agreed between the base station and the user equipment in the communication system, and then the layer mapping and layer demapping procedures may be performed according to the manner above.
  • the processing procedure of the demapping module is repeated for m times, "m” denotes the number of symbols in each layer.
  • each layer comprises m symbols.
  • the processing process of the demapping module is to complete layer demapping of v signals on one symbol position in v layers onto q data blocks.
  • the processing process of the demapping module is repeated for m times, so as to layer demap signals on m symbols positions of v layers onto q data blocks.
  • the present disclosure may be implemented in software or a combination of software and hardware; for example, it may be implemented by a dedicated integrated circuit (ASIC), a general-purpose computer, or any other similar hardware device.
  • the software program of the present disclosure may be executed by a processor so as to implement the above steps or functions.
  • the software program of the present disclosure (including relevant data structure) may be stored in a computer readable recording medium, for example, a RAM memory, a magnetic or optical driver, or a floppy disk, and similar devices.
  • some steps of functions of the present disclosure may be implemented by hardware, for example, a circuit cooperating with the processor to execute various functions or steps.
  • a method for layer mapping of data blocks in a LTE protocol-based base station wherein a number of data blocks is q, a number of layers is v, where ⁇ ⁇ v , a number of symbols in each layer is m, wherein the method comprises:
  • mapping (q -v%q) + 1 ⁇ y ⁇ v , according to a value of the y element J y of a second mapping element set , mapping
  • a value of each element is an integer value ging [1, v] and different from one anothe
  • v elements for the elements in the first mapping element set and the elements in the second mapping element set , respectively, a value of each element is an integer value ranging [1, v] and different from one another;
  • step of determining a position mapping vector [_ ! , J 2 , J rec] comprises:
  • step of determining the position mapping vector [J 1( J 2 , J tent] comprises:
  • An apparatus for layer mapping of data blocks in a LTE protocol-based base station wherein a number of data blocks is q, a number of layers is v, where ⁇ ⁇ v , a number of symbols in each layer is m, wherein the apparatus comprises:
  • mapping module configured to: from ⁇ v ⁇ o( l data blocks in q data blocks, obtain
  • v elements for the elements in the first mapping element set and the elements in the second mapping element set , respectively, a value of each element is an integer value ranging [1, v] and different from one another;
  • mapping module repeats the step for m times.
  • a module configured to determine a position mapping vector J 2 , J suitcase], wherein the elements in the position mapping vector J 2 , J suitcase] are elements from the first mapping
  • a module configured to determine the position mapping vector J 2 , J tract] based on the position mapping vector [ ⁇ , J' 2 , J'êt] determined in the last time, wherein the position mapping vector [J 1( J 2 , j v ] is [(_ ⁇ +1)% ⁇ , (J' 2 +l)%v (j' v +l)%v].
  • module configured to determine the position mapping vector J 2 , J bookmark] comprises:
  • a demapping module configured to: for each element in a first mapping element set
  • a value of each element is an integer value ranging [1, v] and different from one another;
  • the demapping module repeats the step for m times.
  • a module configured to determine a position mapping vector J 2 , J suitcase], wherein the elements in the position mapping vector J 2 , J suitcase] are elements from the first mapping

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne des procédés et des appareils de mappage de couches et de démappage de couches de liaison descendante appliqués à un système de communications sans fil MIMO d'ordre élevé selon un protocole LTE. Le nouveau procédé de mappage de couches selon la présente invention convient à des situations où le nombre de couches et de mots codés est plus élevé que dans le système MIMO d'ordre élevé, et au cas où la qualité de canal est inégale entre différentes couches. De plus, le procédé de mappage de couches selon la présente invention peut également être compatible avec des schémas de mappage de couches existants dans le protocole actuel.
PCT/IB2016/001984 2015-11-30 2016-11-21 Procédés et appareils de mappage de couches et de démappage de couches dans un système de communications sans fil WO2017093809A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510859638.5A CN106850123B (zh) 2015-11-30 2015-11-30 在无线通信系统中用于层映射和解层映射的方法和装置
CN201510859638.5 2015-11-30

Publications (1)

Publication Number Publication Date
WO2017093809A1 true WO2017093809A1 (fr) 2017-06-08

Family

ID=58057174

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2016/001984 WO2017093809A1 (fr) 2015-11-30 2016-11-21 Procédés et appareils de mappage de couches et de démappage de couches dans un système de communications sans fil

Country Status (3)

Country Link
CN (1) CN106850123B (fr)
TW (1) TWI602408B (fr)
WO (1) WO2017093809A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112136301A (zh) * 2018-05-16 2020-12-25 诺基亚技术有限公司 通信系统中用于安全性管理的错误处理框架

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111431667B (zh) * 2017-09-11 2023-03-10 Oppo广东移动通信有限公司 资源分配方法、终端、网络设备和计算机存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2378673A1 (fr) * 2009-01-21 2011-10-19 ZTE Corporation Procédé et dispositif de mappage de flux de mots de code sur des couches contenues dans un système entrées multiples sorties multiples
EP2731276A1 (fr) * 2011-07-08 2014-05-14 ZTE Corporation Procédé et dispositif de traitement de signaux d'antennes multiples dans un système de liaison montante
EP2945414A1 (fr) * 2013-01-14 2015-11-18 LG Electronics Inc. Procédé de rapport d'informations d'état de canal pour formation de faisceau tridimensionnel dans un système de communication sans fil et dispositif associé

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
MX2009007274A (es) * 2007-01-05 2009-07-10 Lg Electronics Inc Metodo para mapeo de estrato y metodo de transmision de datos para sistema de entrada multiple salida multiple.
EP4030667A1 (fr) * 2007-02-14 2022-07-20 Optis Wireless Technology, LLC Mappage de mots de code sur des couches dans un système implémentant harq
US8259643B2 (en) * 2009-02-13 2012-09-04 Samsung Electronics Co., Ltd. Apparatus and method for codeword to layer mapping in MIMO transmission wireless systems
CN101932096B (zh) * 2009-06-24 2015-03-25 中兴通讯股份有限公司 多用户多输入多输出模式下层映射信息的通知方法和系统
CN102104454A (zh) * 2009-12-18 2011-06-22 富士通株式会社 多输入多输出通信系统中码字流到层的映射方法与装置
WO2011098426A1 (fr) * 2010-02-11 2011-08-18 Sony Corporation Appareil et procédé de démappage permettant une réception de données dans un système de diffusion multiporteuse
CN102869097B (zh) * 2011-07-07 2015-07-08 华为技术有限公司 一种上行控制信令的发送、接收方法和相关设备
CN102611526B (zh) * 2011-11-08 2015-03-25 华为技术有限公司 Mimo系统中发送数据流的方法和装置
US9743097B2 (en) * 2013-03-01 2017-08-22 Qualcomm Incorporated Spatial motion vector scaling for scalable video coding

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2378673A1 (fr) * 2009-01-21 2011-10-19 ZTE Corporation Procédé et dispositif de mappage de flux de mots de code sur des couches contenues dans un système entrées multiples sorties multiples
EP2731276A1 (fr) * 2011-07-08 2014-05-14 ZTE Corporation Procédé et dispositif de traitement de signaux d'antennes multiples dans un système de liaison montante
EP2945414A1 (fr) * 2013-01-14 2015-11-18 LG Electronics Inc. Procédé de rapport d'informations d'état de canal pour formation de faisceau tridimensionnel dans un système de communication sans fil et dispositif associé

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112136301A (zh) * 2018-05-16 2020-12-25 诺基亚技术有限公司 通信系统中用于安全性管理的错误处理框架
US11789803B2 (en) 2018-05-16 2023-10-17 Nokia Technologies Oy Error handling framework for security management in a communication system

Also Published As

Publication number Publication date
CN106850123A (zh) 2017-06-13
TW201731237A (zh) 2017-09-01
TWI602408B (zh) 2017-10-11
CN106850123B (zh) 2020-02-21

Similar Documents

Publication Publication Date Title
US11212054B2 (en) Data transmission method and apparatus
US10158404B2 (en) Data transmission method, transmit end device, and receive end device
WO2018021836A1 (fr) Livre de code de combinaison linéaire pour signaler des csi dans des systèmes de communication sans fil avancés
EP2913950B1 (fr) Procédé, système et dispositif de transmission d'informations d'instruction de codage et de détermination de matrice de précodage
WO2016071840A1 (fr) Balayage de faisceau efficace pour des réseaux sans fil haute fréquence
EP2337236A2 (fr) Précodeur pour multiplexage spatial, émetteur à antennes multiples
US9900078B2 (en) Data processing method, apparatus, and device
JP2015092713A (ja) Ｍｉｍｏ通信システムのコードブックのプリコーディング
EP2978155A1 (fr) Procédé, système et dispositif servant à déterminer une matrice de précodage
EP3490323B1 (fr) Procédé et appareil permettant de sélectionner un vecteur de signature d'utilisateur
US10171142B2 (en) Data transmission method, apparatus, and device
EP3429108A1 (fr) Procédé de renvoi de csi, procédé de précodage, et appareil
CN102687409A (zh) 生成预编码矩阵码书的方法和装置
CN105530071A (zh) 一种基于码块分割的上行信号编码方法及终端
EP3226637B1 (fr) Procédé et dispositif pour transmettre des informations d'indication
JP5925917B2 (ja) チャンネルステータス情報を受信、送信する方法及び装置
CN105940740B (zh) 处理数据的方法、网络节点和终端
US10707936B2 (en) Channel state information CSI measurement and feedback method and apparatus
EP2913949B1 (fr) Procédé, système et dispositif de transmission d'informations d'indication précodées et de détermination d'une matrice de précodage
WO2017093809A1 (fr) Procédés et appareils de mappage de couches et de démappage de couches dans un système de communications sans fil
WO2017041463A1 (fr) Système et procédé pour une rétroaction de canal à base de quantification en codage par treillis
CN110011711B (zh) 预编码的方法、网络设备和计算机可读存储介质
JP6328021B2 (ja) 無線通信装置
JP2014143553A (ja) 無線通信システム及びその通信方法、送信装置及びその方法、並びに受信装置及びその方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16838005

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16838005

Country of ref document: EP

Kind code of ref document: A1