Some content of this application is unavailable at the moment.
If this situation persist, please contact us atFeedback&Contact
1. (WO2018226137) METHODS, APPARATUS AND MACHINE-READABLE MEDIUMS FOR GENERATION AND TRANSMISSION OF A MESSAGE IN A WIRELESS COMMUNICATIONS NETWORK
Note: Text based on automatic Optical Character Recognition processes. Please use the PDF version for legal matters

CLAIMS

1. A method in a transmitting node (700, 800), the transmitting node operative in a wireless communications network, the method comprising:

processing a block of data to generate a message for transmission by the transmitting node; and

transmitting (542, 612) the message;

wherein processing the block of data comprises:

performing (506) a scrambling algorithm on data using a scrambling code; and

subsequent to performing the scrambling algorithm, performing (514) a rate-matching algorithm to match a number of bits for transmission to radio resources available to the transmitting node.

2. The method according to claim 1 , wherein processing the block of data further comprises:

storing (508, 512, 516, 520, 524, 528, 532, 536, 540) data on which the scrambling algorithm has been performed; and

responsive to a determination to transmit the message:

generating the message based on the stored data; and

transmitting (542) the message.

3. The method according to claim 2, wherein the rate-matching algorithm is performed on the stored data as part of the step of generating the message.

4. The method according to claim 2, wherein the stored data comprises data on which the scrambling algorithm and the rate-matching algorithm have been performed.

5. The method according to any one of claims 2 to 4, further comprising making a determination to transmit the message upon determining that:

a previous message comprising at least some of the block of data was not successfully received by a receiving node; or

a radio channel is available for transmission by the transmitting node.

6. The method according to any one of the preceding claims, wherein processing the message further comprises:

prior to performing the rate-matching algorithm, performing (510) a channel encoding algorithm on data on which the scrambling algorithm has been performed.

7. The method according to any one of the preceding claims, wherein processing the message further comprises:

subsequent to performing the rate-matching algorithm, performing (522) a modulating algorithm.

8. The method according to any one of the preceding claims, wherein processing the message further comprises:

subsequent to performing the rate-matching algorithm, performing (526, 604) a layer-mapping algorithm to map data to one or more layers for transmission by the transmitting node.

9. The method according to any one of the preceding claims, wherein processing the message further comprises:

subsequent to performing the rate-matching algorithm, performing (530, 606) a precoding algorithm to precode data for MIMO transmission by the transmitting node.

10. The method according to any one of the preceding claims, wherein processing the message further comprises:

subsequent to performing the rate-matching algorithm, performing (534, 608) a resource element mapping algorithm to map data to one or more resource elements for transmission by the transmitting node.

1 1. The method according to any one of the preceding claims, wherein processing the message further comprises:

subsequent to performing the rate-matching algorithm, generating (538, 610) one or more orthogonal frequency division multiplexing, OFDM, symbols.

12. The method according to any one of the preceding claims, wherein the scrambling code is time-independent.

13. The method according to claim 12, wherein the time-independent scrambling code is initialized based on one or more time-independent parameters.

14. The method according to claim 13, wherein the time-independent parameters comprise one or more of: an identity of the transmitting node; an identity of a cell served by the transmitting node, or by which the transmitting node is served; a number of layers over which the message is transmitted; and an identifier associated with a physical channel over which the message is transmitted.

15. The method according to any one of the preceding claims, wherein the transmitting node is one of: a radio access node and a wireless terminal device.

16. A node (700, 800) for a wireless communications network, the node configured to:

process a block of data to generate a message for transmission by the transmitting node; and

transmit the message;

wherein processing the block of data comprises:

performing a scrambling algorithm on data using a scrambling code; and subsequent to performing the scrambling algorithm, performing a rate- matching algorithm to match a number of bits for transmission to radio resources available to the transmitting node.

17. The node according to claim 16, further configured to carry out the method according to any one of claims 2 to 15.

