WO2016106670A1 - 一种广播通信方法及用户设备 - Google Patents

一种广播通信方法及用户设备 Download PDF

Info

Publication number
WO2016106670A1
WO2016106670A1 PCT/CN2014/095868 CN2014095868W WO2016106670A1 WO 2016106670 A1 WO2016106670 A1 WO 2016106670A1 CN 2014095868 W CN2014095868 W CN 2014095868W WO 2016106670 A1 WO2016106670 A1 WO 2016106670A1
Authority
WO
WIPO (PCT)
Prior art keywords
time
data packets
resource pool
frequency sub
encoded data
Prior art date
Application number
PCT/CN2014/095868
Other languages
English (en)
French (fr)
Inventor
张祺智
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN201480084347.7A priority Critical patent/CN107113786A/zh
Priority to PCT/CN2014/095868 priority patent/WO2016106670A1/zh
Publication of WO2016106670A1 publication Critical patent/WO2016106670A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation

Definitions

  • the present invention relates to the field of wireless communication technologies, and in particular, to a broadcast communication method and user equipment.
  • the communication system has at least one end-to-end broadcast resource pool, and the user equipment (User Equipment, UE for short) in the communication system can use the resources in the end-to-end broadcast resource pool to broadcast signals. transmission.
  • the user equipment User Equipment, UE for short
  • the end-to-end broadcast resource pool is divided into A sub-pools from the time domain, and each sub-pool is further divided into B time-frequency resources.
  • a device transmits a broadcast signal of the device using a time-frequency resource in a sub-pool. And the broadcast signal of the device is repeatedly sent A times in the A subpool.
  • the broadcast signals of each other cannot be received between the devices. Therefore, in order to ensure that different devices can receive each other's broadcast signals from each other, in different sub-pools, each device can use time-frequency jump to adjust the time domain position of the broadcast signal of the device. Specifically, FIG.
  • FIG. 1 is a schematic diagram of an end-to-end broadcast resource pool division provided by the prior art.
  • A is 3
  • B is 9, and the number of UEs is 9.
  • Each UE sends a broadcast signal using a different time-frequency resource in the first sub-pool, performs a frequency-hopping jump in the subsequent sub-pool, and transmits the same content as the content sent in the first sub-pool.
  • FIG. 1 is a schematic diagram of an end-to-end broadcast resource pool division provided by the prior art. Referring to FIG. 1, A is 3, B is 9, and the number of UEs is 9.
  • Each UE sends a broadcast signal using a different time-frequency resource in the first sub-pool, performs a frequency-hopping jump in the subsequent sub-pool, and transmits the same content as the content sent in the first sub-pool.
  • the broadcast signal x4 is transmitted by the UE 4, which uses the same time domain resource in the first sub-pool as the broadcast signal x1 transmitted by the UE1 and the broadcast signal x7 transmitted by the UE7, and
  • the broadcast signal x5 transmitted by the UE 5 and the broadcast signal x6 transmitted by the UE 6 have the same frequency domain resources. Since the UEs that broadcast at the same time domain location cannot receive each other's broadcast signals between the prior art, the UE1 and the UE7 cannot receive the x4 transmitted by the UE4.
  • UE4 performs time-frequency jump transmission. That is, a jump occurs in the time domain position of the second sub-pool x4. Similarly, each UE can perform frequency jump transmission in each sub-pool to enable other UEs to normally receive broadcast signals.
  • UE4 can only transmit the data content of one broadcast signal, for example, UE4 repeatedly transmits x4 in three sub-pools. Since x4 is an encoded data packet obtained by encoding an original data packet, the UE can only repeatedly broadcast an encoded data packet obtained by encoding the original data packet, thereby reducing the efficiency of the UE transmitting the broadcast signal.
  • the present invention provides a broadcast communication method and user equipment for improving transmission efficiency of broadcast communication.
  • a first aspect of the present invention provides a user equipment, including:
  • An encoding module configured to encode the k original data packets into N encoded data packets, where the k is a positive integer less than or equal to Ne and greater than 1, the e being the first user equipment UE and the at least one other UE The maximum number of shared time domain resources;
  • a broadcast module configured to broadcast the N encoded data packets on N time-frequency sub-resource pools of a resource pool in a broadcast period, where each resource pool broadcasts one of the encoded data packets;
  • a UE and the at least one other UE belong to the first device group; the number of the time domain resources shared by the first UE and any other UE of the first device group is less than or equal to the e.
  • the coding module is specifically configured to encode the k original data packets into the N encoded data packets by using an encoding matrix
  • the length of the original data packet is d
  • the length of the encoded data packet is d
  • the coding matrix is a matrix on a first finite field, and at least one element in the coding matrix does not belong to the second limited a domain
  • the first finite field is a d-th generation expansion of the second finite field
  • the second finite field is a finite field having two elements
  • an arbitrary k-th order square matrix of the coding matrix is full rank.
  • the broadcast module is specifically configured to:
  • the second time-frequency sub-resource pool to the N-th time-frequency sub-carrier in the N time-frequency sub-resource pools The remaining N-1 encoded data packets are sequentially broadcasted in the resource pool, and the remaining N-1 encoded data packets satisfy the following frequency hopping rules when broadcasting:
  • the third finite field contains the number of elements equal to the number of frequency domain units, and the third finite field contains the number of elements equal to the time domain unit
  • the number represents a frequency domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool, and r is a positive integer greater than or equal to 0 and less than or equal to N-2;
  • the j represents a time domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool; the i next indicates that the first UE is in the r+1th time-frequency sub- a frequency domain unit number of the resource used in the resource pool; the j next represents a time domain unit number of the resource used by the first UE in the r+1th time-frequency sub-resource pool;
  • the upper second order invertible matrix of the third finite field wherein Does not belong to the feature vector set, the feature vector set is ⁇ A, A 2 ,
  • a second aspect of the present invention provides a user equipment, including:
  • a processor configured to encode the k original data packets into N encoded data packets, where the k is a positive integer less than or equal to Ne and greater than 1, the e being the first user equipment UE and the at least one other UE The maximum number of shared time domain resources;
  • a transceiver configured to broadcast the N encoded data packets on a N time-frequency sub-resource pool of a resource pool in a broadcast period, where each resource pool broadcasts one of the encoded data packets;
  • the first UE and the at least one other UE belong to the first device group; the number of the time domain resources shared by the first UE and any other UE of the first device group is less than or equal to the e.
  • the processor is specifically configured to encode the k original data packets into the N encoded data packets by using an encoding matrix
  • the length of the original data packet is d
  • the length of the encoded data packet is d
  • the coding matrix is a matrix on a first finite field, and at least one element in the coding matrix Not belonging to the second finite field
  • the first finite field is a d-th generation expansion of the second finite field
  • the second finite field is a finite field having two elements
  • any k-order of the coding matrix The square is full of ranks.
  • the transceiver is specifically configured to:
  • the third finite field contains the number of elements equal to the number of frequency domain units, and the third finite field contains the number of elements equal to the time domain unit
  • the number represents a frequency domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool, and r is a positive integer greater than or equal to 0 and less than or equal to N-2;
  • the j represents a time domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool; the i next indicates that the first UE is in the r+1th time-frequency sub- a frequency domain unit number of the resource used in the resource pool; the j next represents a time domain unit number of the resource used by the first UE in the r+1th time-frequency sub-resource pool;
  • the upper second order invertible matrix of the third finite field wherein Does not belong to the feature vector set, the feature vector set is ⁇ A, A 2 ,
  • a third aspect of the present invention provides a broadcast communication method, including:
  • the first user equipment UE encodes k original data packets into N encoded data packets, where k is a positive integer less than or equal to Ne and greater than 1, and the e is the first UE and at least one other UE The maximum number of shared time domain resources;
  • the number of the time domain resources shared by any other UE of the first device group is less than or equal to the e.
  • the first user equipment UE encodes k original data packets into N encoded data packets, including:
  • the length of the original data packet is d
  • the length of the encoded data packet is d
  • the coding matrix is a matrix on a first finite field, and at least one element in the coding matrix does not belong to the second limited a domain
  • the first finite field is a d-th generation expansion of the second finite field
  • the second finite field is a finite field having two elements
  • an arbitrary k-th order square matrix of the coding matrix is full rank.
  • the first UE sends the N coded data packets in a resource pool N in a broadcast period. Broadcasts of time-frequency sub-resource pools, including:
  • the first UE selects an idle resource to broadcast the first one of the N encoded data packets in the first time-frequency sub-resource pool in the N time-frequency sub-resource pools;
  • the first UE sequentially broadcasts the remaining N-1 encoded data packets in the second time-frequency sub-resource pool to the N-th time-frequency sub-resource pool in the N time-frequency sub-resource pools, and the remaining The N-1 encoded data packets satisfy the following frequency hopping rules when broadcasting:
  • the third finite field contains the number of elements equal to the number of frequency domain units, and the third finite field contains the number of elements equal to the time domain unit
  • the number represents a frequency domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool, and r is a positive integer greater than or equal to 0 and less than or equal to N-2;
  • the j represents a time domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool; the i next indicates that the first UE is in the r+1th time-frequency sub- a frequency domain unit number of the resource used in the resource pool; the j next represents a time domain unit number of the resource used by the first UE in the r+1th time-frequency sub-resource pool;
  • the upper second order invertible matrix of the third finite field wherein Does not belong to the feature vector set, the feature vector set is ⁇ A, A 2 ,
  • the broadcast communication method and the user equipment provided by the embodiment of the present invention encode the k original data packets into N coded data packets by using the first UE, where the k is a positive integer less than or equal to Ne and greater than 1.
  • e is a maximum number of time domain resources shared by the first UE and at least one other UE; the first UE broadcasts the N encoded data packets on N time-frequency sub-resource pools of one resource pool in one broadcast period Each resource pool broadcasts one of the encoded data packets; and the first UE and the at least one other UE belong to the first device group; the first UE is shared with any other UE of the first device group
  • the number of the time domain resources is less than or equal to the e. Therefore, the UE as the broadcast communication apparatus can broadcast the encoded data packets encoded by different original data packets (i.e., k different original data), thereby improving the transmission efficiency of the broadcast communication.
  • FIG. 1 is a schematic diagram of an end-to-end broadcast resource pool division provided by the prior art
  • FIG. 2 is a schematic diagram of a broadcast resource pool provided by the prior art
  • FIG. 3 is a schematic diagram of a broadcast communication provided by the prior art
  • FIG. 5 is a schematic structural diagram of a user equipment according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of another user equipment according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic flowchart of a broadcast communication method according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of resources according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of a broadcast resource pool provided by the prior art.
  • at least one end-to-end broadcast resource pool R exists in the system, and the occupied bandwidth is B, and the period is T_max, which is occupied by R during the weekly period.
  • the length of time is T.
  • Each device in each cycle wishes to use a resource in the end-to-end broadcast resource pool R to transmit broadcast signals.
  • the transmitting device does not know the information of the receiving device, so the transmitting device transmits with constant power and modulation and coding.
  • a device sends a broadcast signal by using resources in an end-to-end broadcast resource pool. Specifically, the device is modulated by turbo coding and Quadrature Phase Shift Keying (QPSK).
  • QPSK Quadrature Phase Shift Keying
  • the broadcast signal is transmitted at a power of 23 dBm, and most of the corresponding receiving devices can successfully decode the broadcast signal.
  • FIG. 3 is a schematic diagram of a broadcast communication provided by the prior art.
  • all user equipments UE time-divisionally transmit data packets of a broadcast signal.
  • Each UEi uses a full bandwidth to transmit a data packet (xi, yi, zi) of the respective broadcast signal.
  • the data content of xi, yi and zi can be different.
  • UE1 transmits broadcast signals x1, y1 and z1 using all frequency domain resources on the same time domain resource.
  • UE1 can only transmit the broadcast signal x1 in one transmission period. It can be seen that the transmission efficiency of UE1 is only 1/A of the transmission efficiency of mode one.
  • the UE can be made to transmit different data packets in the same time domain position, but each UE transmits at full bandwidth, and the power spectral density is low, resulting in a small coverage.
  • FIG. 4 is a schematic diagram of another broadcast communication provided by the prior art. Referring to FIG. 4, all UEs transmit/transmit data packets by time division/frequency division.
  • UEs that broadcast at the same time domain location cannot receive each other's broadcast messages.
  • UE1 transmits a broadcast signal x1
  • UE2 transmits a broadcast signal x2
  • UE3 transmits a broadcast signal x3. Since x1, x2, and x3 are the same in the time domain, for UE1, it cannot receive x2 sent by UE2 and x3 sent by UE3, that is, UE1, and UE2 and UE3 cannot receive data from each other.
  • UE4, UE5, and UE6 cannot receive data from each other, and UE7, UE8, and UE9 cannot receive data from each other.
  • the conventional broadcast communication method has the following problems: low transmission efficiency and small coverage. Based on such problems, embodiments of the present invention will provide a solution.
  • FIG. 5 is a schematic structural diagram of a user equipment according to an embodiment of the present disclosure, where the user equipment may be a mobile phone, a tablet computer, an automobile, or the like.
  • the apparatus includes an encoding module 100 and a broadcasting module 101.
  • the encoding module 100 is configured to encode the k original data packets into N encoded data packets, where the k is a positive integer less than or equal to Ne and greater than 1, and the e is the first user equipment UE and at least one other The maximum number of time domain resources shared by the UE;
  • the first UE is the UE shown in FIG. 5;
  • the broadcast module 101 is configured to broadcast the N encoded data packets on N time-frequency sub-resource pools of a resource pool in one broadcast period.
  • Each resource pool broadcasts one of the encoded data packets; and the first UE and the at least one other UE belong to the first device group; the first UE is shared with any other UE of the first device group.
  • the number of the time domain resources is less than or equal to the e.
  • the user equipment provided by the embodiment of the present invention encodes k original data packets into N coded data packets by using an encoding module, where k is a positive integer less than or equal to Ne and greater than 1, and the e is the first UE. a maximum number of time domain resources shared with at least one other UE; the broadcast module broadcasts the N encoded data packets on N time-frequency sub-resource pools of a resource pool in a broadcast period, wherein each resource The pool broadcasts one of the encoded data packets; and the first UE and the at least one other UE belong to the first device group; the time domain resource shared by the first UE and any other UE of the first device group The number is less than or equal to the e. Therefore, the UE as the broadcast communication apparatus can broadcast the encoded data packets encoded by different original data packets (i.e., k different original data), thereby improving the transmission efficiency of the broadcast communication.
  • k is a positive integer less than or equal to Ne and greater than 1
  • the e
  • the encoding module 100 is specifically configured to encode the k original data packets into the N encoded data packets by using an encoding matrix.
  • the length of the original data packet is d
  • the length of the encoded data packet is d
  • the coding matrix is a matrix on a first finite field, and at least one element in the coding matrix does not belong to the second limited a domain
  • the first finite field is a d-th generation expansion of the second finite field
  • the second finite field is a finite field having two elements
  • an arbitrary k-th order square matrix of the coding matrix is full rank.
  • the length of the original data packet or the length of the encoded data packet may be in units of bits.
  • the length of the original data packet is 8 bits
  • the first finite field is the 8th algebraic expansion of the second finite field.
  • the broadcast module of the present scheme uses the foregoing coding matrix to encode k original data packets of length d into N encoded data packets of length d, and the number of times the UE sends packets at different times is set to Ne, since the k is a positive integer less than or equal to Ne and greater than 1, so that the receiving end can decode k original data packets of length d after successfully receiving k encoded data packet data packets.
  • the broadcast communication apparatus provided by the embodiment of the present invention does not have a situation that the UE cannot receive the broadcast message, and the stability of the broadcast message is improved.
  • broadcast module 101 is specifically configured to:
  • the third finite field contains the number of elements equal to the number of frequency domain units, and the third finite field contains the number of elements equal to the time domain unit
  • the number represents a frequency domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool, and r is a positive integer greater than or equal to 0 and less than or equal to N-2;
  • the j represents a time domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool; the i next indicates that the first UE is in the r+1th time-frequency sub- a frequency domain unit number of the resource used in the resource pool; the j next represents a time domain unit number of the resource used by the first UE in the r+1th time-frequency sub-resource pool;
  • the upper second order invertible matrix of the third finite field wherein Does not belong to the feature vector set, the feature vector set is ⁇ A, A 2 ,
  • the prior art solution shown in FIG. 1 is reduced in transmission efficiency by 1/N as compared with the prior art shown in the first mode.
  • the embodiment of the present invention firstly uses the frequency hopping rule to perform frequency hopping transmission of the encoded data packet, and the broadcast module does not use the full bandwidth manner to transmit. , thereby increasing the power spectral density and increasing the coverage.
  • the embodiment of the present invention ensures the transmission efficiency while ensuring the coverage.
  • FIG. 6 is a schematic structural diagram of another user equipment according to an embodiment of the present disclosure, where the user equipment may be a mobile phone, a tablet computer, an automobile, or the like.
  • the apparatus includes a processor 200 and a transceiver 201.
  • the processor 200 is configured to encode the k original data packets into N encoded data packets, where the k is a positive integer less than or equal to Ne and greater than 1, and the e is the first user equipment UE and at least one other The maximum number of time domain resources shared by the UE;
  • the first UE is the UE described in FIG. 6.
  • the transceiver 201 is configured to broadcast the N encoded data packets correspondingly on the N time-frequency sub-resource pools of a resource pool in a broadcast period.
  • Each resource pool broadcasts one of the encoded data packets; and the first UE and the at least one other UE belong to the first device group; the first UE is shared with any other UE of the first device group.
  • the number of the time domain resources is less than or equal to the e.
  • the user equipment provided by the embodiment of the present invention encodes k original data packets into N coded data packets by using a processor, where the k is a positive integer less than or equal to Ne and greater than 1, and the e is the first UE.
  • the maximum number of time domain resources shared with at least one other UE Transmitting, in a broadcast period, the N coded data packets on N time-frequency sub-resource pools of a resource pool, wherein each resource pool broadcasts one of the coded data packets; and the first UE And the at least one other UE belongs to the first device group; the number of the time domain resources shared by the first UE and any other UE of the first device group is less than or equal to the e.
  • the processor Since the processor encodes k raw data packets into N encoded data packets. Therefore, the UE as the broadcast communication apparatus can broadcast the encoded data packets encoded by different original data packets (i.e., k different original data), thereby improving the transmission efficiency of the broadcast communication.
  • the processor 200 is specifically configured to encode the k original data packets into the N encoded data packets by using an encoding matrix
  • the length of the original data packet is d
  • the length of the encoded data packet is d
  • the coding matrix is a matrix on a first finite field, and at least one element in the coding matrix does not belong to the second limited a domain
  • the first finite field is a d-th generation expansion of the second finite field
  • the second finite field is a finite field having two elements
  • an arbitrary k-th order square matrix of the coding matrix is full rank.
  • the processor of the present scheme uses the foregoing coding matrix to encode k original data packets of length d into N encoded data packets of length d, and the number of times the UE transmits packets at different times.
  • the k is a positive integer less than or equal to Ne and greater than 1
  • the receiving end can decode k original data packets of length d after successfully receiving k encoded data packet data packets.
  • the broadcast communication apparatus provided by the embodiment of the present invention does not have a situation that the UE cannot receive the broadcast message, and the stability of the broadcast message is improved.
  • transceiver 201 is specifically configured to:
  • the third finite field contains the number of elements equal to the number of frequency domain units, and the third finite field contains the number of elements equal to the time domain unit
  • the number represents a frequency domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool, and r is a positive integer greater than or equal to 0 and less than or equal to N-2;
  • the j represents a time domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool; the i next indicates that the first UE is in the r+1th time-frequency sub- a frequency domain unit number of the resource used in the resource pool; the j next represents a time domain unit number of the resource used by the first UE in the r+1th time-frequency sub-resource pool;
  • the upper second order invertible matrix of the third finite field wherein Does not belong to the feature vector set, the feature vector set is ⁇ A, A 2 ,
  • the prior art solution shown in FIG. 1 is reduced in transmission efficiency by 1/N as compared with the prior art shown in the first mode.
  • the embodiment of the present invention firstly uses the frequency hopping rule to perform frequency hopping transmission of the encoded data packet, and the transceiver does not use the full bandwidth manner to transmit. , thereby increasing the power spectral density and increasing the coverage.
  • the embodiment of the present invention ensures the transmission efficiency while ensuring the coverage.
  • FIG. 7 is a schematic flowchart of a broadcast communication method according to an embodiment of the present invention.
  • the executor of the method is a first UE, and the first UE may adopt the structure shown in FIG. 5 or FIG. 6, specifically, the first UE.
  • Step 100 The first user equipment UE encodes k original data packets into N encoded data packets.
  • the k is a positive integer less than or equal to N-e and greater than 1, and the e is a maximum number of time domain resources shared by the first UE and at least one other UE;
  • Step 101 The first UE broadcasts the N encoded data packets correspondingly in N time-frequency sub-resource pools of a resource pool in a broadcast period.
  • Each resource pool broadcasts one of the encoded data packets; and the first UE and the at least one other UE belong to the first device group; the first UE is shared with any other UE of the first device group.
  • the number of the time domain resources is less than or equal to the e.
  • the k original data packets are encoded into N encoded data packets by the first UE, where the k is a positive integer less than or equal to Ne and greater than 1, and the e is a The maximum number of time domain resources shared by the first UE and the at least one other UE; the first UE broadcasts the N codes on the N time-frequency sub-resource pools of one resource pool in one broadcast period a data packet, wherein each resource pool broadcasts one of the encoded data packets; and the first UE and at least one other UE belong to a first device group; any one of the first UE and the first device group The number of the time domain resources shared by the UE is less than or equal to the e. Therefore, the first UE can broadcast the encoded data packets encoded by different original data packets (ie, k different original data), thereby improving the transmission efficiency of the broadcast communication.
  • the first UE can broadcast the encoded data packets encoded by different original data packets (ie, k different original data), thereby improving the transmission
  • step 100 is:
  • Step 100a The first UE encodes the k original data packets into the N encoded data packets by using an encoding matrix.
  • the length of the original data packet is d
  • the length of the encoded data packet is d
  • the coding matrix is a matrix on a first finite field, and at least one element in the coding matrix does not belong to the second limited a domain
  • the first finite field is a d-th generation expansion of the second finite field
  • the second finite field is a finite field having two elements
  • an arbitrary k-th order square matrix of the coding matrix is full rank.
  • the scheme uses the foregoing coding matrix to encode k original data packets of length d into N encoded data packets of length d, and the number of times the UE transmits packets at different times is set to Ne. Since the k is a positive integer less than or equal to Ne and greater than 1, the receiving end can decode the k original data packets of length d after successfully receiving the k encoded data packet data packets.
  • the broadcast communication method provided by the embodiment of the present invention does not cause a situation that the UE cannot receive the broadcast message, and the stability of the broadcast message is improved.
  • step 101 is:
  • Step 101a The first UE selects an idle resource to broadcast the first encoded data in the N encoded data packets in a first time-frequency sub-resource pool in the N time-frequency sub-resource pools. package;
  • Step 101b The first UE sequentially broadcasts the remaining N-1 encoded data packets in the second time-frequency sub-resource pool to the N-th time-frequency sub-resource pool in the N time-frequency sub-resource pools, and The remaining N-1 encoded data packets satisfy the following frequency hopping rules when broadcasting:
  • the third finite field contains the number of elements equal to the number of frequency domain units, and the third finite field contains the number of elements equal to the time domain unit
  • the number represents a frequency domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool, and r is a positive integer greater than or equal to 0 and less than or equal to N-2;
  • the j represents a time domain unit number of the resource used by the first UE in the rth time-frequency sub-resource pool; the i next indicates that the first UE is in the r+1th time-frequency sub- a frequency domain unit number of the resource used in the resource pool; the j next represents a time domain unit number of the resource used by the first UE in the r+1th time-frequency sub-resource pool;
  • the upper second order invertible matrix of the third finite field wherein Does not belong to the feature vector set, the feature vector set is ⁇ A, A 2 ,
  • the prior art solution shown in FIG. 1 is reduced in transmission efficiency by 1/N as compared with the prior art shown in the first mode.
  • the embodiment of the present invention firstly performs frequency hopping transmission of the encoded data packet by using the above-mentioned frequency hopping rule, and does not use the full bandwidth manner to transmit, thereby improving The power spectral density increases the coverage.
  • the embodiment of the present invention ensures the transmission efficiency while ensuring the coverage.
  • Orthogonal Frequency Division Multiple Access OFDMA
  • SC-FDMA Single-Carrier Frequency-Division Multiple Access
  • the 18 MHz is composed of 300 subcarriers, and the 300 subcarriers are equally divided into 25 parts, and each 12 subcarriers are used as one frequency domain unit.
  • Orthogonal Frequency Division Multiplexing (OFDM) symbols Each of the 15 prefixed OFDM symbols constitutes a time domain unit 300us, wherein the last prefixed OFDM symbol is used as a guard interval for transmitting information, and thus there are 14 OFDM symbols used to transmit information in each time domain unit.
  • Each frequency domain unit on each time domain unit constitutes a resource block (Resource Block, RB for short).
  • the 25x200 RBs are equally divided into 8 time-frequency sub-resource pools from the time domain, and each time-frequency sub-resource pool contains 25x25 RBs.
  • Each transmitting device uses different resources in the first time-frequency sub-resource pool to transmit, and performs frequency hopping in the last seven time-frequency sub-resource pools according to the hopping rules shown above.
  • Such a frequency hopping rule can cause any two devices to transmit at most once in the eight time-frequency sub-resource pools, so each device has 7 chances to receive signals broadcast by other devices.
  • each device can use QPSK on each RB, and the turbo coded transport block size index 7 (TBS index 7) transmits 104 bits as one data packet. If each device wants to broadcast 6 data packets totaling 624 bits, the 6 original data packets can be encoded into 8 encoded data packets, and the coding matrix can be in the following form:
  • the receiving end can arbitrarily receive the 6 encoded data packets to solve the original data packet.
  • UE_j can recover 6 original data packets as long as it successfully performs any 6 turbo decodings in 7 chances of being able to receive the UE_i signal. Its transmission efficiency is 6/8.
  • the sub-array composed of any 6 rows of G is full rank.
  • the sub-array composed of the first 6 lines of G is a unit matrix, which is naturally full rank;
  • the sub-array composed of 5 rows and 7 rows in the first 6 rows of G can be converted into unit frames by row transformation, so it is full
  • the subarray consisting of 5 rows and 8 rows in the first 6 rows of G can be transformed into a diagonal matrix by row transformation, and the elements on the diagonal are not 0, so it is full rank.
  • the sub-array composed of 4 rows and the last two rows in the first 6 rows of G can be changed into the following form by column transformation:
  • I 6 is a 6-order unit array.
  • D ⁇ C -1 is not all one row, it can be expressed as a linear combination of 5 rows in I 6 , which is linearly independent of [B ⁇ C -1 of any 6 rows on F 2 ] Contradictions, and if 2 lines of D ⁇ C -1 are all 1 line, then these 2 lines are already linearly related, and also contradictory with [B ⁇ C -1 of any 6 lines being linearly independent on F 2 ].
  • this fountain code does not exist.
  • the implementation manner is not limited to the foregoing embodiment, and may be encoded by other coding methods, and other frequency hopping rules are adopted. Another implementation will be described below by way of specific embodiments.
  • the middle 8.1 MHz of each 10 M bandwidth portion is divided into 54 subcarriers according to the subcarrier spacing of 150 kHz, and each side has a guard band of 0.95 MHz.
  • Each 20M bandwidth portion can be composed of 2 such 10M bandwidth portions.
  • FIG. 8 is a schematic diagram of a resource according to an embodiment of the present invention.
  • the system period is 100 ms, and 10 end-to-end broadcast resource pools in 100 ms (the rectangle filled with diagonal lines in FIG. 8), each end There are 9 time-frequency sub-resources in the broadcast resource pool.
  • Each time-frequency sub-resource pool has m*11 RBs.
  • the interval between each of the two end-to-end broadcast resource pools is 617.6us.
  • each end-to-end broadcast resource pool 11m devices can be allowed to send information, and each device selects one RB from the first time-frequency sub-resource pool to send, and performs in the subsequent eight time-frequency sub-resource pools.
  • Frequency hopping, frequency hopping can be as follows:
  • i(t), j(t) respectively represent the frequency/time domain position of a device in the t-th time-frequency sub-resource pool .
  • This formula indicates how the frequency and time positions used by each device in the latter time-frequency sub-resource pool are determined based on the frequency/time position used in the first time-frequency sub-resource pool.
  • any two devices can be simultaneously transmitted in up to two times in the nine time-frequency sub-resource pools, so each device has 7 chances to receive signals from other devices.
  • Each device can use QPSK on each RB, and turbo coded TBS index 7 transmits 104 bits as a data packet. If each device wants to broadcast 7 original data packets totaling 728 bits, the 7 original data packets can be encoded into 9 encoded data packets, and the coding matrix can be used as The following form:
  • a 1 ,...,a 7 are unequal to each other The elements in , and are not equal to 0.
  • An encoding constructed using such an encoding matrix has the property that the original data packet can be solved by arbitrarily receiving 7 encoded data packets. For any device pair UE_i and UE_j, UE_j can recover 7 original data packets as long as it successfully performs any 7 turbo decodings in 9 chances of being able to receive the device i signal. The transmission efficiency is 7/9.
  • the foregoing program may be stored in a computer readable storage medium, and the program is executed when executed.
  • the foregoing steps include the steps of the foregoing method embodiments; and the foregoing storage medium includes: a medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.

