Transmissions of blocks of data in distributed MIMO systems

Abstract

A method (200) of transmitting a block of data in a distributed MIMO system is disclosed. The distributed MIMO system comprises a plurality of access points (A.sub.1, . . . , A.sub.K), wherein access points (A.sub.j) are grouped into a first set of M groups and a second set of M groups, different from the first set, wherein M is an integer. A first antenna port mapping assigns each group of the first set to a unique one of M antenna ports. A second antenna port mapping assigns each group of the second set to a unique one of M antenna ports. The method comprises transmitting (220) the block of data using both the first and the second antenna port mapping.

Claims

1. A method of transmitting a block of data in a distributed multiple-input multiple-output (MIMO) system, wherein the distributed MIMO system comprises: a plurality of access points; and wherein the access points are grouped into a first set of M groups and a second set of M groups, different from the first set, wherein M is an integer; a first antenna port mapping assigns each group of the first set to a respective unique one of M antenna ports; and a second antenna port mapping assigns each group of the second set to a respective unique one of M antenna ports; the method comprising: transmitting the block of data using both the first and the second antenna port mapping.

2. The method of claim 1, wherein transmitting the block of data comprises: in a first time slot, transmitting the block of data using the first antenna port mapping; and in a later second time slot, transmitting the block of data using the second antenna port mapping.

3. The method of claim 1, wherein transmitting the block of data comprises: in a first frequency band, transmitting the block of data using the first antenna port mapping; and in a second frequency band, transmitting the block of data using the second antenna port mapping.

4. The method of claim 1, wherein the block of data is represented with symbols coded with a space-time-frequency block code.

5. The method of claim 4, wherein the space-time-frequency block code is an Alamouti code.

6. The method of claim 1, wherein the block of data is a synchronization signal block, comprising at least one synchronization signal.

7. The method of claim 6, wherein the synchronization signal block comprises a primary and a secondary synchronization signal.

8. The method of claim 1, wherein the block of data represents a broadcast channel.

9. The method of claim 1, wherein access points are grouped into at least a third set of M groups, each different from each other and from the first set and the second set; and for each of the at least third set, an associated antenna port mapping assigns each group of that set to a respective unique one of M antenna ports; the method further comprising: transmitting the block of data also using each of said associated antenna port mappings.

10. A central unit for a distributed MIMO system, wherein said distributed MIMO system comprises a plurality of access points, the central unit comprising: a communication interface for communicating with the access points; and a processing circuit configured to control the access points to transmit blocks of data according to the method of claim 1.

11. A for a distributed MIMO system, comprising: a connection interface configured to be connected to a central unit of the distributed MIMO system and receive blocks of data to be transmitted from the central unit; a plurality of access points, each comprising a transceiver for communicating wirelessly with wireless devices; a processing circuit; and a communication interface connected to said connection interface; wherein the access points are grouped into a first set of M groups and a second set of M groups, different from the first set, wherein M is an integer, and wherein processing circuits of the plurality of access points are configured to control the transceivers to transmit one or more of the blocks of data using both a first antenna port mapping and a second antenna port mapping, wherein the first antenna port mapping assigns each group of the first set to a respective unique one of M antenna ports and the second antenna port mapping assigns each group of the second set to a respective unique one of M antenna ports.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) FIG. 1 illustrates a deployment scenario.

(2) FIG. 2 illustrates an Alamouti code.

(3) FIG. 3 illustrates SS Blocks transmitted in SS bursts.

(4) FIG. 4 illustrates differences between a localized massive MIMO system and a distributed massive MIMO system.

(5) FIGS. 5-9 illustrates an example.

(6) FIGS. 10-12 are block diagrams.

(7) FIGS. 13-15 show flow charts.

(8) FIGS. 16-17 schematically illustrate computer-readable media and processing circuits.

DETAILED DESCRIPTION

(9) This disclosure aims at providing an efficient method of transmitting SS Bursts and similar signaling in a network with a distributed MIMO deployment, such as a distributed massive MIMO deployment.

(10) The term “access point” is used in this disclosure. Sometimes, “antenna” or “antenna element” is used with the same meaning in the field of MIMO transmissions.

(11) Distributed massive MIMO is a promising technique in many scenarios. However, no effective solutions for broadcasting of e.g. system information in such cell-free/distributed networks are known.

(12) Existing solutions for broadcasting of system information come in two categories:

