Patent Description:
An example of a cellular communication system is an architecture that is being standardized by the <NUM>rd Generation Partnership Project (3GPP). A recent development in this field is often referred to as the Long-Term Evolution (LTE) of the Universal Mobile Telecommunications System (UMTS) radio-access technology. E-UTRA (evolved UMTS Terrestrial Radio Access) is the air interface of 3GPP's LTE upgrade path for mobile networks. In LTE, base stations or access points (APs), which are referred to as enhanced Node B (eNBs), provide wireless access within a coverage area or cell. In LTE, mobile devices, or mobile stations are referred to as user equipments (UE). LTE has included a number of improvements or developments.

A global bandwidth shortage facing wireless carriers has motivated the consideration of the underutilized millimeter wave (mmWave) frequency spectrum for future broadband cellular communication networks, for example. mmWave (or extremely high frequency) may, for example, include the frequency range between <NUM> and <NUM> gigahertz (GHz). Radio waves in this band may, for example, have wavelengths from ten to one millimeters, giving it the name millimeter band or millimeter wave. The amount of wireless data will likely significantly increase in the coming years. Various techniques have been used in attempt to address this challenge including obtaining more spectrum, having smaller cell sizes, and using improved technologies enabling more bits/s/Hz. One element that may be used to obtain more spectrum is to move to higher frequencies, e.g., above <NUM>. For fifth generation wireless systems (<NUM>), an access architecture for deployment of cellular radio equipment employing mmWave radio spectrum has been proposed. Other example spectrums may also be used, such as cmWave radio spectrum (e.g., <NUM>-<NUM>).

The following background art, which may be regarded as useful for understanding the present invention and its relationship to the prior art, is acknowledged and briefly discussed.

The European patent application entitled "INFORMATION TRANSMISSION METHOD, APPARATUS, AND DEVICE" filed on February <NUM>, <NUM>, published on December <NUM>, <NUM>, with publication number <CIT>, and which falls within the terms of Art. <NUM>(<NUM>) of the European Patent Convention (EPC), discloses an information transmission method, apparatus and device. The method includes sending a MsgA of a <NUM>-step RA procedure to a network device according to a mapping relationship between a preamble parameter in the MsgA and a PUSCH parameter in the MsgA; wherein the preamble parameter includes a preamble index and a PRACH time-frequency resource, and the PUSCH parameter includes a PUSCH time-frequency resource and a PUSCH DMRS.

The European patent application entitled "TERMINAL DEVICE, BASE STATION DEVICE, COMMUNICATION METHOD, AND PROGRAM, FOR EXECUTING TWO-STEP RANDOM ACCESS PROCEDURE" filed on June <NUM>, <NUM>, published on December <NUM>, <NUM>, with publication number <CIT>, and which falls within the terms of Art. <NUM>(<NUM>) EPC, discloses a terminal apparatus that establishes, on the basis of a two-step random access procedure, an initial connection with a base station apparatus by transmitting a first message to the base station apparatus and receiving a second message, which is a reply to the first message, from the base station apparatus. The first message includes a preamble to be transmitted using one sequence selected from a plurality of sequence candidates and predetermined information for initial access, each one of the plurality of sequence candidates is associated with a radio resource to be used for transmitting the predetermined information, wherein a first radio resource associated with a first candidate of the plurality of sequence candidates is different from a second radio resource associated with a second candidate of the plurality of sequence candidates. The terminal apparatus, in the first message, transmits the preamble with a predetermined radio resource using the one sequence selected from the plurality of sequence candidates and transmits the predetermined information using a radio resource associated with the one selected sequence when establishing the initial connection.

The International patent application entitled "USER EQUIPMENTS, BASE STATIONS AND METHODS" filed on June <NUM>, <NUM>, published on December <NUM>, <NUM>, with publication number <CIT>, discloses a user equipment. Receiving circuitry is configured to receive downlink control information which is used for scheduling of a physical downlink shared channel and to receive, on the physical downlink shared channel, a random access response including a random access response grant. Transmitting circuitry is configured to perform, based on the random access response grant, a transmission on a physical uplink shared channel. In a case that a first value is indicated by using information included in the downlink control information, an index of a physical resource block(s) for the physical uplink shared channel is indicated by using the random access response grant. In a case that a second value is indicated by using the information included in the downlink control information, a plurality of indices of the physical resource block(s) for the physical uplink shared channel is indicated by using the random access response grant.

