Transmitter, Receiver and Method for Generating Synchronization Signals

Abstract

A transmitter and a method therein, configured for generating a synchronization signal for Device-to-Device (D2D) communication utilizing a Single Carrier-Frequency Division Multiple Access (SC-FDMA) waveform. The method includes determining, by a transmitter, a synchronization sequence d.sub.u[l] modulating a set of subcarriers, where |d.sub.u[l]|=|d.sub.u[L?1?l]|, l=0, 1, . . . , L?1, and |d.sub.u[l]=K, for a positive constant K, where u is a root index and L is a length of the synchronization sequence d.sub.u[l]. The method further includes selecting the root index u from a set of root indices, and generating a synchronization signal for D2D communication utilizing an SC-FDMA waveform based on the determined synchronization sequence d.sub.u[l] and the selected root index u.

Claims

1. A transmitter, comprising: a processor; and a non-transitory computer-readable storage medium storing a program to be executed by the processor, the program including instructions for: determining a synchronization sequence d.sub.u[l] modulating a set of subcarriers, wherein u is a root index and L is a length of the synchronization sequence d.sub.u[l]; selecting the root index u from a set of root indices; and generating, and transmitting to a receiver, a synchronization signal utilizing a Single Carrier-Frequency Division Multiple Access (SC-FDMA) waveform based on the determined synchronization sequence d.sub.u[l] and the selected root index u.

2. The transmitter according to claim 1, wherein the program further includes instructions for determining the synchronization sequence d.sub.u[l], such that:
d.sub.u[l]=?d.sub.u[L?1?l],l=0,1, . . . ,L?1.

3. The transmitter according to claim 1, wherein the program further includes instructions for obtaining a centrally anti-symmetric synchronization sequence of even length from a centrally symmetric synchronization sequence of even length by multiplying elements of one of synchronization sequence halves by ?1.

4. The transmitter according to claim 1, wherein the program further includes instructions for: determining the synchronization sequence d.sub.u[n], such that: $d_u?\left[n\right]=\{\begin{array}{cc}{e}^{-j.Math.\frac{?.Math..Math.\mathrm{un}?\left(n+1\right)}{63}},& n=0,1,\mathrm{.Math.}.Math.,30\\ e^{-j.Math.\frac{?.Math..Math.u?\left(n+1\right).Math.\left(n+2\right)}{63}},& n=31,32,\mathrm{.Math.}.Math.,61\end{array};\mathrm{and}$ selecting the root index u to an integer different from 25, 29 and 34.

5. The transmitter according to claim 1, wherein the program further includes instructions for: determining the synchronization sequence by selecting a Zadoff-Chu sequence of odd length; and removing an odd number of elements from the selected Zadoff-Chu sequence, and obtaining a synchronization sequence of even length.

6. The transmitter according to claim 1, wherein the program further includes instructions for determining the synchronization sequence d.sub.u[n] such that:
d.sub.u[n]=W.sub.L.sup.un(n+1)/2,n=0,1, . . . ,L?1, wherein L is even, and
W.sub.L=e.sup.?j2?/L.

7. The transmitter according to claim 1, wherein the program further includes instructions for mapping the synchronization sequence to resource elements of the SC-FDMA signal, such that for Fourier coefficients:
|H[k]|=|H[N?1?k]|,k=0,1, . . . ,N?1, where N is an integer not smaller than L and H[k] is a Fourier coefficient at frequency k.

8. The transmitter according to claim 7, wherein:
H[k]=H[N?1?k],k=0,1, . . . ,N?1.

9. The transmitter according to claim 8, wherein:
s[n]=?s[N?n],n=1, . . . ,N?1,s[n] is a SC-FDMA signal, and n=0,1, . . . ,N?1.

10. The transmitter according to claim 7, wherein:
H[k]=?H[N?1?k],k=0,1, . . . ,N?1.

11. The transmitter according to claim 1, wherein the program further includes instructions for selecting the root index u from the set of root indices by one of random selection or by deriving the root index u from one or more parameters internal to the transmitter.

12. The transmitter according claim 1, wherein the program further includes instructions for performing at least one of: selecting the root index u from the set of root indices based on information received from a serving radio network node or based on a received signal; selecting the root index u from a first set of root indices when receiving a synchronization signal from another D2D transmitter being synchronized to a cell, and from a second set of root indices when receiving a synchronization signal from another D2D transmitter not being synchronized to a cell; selecting either the same, or a different, root index u as has been utilized in a received synchronization signal; and selecting the root index u from the set of root indices based on a number of hops of the received synchronization signal when the synchronization signal is transmitted over multiple hops between network nodes.

13. A method, comprising: determining, by a transmitter, a synchronization sequence d.sub.u[l] modulating a set of subcarriers, wherein u is a root index and L is a length of the synchronization sequence d.sub.u[l]; selecting the root index u from a set of root indices; and generating, and transmitting to a receiver, a synchronization signal utilizing a Single Carrier-Frequency Division Multiple Access (SC-FDMA) waveform based on the determined synchronization sequence d.sub.u[l] and the selected root index u.

14. The method according to claim 13, wherein the method comprises mapping the synchronization sequence to resource elements of the SC-FDMA waveform, such that for Fourier coefficients:
|H[k]|=H[N?1?k]|,k=0,1, . . . ,N?1, where N is an integer not smaller than L and H[k] is a Fourier coefficient at frequency k.

15. The method according to claim 14, wherein:
H[k]=H[N?1?k],k=0,1, . . . ,N?1.

16. The method according to claim 15, wherein:
s[n]=?s[N?n],n=1, . . . ,N?1,s[n] is a SC-FDMA signal, and n=0,1, . . . ,N?1.

17. An apparatus comprising a non-transitory computer readable storage medium having program code stored thereon for use by a transmitter, the program code including instructions for: determining a synchronization sequence d.sub.u[l] modulating a set of subcarriers, wherein u is a root index and L is a length of the synchronization sequence d.sub.u[l]; selecting the root index u from the set of root indices; and generating, and transmitting to a receiver, a synchronization signal-utilizing a Single Carrier-Frequency Division Multiple Access (SC-FDMA) waveform based on the determined synchronization sequence d.sub.u[l] and the selected root index u.

18. The apparatus according to claim 17, wherein the program code further includes instructions for mapping the synchronization sequence to the resource elements of the SC-FDMA waveform, such that for Fourier coefficients:
|H[k]|=|H[N?1?k]|,k=0,1, . . . ,N?1, where N is an integer not smaller than L and H[k] is a Fourier coefficient at frequency k.

19. The apparatus according to claim 18, wherein:
H[k]=H[N?1?k],k=0,1, . . . ,N?1.

20. The apparatus according to claim 19, wherein:
s[n]=?s[N?n],n=1, . . . ,N?1,s[n] is a SC-FDMA signal,n=0,1, . . . ,N?1.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0103] For a more complete understanding of the present invention, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:

[0104] FIG. 1a is a block diagram illustrating a conventional wireless communication net-work.

[0105] FIG. 1b is a block diagram illustrating a conventional wireless communication net-work.

[0106] FIG. 1c is a block diagram illustrating a conventional transmitter.

[0107] FIG. 2a is a block diagram illustrating a wireless communication network in an embodiment.

[0108] FIG. 2b is a block diagram illustrating a transmitter and a receiver in an embodiment.

[0109] FIG. 2c is a block diagram illustrating a transmitter, a receiver and a network node in an embodiment.

[0110] FIG. 3 is a block diagram illustrating a transmitter according to an embodiment.

[0111] FIG. 4 is a flow chart illustrating a method in a transmitter according to an embodiment.

[0112] FIG. 5 is a block diagram illustrating a transmitter according to an embodiment.

[0113] FIG. 6 is a block diagram illustrating a receiver according to an embodiment;

DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS

[0114] Embodiments of the invention described herein are defined as a transmitter, a method in a transmitter and a receiver, which may be put into practice in the embodiments described below. These embodiments may, however, be exemplified and realized in many different forms and are not to be limited to the examples set forth herein; rather, these illustrative examples of embodiments are provided so that this disclosure will be thorough and complete.

[0115] Still other objects and features may become apparent from the following detailed description, considered in conjunction with the accompanying drawings. It is to be understood, however, that the drawings are designed solely for purposes of illustration and not as a definition of the limits of the herein disclosed embodiments, for which reference is to be made to the appended claims. Further, the drawings are not necessarily drawn to scale and, unless otherwise indicated, they are merely intended to conceptually illustrate the structures and pro-cedures described herein.

[0116] FIG. 2a is a schematic illustration over a wireless communication network too comprising a transmitter 110, a receiver 120 and a radio network node 130. The transmitter 110 and/or the receiver 120 may be mobile terminals, which may be served by the radio network node 130, thereby being connected to the wireless communication network 100.

[0117] The wireless communication network 100 may at least partly be based on radio access technologies such as, e.g., 3GPP LTE, LTE-Advanced, Evolved Universal Terrestrial Radio Access Network (E-UTRAN), Universal Mobile Telecommunications System (UMTS), Global System for Mobile Communications (originally: Groupe Special Mobile) (GSM)/Enhanced Data rate for GSM Evolution (GSM/EDGE), Wideband Code Division Multiple Access (WCDMA), Time Division Multiple Access (TDMA) networks, Frequency Division Multiple Access (FDMA) networks, Orthogonal FDMA (OFDMA) networks, Single-Carrier FDMA (SC-FDMA) networks, Worldwide Interoperability for Microwave Access (WiMax), or Ultra Mobile Broadband (UMB), High Speed Packet Access (HSPA) Evolved Universal Terrestrial Radio Access (E-UTRA), Universal Terrestrial Radio Access (UTRA), GSM EDGE Radio Access Network (GERAN), 3GPP2 CDMA technologies, e.g., CDMA2000 Ix RTT and High Rate Packet Data (HRPD), just to mention some few options. The expressions wireless communication network, wireless communication system and/or cellular telecommunication system may within the technological context of this disclosure sometimes be utilized interchangeably.

[0118] The wireless communication network 100 may be configured to operate according to the Time Division Duplex (TDD) and/or the Frequency Division Duplex (FDD) principle, according to different embodiments.

[0119] TDD is an application of time-division multiplexing to separate uplink and downlink signals in time, possibly with a Guard Period (GP) situated in the time domain between the uplink and downlink signaling. FDD means that the transmitter and receiver operate at different carrier frequencies.

[0120] The purpose of the illustration in FIG. 2a is to provide a simplified, general overview of the wireless communication network 100 and the involved methods and nodes, such as the transmitter 110, the receiver 120 and the radio network node 130 herein described, and the functionalities involved. The method, the transmitter 110, the receiver 120 and the radio network node 130 will subsequently, as a non-limiting example, be described in a 3GPP LTE/LTE-Advanced environment. However the disclosed embodiments may operate in a wireless communication network 100 based on another access technology such as, e.g., any of the above already enumerated. Thus, although the embodiments of the invention are described based on, and using the lingo of, 3GPP LTE systems, it is by no means limited to 3GPP LTE. Further, the terms radio network node, network node, base station, and cell may be used interchangeably in the sequel.

[0121] The illustrated transmitter 110 in the wireless communication network 100 may send synchronization signals to be received by the receiver 120.

[0122] FIG. 2b illustrates an example wherein the transmitter 110 and the receiver 120 are situated outside any wireless communication network 100, i.e., LTE network. The transmitter 110 transmits a D2D synchronization signal (D2DSS) to be received by the receiver 120.

[0123] FIG. 2c illustrates yet an embodiment wherein multi-hop is illustrated. The transmitter 110 transmits a D2DSS to be received by the receiver 120, via an intermediately situated other network node 140.

[0124] It is to be noted that the illustrated settings of FIG. 2a, FIG. 2b and/or FIG. 2c of one instance of the transmitter 110, one instance of the receiver 120 and possibly one radio network node 130 or other network node 140 in FIG. 2a, FIG. 2b and/or FIG. 2c are to be regarded as non-limiting examples of embodiments only. The wireless communication network 100 may comprise any other number and/or combination of the discussed entities 110, 120, 130, 140. A plurality of transmitters 110, receivers 120, other network nodes 140 and another configuration of radio network nodes 130 may thus be involved in some embodiments of the disclosed invention. Thus, e.g., when reference is made herein to multi-hop over another network node 140, the other network node 140 may comprise a set of a plurality of other network nodes 140, according to some embodiments.

[0125] Thus whenever one or a/an transmitter 110, receiver 120 other network node 140 and/or radio network node 130 is referred to in the present context, a plurality of the transmitter 110, receiver 120 other network node 140 and/or radio network node 130 may be involved, according to some embodiments.