(13) 1) Assuming conventional cellular operation and using diversity transmission techniques. Here, one common diversity technique is the beam-sweeping method, which is only well-defined for co-located antenna arrays that form beams in angular directions, and not for cell-free networks with distributed antenna elements where the radiation pattern is shaped by the transmission from many access points. Another diversity technique is space-time coding, but this technique is also developed for cellular systems and is not directly applicable in a cell-free network. In particular, it requires the transmission of downlink pilots which does not scale in a cell-free system where the number of access points can be vastly larger than the number of samples per channel coherence block. Antenna hopping is another example of techniques in this category, but it does not work in cell-free because of a similar scalability problem.

(14) 2) Single-frequency network broadcasting, where every access point sends the same signal. Here, no spatial diversity against small scale fading is achieved and hence the reliability of the broadcasted signal is degraded by channel fading. This is particularly serious for applications with narrowband signals and applications where there is little mobility (internet-of-things. MTC, . . . ).

(15) Space-time-frequency block codes are straightforward to apply in both centralized and distributed antenna ports, as depicted in FIG. 4, where a UE sees two antenna ports; antenna port #0 (solid arrows) and antenna port #1 (dashed arrows). One difference is that in a centralized deployment of antenna ports (left part of the figure), all ports have equivalent large scale fading properties, while this is not the case in a deployment with distributed antenna elements (right part of the figure). In the latter case, antennas of antenna port #1 are located further away, and they will be less effective in providing diversity to the UE. In case the signals that constitute antenna port #0 (transmitted from the antennas closest to the UE in this example) happen to add up destructively, due to unfortunate fast fading, then the UE may not be able to decode the transmission from the network. In this example the unfortunate mapping of the two nearest antenna elements to the same antenna port in the space-time-frequency code was problematic. It is an objective of some embodiments of the present disclosure to avoid this kind of operation when applying space-time-frequency codes to distributed antenna deployments.

(16) According to some embodiments of this disclosure, the access points jointly broadcast system information using a diversity scheme consisting of a hybrid between space-time block coding and access point hopping. Such a scheme provides diversity towards small-scale channel fading and macro-diversity.

(17) According to some embodiments, the UE can also extract context information from the system information broadcast, which describes the subset of access points that provide the largest SNRs, and use this information to determine how to further access to the network.

(18) In some embodiment, time is slotted. In even slots, a first set S1 of groups of access points (APs) transmit system information using space-time coding. This set is further partitioned into ports S1P1, S1P2, S1P3, . . . , one group of the set is assigned to each port, where the number of ports equals the spatial dimension of the space-time code. Each port (or group) contains at least one AP and if there are multiple APs then these operate as a single antenna port in the transmission of this slot. The space-time code is transmitted over these antenna ports and the transmission may also include downlink pilots.

(19) In odd slots, a different antenna-port mapping is used. Here, a second set S2 of groups of APs transmit system information using space-time coding. This set is further partitioned into ports S2P1, S2P2, S2P3 . . . , one group of the set is assigned to each port, where again the number of ports equals the spatial dimension of the space-time code. Again, each port (or group) contains at least one AP and if there are multiple APs then these operate as a single antenna port in the transmission of this slot. Similarly to even slots, the space-time code is transmitted over these antenna ports and the transmission may also include downlink pilots.

(20) The space-time coded transmission provides diversity towards small-scale fading and thereby improves the reliability of the transmission. The spatial diversity is particularly important for broadcast of small data quantities, for which time and frequency diversity cannot be efficiently exploited.

(21) The sets S1 and S2 may overlap, i.e. they may be built op of the same and partly the same APs. However, some APs belonging to groups in the first set S1 may be inactive in the second set S2, i.e. not belonging to any group in the second set S2. Similarly, some APs belonging to groups in the second set S2 may be inactive in the first set S1, i.e. not belonging to any group in the first set S1. Ports/groups in different subsets may also partly overlap, i.e., comprise partially the same APs. However, to provide additional diversity, the sets S1 and S2 are different, i.e. they do not comprise the same groupings of APs.

(22) FIG. 5 illustrates a distributed massive MIMO system with APs, or antenna elements, and terminals according to an example.

(23) FIG. 6 shows an example of transmission in even slots. Which APs belong to which port, or group, S1P1 or S1P2, is indicated in the figure. Here, a two-dimensional space-time code is transmitted. The APs in S1P1 form an antenna port that coherently transmits the first half of the code. The APs in S1P2 form an antenna port that coherently transmits the second half of the code.