<NPL>, discusses a proposal for resource allocation for V2X communications.

<NPL>, discusses a proposal for random access procedures for Non-Terrestrial Networks (NTN).

<NPL>, is a summary of the email discussions held on <NUM>-step Random Access Channel (RACH) model and initial information contents.

According to some aspects, there is provided the subject matter of the independent claims. Some further aspects are defined in the dependent claims.

The details of one or more examples of implementations are set forth in the accompanying drawings and the description below.

<FIG> is a block diagram of a wireless network <NUM> according to an example implementation. In the wireless network <NUM> of <FIG>, user devices <NUM>, <NUM> and <NUM>, which may also be referred to as mobile stations (MSs) or user equipment (UEs), may be connected (and in communication) with a base station (BS) <NUM>, which may also be referred to as an access point (AP), an enhanced Node B (eNB), a gNB (which may be a <NUM> base station) or a network node. At least part of the functionalities of an access point (AP), base station (BS) or (e)Node B (eNB) may also be carried out by any node, server or host which may be operably coupled to a transceiver, such as a remote radio head. BS (or AP) <NUM> provides wireless coverage within a cell <NUM>, including to user devices <NUM>, <NUM>, and <NUM>. Although only three user devices are shown as being connected or attached to BS <NUM>, any number of user devices may be provided. BS <NUM> is also connected to a core network <NUM> via an interface <NUM>. This is merely one simple example of a wireless network, and others may be used.

A user device (user terminal, user equipment (UE)) may refer to a portable computing device that includes wireless mobile communication devices operating with or without a subscriber identification module (SIM), including, but not limited to, the following types of devices: a mobile station (MS), a mobile phone, a cell phone, a smartphone, a personal digital assistant (PDA), a handset, a device using a wireless modem (alarm or measurement device, etc.), a laptop and/or touch screen computer, a tablet, a phablet, a game console, a notebook, and a multimedia device, as examples.

The various example implementations may be applied to a wide variety of wireless technologies, wireless networks, such as LTE, LTE-A, <NUM> (New Radio, or NR), cmWave, and/or mmWave band networks, or any other wireless network or use case. LTE, <NUM>, cmWave and mmWave band networks are provided only as illustrative examples, and the various example implementations may be applied to any wireless technology/wireless network. The various example implementations may also be applied to a variety of different applications, services or use cases, such as, for example, ultra-reliability low latency communications (URLLC), Internet of Things (IoT), enhanced mobile broadband, massive machine type communications (MMTC), vehicle-to-vehicle (V2V), vehicle-to-device, etc. Each of these use cases, or types of UEs, may have its own set of requirements.

<FIG> is a diagram illustrating an example illustrating a four-step contention-based random access (RACH) procedure <NUM> according to an example implementation. Each of the steps involves the transmission of a message ("Msg1," "Msg2," "Msg3," "Msg4") between a UE and a gNB. As shown in <FIG>, Msg1 includes a preamble (physical RACH, or PRACH) sent from the UE to the gNB to initiate access to the cell associated with the gNB. Msg2 includes a random access response (RAR) sent from the gNB to the UE which instructs the UE to transmit data according to a schedule. In some implementations, Msg2 also includes a time advance command. Msg3 includes the payload (data) transmitted from the UE to the gNB according to the schedule. Msg4 is a contention resolution message. If Msg4 includes the contention resolution identifier expected by the UE, then the RACH procedure has been successfully completed. If Msg4 includes a contention resolution identifier different from that expected by the UE, then the RACH procedure has not been successfully completed.

The above-described four-step RACH has some latency, and increased signaling overhead due to the multiple signaling exchanges. One solution to such latency and increased signaling overhead is a two-step RACH procedure. Such a procedure is discussed with regard to <FIG>.

<FIG> is a diagram illustrating a two-step RACH procedure <NUM> according to an example implementation. In the two-step RACH procedure <NUM> illustrated in <FIG>, MsgA combines the preamble signal (Msg1) and the data signal (Msg3), and MsgB combines the random access response (Msg2) and the contention resolution (Msg4).