18. A node (700) for a wireless communications network, the node comprising processing circuitry (702) and a machine-readable medium (704) storing instructions which, when executed by the processing circuitry, cause the node to:

process a block of data to generate a message for transmission by the node; and transmit (542, 612) the message;

wherein the node is caused to process the block of data by:

performing (506) a scrambling algorithm on data using a scrambling code; and

subsequent to performing the scrambling algorithm, performing (514) a rate-matching algorithm to match a number of bits for transmission to radio resources available to the node.

19. The node according to claim 18, wherein the node is caused to process the block of data by:

storing (508, 512, 516, 520, 524, 528, 532, 536, 540) data on which the scrambling algorithm has been performed; and

responsive to a determination to transmit the message:

generating the message based on the stored data; and

transmitting (542, 612) the message.

20. The node according to claim 19, wherein the rate-matching algorithm is performed on the stored data as part of the step of generating the message.

21. The node according to claim 19, wherein the stored data comprises data on which the scrambling algorithm and the rate-matching algorithm have been performed.

22. The node according to any one of claims 19 to 21 , wherein the node is caused to make a determination to transmit the message upon determining that:

a previous message comprising at least some of the block of data was not successfully received by a receiving node; or

a radio channel is available for transmission by the transmitting node.

23. The node according to any one of claims 18 to 22, wherein the node is caused to process the message by:

prior to performing the rate-matching algorithm, performing (510) a channel encoding algorithm on data on which the scrambling algorithm has been performed.

24. The node according to any one of claims 18 to 23, wherein the node is caused to process the message by:

subsequent to performing the rate-matching algorithm, performing (522) a modulating algorithm.

25. The node according to any one of claims 18 to 24, wherein the node is caused to process the message by:

subsequent to performing the rate-matching algorithm, performing (526, 604) a layer-mapping algorithm to map data to one or more layers for transmission by the node.

26. The node according to any one of claims 18 to 25, wherein the node is caused to process the message by:

subsequent to performing the rate-matching algorithm, performing (530, 606) a precoding algorithm to precode data for MIMO transmission by the node.

27. The node according to any one of claims 18 to 26, wherein the node is caused to process the message by:

subsequent to performing the rate-matching algorithm, performing (534, 608) a resource element mapping algorithm to map data to one or more resource elements for transmission by the node.

28. The node according to any one of claims 18 to 27, wherein the node is caused to process the message by:

subsequent to performing the rate-matching algorithm, generating (538, 610) one or more orthogonal frequency division multiplexing, OFDM, symbols.

29. The node according to any one of claims 18 to 28, wherein the scrambling code is time-independent.

30. The node according to claim 29, wherein the time-independent scrambling code is initialized based on one or more time-independent parameters.

31. The node according to claim 30, wherein the time-independent parameters comprise one or more of: an identity of the node; an identity of a cell served by the transmitting node, or by which the transmitting node is served; a number of layers over which the message is transmitted; and an identifier associated with a physical channel over which the message is transmitted.

32. The node according to any one of claims 18 to 31 , wherein the node is one of: a radio access node and a wireless terminal device.

33. A node (800) for a wireless communications network, the node comprising:

a processing module (802) configured to process a block of data to generate a message for transmission by the node; and

a transmitting module (804) configured to transmit the message;

wherein the processing module is configured to:

perform a scrambling algorithm on data using a scrambling code; and subsequent to performing the scrambling algorithm, perform a rate- matching algorithm to match a number of bits for transmission to radio resources available to the node.

34. A machine-readable medium storing instructions which, when executed by processing circuitry of a node for a wireless communications network, cause the node to:

process a block of data to generate a message for transmission by the node; and transmit the message;

wherein the node is caused to process the block of data by:

performing a scrambling algorithm on data using a scrambling code; and subsequent to performing the scrambling algorithm, performing a rate- matching algorithm to match a number of bits for transmission to radio resources available to the node.