(24) FIG. 7 similarly shows an example of transmission in odd slots. Which APs belong to which port, S2P1 or S2P2, is indicated in the figure. The APs in S1P1 form an antenna port that coherently retransmits the first half of the code. The APs in S1P2 form an antenna port that coherently retransmits the second half of the code.

(25) Consider, for example, a single-antenna terminal (“wireless device”) that is reached by four APs in the network. The channel coefficients from the APs are denoted by h.sub.1, h.sub.2, h.sub.3 and h.sub.4. The APs are mapped into antenna ports in different ways in even and odd slots, as illustrated in FIG. 8. Two downlink pilots are transmitted so that the terminal can estimate the combined channel coefficients g.sub.1, g.sub.2 from each of the antenna ports. In even slots, g.sub.1=h.sub.2+h.sub.4 (for antenna port S1P1) and g.sub.2=h.sub.1+h.sub.3 (for antenna port S1P2). In odd slots, g.sub.1=h.sub.1+h.sub.4 (for antenna port S2P1) and g.sub.2=h.sub.2+h.sub.3 (for antenna port S2P2).

(26) Let x.sub.1, x.sub.2 denote the symbols that are transmitted in one block of a two-dimensional space-time code. If an Alamouti code is used, these symbols are transmitted over two channel uses. Consider an even slot. The APs of the first antenna port (S1P1) sends x.sub.1 followed by −x.sub.2*. The APs of the second antenna port (S1P2) sends x.sub.2 followed by x.sub.1*, where the * denotes complex conjugation. The first received signal at the terminal is

(27) $\begin{array}{cc}{y}_1=\left[g_1{g}_2\right]\left[\begin{array}{c}{x}_1\\ x_2\end{array}\right]+n_1& \left(2\right)\end{array}$
and the second received signal is

(28) $\begin{array}{cc}{y}_2=\left[g_1{g}_2\right]\left[\begin{array}{c}-x_2^{*}\\ x_1^{*}\end{array}\right]+n_2& \left(3\right)\end{array}$
where n.sub.1, n.sub.2 are independent Gaussian noise terms. The receiving terminal can now form the two-dimensional received signal

(29) $\begin{array}{cc}\left[\begin{array}{c}{y}_1\\ y_2^{*}\end{array}\right]=\left[\begin{array}{c}{g}_1{x}_1+g_2{x}_2\\ g_2^{*}{x}_1-g_1^{*}{x}_2\end{array}\right]+\left[\begin{array}{c}{n}_1\\ n_2^{*}\end{array}\right]=\left[\begin{array}{cc}{g}_1& g_2\\ g_2^{*}& -g_1^{*}\end{array}\right]\left[\begin{array}{c}{x}_1\\ x_2\end{array}\right]+\left[\begin{array}{c}{n}_1\\ n_2^{*}\end{array}\right]& \left(4\right)\end{array}$
which is equivalent to a full-rank 2×2 MIMO channel. Note that this channel structure is obtained although the terminal has only one antenna and the APs have no channel state information. Since the terminal knows the channel coefficients it can decouple the reception of x.sub.1, x.sub.2 as

(30) $\begin{array}{cc}\left[\begin{array}{cc}{g}_1^{*}& g_2\\ g_2^{*}& -g_1\end{array}\right]\left[\begin{array}{c}{y}_1\\ y_2^{*}\end{array}\right]=\left[\begin{array}{cc}{.Math.g_1.Math.}^2+{.Math.g_2.Math.}^2& 0\\ 0& {.Math.g_1.Math.}^2+{.Math.g_2.Math.}^2\end{array}\right]\left[\begin{array}{c}{x}_1\\ x_2\end{array}\right]+\left[\begin{array}{c}{n}_1^{\prime }\\ n_2^{\prime }\end{array}\right]& \left(5\right)\end{array}$
where the noise vector

(31) $\begin{array}{cc}\left[\begin{array}{c}{n}_1^{\prime }\\ n_2^{\prime }\end{array}\right]=\left[\begin{array}{cc}{g}_1^{*}& g_2\\ g_2^{*}& -g_1\end{array}\right]\left[\begin{array}{c}{n}_1\\ n_2^{*}\end{array}\right]& \left(6\right)\end{array}$
has independent Gaussian noise terms with the same distribution as n.sub.1, n.sub.2 but a variance scaled by (|g.sub.1.sup.2|+|g.sub.2|.sup.2). The resulting SNR is proportional to |g.sub.1|.sup.2+|g.sub.2|.sup.2 and thus the space-time code provides a second-order spatial diversity.