Landscapes

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

Abstract

本发明提供一种广播通信方法及用户设备，通过第一UE将k个原始数据包编码为N个编码数据包，其中，k为小于或等于N-e并且大于1的正整数，e为第一UE与至少一个其他UE共用的时域资源的个数最大值；第一UE在一个广播周期内，在一个资源池的N个时频子资源池上广播N个编码数据包，其中，每个资源池广播一个编码数据包；且第一UE与至少一个其他UE属于第一设备组；第一UE与第一设备组的任意一个其他UE共用的时域资源的个数小于或等于e。因此，作为广播通信装置的UE能够广播不同原始数据包编码得到的编码数据包，从而提高了广播通信的传输效率。

Description

一种广播通信方法及用户设备 技术领域
本发明涉及无线通信技术领域，尤其涉及一种广播通信方法及用户设备。
背景技术
现有技术中，通信系统存在着至少一个端到端广播资源池，通信系统中的多个用户设备(User Equipment，简称：UE)可以利用该端到端广播资源池中的资源进行广播信号的传输。
进一步的，在现有技术中，将端到端广播资源池从时域上分为A个子池，每个子池再分为B个时频资源。在设备进行广播通信的过程中，一个设备在一个子池内使用一个时频资源发送该设备的广播信号。并且该设备的广播信号在A子池内共重复发送A次。进一步的，当多个设备在具有相同时域位置的时频资源上发送广播信号时，这些设备之间无法接收到彼此的广播信号。因此为了能够保证不同的设备间能够相互接收对方的广播信号，在不同的子池中，每个设备可以利用时频跳转来对发送该设备广播信号的时域位置进行调整。具体的，图1为现有技术提供的一种端到端广播资源池划分示意图，参照图1可知，其中A为3，B为9，UE数量为9。每个UE在第一子池中使用不同的频时资源发送广播信号，在后续的子池中进行频时跳转,并发送与在第一子池中发送的内容相同的内容。参照图1，以广播信号x4为例，该广播信号x4由UE4进行发送，其在第一个子池中与UE1发送的广播信号x1和UE7发送的广播信号x7使用相同的时域资源，与UE5发送的广播信号x5和UE6发送的广播信号x6具有相同的频域资源。由于现有技术中，在相同时域位置进行广播的多个UE之间无法相互接收彼此的广播信号，因此UE1和UE7无法接收UE4发送的x4。为了能够使得UE1和UE7正常接收x4，在第二子池，UE4进行了时频跳转传输。即在第二子池x4的时域位置发生了跳转，类似的，每个UE在每个子池中都可以进行频跳转传输以便使得其他UE能够正常接收广播信号。
但是，采用图1所示的现有技术，对于每个子池中的任意一个UE，其只能发送一个广播信号的数据内容，例如UE4在三个子池中重复发送x4。由于x4是由一个原始数据包经编码得到的编码数据包，因此UE只能重复广播一个原始数据包经编码得到的编码数据包，降低了UE发送广播信号的效率。
发明内容
本发明提供一种广播通信方法及用户设备，用于提高广播通信的传输效率。
本发明的第一个方面是提供一种用户设备，包括：
编码模块，用于将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一用户设备UE与至少一个其他UE共用的时域资源的个数最大值；
广播模块，用于在一个广播周期内，在一个资源池的N个时频子资源池上广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
结合第一个方面，在第一种可行的实现方式中，所述编码模块，具体用于采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
结合第一个方面的第一种可行的实现方式，在第二种可行的实现方式中，所述广播模块，具体用于：
在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
在所述N个时频子资源池中的第二个时频子资源池至第N个时频子 资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
Figure PCTCN2014095868-appb-000001
其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中，
Figure PCTCN2014095868-appb-000002
不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
本发明的第二个方面是提供一种用户设备，包括：
处理器，用于将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一用户设备UE与至少一个其他UE共用的时域资源的个数最大值；
收发器，用于在一个广播周期内，在一个资源池的N个时频子资源池上对应广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
结合第二个方面，在第一种可行的实现方式中，所述处理器，具体用于采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素 不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
结合第二个方面的第一种可行的实现方式，在第二种可行的实现方式中，所述收发器，具体用于：
在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
在所述N个时频子资源池中的第二个时频子资源池至第N个时频子资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
Figure PCTCN2014095868-appb-000003
其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中，
Figure PCTCN2014095868-appb-000004
不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
本发明的第三个方面是提供一种广播通信方法，包括：
第一用户设备UE将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为所述第一UE与至少一个其他UE共用的时域资源的个数最大值；
所述第一UE在一个广播周期内，在一个资源池的N个时频子资源池 上对应广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
结合第三个方面，在第一种可行的实现方式中，所述第一用户设备UE将k个原始数据包编码为N个编码数据包，包括：
所述第一UE采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
结合第三个方面的第一种可行的实现方式，在第二种可行的实现方式中，所述第一UE在一个广播周期内，将所述N个编码数据包分别在一个资源池的N个时频子资源池进行广播，包括：
所述第一UE在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
所述第一UE在所述N个时频子资源池中的第二个时频子资源池至第N个时频子资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
Figure PCTCN2014095868-appb-000005
其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时 频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中，
Figure PCTCN2014095868-appb-000006
不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
本发明实施例提供的广播通信方法及用户设备，通过第一UE将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一UE与至少一个其他UE共用的时域资源的个数最大值；第一UE在一个广播周期内，在一个资源池的N个时频子资源池上广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。因此，作为广播通信装置的UE能够广播不同原始数据包(即k个不同的原始数据)编码得到的编码数据包，从而提高了广播通信的传输效率。
附图说明
为了更清楚地说明本发明实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图做一简单地介绍，显而易见地，下面描述中的附图是本发明的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。
图1为现有技术提供的一种端到端广播资源池划分示意图；
图2为现有技术提供的广播资源池示意图；
图3为现有技术提供的一种广播通信示意图；
图4为现有技术提供的另一种广播通信示意图；
图5为本发明实施例提供的一种用户设备的结构示意图；
图6为本发明实施例提供的另一种用户设备的结构示意图；
图7为本发明实施例提供的一种广播通信方法流程示意图；
图8为本发明实施例提供的一种资源示意图。
具体实施方式
为使本发明实施例的目的、技术方案和优点更加清楚，下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的范围。
图2为现有技术提供的广播资源池示意图，参照图2，设系统内存在着至少一个端到端广播资源池R，其所占用的带宽为B,周期为T_max，每周期内R所占用的时间长度为T。
每个周期内每个设备都希望使用端到端广播资源池R中的一块资源来发送广播信号。
对于广播信号，发送设备并不知道接收设备的信息，所以发送设备以不变的功率与调制编码方式发送。例如，某个设备利用端到端广播资源池中的资源发送广播信号，具体的，该设备通过涡轮(turbo)编码、正交相移键控(Quadrature Phase Shift Keying，简称：QPSK)调制后，以功率23dbm发送该广播信号，相应的大多数接收设备可以成功解码广播信号。
进一步的，如何利用广播资源池进行数据的传输，除了图1所示的一种现有技术之外，还可以有如下两种传输方式：
方式一：
图3为现有技术提供的一种广播通信示意图，参照图3，所有用户设备UE时分发射广播信号的数据包。每个UEi使用全带宽发送各自广播信号的数据包(xi，yi，zi)。并且xi，yi和zi的数据内容可以不同。例如，UE1在同一个时域资源上利用全部的频域资源发送广播信号x1，y1和z1。而上文图1所示的现有技术，在一个发射周期内，UE1只能够发送广播信号x1。可见UE1的传输效率仅为方式一传输效率的1/A。
但是，尽管采用图3所示的方式，可以使得UE在相同的时域位置发送不同数据包，但是每个UE都在全带宽发射，功率谱密度很低，导致覆盖范围很小。
方案二：
图4为现有技术提供的另一种广播通信示意图，参照图4，所有UE时分\频分发送数据包。
但是，在同一个时域位置进行广播的UE，彼此不能接收对方的广播消息。例如，参照图4，UE1发送广播信号x1，UE2发送广播信号x2，UE3发送广播信号x3。由于x1、x2、x3在时域位置相同，因此，对于UE1来说，其不能接收UE2发送的x2和UE3发送的x3，即UE1,UE2和UE3互相无法接收数据。类似的，如图4所示，UE4,UE5,UE6互相无法接收数据，UE7,UE8,UE9互相无法接收数据。
参照上文对现有技术所采用的各种实现方式的说明可知，现有的广播通信方法其具有如下问题：传输效率低、覆盖范围小。基于这样的问题，本发明实施例将提供一种解决的方案。
下面通过具体实施例，对本发明提供的广播通信装置及方法进行说明。
图5为本发明实施例提供的一种用户设备的结构示意图，该用户设备具体可以为手机、平板电脑、汽车等。参照图5，该装置包括：编码模块100、广播模块101。
编码模块100，用于将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一用户设备UE与至少一个其他UE共用的时域资源的个数最大值；
其中，第一UE即为图5所示的UE；
广播模块101，用于在一个广播周期内，在一个资源池的N个时频子资源池上广播所述N个编码数据包。
其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
本发明实施例提供的用户设备，通过编码模块将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一UE与至少一个其他UE共用的时域资源的个数最大值；广播模块在一个广播周期内，在一个资源池的N个时频子资源池上广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。 因此，作为广播通信装置的UE能够广播不同原始数据包(即k个不同的原始数据)编码得到的编码数据包，从而提高了广播通信的传输效率。
进一步的，所述编码模块100，具体用于采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
具体的，原始数据包的长度或编码数据包的长度可以以比特作为单位，例如，原始数据包的长度为8比特，则第一有限域是所述第二有限域的8次代数扩张。
与方式二相比，由于本方案广播模块采用上述编码矩阵将k个长度为d的原始数据包编码为N个长度为d的编码数据包，并且UE之间不同时发送数据包的次数设置为N-e，由于所述k为小于或等于N-e并且大于1的正整数，因此使得接收端在成功接收k个编码数据包数据包之后，就可以解码出k个长度为d的原始数据包。使得本发明实施例提供的广播通信装置不会出现UE之间无法接收广播消息的情况，提高了广播消息的稳定性。
进一步的，所述广播模块101，具体用于：
在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
在所述N个时频子资源池中的第二个时频子资源池至第N个时频子资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
Figure PCTCN2014095868-appb-000007
其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资 源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中，
Figure PCTCN2014095868-appb-000008
不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
进一步的，图1所示的现有技术方案与上文方式一所示的现有技术相比，其传输效率降低为1/N。本发明实施例与上文方式一所示的现有技术相比，首先由于每个UE的广播模块采用上述跳频规则进行编码数据包的跳频传输，其并不采用全带宽的方式进行发送，从而提高了功率频谱密度，增加了覆盖范围。并且本发明实施例与上文方式一所示的现有技术相比，在保证覆盖范围的同时，也保证了传输效率。
图6为本发明实施例提供的另一种用户设备的结构示意图，该用户设备具体可以为手机、平板电脑、汽车等。参照图6，该装置包括：处理器200、收发器201。
处理器200，用于将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一用户设备UE与至少一个其他UE共用的时域资源的个数最大值；
其中，第一UE为图6所述的UE。
收发器201，用于在一个广播周期内，在一个资源池的N个时频子资源池上对应广播所述N个编码数据包。
其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
本发明实施例提供的用户设备，通过处理器将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一UE与至少一个其他UE共用的时域资源的个数最大值；收 发器在一个广播周期内，在一个资源池的N个时频子资源池上对应广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。由于处理器将k个原始数据包编码为N个编码数据包。因此，作为广播通信装置的UE能够广播不同原始数据包(即k个不同的原始数据)编码得到的编码数据包，从而提高了广播通信的传输效率。
进一步的，所述处理器200，具体用于采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
与方式二相比，由于本方案的处理器采用上述编码矩阵将k个长度为d的原始数据包编码为N个长度为d的编码数据包，并且UE之间不同时发送数据包的次数设置为N-e，由于所述k为小于或等于N-e并且大于1的正整数，因此使得接收端在成功接收k个编码数据包数据包之后，就可以解码出k个长度为d的原始数据包。使得本发明实施例提供的广播通信装置不会出现UE之间无法接收广播消息的情况，提高了广播消息的稳定性。
进一步的，所述收发器201，具体用于：
在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
在所述N个时频子资源池中的第二个时频子资源池至第N个时频子资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
Figure PCTCN2014095868-appb-000009
其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素 个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中，
Figure PCTCN2014095868-appb-000010
不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
进一步的，图1所示的现有技术方案与上文方式一所示的现有技术相比，其传输效率降低为1/N。本发明实施例与上文方式一所示的现有技术相比，首先由于每个UE的收发器采用上述跳频规则进行编码数据包的跳频传输，其并不采用全带宽的方式进行发送，从而提高了功率频谱密度，增加了覆盖范围。并且本发明实施例与上文方式一所示的现有技术相比，在保证覆盖范围的同时，也保证了传输效率。
图7为本发明实施例提供的一种广播通信方法流程示意图，该方法的执行主体为第一UE，该第一UE可以采用图5或图6所示的结构，具体的，该第一UE可以为手机、平板电脑、汽车等。参照图7，该方法包括如下步骤：
步骤100、第一用户设备UE将k个原始数据包编码为N个编码数据包；
其中，所述k为小于或等于N-e并且大于1的正整数，所述e为所述第一UE与至少一个其他UE共用的时域资源的个数最大值；
步骤101、所述第一UE在一个广播周期内，在一个资源池的N个时频子资源池上对应广播所述N个编码数据包。
其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
本发明实施例提供的广播通信方法，通过第一UE将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为所述第一UE与至少一个其他UE共用的时域资源的个数最大值；所述第一UE在一个广播周期内，在一个资源池的N个时频子资源池上对应广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。因此，第一UE能够广播不同原始数据包(即k个不同的原始数据)编码得到的编码数据包，从而提高了广播通信的传输效率。
进一步的，步骤100一种可行的实现方式为：
步骤100a、所述第一UE采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
与方式二相比，由于本方案采用上述编码矩阵将k个长度为d的原始数据包编码为N个长度为d的编码数据包，并且UE之间不同时发送数据包的次数设置为N-e，由于所述k为小于或等于N-e并且大于1的正整数，因此使得接收端在成功接收k个编码数据包数据包之后，就可以解码出k个长度为d的原始数据包。使得本发明实施例提供的广播通信方法不会出现UE之间无法接收广播消息的情况，提高了广播消息的稳定性。
进一步的，步骤101的一种可行的实现方式为：
步骤101a、所述第一UE在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
步骤101b、所述第一UE在所述N个时频子资源池中的第二个时频子资源池至第N个时频子资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
Figure PCTCN2014095868-appb-000011
其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中， 不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
进一步的，图1所示的现有技术方案与上文方式一所示的现有技术相比，其传输效率降低为1/N。本发明实施例与上文方式一所示的现有技术相比，首先由于每个UE采用上述跳频规则进行编码数据包的跳频传输，其并不采用全带宽的方式进行发送，从而提高了功率频谱密度，增加了覆盖范围。并且本发明实施例与上文方式一所示的现有技术相比，在保证覆盖范围的同时，也保证了传输效率。
进一步的，对于上述图5或图6所示的用户设备如何采用图7所示的广播通信方法实现相应的技术效果，下面给出具体实施例，进行说明。
在子载波间隔为60kHz的20MHz带宽正交频分多址(Orthogonal Frequency Division Multiple Access，简称：OFDMA)或单载波频分多址(Single-carrier Frequency-Division Multiple Access，简称：SC-FDMA)系统中,使用中间的18MHz用来广播通信。这18MHz由300个子载波构成，将这300个子载波平分为25份，每份12个子载波作为一个频域单元。
该系统中每个OFDM符号的时间长度(不包括循环前缀)为1/(60*10^3)＝16.67us,可以加上4.67us的循环前缀构成20us的含前缀正交 频分复用(Orthogonal Frequency Division Multiplexing，简称：OFDM)符号。每15个含前缀OFDM符号构成一个时域单元300us，其中最后一个含前缀OFDM符号作为保护间隔不用来传输信息，于是每个时域单元上用来传输信息的OFDM符号有14个。每个时域单元上的每个频域单元构成一个资源块(Resource Block，简称：RB)。
设置端到端广播资源池R的周期为T_max＝90ms,在一个周期内有一个端到端广播资源池R占用的时域资源为0～60ms,于是端到端广播资源池R在每个周期内含有25x200个RB，每个RB用作一个设备发送一个数据包。
将这25x200个RB从时域上平分为8个时频子资源池，每个时频子资源池含25x25个RB。
用有限域F25中元素对25个频域单元进行编号，并且用有限域F25中元素对25个时域单元进行编号。
每个发送设备使用第一个时频子资源池内中不同的资源进行发送，并在后7个时频子资源池内按上文所示的跳频规则进行跳频。这样的跳频规则可以使得任意两个设备在这8个时频子资源池中至多一次同时发送，所以每个设备都有7次机会接收其它设备广播的信号。
进一步地，每个设备在每个RB上可以使用QPSK,涡轮编码传输块规模指标7(Transmission block size index 7，简称：TBS index 7)传输104bit作为一个数据包。如果每个设备希望广播6个数据包共计624bit,则可以把这6个原始数据包编码成8个编码数据包，编码矩阵可以采用如下的形式：
Figure PCTCN2014095868-appb-000013
其中，a1,...,a6是互不相等的
Figure PCTCN2014095868-appb-000014
中的元素，其中，
Figure PCTCN2014095868-appb-000015
为F2的104次代数扩张，并且都不等于0。使用这种编码矩阵构造的编码具有如下性质： 接收端任意收到6个编码数据包就可以解出原始数据包。
因此，对于任意的设备对UE_i和UE_j，UE_j只要在能够接收到UE_i信号的7次机会中成功进行任意6次turbo解码，就可以恢复出6个原始数据包。其发送效率为6/8。
需要说明的是，关于这种编码性质的证明：只需证明G的任意6行组成的子阵是满秩的。首先G的前6行组成的子阵是单位阵，自然是满秩的；其次G的前6行中的5行与第7行组成的子阵可以通过行变换变为单位帧，所以是满秩的；G的前6行中的5行与第8行组成的子阵可以通过行变换变为对角阵，且对角线上元素均非0，所以是满秩的。进一步地，G的前6行中的4行与后两行组成的子阵可以通过列变换变为如下形式：
Figure PCTCN2014095868-appb-000016
其中，ai不等于aj，所以是满秩的。
另外，如果使用喷泉码，接收端UE不可能从8个编码数据包中的任意6个中恢复出6个原始数据包。证明：假设某喷泉码的8个编码包中任意6个可以恢复出原始的6个包，设它的编码矩阵为B 8x6矩阵,其中B的元素只有0,1，则B的任意6行在F2上线性无关。特别地，B的前6行在F2上线性无关。设B的前六行组成的方阵为C,后2行组成的2阶方阵为D,即：
Figure PCTCN2014095868-appb-000017
则有
Figure PCTCN2014095868-appb-000018
的任意6行在F2上线性无关。其中，I6为6阶的单位阵。而事实上，只要D×C-1中的某一行不是全1行，则可以表示成I6中5行的线性组合，与[B×C-1的任意6行在F2上线性无关]矛盾，而如果D×C-1的2行都是全1行，则这2行就已经线性相关，也与[B×C-1的任意6行在F2上线性无关]矛盾。综上，这种喷泉码是不存在的。
进一步地，对于上文实施例提供的步骤100与步骤101，其实现方式不仅限于上述实施例，其还可以采用其他的编码方式进行编码，采用其他的跳频规。下面通过具体实施例对另一种实现方式进行说明。
一个带宽为20～130M的系统被从频域上划分为m部分，m<＝121,每部分带宽为10M或20M。每个10M带宽的部分的中间8.1MHz按照子载波间隔150kHz划分成54个子载波,两边各留0.95MHZ的保护带。每个20M带宽的部分可以由2个这样的10M带宽的部分组成。每个OFDM符号长度为6.67us，加上1.63us循环前缀构成8.3us的带前缀OFDM符号，每个10M或20M带宽部分的9个OFDM符号加上20us保护时间间隔构成一个RB。于是一个RB的时间长度为8.3us*9+20us＝94.7us。
图8为本发明实施例提供的一种资源示意图，参照图8，设系统周期为100ms,在100ms中有10个端到端广播资源池(图8中斜线填充的矩形)，每个端到端广播资源池中有9个时频子资源池，每个时频子资源池有m*11个RB，于是每个端到端广播资源池的时间长度为94.7*11*9＝9375.3us,每两个端到端广播资源池之间间隔617.6us。在每个端到端广播资源池中可以允许11m个设备发送信息，每个设备从第一个时频子资源池中选择一个RB进行发送，并在后续的8个时频子资源池中进行频时跳转，频时跳转可以按采用如下跳频规则：
i(t)＝i(t-1)modm
j(t)＝j(t-1)+i(t-1)mod11
其中t＝0,1,…8表示子时频子资源池的序号，i(t),j(t)分别表示某个设备在第t个时频子资源池中的频域/时域位置。这个公式表示每个设备在后一个时频子资源池中使用的频、时位置是如何根据在第一个时频子资源池中使用的频/时位置决定的。
采用这样的跳频规则，可以使得任意两个设备在这9个时频子资源池中至多2次同时发送，所以每个设备都有7次机会接收其它设备发出的信号。
每个设备在每个RB上可以使用QPSK,turbo编码TBS index 7传输104bit作为一个数据包。如果每个设备希望广播7个原始数据包共计728bit,则可以把这7个原始数据包编码成9个编码数据包，编码矩阵可以采用如 下形式：
Figure PCTCN2014095868-appb-000019
其中a1,...,a7是互不相等的
Figure PCTCN2014095868-appb-000020
中的元素，并且都不等于0。使用这种编码矩阵构造的编码具有如下性质：任意收到7个编码数据包就可以解出原始数据包。对于任意的设备对UE_i和UE_j，UE_j只要在能够接收到设备i信号的9次机会中成功进行任意7次turbo解码，就可以恢复出7个原始数据包。发送效率为7/9。
本领域普通技术人员可以理解：实现上述方法实施例的全部或部分步骤可以通过程序指令相关的硬件来完成，前述的程序可以存储于一计算机可读取存储介质中，该程序在执行时，执行包括上述方法实施例的步骤；而前述的存储介质包括：ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
最后应说明的是：以上各实施例仅用以说明本发明的技术方案，而非对其限制；尽管参照前述各实施例对本发明进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分或者全部技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本发明各实施例技术方案的范围。