[0126] The transmitter 110, the receiver 120 and/or the other network node 140 may correspondingly be represented by, e.g., a wireless communication terminal, a mobile cellular phone, a Personal Digital Assistant (PDA), a wireless platform, a mobile station a user equipment, a tablet computer, a portable communication device, a laptop, a computer, a wireless terminal acting as a relay, a relay node, a mobile relay, a Customer Premises Equipment (CPE), a Fixed Wireless Access (FWA) nodes or any other kind of device configured to communicate wirelessly with each other by direct communication and possibly also with the radio network node 130, according to different embodiments and different vocabulary.

[0127] Further, the radio network node 130 and/or the other network node 140, according to some embodiments, may be configured for downlink transmission and uplink reception, and may be referred to, respectively, as, e.g., a base station, a NodeB, an evolved Node Bs (eNB, or eNode B), a base transceiver station, an Access Point Base Station, a base station router, a Radio Base Station (RBS), a micro base station, a pico base station, a femto base station, a Home eNodeB, a sensor, a beacon device, a relay node, a repeater or any other network node configured for communication with the mobile stations within cell coverage over a wireless interface, depending, e.g., of the radio access technology and/or terminology used.

[0128] Some embodiments of the invention may define a modular implementation approach, and make it possible to reuse legacy systems such as, e.g., standards, algorithms, implementations, components and products.

[0129] The SC-FDMA waveform without a cyclic prefix can be defined by:

s(t)=?.sub.k=??N.sub.RB.sub.UL.sub.N.sub.sc.sub.RB.sub./2?.sup.?N.sup.RB.sup.UL.sup.N.sup.sc.sup.RB.sup./2??1a.sub.k+?N.sub.RB.sub.UL.sub.N.sub.sc.sub.RB.sub./2?.Math.e.sup.j2?(k+1/2)?ft

[0130] for 0?t<N?T.sub.s. According to the LTE standard,

[00010]$N=\frac{f_s}{?.Math..Math.f}?N_{\mathrm{RB}}^{\mathrm{UL}}.Math.N_{\mathrm{sc}}^{\mathrm{RB}},$

hence it is possible to define:

[00011]$H?\left[k\right]=\{\begin{array}{cc}{a}_{k+.Math.N_{\mathrm{RB}}^{\mathrm{UL}}.Math.N_{\mathrm{sc}}^{\mathrm{RB}}/2.Math.},& -.Math.N_{\mathrm{RB}}^{\mathrm{UL}}.Math.N_{\mathrm{sc}}^{\mathrm{RB}}/2.Math.?k?.Math.N_{\mathrm{RB}}^{\mathrm{UL}}.Math.N_{\mathrm{sc}}^{\mathrm{RB}}/2.Math.-1\\ 0,& \mathrm{elsewhere}\end{array}.Math..Math.\mathrm{and}.Math..Math.s?\left(t\right)=\underset{k=-.Math.N/2.Math.}{\overset{.Math.N/2.Math.-1}{.Math.}}.Math..Math.H?\left[k\right].Math.e^{j.Math..Math.2.Math..Math.??\left(k+1/2\right).Math.?.Math..Math.\mathrm{ft}}.$

[0131] The sampled version is obtained by setting: t=n/f.sub.s which gives (comprising a normalization factor 1/?{square root over (N)}), a low-pass equivalent signal:

[00012]$s?\left[n\right]=\frac{1}{\sqrt{N}}.Math.\underset{k=-.Math.N/2.Math.}{\overset{.Math.N/2.Math.-1}{.Math.}}.Math..Math.H?\left[k\right].Math.e^{\frac{j.Math..Math.2.Math..Math.?.Math..Math.n?\left(k+1/2\right)}{N}}$

[0132] for n=0, 1, . . . , N?1 where H[k] is a Fourier coefficient at frequency k. A cyclic prefix may be inserted in the representation. Since

[00013]$e^{\frac{j.Math..Math.2.Math.?.Math..Math.n?\left(N-k+1/2\right)}{N}}=e^{\frac{j.Math..Math.2.Math.?.Math..Math.n?\left(-k+1/2\right)}{N}}$

and defining H[k]=H[k+N], an alternative representation (still without cyclic prefix) is:

[00014]$s?\left[n\right]=\frac{1}{\sqrt{N}}.Math.\underset{k=0}{\overset{N-1}{.Math.}}.Math..Math.H?\left[k\right].Math.e^{\frac{j.Math..Math.2.Math.?.Math..Math.n?\left(k+1/2\right)}{N}}=e^{\frac{j.Math..Math.2.Math.?.Math..Math.n?\left(1/2\right)}{N}}.Math.\frac{1}{\sqrt{N}}.Math.\underset{k=0}{\overset{N-1}{.Math.}}.Math..Math.H?\left[k\right].Math.e^{\frac{j.Math..Math.2.Math.?.Math..Math.\mathrm{nk}}{N}}$

Then, from the definition of the SC-FDMA signal, conditions for obtaining a centrally symmetric signal for n=1, . . . , N may be deduced from:

[00015]$\begin{array}{c}s?\left[N-n\right]=.Math.-e^{\frac{-j.Math..Math.2.Math.?.Math..Math.n?\left(1/2\right)}{N}}.Math.\frac{1}{\sqrt{N}}.Math.\underset{k=0}{\overset{N-1}{.Math.}}.Math..Math.H?\left[k\right].Math.e^{\frac{-j.Math..Math.2.Math.?.Math..Math.\mathrm{nk}}{N}}\\ =.Math.-e^{\frac{-j.Math..Math.2.Math.?.Math..Math.n?\left(1/2\right)}{N}}.Math.\frac{1}{\sqrt{N}}.Math.\underset{p=0}{\overset{N-1}{.Math.}}.Math..Math.H?\left[N-1-p\right].Math.e^{\frac{-j.Math..Math.2.Math.?.Math..Math.n?\left(N-1-p\right)}{N}}\\ =.Math.-e^{\frac{-j.Math..Math.2.Math.?.Math..Math.n?\left(1/2\right)}{N}}.Math.e^{\frac{j.Math..Math.2.Math.?.Math..Math.n}{N}}.Math.\frac{1}{\sqrt{N}}.Math.\underset{p=0}{\overset{N-1}{.Math.}}.Math..Math.H?\left[N-1-p\right].Math.e^{\frac{j.Math..Math.2.Math.?.Math..Math.\mathrm{np}}{N}}\\ =.Math.-e^{\frac{j.Math..Math.2.Math.?.Math..Math.n?\left(1/2\right)}{N}}.Math.\frac{1}{\sqrt{N}}.Math.\underset{p=0}{\overset{N-1}{.Math.}}.Math..Math.H?\left[N-1-p\right].Math.e^{\frac{j.Math..Math.2.Math.?.Math..Math.\mathrm{np}}{N}}.\end{array}$

[0133] This relationship may be utilized to identify requirements on the Fourier coefficients in order to obtain certain symmetries in the signal. It is therefore realized that:

i) If H[k]=H[N?1?k],k=0,1, . . . ,N?1, then s[n]=?s[N?n],n=1, . . . ,N?1.