(32) In a subsequent odd slot, the transmission is repeated, but with different antenna ports. The APs of the first antenna port (which is now S2P1) sends x.sub.1 followed by −x.sub.2*. The APs of the second antenna port (which is now S2P2) sends x.sub.2 followed by x.sub.1*.

(33) By broadcasting the same system information in consecutive even and odd slots, the terminal can combine the received signals to achieve an SNR proportional to
|h.sub.2+h.sub.4|.sup.2+|h.sub.1+h.sub.3|.sup.2+|h.sub.1+h.sub.4|.sup.2+|h.sub.2+h.sub.3|.sup.2   (7)
which basically provides fourth-order spatial diversity. FIG. 9 demonstrates this in terms of the probability of error in BPSK (binary phase-shift keying) transmission, when the channel coefficients are independent Rayleigh fading and constant for two consecutive slots. The proposed method is compared with a baseline scheme where the same port mapping is used in both odd and even slots, thus only a second-order diversity is achieved and the combining of consecutive slots only provide a power gain.

(34) The increased diversity order leads to higher reliability in the system information broadcast.

(35) Every terminal wants its closest APs (the ones that are most likely to provide strong channel coefficients) to belong to different antenna ports to make the most out of the spatial diversity. The gain from switching antenna port mappings between slots can be particularly large in irregular antenna deployments, where one cannot find a single mapping that fits all user positions.

(36) In another embodiment, the frequency domain is partitioned into segments. The same procedure as above is applied, but with “time” and “frequency” interchanged.

(37) In another embodiment, a combination between time and frequency slotting is used.

(38) In some embodiments, the APs may be divided into multiple independent collections of APs. Each collection operates according to the above procedures, but there might be mutual interference between the collections. The collections can be selected to make the mutual interference low.

(39) In addition to reliable decoding of the system information broadcast, the user terminal can determine which sets and which antenna ports that provide the largest and most reliable channel gains. This information indicates which APs that later should transmit payload data to the user. The user (or “terminal” or “wireless device”) can utilize this information when accessing the network. In one embodiment, the access scheme is determined by which sets and ports that provided large/reliable channel gains. In another embodiment, the user access the network in a predetermined way, but feeds back said information to the network.

(40) In one embodiment related to 5G NR the method described above is used in a first timeslot to transmit an SS Block and in a second time slot to transmit another SS Block, where both said first and said second SS Blocks are part of the same SS Burst or part of the same SS Burst Set.

(41) In one embodiment related to 5G NR the method described above is used in multiple time-slots to transmit SS Blocks belonging to the same SS Burst or SS Burst Set.

(42) Description of Block Diagrams

(43) FIG. 10 is a block diagram of a distributed MIMO system according to an embodiment. It comprises a plurality of access points A.sub.1, . . . , A.sub.K. The plurality of access points A.sub.1, . . . , A.sub.K form a cluster 50 of access points. The distributed MIMO system further comprises a central unit 100. The cluster 50 comprises a connection interface configured to be connected to the central unit 100 of the distributed MIMO system and receive blocks of data, such as the above-mentioned SS blocks, to be transmitted from the central unit 100. Other types of data and control signaling may also take place over the connection interface 60. The connection interface 60 may e.g. be a bus interface. The central unit 100 provides backhaul, implement functionalities in higher layer protocols (TCP/IP, PDCP, RLC, MAC) and may also perform a large part of the base-band physical layer processing such as channel coding and decoding, modulation, etc. The central unit 100 may also coordinate calculations that are performed relatively seldom; such as determining which access points that should serve which users; ensure that the nodes are properly calibrated and synchronized; assign pilots to users to be used for channel estimation; make handover decisions to other central units in the vicinity; etc.

(44) In the example shown in FIG. 4, the distributed MIMO system has a number N of wireless devices u.sub.1, . . . , u.sub.N within its coverage area, such as mobile phones or other types of UEs (User Equipment). These correspond to what is referred to above as “users” or “terminals”.