Nevertheless, there are no detailed proposals for the structure of the UE-to-gNB message of two-step RACH. For example, it has been proposed that the PRACH preamble and PUSCH in MsgA be time-division multiplexed (TDMed). An example implementation has a PRACH occasion followed by a PUSCH allocation for the data part of MsgA. This, however, leads to all data of all the preambles being mapped onto the same PUSCH allocation and increases the probability of data collision and false decoding.

In contrast to the above-described conventional RACH procedures, an improved technique includes a framework for a two-step RACH in which a first message (MsgA) from the UE to the gNB has data carrying resources (i.e., two-step RACH PUSCH resource units) is organized into a time-frequency array defined by a mapping to a plurality of preambles. Such a two-step RACH has less latency than the four-step RACH due to fewer signaling exchanges. Moreover, this two-step RACH also causes the UE to use less power due to a decreased signaling overhead.

<FIG> is a diagram illustrating a two-step RACH procedure <NUM> with fallback according to an example implementation. As shown in <FIG>, however, there is a preliminary step <NUM>, which involves a broadcast signal from the gNB. The network broadcasts a two-step RACH configuration in the remaining minimum system information (RMSI), system information block <NUM> (SIB1), as the two-step RACH can be an initial access scheme. The two-step RACH configuration includes a set of preambles and a mapping between the preambles and a schedule by which a UE <NUM> may send data to a gNB <NUM>. Further details about the mapping are described with regard to <FIG>.

As shown in <FIG>, the MsgA generation and transmission by the UE <NUM> is divided into two pieces, 1a in which the preamble is selected, and 1b in which a physical resource for sending data is selected.

In 1a, in some implementations, the preamble is a Zadoff-Chu (ZC) sequence and is transmitted over the PRACH (e.g. the two-step procedure preambles are a subset of the available PRACH preambles or there are random access opportunities (PRACH occasions) fully dedicated to the two-step procedure). In some implementations, the preamble has another structure other than the one used in the PRACH, but that is used both for activity detection (for the gNB <NUM> to detect that a transmission is occurring), timing estimation and as a reference symbol for the data transmission (for the gNB <NUM> to estimate the channel so that it can decode the data part of MsgA).

In 1b, the UE <NUM> selects a physical uplink shared channel (PUSCH) resource according with the configuration broadcast by the network in step <NUM> and according with the UE's <NUM> own payload requirements. Further details with regard to 1b are described in detail with regard to <FIG>.

In 2a, the gNB <NUM>, upon successfully decoding the Msg A, transmits a MsgB in order to acknowledge MsgA reception, perform contention resolution and potentially provide any other information that is associated with the request in Msg A. In 2b, the gNB <NUM> detects the preamble of MsgA, but does not successfully decode the data payload of MsgA. In this case, a Msg2 (see <FIG>) is transmitted instead that directs the UE <NUM> towards a fall back four-step procedure.

<FIG> is a diagram illustrating a data part <NUM> of a MsgA (i.e., a message from the UE <NUM> to the gNB <NUM>) according to an example implementation. In some implementations, as described herein, the preamble is transmitted in a PRACH Occasion (RO). In some implementations, another approach for the preamble construction is followed. In some implementations, a RO can be dedicated for a two-step RACH. In some implementations, the RO is shared with two-step RACH.

In the configuration sent by the gNB <NUM> in step <NUM>, there are MAXPreambleIndex preambles for two-step RACH. In some implementations, MAXPreambleIndex is the number of preambles in one RO. In some implementations, MAXPreambleIndex is the number of preambles in multiple ROs. In some implementations, MAXPreambleIndex is the number of preambles in a portion of a RO. Each of the MAXPreamblelndex preambles of the configuration may be represented by a respective preamble index i. Signal representing the preamble index i is transmitted by the gNB <NUM> in a RO, where <NUM> ≤ i < MAXPreambleIndex. As is discussed with regard to step 1b, the preamble index i determines the time, frequency and DMRS port of the PUSCH resources used for data transmission.