ii) If H[k]=?H[N?1?k],k=0,1, . . . ,N?1, then s[n]=s[N?n],n=1, . . . ,N?1.

[0134] A property s[n]=?s[N?n], n=1, . . . , N?1 may be referred to as a centrally anti-symmetric signal.

[0135] A property s[n]=s[N?n], n=1, . . . , N?1 may be referred to as a centrally symmetric signal.

[0136] An advantage of using a centrally anti-symmetric signal is that it has very low cross-correlation with a centrally symmetric signal. For example, assume a centrally anti-symmetric signal where x[n]=?x[N?n], n=1, . . . , N?1, and a centrally symmetric signal where y[n]=y[N?n], n=1, . . . , N?1. Then, when the signals are aligned in time, the cross-correlation becomes

[00016]$.Math.\underset{n=0}{\overset{N-1}{.Math.}}.Math..Math.x?\left[n\right].Math.y^{*}?\left[n\right].Math.=\{\begin{array}{cc}.Math.x?\left[0\right].Math.y^{*}?\left[0\right]+x?\left[N/2\right].Math.y^{*}?\left[N/2\right].Math.,& N.Math..Math.\mathrm{even}\\ .Math.x?\left[0\right].Math.y^{*}?\left[0\right].Math.,& N.Math..Math.\mathrm{odd}\end{array}$

[0137] which is typically much smaller than the signal energy |?.sub.n=0.sup.N?1 x[n]x*[n]|. Hence, when the signals are time aligned, if the D2DSS is centrally anti-symmetric, it may have low cross-correlation with the LTE PSS, which is centrally symmetric.

[0138] One embodiment of the invention comprises defining a D2DSS wherein the Fourier coefficients are according to |H[k]|=|H[N?1?k]|, k=0, 1, . . . , N?1.

[0139] A first embodiment comprises defining a D2DSS wherein the Fourier coefficients are according to H[k]=H[N?1?k], k=0, 1, . . . ,N?1.

[0140] A second embodiment comprises defining a D2DSS wherein the Fourier coefficients are according to H[k]=?H[N?1?k], k=0, 1, . . . , N?1.

[0141] FIG. 3 depicts an example of a receiver 120 for a centrally anti-symmetric signal, utilizing only N/2+1 multiplications for an input signal of length N. It may further be realized that:

[00017]$\begin{array}{c}s?\left[?n+N\right]=.Math.\frac{1}{\sqrt{N}}.Math.\underset{k=0}{\overset{N-1}{.Math.}}.Math..Math.H?\left[k\right].Math.e^{\frac{j.Math..Math.2.Math.??\left(?n+N\right).Math.\left(k+1/2\right)}{N}}\\ =.Math.-e^{\frac{j.Math..Math.2.Math.??\left(?n\right).Math.\left(1/2\right)}{N}}.Math.\frac{1}{\sqrt{N}}.Math.\underset{k=0}{\overset{N-1}{.Math.}}.Math..Math.H?\left[k\right].Math.e^{\frac{j.Math..Math.2.Math.??\left(?n\right).Math.k}{N}}\\ =.Math.-s?\left[?n\right].\end{array}$

[0142] Therefore, according to the first embodiment, for two different sets of Fourier coefficients where H.sub.u[k]=H.sub.v*[k], it follows that:

[00018]$\begin{array}{c}{s}_u?\left[n\right]=.Math.e^{\frac{-j.Math..Math.2.Math.??\left(-n\right).Math.\left(1/2\right)}{N}}.Math.\frac{1}{\sqrt{N}}.Math.\underset{k=0}{\overset{N-1}{.Math.}}.Math..Math.H_v^{*}?\left[k\right].Math.e^{\frac{-j.Math..Math.2.Math.??\left(-n\right).Math.k}{N}}\\ =.Math.s_v^{*}?\left[-n\right]\\ =.Math.-s_v^{*}?\left[N-n\right]\\ =.Math.s_v^{*}?\left[n\right].\end{array}$

[0143] An advantage of this property is that s.sub.u[n] and s.sub.v[n] can be detected with multiplication complexity of just one of the signals. That is, if a matched filter is designed for s.sub.u[n], due to the above relationship, no further complex valued multiplications may be required for computing a correlation value corresponding to s.sub.v[n], according to some embodiments.

[0144] Therefore, according to the second embodiment, for two different sets of Fourier coefficients where H.sub.u[k]=H.sub.v*[k], it follows that:

[00019]$\begin{array}{c}{s}_u?\left[n\right]=.Math.e^{\frac{-j.Math..Math.2.Math.??\left(-n\right).Math.\left(1/2\right)}{N}}.Math.\frac{1}{\sqrt{N}}.Math.\underset{k=0}{\overset{N-1}{.Math.}}.Math..Math.H_v^{*}?\left[k\right].Math.e^{\frac{-j.Math..Math.2.Math.??\left(-n\right).Math.k}{N}}\\ =.Math.s_v^{*}?\left[-n\right]\\ =.Math.-s_v^{*}?\left[N-n\right]\\ =.Math.-s_v^{*}?\left[n\right].\end{array}$

[0145] An advantage of this property is that s.sub.u[n] and s.sub.v[n] may be detected with multiplication complexity of just one of the signals. That is, if a matched filter is designed for s.sub.u[n], due to the above relationship, no further complex valued multiplications are needed for computing a correlation value corresponding to s.sub.v[n].

[0146] According to some embodiments, a D2D synchronization sequence is defined based on a sequence d.sub.u[l], l=0, 1, . . . , L?1 where L?N, such that when it is mapped to the Fourier coefficients (i.e., d.sub.u[l].fwdarw.H.sub.u[k]), either property i) or ii) as defined at page 20, last paragraph is fulfilled. Hence, the D2D sequences may be centrally symmetric or anti-symmetric, in order to produce centrally anti-symmetric or symmetric SC-FDMA D2DSS, respectively.

[0147] In one embodiment, a centrally symmetric sequence exhibits a property |d.sub.u[l]|=|d.sub.u[L?1?l] 1, 1=0, 1, . . . , L?1, where |?| denotes the absolute value.