Claims (9)

  1. 一种用户设备，其特征在于，包括：
    编码模块，用于将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一用户设备UE与至少一个其他UE共用的时域资源的个数最大值；
    广播模块，用于在一个广播周期内，在一个资源池的N个时频子资源池上广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
  2. 根据权利要求1所述的装置，其特征在于，所述编码模块，具体用于采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
    其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
  3. 根据权利要求2所述的装置，其特征在于，所述广播模块，具体用于：
    在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
    在所述N个时频子资源池中的第二个时频子资源池至第N个时频子资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
    Figure PCTCN2014095868-appb-100001
    其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资 源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中，
    Figure PCTCN2014095868-appb-100002
    不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
  4. 一种用户设备，其特征在于，包括：
    处理器，用于将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为第一用户设备UE与至少一个其他UE共用的时域资源的个数最大值；
    收发器，用于在一个广播周期内，在一个资源池的N个时频子资源池上对应广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
  5. 根据权利要求4所述的装置，其特征在于，所述处理器，具体用于采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
    其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
  6. 根据权利要求5所述的装置，其特征在于，所述收发器，具体用于：
    在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
    在所述N个时频子资源池中的第二个时频子资源池至第N个时频子 资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
    Figure PCTCN2014095868-appb-100003
    其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中，
    Figure PCTCN2014095868-appb-100004
    不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
  7. 一种广播通信方法，其特征在于，包括：
    第一用户设备UE将k个原始数据包编码为N个编码数据包，其中，所述k为小于或等于N-e并且大于1的正整数，所述e为所述第一UE与至少一个其他UE共用的时域资源的个数最大值；
    所述第一UE在一个广播周期内，在一个资源池的N个时频子资源池上对应广播所述N个编码数据包，其中，每个资源池广播一个所述编码数据包；且所述第一UE与至少一个其他UE属于第一设备组；所述第一UE与所述第一设备组的任意一个其他UE共用的所述时域资源的个数小于或等于所述e。
  8. 根据权利要求7所述的方法，其特征在于，所述第一用户设备UE将k个原始数据包编码为N个编码数据包，包括：
    所述第一UE采用编码矩阵将所述k个原始数据包编码为所述N个编码数据包；
    其中，所述原始数据包的长度为d，所述编码数据包的长度为d，所述编码矩阵是第一有限域上的矩阵，并且所述编码矩阵中的至少一个元素不属于第二有限域，所述第一有限域是所述第二有限域的d次代数扩张，所述第二有限域为具有两个元素的有限域，所述编码矩阵的任意k阶子方阵满秩。
  9. 根据权利要求8所述的方法，其特征在于，所述第一UE在一个广播周期内，将所述N个编码数据包分别在一个资源池的N个时频子资源池进行广播，包括：
    所述第一UE在所述N个时频子资源池中的第一个时频子资源池内，选择一个空闲资源广播所述N个编码数据包中的第一个所述编码数据包；
    所述第一UE在所述N个时频子资源池中的第二个时频子资源池至第N个时频子资源池内依次广播剩余的N-1个编码数据包，并且所述剩余的N-1个编码数据包在广播时满足如下跳频规则：
    Figure PCTCN2014095868-appb-100005
    其中，所述i和所述j属于第三有限域，所述第三有限域包含的元素个数等于频域单元个数，并且所述第三有限域包含的元素个数等于时域单元个数；所述i表示所述第一UE在第r个时频子资源池内，所使用的资源的频域单元编号，所述r为大于或等于0且小于或等于N-2的正整数；所述j表示所述第一UE在所述第r个时频子资源池内，所使用的资源的时域单元编号；所述inext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的频域单元编号；所述jnext表示所述第一UE在第r+1个时频子资源池内，所使用的资源的时域单元编号；所述A为所述第三有限域的上二阶可逆矩阵，其中，
    Figure PCTCN2014095868-appb-100006
    不属于特征向量集合，所述特征向量集合为{A,A2,...AN-1}。