(45) FIG. 11 is a simplified block diagram of an access point A.sub.j according to an embodiment. It comprises a transceiver a transceiver 52 configured to communicate wirelessly with wireless devices u.sub.k. Furthermore, it comprises a processing circuit 54. The processing circuit 54 may be a programmable processing circuit 54, and may e.g. comprise a processor 56 and memory 58. The memory 58 may e.g. store computer program code executable by the processor 56. The access point A.sub.j may also comprise a communication interface 55 configured to communicate with the central unit 100, as indicated in FIG. 11. For example, the communication interface 55 may be connected to the connection interface 60 of the cluster 50. The terms “connection interface” and “communication interface” are used in this disclosure as labels to distinguish the two interface.

(46) FIG. 12 is a simplified block diagram of the central unit 100 according to an embodiment. It comprises a communication interface 102 configured to communicate with access points A.sub.1, . . . , A.sub.K of the distributed MIMO system, e.g. through the communication interface 55 (FIG. 5). Furthermore, it comprises a processing circuit 104. The processing circuit may be configured to control the access points A.sub.1, . . . , A.sub.K in various ways. For example, it may be configured to provide data to be transmitted to the wireless devices u.sub.1, . . . , u.sub.N. The processing circuit 104 may be a programmable processing circuit 104, and may e.g. comprise a processor 106 and memory 108. The memory 108 may e.g. store computer program code executable by the processor 106.

(47) Description of Flowcharts

(48) According to some embodiments of the present disclosure, there is provided a method 200 of transmitting a block of data in the distributed MIMO system. As mentioned above, the block of data may be represented with symbols coded with a space-time-frequency block code (STFBC), such as an Alamouti code. As indicated above, the block of data may be a synchronization signal block, comprising at least one synchronization signal, such as a primary and a secondary synchronization signal. Furthermore, as also indicated above the block of data may represent a broadcast channel, such as NR-PBCH. More generally, the block of data may be a block of data that should be subject to a wide-area transmission, such as a broadcast transmission.

(49) According to some embodiments, access points A.sub.g are grouped into a first set of M groups and a second set of M groups, different from the first set, wherein M is an integer. A first antenna port mapping assigns each group of the first set to a unique one of M antenna ports. The word “unique” here means that there are not two groups in the first set that are mapped onto one and the same antenna port. A second antenna port mapping assigns each group of the second set to a unique one of M antenna ports. For example, with reference to the example in FIGS. 5-7, a first group of the first set is formed by the access points that are mapped onto the antenna port S1P1 (FIG. 6), and a second group of the first set is formed by the access points that are mapped onto the antenna port S1P2 (FIG. 6). Similarly, a first group of the second set is formed by the access points that are mapped onto the antenna port S2P1 (FIG. 7), and a second group of the first set is formed by the access points that are mapped onto the antenna port S2P2 (FIG. 7). Hence, in this example, M=2. In the example illustrated with FIGS. 5-7, all access points belong to a group that is mapped onto an antenna port. However, in some embodiments, some access points may sometimes be unused, or inactivated, and not mapped onto any antenna port. Which these access points are may be different for the first set and the second set. In some embodiments, all of the APs used in the first set may be inactivated in the second set, and vice versa. For example half of the APs in the cluster 50 may be used in the groups of the first set (but not the second set), and the other half of the APs in the cluster 50 may be used in the groups of the second set (but not the first set).

(50) Embodiments of the method 200 comprises transmitting the block of data using both the first and the second antenna port mapping. As explained above, this is a relatively efficient way to provide transmit diversity in the distributed MIMO system. A flowchart of an embodiment of the method 200 is shown in FIG. 13. Operation of the method is started in step 210. In step 220, the block of data using both the first and the second antenna port mapping. Operation of the method 200 is ended in step 230. The method 200 may be repeated as necessary, for instance whenever a new SS burst is to be transmitted.

(51) It should be noted that some embodiments may involve more than two sets and two antenna mappings. For example, access points A; may be grouped into a third (and a fourth, and a fifth, . . . ) set of M groups, different from the first set and the second set (and different from each other if one or more sets than the third set are used). Furthermore, a third (and a fourth, and a fifth, . . . ) antenna port mapping may assign each group of the third (fourth, fifth, . . . ) set to a unique one of M antenna ports. To provide an even further degree of diversity, the block of data may be transmitted using also the third (fourth, fifth, . . . ) antenna port mapping.