[0148] In one embodiment, a centrally symmetric sequence exhibits a property d.sub.u[l]=d.sub.u[L?1?l], =0, 1, . . . , L?1.

[0149] In one embodiment, a centrally anti-symmetric sequence exhibits a property d.sub.u[l]=?d.sub.u[L?1?l], l=0, 1, . . . , L?1.

[0150] It may further be realized that once the receiver 120 has detected and obtained synchronization from the D2DSS, the synchronization sequence is known to the receiver 120. Thus, the sequence may be utilized as reference symbols for estimating the channel. This would allow coherent detection of other signals or channels, utilizing channel estimates from the D2DSS. For reliable channel estimation, it is desirable that all reference symbols (i.e., sequence elements) are using the same transmit power. It is also beneficial for the transmitter to use the same transmit power of the symbols as it makes the power control less complex. Hence, in an embodiment, the synchronization sequence exhibits a property |d.sub.u[l]|=K where K is a positive constant.

[0151] When L?N, the remaining N?L Fourier coefficients in some cases (e.g., when L and N are even) may be set to zero and property i) or ii) is fulfilled. Furthermore, when at least one of the remaining N?L Fourier coefficients is not set to zero, it may be regarded as a superposition of a centrally symmetric or centrally anti-symmetric synchronization signal (obtained from L Fourier coefficients) and an arbitrary signal (obtained from the remaining N?L Fourier coefficients). In that case, property i) or ii) applies only to the synchronization signal. However, this may not be a problem in practice, since filtering may be done to suppress the signals from the remaining N?L Fourier coefficients such that the receiver 120 only experiences the signals obtained from the L Fourier coefficients, in some embodiments.

[0152] In some embodiments, D2D synchronization sequences of even length which are centrally symmetric may be utilized.

[0153] In some embodiments, D2D synchronization sequences of even length which are centrally anti-symmetric may be utilized.

[0154] One embodiment comprises constructing a centrally anti-symmetric D2D synchronization sequence of even length from a centrally symmetric D2D synchronization sequence of even length by multiplying the first half or the second half of its elements by ?1. For example if there is a centrally symmetric D2D synchronization sequence:

[00020]$d_u?\left[n\right]=\{\begin{array}{cc}{e}^{-j.Math.\frac{?.Math..Math.\mathrm{un}?\left(n+1\right)}{63}},& n=0,1,\mathrm{.Math.}.Math.,30\\ e^{-j.Math.\frac{?.Math..Math.u?\left(n+1\right).Math.\left(n+2\right)}{63}},& n=31,32,\mathrm{.Math.}.Math.,61\end{array},$

[0155] then a centrally anti-symmetric sequence may be defined by:

[00021]${\tilde{d}}_u?\left[n\right]=\{\begin{array}{cc}{d}_u?\left[n\right]& n=0,1,\mathrm{.Math.}.Math.,30\\ -d_u?\left[n\right]& n=31,32,\mathrm{.Math.}.Math.,61\end{array}.Math..Math.\mathrm{or}.Math..Math.{\tilde{d}}_u?\left[n\right]=\{\begin{array}{cc}-d_u?\left[n\right]& n=0,1,\mathrm{.Math.}.Math.,30\\ d_u?\left[n\right]& n=31,32,\mathrm{.Math.}.Math.,61\end{array}.$

[0156] An advantage of this is lower implementation complexity since both the radio network node 130 and the transmitter 110 already are capable of generating the centrally symmetric LTE PSS sequence d.sub.u(n).

[0157] One embodiment comprises constructing a centrally symmetric D2D synchronization sequence of even length from a centrally anti-asymmetric D2D synchronization sequence of even length by multiplying the first half or the second half of its elements by ?1.

[0158] In the following embodiments a number of centrally symmetric sequences are disclosed for giving some non-limiting examples of sets of root indices. The terms root index and index respectively, are used somewhat interchangeably herein. Centrally anti-symmetric sequences may be generated from the disclosed centrally symmetric sequences in some embodiments. The performance may depend on the chosen set of root indices. The set of indices will be known to both the transmitter 110 and the receiver 120.

[0159] The root index u may be selected by the transmitter 110 from a given set of root indices in some embodiments. When the transmitter 110 is connected to a cell, the radio network node 130 may signal information to the transmitter 110, which may explicitly or implicitly indicate which root index u to be used. In the latter case, the radio network node 130 may, e.g., signal a physical layer identity from which the root index u may be derived. An advantage of signaling the root index is that the radio network node 130 may perform coordination between time-frequency resources used for the D2DSS and the root indices, in order to minimize the mutual interference in the system. The root index u may also in some embodiments be selected without any prior signaling information from the network 100. This would be advantageous in order to minimize the control signaling in the cell. In one example, the transmitter 110 may derive the root index u randomly or from parameters internal to the transmitter 110. Moreover, the transmitter 110 may select the root index u based on other received signals. For example, when the transmitter 110 receives a D2DSS from another D2D transmitter which is synchronized to a cell, the transmitter 110 may select a root index u from a first set of root indices, while when the transmitter 110 receives a D2DSS from another D2D transmitter which is not synchronized to a cell, the transmitter 110 may select a root index u from a second set of root indices in some embodiments. This is advantageous since a receiver 120 may then select which D2DSS it should synchronize to, based on information on the synchronization source, e.g., a synchronization source which has synchronized to a cell may be more reliable. In another example, if the transmitter 110 receives a D2DSS, it may select the same root index u as the received D2DSS. Alternatively, if the transmitter 110 receives a D2DSS, it may select a different root index u as the received D2DSS. Furthermore, if D2DSS transmissions may be relayed among network nodes 140, e.g., being transmitted over multiple hops, and if the transmitter 110 receives a D2DSS, and if it is able to determine for how many hops the D2DSS has been transmitted, it may select the root index u based on the number of hops. This is advantageous since the receiver 120 may then select which D2DSS it should synchronize to, based on information on the synchronization source, e.g., a D2DSS with less hops may be more reliable. The root index selection may also comprise a combination of the above examples in some embodiments.

[0160] In one embodiment, the LTE PSS sequence is used as a D2DSS sequence but with different root indices. Table 2 illustrates correlation properties for an example where the set of root indices is u?{26,37,38}. Since the sequence is obtained from a punctured Zadoff-Chu sequence of length 63, typically u may be a relatively prime (sometimes also referred to as mutually prime or coprime/co-prime) to 63. It may further be realized that if two root indices u and v are related by u=63?v, the sequences constitute a complex conjugated pair and the corresponding D2DSS signals will exhibit a complex conjugated pair property.

TABLE-US-00002 TABLE 2 Auto-correlation: Cross-correlation with PSS: Maximum false Maximum false peak, Root index peak correlation (PSS root index) u = 26 0.25 0.21 u = 37 0.25 0.21 u = 38 0.25 0.21

[0161] The maximum cross-correlation among the D2DSSs generated from the set of root indices u?{26,37,38} is 0.29.

[0162] In one embodiment, Zadoff-Chu sequences of odd length L are used for which R elements are removed to obtain a sequence of even length (e.g., length 62). R may be a value not smaller than 3. An odd length Zadoff-Chu sequence may be defined as follows, where u is relatively prime to L.

d.sub.u(n)=W.sub.L.sup.un(n+1)/2,n=0,1, . . . ,L?1

W.sub.L=e.sup.?j2?/L

[0163] Since d.sub.u(n)=d.sub.L?u*(n), n=0, 1, . . . , L?1, the same complex-conjugate relationship among root indices u and L?u will exist when R elements have been removed. Hence the advantage of being able to detect two D2DSSs with the multiplication complexity of just one D2DSS may be achieved.

[0164] The removal of the R elements should assure that the remaining sequence is centrally symmetric or centrally anti-symmetric. In one example, this is achieved by removing the central R elements. It is further realized that such symmetries could be achieved by other removal options, e.g., removing one or several central elements and additionally, elements in the beginning and the end of the sequence. In order to preserve good auto-correlation and Peak-to-Average-Power-Ratio (PAPR) properties of Zadoff-Chu sequences, it is desirable that R is as small as possible. If targeted length is 62, then it may be beneficial to use L=65 and R=3. Since the sequence is obtained from a punctured Zadoff-Chu sequence of length 65, typically u may be selected as a relatively prime to 65. When two root indices u and v are related by u=65?v, the corresponding D2DSS signal will exhibit a complex conjugated pair property.

[0165] Table 3 illustrates correlation properties for an example where the set of root indices is u?{22,24,43}.

TABLE-US-00003 TABLE 3 Auto-correlation: Cross-correlation with PSS: Maximum false Maximum false peak, Root index peak correlation (PSS root index) u = 22 0.26 0.24 u = 24 0.24 0.31 u = 43 0.26 0.31

[0166] The maximum cross-correlation among the D2DSSs generated from the set of root indices u?{22,24,43} is 0.21.

[0167] In one embodiment, Zadoff-Chu sequences of even length L may be used which are cyclically extended to length L+1 and where the central element is removed. An even length Zadoff-Chu sequence may be defined as follows, where u may be relatively prime to L:

[00022]$d_u?\left(n\right)=W_L^{\frac{{\mathrm{un}}^2}{2}},n=0,1,\mathrm{.Math.}.Math.,L-1$$W_L=e^{-j.Math..Math.2.Math.?/L}.$

[0168] Furthermore, d.sub.u(n)=(?1).sup.nd.sub.L?u*(n), n=0, 1, . . . , L?1. Hence, this relationship may be utilized to determine an association between the D2DSSs corresponding to indices u and L?u.

[0169] The obtained punctured and extended sequence may be described as:

[00023]$d_u?\left(n\right)=\{\begin{array}{cc}{e}^{-j.Math.\frac{?.Math..Math.{\mathrm{un}}^2}{L}},& n=0,1,\mathrm{.Math.}.Math.,\frac{L}{2}-1\\ e^{-j.Math.\frac{?.Math..Math.u?\left(n+1\right).Math.\left(n+1\right)}{L}},& n=\frac{L}{2},\frac{L}{2}+1,\mathrm{.Math.}.Math.,L-1\end{array}$

[0170] This sequence is centrally symmetric. Table 4 illustrates correlation properties for an example where L=62 and the set of root indices is u?{21,29,41}.

TABLE-US-00004 TABLE 4 Auto-correlation: Cross-correlation with PSS: Maximum false Maximum false peak, Root index peak correlation (PSS root index) u = 21 0.28 0.26 u = 29 0.26 0.24 u = 41 0.29 0.22

[0171] The maximum cross-correlation among the D2DSSs generated from the set of root indices u {21,29,41} is 0.21.

[0172] In one embodiment, the same sequence structure as for the Zadoff-Chu sequences of odd length may be assumed, but then it may be specified an even number of phases and even sequence length. Mathematically, these new sequences may be described as:

[00024]$d_u?\left(n\right)=W_L^{\frac{\mathrm{un}?\left(n+1\right)}{2}},n=0,1,\mathrm{.Math.}.Math.,L-1,L.Math..Math.\mathrm{even}$$W_L=e^{-j.Math..Math.2.Math.?/L}.$

[0173] For example, it is possible to assume L=62. It is noted that this sequence is not a Zadoff-Chu sequence. Table 5 contains correlation properties for an example where L=62 and the set of root indices is u?{25,27,29}.

TABLE-US-00005 TABLE 5 Auto-correlation: Cross-correlation with PSS: Maximum false Maximum false peak, Root index peak correlation (PSS root index) u = 25 0.26 0.25 u = 27 0.30 0.24 u = 29 0.30 0.20

[0174] The maximum cross-correlation among the D2DSSs generated from the set of root indices u?{25,27,29} is 0.21.

[0175] Furthermore, some of the herein described embodiments may be used in multi-user D2D communications compatible with LTE system. The herein described D2DSS may be transmitted by a D2D-enabled user equipment (UE), or any network node other than an eNodeB within the LTE system.

[0176] FIG. 4 is a flow chart illustrating embodiments of a method 400 for use in a transmitter 110, for generating a synchronization signal for D2D communications utilizing a SC-FDMA waveform, wherein a synchronization sequence is modulating a set of subcarriers.

[0177] To generate the synchronization signal for D2D communications, the method 400 may comprise a number of actions 401-403. It is however to be noted that any, some or all of the described actions 401-403, may be performed in a somewhat different chronological order than the enumeration indicates, be performed simultaneously or even be performed in a completely reversed order according to different embodiments. Further, it is to be noted that some actions may be performed in a plurality of alternative manners according to different embodiments, and that some such alternative manners may be performed only within some, but not necessarily all embodiments. The method 400 may comprise the following actions:

Action 401

[0178] A synchronization sequence is determined, where:

|d.sub.u[l]|=|d.sub.u[L?1?l]|,l=0,1, . . . ,L?1

and

|d.sub.u[l]|=K,

[0179] for a positive constant K, wherein u is an index and L is the length of the synchronization sequence.

[0180] In some embodiments, the synchronization sequence may be determined, such that:

d.sub.u[l]=?d.sub.u[L?1?l],l=0,1, . . . ,L?1.

[0181] In some embodiments, a centrally anti-symmetric D2D synchronization sequence of even length may be obtained from a centrally symmetric D2D synchronization sequence of even length by multiplying the elements of one of the synchronization sequence halves by ?1.

[0182] In some embodiments, the synchronization sequence may be determined, such that:

[00025]$d_u?\left[n\right]=\{\begin{array}{cc}{e}^{-j.Math.\frac{?.Math..Math.\mathrm{un}?\left(n+1\right)}{63}},& n=0,1,\mathrm{.Math.}.Math.,30\\ e^{-j.Math.\frac{?.Math..Math.u?\left(n+1\right).Math.\left(n+2\right)}{63}},& n=31,32,\mathrm{.Math.}.Math.,61\end{array}$

[0183] In some embodiments, the synchronization sequence may be determined by selecting a Zadoff-Chu sequence of odd length, and removing an odd number of elements from the selected Zadoff-Chu sequence, to obtain a centrally symmetric synchronization sequence of even length.

[0184] However, in some embodiments, the synchronization sequence may be determined by selecting a Zadoff-Chu sequence of even length, extending the selected Zadoff-Chu sequence by one element, and removing a central element of the extended Zadoff-Chu sequence.

[0185] The synchronization sequence may in some further embodiments be determined such that:

d.sub.u[n]=W.sub.L.sup.un(n+1)/2,n=0,1, . . . ,L?1, L even

and W.sub.L=e.sup.?j2?/L.

[0186] Furthermore, according to some embodiments, the synchronization sequence may be mapped to the resource elements of the SC-FDMA signal, such that for the Fourier coefficients: |H[k]|=H[N?1?k]|, k=0, 1, . . . , N?1, where N is an integer not smaller than L.

[0187] However, in some such embodiments, H[k]=H[N?1?k], k=0, 1, . . . , N?1, while in some other embodiments H[k]=?H[N?1?k], k=0, 1, . . . , N?1.

Action 402

[0188] The root index u is selected from a set of root indices. In some embodiments, the indices comprised in the set of root indices may be relatively primes in relation to each other.

[0189] The root index u may be selected to an integer different from 25, 29 and 34.

[0190] The root index u may, according to some embodiments be selected from the set of root indices randomly.

[0191] The root index u my further be selected from the set of root indices by deriving it from one or more parameters internal to the transmitter 110.

[0192] Further, in some embodiments, the root index u may be selected from the set of root indices, based on information received from a serving radio network node 130.

[0193] In some embodiments, the root index u may be selected from the set of indices, based on a received signal, received, e.g., from the receiver 120, from another network node 140 or from the radio network node 130.

[0194] The root index u may further be selected from a first set of root indices when receiving a synchronization signal from another D2D transmitter synchronized to a cell, and from a second set of root indices when receiving a synchronization signal from a D2D transmitter, not synchronized to a cell.

[0195] Also, according to some embodiments, the same root index u may be selected as has been utilized in a received synchronization signal.

[0196] However, according to other embodiments, a different root index u may be selected, as has been utilised in a received synchronization signal.

[0197] The synchronization signal may, in some embodiments, be transmitted over multiple hops between network nodes 140 and wherein the root index u may be selected from the set of root indices, based on the number of hops of the received synchronization signal.

Action 403

[0198] The synchronization signal is generated, based on the determined 401 synchronization sequence and the selected 402 root index u.

[0199] FIG. 5 illustrates an embodiment of a transmitter 110, configured for generating a synchronization signal for Device-to-Device (D2D) communication utilizing a Single Carrier-Frequency Division Multiple Access (SC-FDMA) waveform, wherein a synchronization sequence is modulating a set of subcarriers. The transmitter 110 is further configured for performing the method 400 according to at least some of the previously described actions 401-403.

[0200] For enhanced clarity, any internal electronics or other components of the transmitter 110, not completely indispensable for understanding the herein described embodiments have been omitted from FIG. 5.

[0201] The transmitter 110 comprises a processor 520, configured for determining a synchronization sequence, where |d.sub.u[l]|=|d.sub.u[L?1?l]|, l=0, 1, . . . , L?1, and |d.sub.u[l]|=K, for a positive constant K wherein u is a root index and L is the length of the synchronization sequence. Also, the processor 520 is further configured for selecting the root index u from a set of root indices; and in addition configured for generating the D2D synchronization signal, based on the determined synchronization sequence and the selected root index u.

[0202] The processor 520 may be further configured for determining the synchronization sequence, such that: d.sub.u[l]=?d.sub.u[L?1?l], l=0, 1, . . . , L?1.

[0203] In some embodiments, the processor 520 may be configured for obtaining a centrally anti-symmetric D2D synchronization sequence of even length from a centrally symmetric D2D synchronization sequence of even length by multiplying the elements of one of the synchronization sequence halves by ?1.

[0204] The processor 520 may be further configured for determining the synchronization sequence, such that:

[00026]$d_u?\left[n\right]=\{\begin{array}{cc}{e}^{-j.Math.\frac{?.Math..Math.\mathrm{un}?\left(n+1\right)}{63}},& n=0,1,\mathrm{.Math.}.Math.,30\\ e^{-j.Math.\frac{?.Math..Math.u?\left(n+1\right).Math.\left(n+2\right)}{63}},& n=31,32,\mathrm{.Math.}.Math.,61\end{array}$

[0205] and may in addition also be configured for selecting the root index u to an integer different from 25, 29 and/or 34.

[0206] The processor 520 may further be configured for determining the synchronization sequence by selecting a Zadoff-Chu sequence of odd length, and removing an odd number of elements from the selected Zadoff-Chu sequence, to obtain a synchronization sequence of even length in some embodiments.

[0207] Alternatively, the processor 520 may be configured for determining the synchronization sequence by selecting a Zadoff-Chu sequence of even length, extending the selected Zadoff-Chu sequence by one element, and removing a central element of the extended Zadoff-Chu sequence.

[0208] The processor 520 may also be configured for determining the synchronization sequence such that:

d.sub.u[n]=W.sub.L.sup.un(n+1)/2,n=0,1, . . . ,L?1, L even

and W.sub.L=e.sup.?j2?/L.

[0209] Further, the processor 520 may be configured for mapping the synchronization sequence to the resource elements of the SC-FDMA signal, such that for the Fourier coefficients:

|H[k]|=|H[N?1?k]|,k=0,1, . . . ,N?1, where N is an integer not smaller than L.

In some such embodiments, the processor 520 may be configured for mapping the synchronization sequence such that H[k]=H[N?1?k], k=0, 1, . . . , N?1, and/or H[k]=?H[N?1?k], k=0, 1, . . . ,N?1.

[0210] Such processor 520 may comprise one or more instances of a processing circuit, i.e., a Central Processing Unit (CPU), a processing unit, a processing circuit, a processor, an Application Specific Integrated Circuit (ASIC), a microprocessor, or other processing logic that may interpret and execute instructions. The herein utilized expression processor may thus represent a processing circuitry comprising a plurality of processing circuits, such as, e.g., any, some or all of the ones enumerated above.

[0211] The transmitter 11o also may comprise a transmitting circuit 530, configured for transmitting a signal, such as, e.g., a synchronization signal.

[0212] In further addition, the transmitter 110 may comprise a receiving circuit 510, configured for receiving signals, such as, e.g., synchronization signals, from other network nodes 120, 130, 140 over a wireless interface according to some embodiments.

[0213] Furthermore, the transmitter 11o may further comprise at least one memory 525, according to some embodiments. The optional memory 525 may comprise a physical device utilized to store data or a program, i.e., a sequence of instructions, on a temporary or permanent basis. According to some embodiments, the memory 525 may comprise integrated circuits comprising silicon-based transistors. Further, the memory 525 may be volatile or non-volatile.

[0214] Some or all of the above described actions 401-403 to be performed in the transmitter 110 may be implemented through the one or more processors 520 in the transmitter 110, together with a computer program product for performing at least some of the functions of the actions 401-403. Thus a computer program comprising program code may perform a method 400 according to any, at least some, or all of the functions of the actions 401-403 for generating a synchronization signal for D2D communications utilizing an SC-FDMA waveform, wherein a synchronization sequence is modulating a set of subcarriers, when the computer program is loaded into a processor 520 of the transmitter 110.

[0215] Further, a computer program product may comprise a computer readable storage medium storing program code thereon for use by the transmitter 110, for generating a synchronization signal for D2D communications utilizing an SC-FDMA waveform, wherein a synchronization sequence is modulating a set of subcarriers. The program code comprising instructions for executing a method 400 that comprises determining 401 a synchronization sequence, where |d [l]|=|d.sub.u[L?1?l]|, l=0, 1, . . . , L?1 and |d.sub.u[l]|=K, for a positive constant K, wherein u is a root index and L is the length of the synchronization sequence; selecting 402 the root index u from the set of root indices; and generating 403 the synchronization signal, based on the determined 401 synchronization sequence and the selected 402 root index u.

[0216] The computer program product mentioned above may be provided for instance in the form of a data carrier carrying computer program code for performing at least some of the actions 401-403 according to some embodiments when being loaded into the processor 520. The data carrier may be, e.g., a hard disk, a CD ROM disc, a memory stick, an optical storage device, a magnetic storage device or any other appropriate medium such as a disk or tape that may hold machine readable data in a non-transitory manner. The computer program product may furthermore be provided as computer program code on a server and downloaded to the transmitter 110 remotely, e.g., over an Internet or an intranet connection.

[0217] FIG. 6 illustrates an embodiment of a receiver 120, configured for detecting a received synchronization signal for D2D communications utilizing an SC-FDMA waveform, wherein a synchronization sequence is modulating a set of subcarriers. The synchronization signal for D2D communications may be received from the transmitter 110.

[0218] For enhanced clarity, any internal electronics or other components of the receiver 120, not completely indispensable for understanding the herein described embodiments have been omitted from FIG. 6.

[0219] The receiver 120 comprises a processor 620, configured for detecting the synchronization signal comprising a synchronization sequence, where |d.sub.u[ ]|=|d.sub.u[L?1?l]|, l=0, 1, . . . , L?1, and |d.sub.u[l]|=K, for a positive constant K, wherein u is a root index and L is the length of the synchronization sequence.

[0220] Such processor 620 may comprise one or more instances of a processing circuit, i.e., a Central Processing Unit (CPU), a processing unit, a processing circuit, a processor, an Application Specific Integrated Circuit (ASIC), a microprocessor, or other processing logic that may interpret and execute instructions. The herein utilized expression processor may thus represent a processing circuitry comprising a plurality of processing circuits, such as, e.g., any, some or all of the ones enumerated above.

[0221] Further, the receiver 120 comprises a receiving circuit 610, configured for receiving a signal such as, e.g., a synchronization signal, from, e.g., the transmitter 110.

[0222] However, the receiving circuit 610 may be configured for receiving radio signals of various types over a wireless interface from a plurality of transmitting entities, such as other network nodes 140, or the radio network node 130.

[0223] Furthermore, the receiver 120 also may in some embodiments comprise a transmitting circuit 630, configured for transmitting a wireless signal comprising, e.g., synchronization signal.

[0224] Furthermore, the receiver 120 may further comprise at least one memory 625, according to some embodiments. The optional memory 625 may comprise a physical device utilised to store data or programs, i.e., sequences of instructions, on a temporary or permanent basis. According to some embodiments, the memory 625 may comprise integrated circuits comprising silicon-based transistors. Further, the memory 625 may be volatile or non-volatile.

[0225] The terminology used in the description of the embodiments as illustrated in the accompanying drawings is not intended to be limiting of the described method 400; transmitter 110 and/or receiver 120. Various changes, substitutions and/or alterations may be made, without departing from the invention as defined by the appended claims.

[0226] As used herein, the term and/or comprises any and all combinations of one or more of the associated listed items. In addition, the singular forms a, an and the are to be interpreted as at least one, thus also possibly comprising a plurality of entities of the same kind, unless expressly stated otherwise. It will be further understood that the terms includes, comprises, including and/or comprising, specifies the presence of stated features, actions, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, actions, integers, steps, operations, elements, components, and/or groups thereof. The term or as used herein, is to be interpreted as a mathematical OR, i.e. as an inclusive disjunction; not as a mathematical exclusive OR (XOR), unless expressly stated otherwise. A single unit such as, e.g., a processor may fulfil the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage. A computer program may be stored/distributed on a suitable medium, such as an optical storage medium or a solid-state medium supplied together with or as part of other hardware, but may also be distributed in other forms such as via Internet or other wired or wireless communication system.