In a time-frequency grid in time and frequency space, multiple resources can be used for data transmission according to the preamble index. Each two-step RACH PUSCH resource unit in the time-frequency grid has a time duration of mPUSCHSym, and an extent in the frequency domain of nPUSCHPRB as shown in <FIG>. The symbol duration and PRB size is given by numerology of the PUSCH used for data transmission.

<FIG> is a diagram illustrating a structure <NUM> of the MsgA according to an example implementation. Consisting of PRACH occasion (it is also possible to have multiple PRACH occasions) and a two-step RACH PUSCH resource group consisting of an array of two-step RACH PUSCH resource units.

As shown in <FIG>, the MsgA PUSCH frequency resource kPUSCH ∈ {<NUM>,<NUM>,. , n - <NUM>}, where n is the number of frequency-division multiplexed (FDMed) two-step RACH PUSCH resource units for data transmission corresponding to one (or more) preamble RO. The MsgA PUSCH time resource lPUSCH ∈ {<NUM>,<NUM>,. m - <NUM>}, where m is the number of TDMed two-step RACH PUSCH resource units for data transmission corresponding to one (or more) preamble RO. The two-step RACH PUSCH resource units are consecutive in frequency, in time the two-step RACH PUSCH resource units can be consecutive, or can have a gap to accommodate a round-trip delay larger than the cyclic prefix (CP) and avoid interfering with the subsequent transmission. In the structure <NUM>, the earliest PUSCH resource at the lowest frequency starts Preamble2DataTime symbols/slots from the start of the RO used for preamble transmission in the time domain, this PUSCH resource also starts Preamble2DataFreq physical resource blocks (PRBs) from the start of the RO used for preamble transmission in the frequency domain. Preamble2DataTime and Preamble2DataFreq are given by numerology of the PUSCH used for data transmission. Alternatively, the time and frequency of the two-step RACH resource group can be configured with an absolute time that repeats periodically and an absolute frequency within the carrier and/or bandwidth part.

The allocation of PUSH time and frequency resources to the ith preamble is performed as follows. Let A = MAXPreambleIndex mod(m · n), <MAT>, and <MAT>. Further define <MAT>.

Then the time domain resource index is <MAT> and the frequency domain resource index is <MAT>.

<FIG> illustrates a table <NUM> illustrating an allocation of preamble index "i" to time "l" frequency "k" resources according to an example implementation. As illustrated in <FIG>, the table is generated using the following values: MAXPreambleIndex = <NUM>, m = <NUM>, n = <NUM>.

As can be seen in <FIG>, there may be more than one preamble that is mapped to a PUSCH time and frequency resource. Each such preamble for a particular PUSCH time and frequency resource may be assigned to a demodulation reference signal (DMRS) port of the PUSCH time and frequency resource as follows.

Let there be nPreamble values are allocated to a PUSCH time and frequency resource such the logical preamble index allocated to that PUSCH resource is given by h ∈ {<NUM>,<NUM>,. nPreamble - <NUM>}. Moreover, let the PUSCH time and frequency resource have nDMRSPorts DMRS ports, where the DMRS port index j ∈ {<NUM>,<NUM>,. nDMRSPorts - <NUM>}. Then the preamble index h is allocated to the DMRS port index j as follows. Let D = nPreamble mod nDMRSPorts, <MAT> , and <MAT>. Then <MAT>.

The proposed mappings of preamble indices to PUSCH resources and DMRS ports (including other mappings following the same principles) as well as the RO dedicated for the two-step are shared with the UE at step <NUM> via that broadcasted RMSI (SIB1).

Now that the mapping of a preamble to a PUSCH time and frequency resource has been defined, the PUSCH resource selection based on the UE payload is described herein. Note that there are multiple trigger causes for two-step RACH. Each trigger can have a different size for MsgA. Even for the same trigger, MsgA can have different size for different scenarios. Different MsgA configurations may have different number of PRBs nPUSCHPRB and number of OFDM symbols nPUSCHSym. Accordingly, there are different approaches to selecting a PUSCH resource; such approaches are discussed with regard to <FIG>.