PCT/CN2014/095868 2014-12-31 2014-12-31 一种广播通信方法及用户设备 WO2016106670A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201480084347.7A CN107113786A (zh) 2014-12-31 2014-12-31 一种广播通信方法及用户设备
PCT/CN2014/095868 WO2016106670A1 (zh) 2014-12-31 2014-12-31 一种广播通信方法及用户设备

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2014/095868 WO2016106670A1 (zh) 2014-12-31 2014-12-31 一种广播通信方法及用户设备

Publications (1)

Publication Number Publication Date
WO2016106670A1 true WO2016106670A1 (zh) 2016-07-07

Family

ID=56283944

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/095868 WO2016106670A1 (zh) 2014-12-31 2014-12-31 一种广播通信方法及用户设备

Country Status (2)

Country Link
CN (1) CN107113786A (zh)
WO (1) WO2016106670A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101960871A (zh) * 2008-02-29 2011-01-26 株式会社Ntt都科摩 基站、移动台以及组播/广播通信方法
CN103416004A (zh) * 2011-03-03 2013-11-27 三星电子株式会社 用于在广播通信系统中提供跳频方案的装置和方法
CN103841649A (zh) * 2014-03-19 2014-06-04 宇龙计算机通信科技(深圳)有限公司 终端直连通信方法和终端直连通信系统
CN104010275A (zh) * 2014-06-09 2014-08-27 宇龙计算机通信科技(深圳)有限公司 资源分配及广播通信方法和装置、基站和终端

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102130741B (zh) * 2010-11-09 2013-09-25 华为技术有限公司 一种信道质量信息的传输方法、基站及用户设备
CN103701558B (zh) * 2010-11-09 2017-10-10 华为技术有限公司 一种信道质量信息的传输方法、基站及用户设备
CN103037436B (zh) * 2012-12-21 2015-07-01 河海大学 一种基于HWMP的网络编码感知无线Mesh路由协议

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101960871A (zh) * 2008-02-29 2011-01-26 株式会社Ntt都科摩 基站、移动台以及组播/广播通信方法
CN103416004A (zh) * 2011-03-03 2013-11-27 三星电子株式会社 用于在广播通信系统中提供跳频方案的装置和方法
CN103841649A (zh) * 2014-03-19 2014-06-04 宇龙计算机通信科技(深圳)有限公司 终端直连通信方法和终端直连通信系统
CN104010275A (zh) * 2014-06-09 2014-08-27 宇龙计算机通信科技(深圳)有限公司 资源分配及广播通信方法和装置、基站和终端