(52) In some embodiments, the method operates according to a slotted time, as described above. This is illustrated in FIG. 14, where step 220 the block of data comprises, in a first time slot, transmitting 221 the block of data using the first antenna port mapping, and in a later second time slot, transmitting 222 the block of data using the second antenna port mapping. As indicated in FIG. 14, step 220 may optionally also in a further later time slot comprise transmitting 223 the block of data using the third antenna port mapping. In some embodiments, further later time slots may be used for transmitting the block of data using additional antenna port mappings (fourth, fifth, . . . ).

(53) In some embodiments, the block of data may be transmitted using the first and the second antenna port mappings concurrently. This is illustrated in FIG. 15, wherein steps 221 and 222 (and optionally step 223, etc.) are carried out concurrently. This may e.g. be accomplished through the use of frequency division, where step 221 includes transmitting the block of data using the first antenna port mapping in a first frequency band, and step 222 comprises transmitting the block of data using the second antenna port mapping in a second frequency band. In an OFDM system, the first and second frequency bands may correspond to a first and a second set of subcarriers.

(54) It should be noted that the slotted time and frequency division described above can be combined. For example, step 221 may comprise transmitting the block of data using the first antenna port mapping in the first time slot and in the first frequency band. Step 222 may comprise transmitting 222 the block of data using the second antenna port mapping in the later second time slot and in the second frequency band.

(55) According to embodiments of the present disclosure, the distributed MIMO system is configured to transmit blocks of data according to the method 200 of any one of the examples. In some embodiments, this is controlled from the central unit 100. For example, the processing circuit 104 may be configured to control the access points A.sub.1, . . . , A.sub.K to transmit blocks of data according to the method 200, for instance by providing each access point A.sub.j with control signals indicating which antenna port it belongs to for a given transmission.

(56) In some embodiments, the operation of the method 200 is controlled within the cluster 50 of access points A.sub.1, . . . , A.sub.K. For example, the processing circuits 54 of the of access points A.sub.1, . . . , A.sub.K may be configured to control the transceivers 52 to transmit the blocks of data according to the method 200. The processing circuit 54 of any given access point A.sub.j may e.g. be preconfigured to keep track of in which time slot (and/or in which frequency band) that access point belongs to a given antenna port. In such embodiments, the central unit 100 does not have to keep track of the antenna port mappings, but can simply supply the blocks of data to be transmitted to the access points A.sub.1, . . . , A.sub.K over the connection interface 60.

(57) In other embodiments, the cluster 50 and the central unit 100 may jointly be in control over the operation of the method 200.

(58) Description of Computer-Readable Media Figures

(59) As described above with reference to FIGS. 11 and 12, the processing circuits 54 and 104, or parts thereof, may be implemented with programmable and/or configurable hardware units, such as but not limited to one or more field-programmable gate arrays (FPGAs), processors, or microcontrollers. Thus, the processing circuits 54 and 104 may be a programmable processing circuits. Hence, embodiments of the present disclosure may be embedded in computer program products, which enables implementation of the methods and functions described herein, e.g. the embodiments of the method 200 described with reference to FIGS. 13-15.

(60) According to some embodiments, there is provided a computer program product comprising computer program code for causing the access points A.sub.1, . . . , A.sub.K to transmit blocks of data according to the method 200 when said computer program code is executed by the processing circuits 54 of the access points A.sub.1, . . . , A.sub.K. The computer program code may be stored on a computer readable medium 1000, as illustrated in FIG. 16. The computer-readable medium 1000 may e.g. be a non-transitory computer-readable medium. The computer program code may be loadable into the memory 58 in order to be executed by the processor 56.

(61) According to some embodiments, there is provided a computer program product comprising computer program code for causing the access points A.sub.1, . . . , A.sub.K to transmit blocks of data according to the method 200 when said computer program code is executed by the processing circuit 104 of the central unit 100. The computer program code may be stored on a computer readable medium 2000, as illustrated in FIG. 17. The computer-readable medium 2000 may e.g. be a non-transitory computer-readable medium. The computer program code may be loadable into the memory 108 in order to be executed by the processor 106.

(62) The present disclosure has been presented above with reference to specific embodiments. However, other embodiments than the above described are possible within the scope of the disclosure. Different method steps than those described above, performing the method by hardware or software, may be provided within the scope of the disclosure. The different features and steps of the embodiments may be combined in other combinations than those described.

(63) The term “comprises/comprising” when used in this disclosure is taken to specify the presence of stated features, integers, steps, or components, but does not preclude the presence or addition of one or more other features, integers, steps, components, or groups thereof.