<FIG> is a diagram illustrating a two-step RACH <NUM> with multiple PUSCH configurations according to an example implementation. As shown in <FIG>, the PRACH preambles are partitioned into different groups according to the msgA size. These preambles may have a direct mapping to a PUSCH block with an adequate number of resources. The preambles of the different groups can be in the same RO, or in different ROs. <FIG> shows a two-step RACH <NUM> with two configurations, two-step RACH PUSCH resource group A and two-step RACH PUSCH resource group B. In this example implementation, the preambles of the two-step RACH share the same PRACH occasion with four-step CBRA preambles. Each two-step RACH PUSCH resource group configuration is an array of two-step RACH PUSCH resource units (as shown in <FIG>) with a different amount of resources.

In some implementations, the more often occurring triggers would have a reduced contention space, i.e. they would have a higher level of collisions.

<FIG> is a diagram illustrating a two-step RACH <NUM> with common preamble set and different PUSCH configurations according to an example implementation. As shown in <FIG>, the PRACH preambles are not partitioned. Nevertheless, after selecting a preamble, the UE selects a two-step RACH PUSCH resource unit with an adequate amount of resources from the pool of available two-step RACH PUSCH resource groups. In some implementations, each preamble is associated with multiple two-step RACH PUSCH resource units, in different groups, and each two-step PUSCH resource unit has a different resource allocation size. The UE selects the two-step PUSCH resource unit based on the amount of resources it needs. The gNB tries different hypotheses to determine which PUSCH resource the UE has sent.

<FIG> shows an example with a PRACH occasion that is not partitioned. Each preamble index in the PRACH occasion is associated with a two-step RACH PUSCH resource unit in each of the three two-step RACH PUSCH groups shown in <FIG>. Each PUSCH resource group is similar to the MsgA data part of <FIG>.

In the approach illustrated in <FIG>, there is a more complex decoding as there would not be a direct mapping between PRACH preamble and PUSCH resource. This approach increases the probability of collision for the same PUSCH resource usage and/or increases the PUSCH resource usage.

Another approach involves having a single PUSCH resource allocation size. Smaller payloads are then padded or rate-matched to fit within a single PUSCH resource allocation size.

Yet another approach involves performing a resource partitioning by creating a set of "data carrying candidates", as shown in <FIG>. In some implementations, the configuration will divide the resources into clusters of resources that allows for the UE to transmit the uplink data (PUSCH) for the random access message payload. This approach is discussed in detail with regard to <FIG> and <FIG>.

<FIG> is a diagram illustrating orthogonal resources <NUM> for different payload sizes of MsgA according to an example implementation. <FIG> shows that the resources are divided into two sets <NUM> and <NUM>, each set being able to carry two different payload sizes. As shown in the <FIG>, the first X messages are pre-assigned to the smaller payloads, while the larger payloads (assuming up to Y messages) are reserved some other physical resources. By knowing the physical resources assigned to the message, as well as the amount of messages for X and Y (and payload size difference or ratio between X and Y), it is possible to generate a proper mapping between the payload sizes and the resources. An example of this approach is discussed with regard to <FIG>.

<FIG> is a diagram illustrating overlaid resources <NUM> and <NUM> for different payload sizes of MsgA according to an example implementation. In <FIG>, the UE is allowed to create new "virtual" resources in the physical resources normally reserved for the larger payloads to carry messages with low payload. Allowance of using such resources on a temporary basis could potentially be triggered by network signaling via the RMSI (SIB1) in step <NUM>.

In some implementations, the data carrying candidates are organized in an array of basic two-step RACH PUSCH resource units as shown in <FIG>. The basic unit is the smallest resource allocation size of MsgA data. When transmitting the data part of MsgA, the UE allocates one or more basic units depending on the configuration of MsgA and the amount of resources needed to transmit the MsgA payload. The preamble index is associated with the selected PUSCH resource. There are two alternatives in this scenario, discussed in further detail with regard to <FIG> and <FIG>, respectively.