Also Published As

Publication number Publication date
CN107113786A (zh) 2017-08-29

Similar Documents

Publication Publication Date Title
US9900885B2 (en) Method for signaling of resource allocation to adjust granularity in cellular multi-carrier system
CN107241920B (zh) 用于通信系统中的重复传输的资源分配
CN105338637B (zh) D2d通信处理方法、装置、d2d通信设备及基站
CN107343297B (zh) 一种无线通信中的方法和装置
JP2023139111A (ja) 情報送受信方法および装置
CN108632192B (zh) 数据传输的方法、设备和系统
WO2019029401A1 (zh) 参考信号信息的配置方法及装置
EP3451761B1 (en) Downlink control information sending method and detection method and device
WO2014110822A1 (zh) Pdsch的传输方法及装置
CN104904136B (zh) 数据传输方法及装置
US10142776B2 (en) Method, device and communication system for processing common search area
KR102317129B1 (ko) 복조 참조 신호 오버헤드 감소를 위한 시스템 및 방법
JP7027543B2 (ja) 情報送信方法及びデバイス
JP6544443B2 (ja) 通信システム、通信方法および基地局
CN103227694B (zh) 下行控制信息通知、解码方法与装置
CN107409295A (zh) 传输下行控制信息的方法和装置
KR20170108007A (ko) 지시 정보 전송 방법 및 장치
CN108605337B (zh) 一种传输控制信令的方法及设备
US10349398B2 (en) Non-orthogonal transmission method and apparatus in communication system
CN102281086A (zh) 参考信号的传输方法及装置
US20160234657A1 (en) Method, apparatus and network device for user data transmission
WO2018202201A1 (zh) 资源分配方法及装置
WO2016106670A1 (zh) 一种广播通信方法及用户设备
US20230008945A1 (en) Method and apparatus for uplink data transmission
CN107534863B (zh) 资源调度的方法、装置和设备

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: 14909479

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: 14909479

Country of ref document: EP

Kind code of ref document: A1