<FIG> is a diagram illustrating a two-step RACH PUSCH resource group <NUM> in basic two-step RACH PUSCH resource units with preamble indicating PUSCH starting location and size according to an example implementation. The size determines the number of basic two-step RACH PUSCH units to use when transmitting the data part of MsgA. That is, the preamble index indicates the starting position (in time and frequency) of the PUSCH resource as well as the PUSCH resource allocation size (in number of basic units). <FIG> shows an example where the PUSCH resource can have a size of one or two basic units, and preamble index indicates the PUSCH resource starting position in time and frequency, as well as the PUSCH resource size. The preamble index can also indicate the DMRS port of the PUSCH resource. This alternative reduces the gNB receiver complexity, as it avoids decoding multiple hypotheses.

As an example, consider eight basic two-step RACH PUSCH resource units for MsgA as shown in <FIG>. These are denoted by A, B, C, D, E, F, G, H. In this example, the network configures the following possible PUSCH allocations eight single basic resource allocation: A, B, C, D, E, F, G, H, and <NUM> double resource allocation: AB, CD, EF, GH. In total, there are twelve possible allocations that can be signalled by the preamble. The preamble space, in this example is divided into twelve sets. When a preamble is selected from a set, it points to the PUSCH resource corresponding to that set.

<FIG> is a diagram illustrating PUSCH resource allocation in basic two-step RACH PUSCH resource units with preamble indicating PUSCH starting location according to an example implementation. That is, the preamble index indicates the starting position (in time and frequency). The preamble index can also indicate the DMRS port of the PUSCH resource. The UE selects PUSCH resource size based on the amount of data and MCS it needs to transmit. The size determines the number of basic two-step RACH PUSCH units to use when transmitting the data part of MsgA according to the sizes allowed by configuration. The gNB tries multiple decoding hypotheses to find the PUSCH resource size sent by the UE.

As an example, consider eight basic two-step RACH PUSCH resource units for MsgA in PUSCH resource group <NUM> as shown in <FIG>. These are denoted by A, B, C, D, E, F, G, H. In this example, the network configures the following possible PUSCH allocations eight single basic resource allocation: A, B, C, D, E, F, G, H, and <NUM> double resource allocation: AB, CD, EF, GH. In total, there are twelve possible allocations, however, there are only eight possible starting positions. The preamble space, in this example is divided into eight sets corresponding to the starting positions. When a preamble is selected from a set, it points to the PUSCH resource starting position corresponding to that set. If a preamble points to a starting position with two possible resource allocation sizes (e.g., A and AB), the network decodes multiple hypotheses to determine the PUSCH resource allocation the UE used to transmit the data part of MsgA.

<FIG> is a flow chart illustrating an example method <NUM> of performing the improved techniques. Operation <NUM> includes receiving, by a user equipment (UE), information from a network, the information including (i) a plurality of preambles to be transmitted over a physical random access channel (PRACH) and (ii) locations and size and DMRS ports of physical uplink shared channel (PUSCH) resources in time and frequency space by which data is to be transmitted to a base station (gNB); and (iii) mapping information between the preambles and PUSCH resources. Operation <NUM> includes, after receiving the information, performing, by the UE, a preamble selection operation to produce a selected preamble of the plurality of preambles. Operation <NUM> includes performing, by the UE, a PUSCH determination operation to produce a location and size of a PUSCH resource in the time and frequency space and the DMRS port of the PUSCH resource, the location and the size of the PUSCH resource and the DMRS port of the PUSCH resource being based on the selected preamble and/or the amount of PUSCH resource elements needed to transmit the payload from the UE. Operation <NUM> includes generating, by the UE, a single message that includes the selected preamble and the data. Operation <NUM> includes transmitting, by the UE, the single message to the gNB during a time and over a set of frequencies determined by the location of the PUSCH resource in the time and frequency space.

Further example implementations and/or example details will now be provided.

<FIG> is a block diagram of a wireless station (e.g., AP, BS, eNB, UE or user device) <NUM> according to an example implementation. The wireless station <NUM> may include, for example, one or two RF (radio frequency) or wireless transceivers 1202A, 1202B, where each wireless transceiver includes a transmitter to transmit signals and a receiver to receive signals. The wireless station also includes a processor or control unit/entity (controller) <NUM> to execute instructions or software and control transmission and receptions of signals, and a memory <NUM> to store data and/or instructions.

Processor <NUM> may also make decisions or determinations, generate frames, packets or messages for transmission, decode received frames or messages for further processing, and other tasks or functions described herein. Processor <NUM>, which may be a baseband processor, for example, may generate messages, packets, frames or other signals for transmission via wireless transceiver <NUM> (1202A or 1202B). Processor <NUM> may control transmission of signals or messages over a wireless network, and may control the reception of signals or messages, etc., via a wireless network (e.g., after being down-converted by wireless transceiver <NUM>, for example). Processor <NUM> may be programmable and capable of executing software or other instructions stored in memory or on other computer media to perform the various tasks and functions described above, such as one or more of the tasks or methods described above. Processor <NUM> may be (or may include), for example, hardware, programmable logic, a programmable processor that executes software or firmware, and/or any combination of these. Using other terminology, processor <NUM> and transceiver <NUM> together may be considered as a wireless transmitter/receiver system, for example.

According to another example implementation, RF or wireless transceiver(s) 1202A/1202B may receive signals or data and/or transmit or send signals or data. Processor <NUM> (and possibly transceivers 1202A/1202B) may control the RF or wireless transceiver 1202A or 1202B to receive, send, broadcast or transmit signals or data.

The embodiments are not, however, restricted to the system that is given as an example, but a person skilled in the art may apply the solution to other communication systems. Another example of a suitable communications system is the <NUM> concept. It is assumed that network architecture in <NUM> will be quite similar to that of the LTE-advanced. <NUM> is likely to use multiple input - multiple output (MIMO) antennas, many more base stations or nodes than the LTE (a so-called small cell concept), including macro sites operating in co-operation with smaller stations and perhaps also employing a variety of radio technologies for better coverage and enhanced data rates.

It should be appreciated that future networks will most probably utilise network functions virtualization (NFV) which is a network architecture concept that proposes virtualizing network node functions into "building blocks" or entities that may be operationally connected or linked together to provide services. A virtualized network function (VNF) may comprise one or more virtual machines running computer program codes using standard or general type servers instead of customized hardware. Cloud computing or data storage may also be utilized. In radio communications this may mean node operations may be carried out, at least partly, in a server, host or node operationally coupled to a remote radio head.

Implementations of the various techniques described herein may be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Implementations may be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable storage device or in a propagated signal, for execution by, or to control the operation of, a data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. Implementations may also be provided on a computer readable medium or computer readable storage medium, which may be a non-transitory medium. Implementations of the various techniques may also include implementations provided via transitory signals or media, and/or programs and/or software implementations that are downloadable via the Internet or other network(s), either wired networks and/or wireless networks. In addition, implementations may be provided via machine type communications (MTC), and also via an Internet of Things (IOT).

Furthermore, implementations of the various techniques described herein may use a cyber-physical system (CPS) (a system of collaborating computational elements controlling physical entities). CPS may enable the implementation and exploitation of massive amounts of interconnected ICT devices (sensors, actuators, processors microcontrollers,. ) embedded in physical objects at different locations. The rise in popularity of smartphones has increased interest in the area of mobile cyber-physical systems. Therefore, various implementations of techniques described herein may be provided via one or more of these technologies.

To provide for interaction with a user, implementations may be implemented on a computer having a display device, e.g., a cathode ray tube (CRT) or liquid crystal display (LCD) monitor, for displaying information to the user and a user interface, such as a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer.

Claim 1:
An apparatus (<NUM>; <NUM>; <NUM>; <NUM>), comprising:
means for receiving information from a network, the information including a plurality of preambles to be transmitted over a physical random access channel, locations and size and demodulation reference signal, DMRS, ports of physical uplink shared channel resources in time and frequency space by which data is to be transmitted to a base station (<NUM>; <NUM>) and mapping information between the preambles and the physical uplink shared channel resources;
means for, after receiving the information, performing a preamble selection operation to produce a selected preamble of the plurality of preambles; and
means for performing a physical uplink shared channel determination operation to produce a location and size of a physical uplink shared channel resource in the time and frequency space and the DMRS port of the physical uplink shared channel resource, the location and size of the physical uplink shared channel resource and the DMRS port being based on the selected preamble,
wherein each of the plurality of preambles is associated with a respective group of a plurality of groups based on a size of a payload associated with the data to be transmitted with that preamble in a single message.