(19)
(11)EP 3 317 987 B1

(12)EUROPEAN PATENT SPECIFICATION

(45)Mention of the grant of the patent:
26.06.2019 Bulletin 2019/26

(21)Application number: 15735894.6

(22)Date of filing:  30.06.2015
(51)International Patent Classification (IPC): 
H04L 1/00(2006.01)
H04B 7/02(2018.01)
(86)International application number:
PCT/EP2015/064893
(87)International publication number:
WO 2017/000999 (05.01.2017 Gazette  2017/01)

(54)

NETWORK INFORMATION TRANSMISSION IN A MOBILE COMMUNICATION NETWORK

NETZWERKINFORMATIONSÜBERTRAGUNG IN EINEM MOBILKOMMUNIKATIONSNETZWERK

TRANSMISSION D'INFORMATIONS DE RÉSEAU DANS UN RÉSEAU DE COMMUNICATIONS MOBILES


(84)Designated Contracting States:
AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

(43)Date of publication of application:
09.05.2018 Bulletin 2018/19

(73)Proprietor: Telecom Italia S.p.A.
20123 Milano (IT)

(72)Inventors:
  • CARETTI, Marco
    I-10148 Torino (IT)
  • DELL'AERA, Gian Michele
    I-10148 Torino (IT)
  • FODRINI, Maurizio
    I-10148 Torino (IT)
  • MELIS, Bruno
    I-10148 Torino (IT)

(74)Representative: Colombo, Stefano Paolo et al
Marchi & Partners S.r.l. Via Vittor Pisani, 13
20124 Milano
20124 Milano (IT)


(56)References cited: : 
WO-A2-2008/024214
US-A1- 2014 204 851
  
  • I-HONG HOU ET AL: "Real-time communication over unreliable wireless links: a theory and its applications", IEEE WIRELESS COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 19, no. 1, 1 February 2012 (2012-02-01), pages 48-59, XP011442640, ISSN: 1536-1284, DOI: 10.1109/MWC.2012.6155876
  
Note: Within nine months from the publication of the mention of the grant of the European patent, any person may give notice to the European Patent Office of opposition to the European patent granted. Notice of opposition shall be filed in a written reasoned statement. It shall not be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention).


Description

Technical field



[0001] The present invention relates to the field of mobile communication networks. In particular, the present invention relates to a method for transmitting broadcast network information in a mobile communication network, such as, for example, an LTE (Long Term Evolution) network.

Background art



[0002] As known, a mobile communication network, such as an LTE (Long Term Evolution) communication network, comprises a radio access network (also termed E-UTRAN, namely Evolved UMTS Terrestrial Radio Access Network) comprising a plurality of network nodes (also termed eNodeB) spread over a certain geographical area. Each network node typically provides radio coverage in one or more cells, each cell being an area nearby the network node. The network node in particular exchanges data with user terminals (namely, mobile phones, smartphones, tablets, etc.) located within its cell(s). Data are typically exchanged within time slots of a radio frame carried over a number of frequency sub-carriers of the network frequency bands.

[0003] Typically, each network node transmits a synchronization channel with synchronization signals, which are exploited by the user of the network to discover the cell identifier (also termed CID) that identifies the network node. In an LTE communication network, two synchronization signals are typically used, namely the Primary Synchronization Signal, PSS, and the Secondary Synchronization Signal, SSS. As known, at the user terminal, the CID is needed to obtain a time/frequency resource for transmission within the cell and to recover the cell specific reference signals (RS).

[0004] In an LTE communication network, the time/frequency resources are organized in a OFDM (Orthogonal Frequency Division Multiplexing) time/frequency grid, wherein a number of frequency sub-carriers are assigned to radio sub-frames of 1 ms in length comprised within a radio frame having a length of 10 ms. Each subframe comprises two time slots, each time slot consisting of a number of OFDM symbols. The cell specific reference signals are reference (or pilot) symbols inserted within the OFDM time/frequency grid at predefined time/frequency locations. The cell specific reference signals are typically used to decode both the Physical Broadcast Channel (PBCH) and other downlink physical channels, such as the Physical Downlink Control Channel (PDCCH) and the Physical Downlink Shared Channel (PDSCH) transmitted by each single node. The PBCH broadcasts the Master Information Block (MIB) that contains network information needed by the user terminal(s) to access the communication network and to acquire other information from the network node. The MIB has a size equal to 14 information bits plus 10 spare bits, which are transmitted with a period of 40 ms. As known, the MIB carries the following information fields: downlink system bandwidth, Physical H-ARQ Information Channel (PHICH) structure and System Frame Number.

[0005] Though the description above makes reference to an exemplary LTE communication network, the concept of broadcasting network information necessary for accessing the network is common to any currently available mobile communication system. For instance, as known, in a 3G UMTS communication network, each Node B broadcasts system information including a Master Information Block containing the network information needed by the user terminal(s) to access the communication network, such as scheduling information, a PLMN (Public Land Mobile Network) identifier, a PLMN type, and so on.

[0006] WO 2014/113173 discloses techniques and apparatus for enhanced physical broadcast channel (PBCH) for new carrier type (NCT) in long term evolution (LTE). According to certain aspects, a method for wireless communications by a base station (BS) is provided. The method generally includes generating an enhanced physical broadcast channel (EPBCH) using a frequency division multiplexed (FDM) structure, wherein the EPBCH spans substantially a subframe duration and transmitting the EPBCH.

Summary of the invention



[0007] According to the above, in current mobile communication networks, a number of essential broadcast network information are transmitted by each node of the network using a broadcast channel.

[0008] The inventors noticed that when a user terminal receives the broadcast network information carried over the broadcast channel, it does not send any feedback to the node which may allow verifying whether the user terminal correctly acquired the broadcast network information. Therefore, typically, the transmission of the broadcast channel is performed by using a large amount of redundancy in order to guarantee reliable reception of the broadcast network information at the user terminal.

[0009] Moreover, the inventors noticed that nowadays the increasing demand of channel quality pushes towards the introduction of new features aiming the user terminal to be assisted by the communication network in order to remove inter-cell interference. Currently, in order to implement such features, a user terminal that has accessed the communication network should acquire from its serving node further information about interfering nodes. Furthermore new generation networks, because of their flexibility in band utilization, need more network information to be broadcast. These procedures may introduce some undesired latency.

[0010] On the other hand, broadcasting further information (e.g. information about interfering nodes) over the broadcast channel would lead to increase the network information that a node is sending over the broadcast channel and hence would lead to reduce the redundancy which is typically used to protect the broadcast network information itself. It follows that in such a situation the reception reliability of the broadcast network information would be disadvantageously reduced.

[0011] In view of the above, the Applicant has tackled the problem of providing a method for transmitting broadcast network information in a mobile communication network which overcomes the aforesaid drawbacks.

[0012] In particular, the Applicant has tackled the problem of providing a method for transmitting broadcast network information in a mobile communication network which allows a network node to broadcast an increased amount of network information (comprising, for instance, information related to other network nodes) to the user terminal(s) served by the node without reducing the reception reliability of the network information.

[0013] In the present description and in the claims, the expression "time/frequency resource" will indicate a combination of network resources in both time and frequency domains. The time/frequency resource comprises a number of frequency sub-carriers allocated for transmission of a predefined amount of data within the communication network and, in combination, a predefined amount of time within the radio frame during which such transmission may take place. For instance, in an LTE communication network, a time/frequency resource allocated for transmission of the primary synchronization signal PSS comprises 62 sub-carriers and the last OFDM symbol of the first and 11-th time slots of each LTE radio frame.

[0014] Moreover, the expression "broadcast network information" indicates information transmitted by a network node of the communication network and needed by any user terminal to access the communication network and/or to acquire other information from the network node. Examples of broadcast network information are the information contained in the Master Information Block (MIB) in an LTE communication network. Moreover, according to the present invention, the "broadcast network information" transmitted by a network node comprise also information related to one or more other network nodes of the communication network such as, for instance, identifiers of these other network nodes, transmit powers, frame and subframe configurations, indicators of network node's statuses or conditions (e.g. load indicators). These latter information may allow, for instance, to implement inter-cell interference coordination and cancellation techniques at the user terminal receiver.

[0015] According to a first aspect, the present invention provides a method for transmitting broadcast network information in a mobile wireless communication network comprising a plurality of network nodes, the method comprising:
  1. a) providing a compression of broadcast network information related to a group of coordinated network nodes of the plurality of network nodes;
  2. b) coding the compressed broadcast network information by segmenting the compressed broadcast network information into a number of blocks and linearly combining the blocks into a plurality of linear combinations of blocks; and
  3. c) transmitting the linear combinations of blocks by the group of coordinated network nodes.


[0016] Preferably, the method further comprises associating the group of coordinated network nodes with a group identifier and each coordinated network node with a joint cell identifier comprising the group identifier and a specific cell identifier.

[0017] Preferably, providing a compression of broadcast network information comprises eliminating redundancies in the broadcast network information of the group of coordinated network nodes.

[0018] Preferably, providing a compression of broadcast network information comprises implementing a lossless compression algorithm.

[0019] Preferably, the method further comprises, after the coding, applying an inner channel coder selected between a Viterbi coder and a Turbo coder.

[0020] Preferably, the method further comprises modulating for transmission the linear combinations, wherein modulating comprises applying a QPSK modulation.

[0021] Preferably, the method further comprises transmitting, by each coordinated network node, al least one synchronization signal allowing to recover, at a user terminal, the respective joint cell identifier.

[0022] According to an embodiment of the present invention, transmitting the linear combinations of blocks comprises cyclically transmitting a same sequence of the linear combinations by each coordinated network node in a synchronized manner over a joint physical broadcasting channel.

[0023] According to this embodiment, the method further comprises generating, at the coordinated network nodes, on the basis of the group identifier, one or more joint reference signals, the joint reference signals being the same for all the coordinated network nodes, and wherein the method further comprises using, at the user terminal, the joint cell identifier to recover the joint reference signals and decode the joint physical broadcasting channel.

[0024] According to another embodiment of the present invention, transmitting the linear combinations of blocks comprises cyclically transmitting a different sequence of the linear combinations by each coordinated network node over a joint physical broadcasting channel.

[0025] According to this embodiment, the method further comprises generating, at each coordinated network nodes, on the basis of the specific cell identifier, one or more reference signals, the reference signals being different among the coordinated network nodes, and wherein the method further comprises using, at the user terminal, the joint cell identifier to recover the joint reference signals and decode the joint physical broadcasting channel.

[0026] According to a second aspect, the present invention provides a controller for a mobile wireless communication network comprising a plurality of network nodes, the controller being configured to:
  • provide a compression of broadcast network information related to a group of coordinated network nodes of the plurality of network nodes; and
  • code the compressed broadcast network information by segmenting the compressed broadcast network information into a number of blocks and linearly combining the blocks into a plurality of linear combinations of blocks.


[0027] According to a third aspect, the present invention provides a mobile wireless communication network comprising a plurality of network nodes and a controller, the controller being configured to:
  • provide a compression of broadcast network information related to a group of coordinated network nodes of the plurality of network nodes;
  • code the compressed broadcast network information by segmenting the compressed broadcast network information into a number of blocks and linearly combining the blocks into a plurality of linear combinations of blocks;
and the group of coordinated network nodes being configured to transmit the linear combinations of blocks.

[0028] According to an embodiment of the present invention, the coordinated network nodes implement a single frequency network, SFN.

[0029] Preferably, the communication network is a long term evolution, LTE, communication network.

Brief description of the drawings



[0030] The present invention will become clearer from the following detailed description, given by way of example and not of limitation, to be read with reference to the accompanying drawings, wherein:
  • Figure 1 schematically shows a communication network according to the present invention;
  • Figure 2 is a flow chart of the method according to the present invention;
  • Figure 3 illustrates in more detail some steps of the flow chart of Figure 2;
  • Figures 4a and 4b schematically illustrate the transmission of broadcast network information according to, respectively, a first embodiment and a second embodiment of the method of the present invention; and
  • Figures 5a and 5b schematically illustrate a further example of transmission of broadcast network information according to, respectively, the first embodiment and the second embodiment of the method of the present invention.

Detailed description of preferred embodiments of the invention



[0031] Figure 1 shows a mobile communication network CN (which will be referred to in the following description simply as "communication network CN") according to an embodiment of the present invention. Preferably, the communication network CN is distributed over a plurality of cells and comprises one or more network nodes providing a radio coverage for the users of the communication network. The communication network CN shown in Figure 1 comprises, for sake of example, five network nodes N1, N2, N3, N4 and N5.

[0032] The network nodes N1-N5 of the communication network CN are preferably configured to exchange data with user terminal(s) (such as, for instance, mobile phones, smartphones, tablets and the like) according to multiple access techniques for the downlink and uplink transmissions.

[0033] The communication network CN may be, for instance, the radio access network (namely, a E-UTRAN) of a Long Term Evolution (LTE) communication network or a LTE-Advanced communication network and it may be based on the OFDMA (Orthogonal Frequency Division Multiple Access) technique for downlink transmission and on the SC-FDMA (Single Carrier-Frequency Division Multiple Access) technique for the uplink transmission. In this case, each network node N1-N5 is a eNodeB.

[0034] Each network node N1-N5 of the communication network CN is preferably configured to transmit and receive data to/from a user terminal according to a scheduling of time and frequency resources. Time resources correspond to time slots of a radio frame while frequency resources correspond to sub-bands (or sub-carriers) of the frequency band allocated for the data transmission. For instance, in an LTE communication network, the time/frequency resources are organized in a OFDM (Orthogonal Frequency Division Multiplexing) time/frequency grid, wherein a number of frequency sub-carriers are assigned to radio subframes of 1 ms in length comprised within a radio frame having a length of 10 ms. Each subframe comprises two time slots, each time slot consisting of a number of OFDM symbols. Scheduling of data transmission is performed on a symbol or time slot or subframe basis.

[0035] Moreover, each network node N1-N5 of the communication network CN is preferably configured to broadcast a number of channels comprising network information needed by the user terminals to access the communication network CN and/or to acquire other information from the network node. As it will be described in greater detail herein after, the information broadcast by a network node N1-N5 over these channels may comprise: frequency and timing synchronization information, a system bandwidth, a control channel structure, a system frame number, one or more cell identifiers, data related to the other network nodes. Preferably, each channel is broadcasted using the time/frequency resources of the communication network CN.

[0036] Moreover, each network node N1-N5 of the communication network CN is preferably configured to transmit also reference signals that may be used by the user terminal to decode the information carried over the channel(s) broadcasted by the network node. Preferably, also the reference signals are broadcasted using the time/frequency resources of the communication network CN.

[0037] In case the communication network CN is an LTE communication network, each network node N1-N5 (namely, each eNodeB) is configured to transmit a synchronization channel comprising a primary synchronization signal (PSS) and a secondary synchronization signal (SSS) allowing the user terminal to achieve the center frequency of the channel bandwidth, the radio frame, subframe, slot and symbol timing synchronization, and the cell identifier (CID). Synchronization signals are transmitted twice per 10 ms radio frame. The PSS is located in the last OFDM symbol of the first and 11-th time slot of each radio frame. The SSS is located in the OFDM symbol immediately before the last OFDM symbol of the first and 11-th time slot of each radio frame.

[0038] Moreover, each eNodeB is configured to transmit a physical broadcast channel (PBCH) comprising the Master Information Block (MIB), as already described above. The MIB (14 bits long) is mapped onto 72 sub-carriers of the OFDM grid. The PBCH transmission occurs on the second time slot of the first subframe of four consecutive radio frames and is thus periodically repeated with a period equal to 40 ms.

[0039] Furthermore, each eNodeB is configured to transmit reference signals in the form of pseudorandom sequences of reference (or pilot) symbols within the radio frame. The reference signals are in predetermined locations within the radio frame, and these locations may be recovered using the cell identifier. For instance, the downlink reference signals may be transmitted every first and fifth OFDM symbol of a time slot with a frequency spacing of six sub-carriers, when one antenna is used for transmission. The recovered reference signals are employed at the user terminal to decode the PBCH and achieve the network information of the MIB.

[0040] Preferably, the network nodes N1-N5 of the communication network CN are synchronized. In particular, at each network node N1-N5, the radio frame start is aligned in time, within a certain error bound, with the radio frame start of all the other network nodes N1-N5. This can be achieved by implementing protocols such as the IEEE 1588 PTP (Precision Time Protocol), Synchronous Ethernet (SyncE) or by exploiting other systems like the Global Positioning System (GPS).

[0041] According to the present invention, the communication network CN comprises also a network controller C which is preferably connected to the network nodes N1-N5 or to a subset thereof (in Figure 1, for example, the controller C is connected to three network nodes N1-N3). The controller C may be in the form of a hardware device, a hardware device running a dedicated software, a software module, a distributed software. It may be implemented over a standalone apparatus connected to the network nodes either through a wired or a wireless connection, or over a network node or it may be distributed over all the network nodes of the communication network CN or a subset thereof. In case the network controller C is implemented over a network node or in case it is distributed over the network nodes, the network nodes are preferably configured to exchange the information needed by the network controller C either wirelessly or through wired connections. The network controller C is preferably configured to coordinate and control the network nodes N1-N5 or a subset thereof.

[0042] According to the present invention, a group of network nodes of the communication network CN is associated with a same group identifier. The network nodes identified by the group identifier are preferably selected on the basis of their geographical location. In particular, a given group identifier may be associated with a group of network nodes that are geographically adjacent and have similar network configurations. The "network configuration" of a network node may comprise parameters such as the transmission bandwidth and the transmission power, and may be related to the environment (e.g. rural, urban) in which the network node is located. Typically, adjacent network nodes operating in a given rural area have the same network configuration. In alternative or in addition, a given group identifier may be associated with a group of network nodes that are managed by a same controller C. In this case, the maximum number of network nodes identified by a same given group identifier may depend on the processing resources of the controller C. The more resources are available at the controller C, the higher the number of network nodes that the controller C may manage. The network nodes identified by a given group identifier will be referred to in the following as "coordinated network nodes". Each coordinated network node is then associated with a joint cell identifier, which may be referred to as "JCID", which comprises the group identifier and a specific cell identifier indicative of the specific network node (e.g. the cell ID in a LTE communication network). For instance, the joint cell identifier may correspond to the specific cell identifier of the network node wherein a number of bits (e.g. the most significant bits) represent the group identifier and are repeated in the joint cell identifiers of all the coordinated network nodes.

[0043] Figure 1, for example, shows three coordinated network nodes N1, N2, N3 that are geographically adjacent within an area A. Figure 1 also shows the connection between the controller C (represented, for sake of example, as a standalone device) and each coordinated network node N1-N3 as a wired connection. This is merely exemplary as the network nodes managed by a same controller C may be connected to it through a wireless connection. The network nodes managed by the controller C do not need to be directly connected to the controller C but they may also be connected to the controller C indirectly, via other network nodes.

[0044] Figure 2 is a flowchart illustrating the steps of the method according to the present invention. Steps 201-204 of Figure 2 are preferably performed by the controller C while steps 205-207 are preferably performed by each coordinated network node after having received from the controller C the resulting signals as processed at step 204. Alternatively, also step 205 may be performed by the controller C and the resulting signals may be sent to the coordinated network nodes N1-N3 for resource mapping and transmission, as it will be described in detail herein after.

[0045] Figure 3 illustrates in more detail steps 201-203 of the method of the present invention.

[0046] At step 201, broadcast network information of the coordinated network nodes are preferably compressed. At this stage, the broadcast network information of a coordinated network node may comprise information needed by a user terminal to access the communication network through the network node, such as a system bandwidth, a control channel structure, a system frame number (e.g. the MIB information in a LTE communication network). In particular, the broadcast network information of the coordinated network nodes are preferably collected by the controller C, which then eliminates redundancies in the broadcast network information. The compression of step 201 of the method of the present invention is preferably performed using a lossless compression algorithm. Examples of known lossless compression algorithms that may be used are the Run Length Encoding Algorithm, the Huffman Encoding, the Shannon Fano Algorithm, the Arithmetic Encoding and the Lempel Zev Welch Algorithm.

[0047] Figure 3 schematically shows three sets of broadcast network information NI1, NI2, NI3 of the three coordinated network nodes N1-N3, represented in Figure 3 as arrays of data. Each exemplary array NI1-NI3 comprises three broadcast network information: the broadcast network information of the first array NI1 are X1, X2, X3, the broadcast network information of the second array NI2 are X1, X2, X4 and the broadcast network information of the third array NI3 are X1, X2, X5. For instance, in an LTE communication network, the broadcast network information X1 may be the downlink system bandwidth comprised within the MIB of nodes N1-N3, which is common to all the coordinated nodes N1-N3; the broadcast network information X2 may be the physical H-ARQ information channel structure comprised within the MIB of nodes N1-N3, which is common to all the coordinated nodes N1-N3; the broadcast network information X3 may be the system frame number comprised within the MIB of node N1; the broadcast network information X4 may be the system frame number comprised within the MIB of node N2; the broadcast network information X5 may be the system frame number comprised within the MIB of node N3. According to this exemplary situation, the system frame number is different for the coordinated network nodes N1, N2, N3, while the other broadcast network information comprised within the MIB related to these network nodes are common to the three nodes.

[0048] As schematically represented in Figure 3, the compression performed by the controller C at step 201 eliminates redundancies and permits to avoid the repetition of the broadcast network information which are common to the coordinated network nodes.

[0049] Moreover, the controller C, at step 202, may add to the compressed broadcast network information, further broadcast network information related to one or more coordinated network nodes. These data may comprise: one or more identifiers of overloaded network nodes, one or more identifiers of switched-off network nodes, transmit power(s), power boost configuration(s), ABS (Almost Black Subframe) subframe configuration(s), radio interface overload indicator(s), backhaul status load indicator(s).

[0050] This data are indicated in Figure 3 as Y1 and Y2.

[0051] The controller C, at the end of steps 201 and 202, preferably provides a set of joint network information JNI comprising the compressed broadcast network information of the coordinated network nodes and the further broadcast network information that are possibly added to the compressed broadcast network information at step 202. In the exemplary scenario illustrated in Figure 3, the outcome of the operations performed by the controller C at steps 201 and 202 is the set or array of joint network information JNI=[X1 X2 X3 X4 X5 Y1 Y2].

[0052] In an LTE scenario, the joint network information JNI comprises a sequence of bits containing the information of the MIBs of the coordinated network nodes, wherein the repetitions of common information are eliminated, and possibly containing other information related to the coordinated network nodes which may allow, for instance, to implement inter-cell interference coordination and cancellation (ICIC) techniques.

[0053] At step 203, the controller C preferably codes the joint network information JNI. In particular, preferably, the controller C applies a linear code to the joint network information JNI. A known linear code that may be applied is described in D. S. Lun, M. Médard, R. Koetter, "Network Coding for Efficient Wireless Unicast", Proceedings of the 2006 International Zurich Seminar on Communications, p. 74-77, February 21-24 2006.

[0054] During step 203, the joint network information JNI is preferably segmented into a number M of blocks Bi, where i=1, ..., M is an integer index indicating the specific block. M is an integer number equal to or higher than 1. Each block Bi preferably comprises a same predetermined number of bits. In Figure 3, as an example, the joint network information JNI is segmented into three blocks B1, B2 and B3. The number of blocks into which the joint network information is segmented may depend on the number of radio resources available for transmission of this information in a radio subframe. Alternatively or in addition, the number of blocks may depend on the number of coordinated network nodes. In the exemplary situation described above, the number of blocks is equal to the number of coordinated network nodes.

[0055] Then, at step 203, the blocks Bi into which the joint network information is segmented are preferably linearly combined. In particular, a number K of linear combinations of the blocks Bi are computed, wherein each linear combination is computed according to the following equation:

wherein j is an integer index indicating the specific linear combination of M blocks Bi, the notation "CBj" indicates the j-th linear combination of the blocks Bi and Cij are the coefficients of the j-th linear combination CBj. The number of linear combinations K is an integer number equal to or higher than M. In Figure 3, as an example, a linear combination CBj of the three blocks B1, B3, B3 is shown.

[0056] Preferably, each linear combination CBj is computed by considering a different set of coefficients Cij, namely Cij+1≠Cij for j=1, ..., K. Preferably, the coefficients Cij are pseudo-randomly generated on the basis of the cell identifier (CID) or a geographical area identifier (e.g. the joint cell identifier). The same function used at transmission side to generate the coefficients Cij should to be used at the reception side so as to generate the same coefficients. Alternatively the coefficients Cij can be transmitted together with the broadcast information in order to be used at the reception side for the detection.

[0057] At step 204, each linear combination CBj can be optionally coded with an inner channel coder, like a Viterbi or a Turbo coder, in order to increase the protection.

[0058] At step 205, a coded linear combination CBj is modulated for transmission by the coordinated network nodes N1-N3. In particular, a QPSK modulation is preferably used, due to its high robustness to noise, but also 16-QAM or 64-QAM modulations may be used. At step 206, the modulated linear combination CBj (for simplicity, the same reference notation "CBj" will be used herein after for indicating the linear combination of the blocks Bi before and after modulation) is mapped on a time/frequency resource of the communication network CN which is reserved for transmission of a joint physical broadcasting channel (also referred to as "JPBCH") by all the coordinated network nodes N1-N3. At step 207, the modulated linear combination CBj is preferably transmitted on the joint physical broadcasting channel.

[0059] Steps 205, 206 and 207 of the method of the present invention are preferably repeated in order to perform the transmission, on the joint physical broadcasting channel, of all the K linear combinations CBj with j=1, ..., K. The method of the present invention provides for cyclically repeating the transmission of the K modulated linear combinations CBj by each coordinated network node N1-N3, with a period P of, for example, 10 subframes (i.e. 10 ms in the LTE case) between two consecutive transmissions of the linear combinations CBj. Taking into account that K different CBj linear combinations are generated and then modulated and transmitted, in each time/frequency resource preferably only one CBj of the K combinations is transmitted.

[0060] As mentioned above, in the LTE case, the Physical Broadcast Channel (PBCH) containing the MIB information is transmitted every 10 ms (i.e. every frame) in 6 physical resource blocks (PRBs) at the center of the bandwidth and the information is repeated over four consecutive frames. According to the present invention, each linear combination CBj can be mapped in frequency resources at the center of the transmission bandwidth to facilitate the demodulation of the broadcast channel. Indeed, typically, users do not know the system bandwidth before the detection of the broadcast channel. As far as time periodicity is considered (i.e. the period of transmission of the linear combinations CBj), an high transmission frequency may reduce the acquisition delay of the network information at the user side, as it will be clearer in the following description. Due to the fact that the broadcast network information are compressed (as described with reference to step 201 according to the present invention), a high transmission frequency does not necessarily correspond to a large use of transmission resources and thus to a large overhead as compared to the transmission of the MIB information in current LTE networks.

[0061] In the following description, the transmission of the modulated linear combinations CBj by the coordinated network nodes N1-N3 will be described in more detail according to a first embodiment and to a second embodiment of the present invention.

[0062] As described above, in a LTE communication network, synchronization signals are exploited by the user terminal to acquire the synchronization with the cell and recover the cell identifier, which is not transmitted in the MIB. According to the present invention, at least one synchronization signal is preferably mapped into a number of time/frequency resources of the communication network CN and transmitted within the radio frame by each coordinated network node N1-N3, the synchronization signal allowing to recover the joint cell identifier at the user terminal. The procedure for recovering the joint cell identifier may be, for instance, analogous to the procedure according to which, in the LTE system, the PSS and SSS are used to recover the cell identifier.

[0063] As mentioned above, the joint cell identifier comprises both the group identifier identifying the group of coordinated network nodes N1-N3 and the specific cell identifier identifying the network node inside the group transmitting the signal.

[0064] The method of the present invention further provides for mapping into a number of time/frequency resources of the communication network CN a number of joint reference signals that may be used by the user terminal to decode the joint physical broadcasting channel and recover the joint network information. The joint reference signals are preferably pseudorandom sequences of pilot symbols generated at the coordinated network nodes N1-N3. The joint reference signals are preferably transmitted within the radio frame by all the coordinated network nodes N1-N3.

[0065] Preferably, according to a first embodiment of the present invention, all the coordinated network nodes N1-N3 generate the same joint reference signal(s) on the basis of the group identifier comprised within the joint cell identifier. According to this embodiment of the present invention, the location of the joint reference signal(s) within the time/frequency grid of the communication network CN is recovered at the user terminal by using the joint cell identifier, and in particular the group identifier of the coordinated network nodes N1-N3 comprised in the joint cell identifier.

[0066] The procedure that the user terminal may employ to recover the location of the joint reference signal(s) may be, for instance, analogous to the procedure according to which, in the LTE system, the location of the cell specific reference signals is recovered by using the specific cell identifier. Moreover, the procedure to decode the joint physical broadcasting channel by using the joint reference signal(s) may be analogous to the procedure according to which, in the LTE system, the cell specific reference signals are used to decode the physical broadcasting channel. In particular, by means of the joint cell identifier, the user terminal can determine the position(s) and the specific pseudorandom sequence(s) used for the transmission of the joint reference signal(s). The joint reference signal(s) are then used as phase reference for the coherent detection of the joint physical broadcasting channel.

[0067] According to the first embodiment of the method of the present invention, transmission of the joint physical broadcasting channel is preferably synchronized among the coordinated network nodes N1-N3.

[0068] In particular, all the coordinated network nodes N1-N3 cyclically transmit the same sequence of linear combinations CBj over the joint physical broadcasting channel by using the same time/frequency resources for such transmission (namely, the joint physical broadcasting channel is transmitted by each coordinated network node at the same time and using the same sub-carriers). Moreover, the joint network information are recovered by the user terminal served by one of the coordinated network nodes N1-N3 by using the joint reference signal(s) transmitted by the coordinated network nodes N1-N3. In this case, the same joint reference signals are transmitted by all the coordinated network nodes N1-N3. Preferably the group identifier which is common to all the coordinated network nodes N1-N3 has to be used to generate the sequence of joint reference signals. According to this embodiment, the coordinated network nodes N1-N3 preferably implement a so-called single frequency network (SFN) for the transmission of the joint physical broadcasting channel as shown in Figure 4a.

[0069] Figure 4a schematically illustrates the transmission of the modulated linear combinations CBj by each coordinated network node N1, N2, N3 on a time axis t. As apparent, each coordinated network node N1, N2, N3 transmits the same modulated linear combination CBj at the same time.

[0070] At the user terminal, the joint network information may be recovered by decoding a number of different linear combinations CBj at least equal to the number M of blocks Bi into which the joint network information is segmented at the controller C. If the number of blocks Bi is three, the minimum number of different linear combinations CBj that must be correctly decoded at the user terminal in order to recover the joint network information is three. This condition derives from the fact that the linear combination of the information blocks Bi can be mathematically expressed as a linear system with M equations and M unknowns, as shown by the equation [1]. It then follows that this system can be solved only if there are at least M equations, where each equation corresponds to one linear combination.

[0071] Advantageously, since using a SFN technique means that all the coordinated network nodes transmit the same data over the joint physical broadcasting channel, the transmission coverage for the broadcast network information which is achieved within the communication network according to the present invention is increased with respect to a state-of-the-art communication network (such as a standard LTE communication network) in which each network node transmits a different physical broadcasting channel carrying the respective broadcast network information. Indeed, according to the present invention, the signals transmitted by the coordinated network nodes are the same and they are summed at the receiving user terminal and hence the channel quality improves.

[0072] On the other side, the method according to the present invention allows a network node to broadcast an increased amount of network information (namely, the network information related to all the other nodes of the group of coordinated network nodes) to the user terminal served by the network node without reducing the reception reliability of the network information.

[0073] According to a second embodiment of the present invention, each coordinated network node N1-N3 generates cell specific reference signal(s) on the basis of the specific cell identifier of the network node. Hence, according to this second embodiment, the different reference signals are generated and transmitted by the coordinated network nodes N1-N3. According to this embodiment of the present invention, the location of the reference signal(s) within the time/frequency grid of the communication network CN is recovered at the user terminal by using the joint cell identifier, and in particular the specific cell identifier of the coordinated network nodes N1-N3 comprised in the joint cell identifier.

[0074] The procedure that the user terminal may employ to recover the location of the reference signal(s) may be, for instance, analogous to the procedure according to which, in the LTE system, the location of the cell specific reference signals is recovered by using the specific cell identifier. Again, the procedure to decode the joint physical broadcasting channel by using the cell specific reference signal(s) may be analogous to the procedure according to which, in the LTE system, the cell specific reference signals are used to decode the physical broadcasting channel. In particular, by means of the joint cell identifier, the user terminal can determine the position and the specific pseudorandom sequence used for the transmission of the cell specific reference signal(s). The cell specific reference signal(s) are then used as phase reference for the coherent detection of the joint physical broadcasting channel.

[0075] According to this second embodiment of the method of the present invention, which is schematically illustrated in Figure 4b, at step 207 each coordinated network node N1, N2, N3, in correspondence of a time/frequency resource, preferably transmits a modulated linear combination CBj which is different from the modulated linear combination CBj that is transmitted by another coordinated network node in correspondence of the same time/frequency resource. Hence,. according to this second embodiment, the coordinated network nodes N1-N3 transmit different modulated linear combinations CBj in correspondence of the same time/frequency resource. For instance, as represented in Figure 4b, at time t1, the coordinated network node N1 transmits the modulated linear combination CB1, the coordinated network node N2 transmits the modulated linear combination CB2 while the coordinated network node N3 transmits the modulated linear combination CB8; at time t2, the coordinated network node N1 transmits the modulated linear combination CB4, the coordinated network node N2 transmits the modulated linear combination CB6 while the coordinated network node N3 transmits the modulated linear combination CB7; and so on. In this case, the coordinated network nodes N1-N3 do not need to be synchronized. However, synchronization is preferably implemented also in this case as it facilitates the network nodes coordination.

[0076] Figures 5a and 5b schematically illustrates another example of transmission of the joint network information by the coordinated network nodes N1-N3. According to this example, the joint network information is segmented into three blocks (M=3) and linearly coded in five different linear combinations CBj where j=1, ..., 5. In Figures 5a and 5b, the transmission with SFN technique (first embodiment, Figure 5a) is compared to the transmission without SFN technique (second embodiment, Figure 5b). In Figures 5a and 5b, the repetition period P is also indicated, which represents the time period between two consecutive transmissions of the linear combinations CBj at a coordinated network node N1-N3. For decoding the joint network information, at a coordinated network node N1-N3, at least three linearly independent linear combinations CBj have to be correctly received. According to the embodiment illustrated in Figure 5a, the coverage area is higher than according to the embodiment illustrated in Figure 5b because the SFN technique is exploited. However, the minimum decoding time of the joint network information is equal to three times the repetition period P. Conversely, according to the embodiment illustrated in Figure 5b, the minimum decoding time of the joint network information is equal to one repetition period P. The solution illustrated in Figure 5b can be easily obtained by time shifting the transmission of a same linear combination CBj among the different coordinated network nodes N1-N3.

[0077] Advantageously, according to this second embodiment, the method of the present invention allows reducing the decoding latency. Indeed, since the coordinated network nodes, at a same time, transmit different linear combinations of the blocks into which the joint network information is segmented, the joint network information can be recovered at the user terminal by decoding the different linear combinations received from different coordinated network nodes at the same time. As represented in Figure 4b, at time t1, for instance, the linear combinations CB1, CB2 and CB8 are simultaneously transmitted by the coordinated network nodes N1, N2, N3 respectively. In Figure 5b, the linear combinations CB1, CB2 and CB3 are simultaneously transmitted by the coordinated network nodes N1, N2, N3, respectively, at a first time, then the linear combinations CB2, CB3 and CB4 are simultaneously transmitted, and so on. The user terminal receiving these linear combinations and decoding them may advantageously recover the joint network information faster than according to the first embodiment of Figures 4a and 5a. Indeed, according to the embodiment of Figures 4a and 5a, each coordinated network node transmits different linear combinations in consecutive time intervals and hence a user terminal may recover the joint network information only after reception of at least three different linear combinations from a network node. However, as explained above, the method as schematically represented in Figures 4a and 5a provides a better channel quality than the method of Figures 4b and 5b, as the signals from the coordinated network nodes are all equal and they are actually summed at the user terminal.


Claims

1. A method for transmitting broadcast network information in a mobile wireless communication network (CN) comprising a plurality of network nodes (N1-N5), said method comprising:

a) providing a compression of broadcast network information related to a group of coordinated network nodes (N1-N3) of said plurality of network nodes (N1-N5);

b) coding said compressed broadcast network information by segmenting said compressed broadcast network information into a number of blocks and linearly combining said blocks into a plurality of linear combinations of blocks; and

c) transmitting said linear combinations of blocks by said group of coordinated network nodes (N1-N3).


 
2. The method according to claim 1, wherein the method further comprises associating said group of coordinated network nodes (N1-N3) with a group identifier and each coordinated network node (N1-N3) with a joint cell identifier comprising said group identifier and a specific cell identifier.
 
3. The method according to claim 1 or 2, wherein said providing a compression of broadcast network information comprises eliminating redundancies in the broadcast network information of said group of coordinated network nodes (N1-N3).
 
4. The method according to claim 3, wherein said providing a compression of broadcast network information comprises implementing a lossless compression algorithm.
 
5. The method according to any of the preceding claims, wherein it further comprises, after said coding, applying an inner channel coder selected between a Viterbi coder and a Turbo coder.
 
6. The method according to any of the preceding claims, wherein it further comprises modulating for transmission said linear combinations, wherein modulating comprises applying a QPSK modulation.
 
7. The method according to any of claims 2 to 6, wherein it further comprises transmitting, by each coordinated network node (N1-N3), at least one synchronization signal allowing to recover, at a user terminal, the respective joint cell identifier.
 
8. The method according to any of the preceding claims, wherein said transmitting said linear combinations of blocks comprises cyclically transmitting a same sequence of said linear combinations by each coordinated network node (N1-N3) in a synchronized manner over a joint physical broadcasting channel.
 
9. The method according to claim 8, wherein it further comprises generating, at the coordinated network nodes (N1-N3), on the basis of said group identifier, one or more joint reference signals, said joint reference signals being the same for all the coordinated network nodes (N1-N3), and wherein the method further comprises using, at said user terminal, said joint cell identifier to recover said joint reference signals and decode said joint physical broadcasting channel.
 
10. The method according to any of claims 1 to 7, wherein said transmitting said linear combinations of blocks comprises cyclically transmitting a different sequence of said linear combinations by each coordinated network node (N1-N3) over a joint physical broadcasting channel.
 
11. The method according to claim 10, wherein it further comprises generating, at each coordinated network nodes (N1-N3), on the basis of said specific cell identifier, one or more reference signals, said reference signals being different among the coordinated network nodes (N1-N3), and wherein the method further comprises using, at said user terminal, said joint cell identifier to recover said joint reference signals and decode said joint physical broadcasting channel.
 
12. A controller (C) for a mobile wireless communication network (CN) comprising a plurality of network nodes (N1-N5), said controller (C) being configured to:

- provide a compression of broadcast network information related to a group of coordinated network nodes (N1-N3) of said plurality of network nodes (N1-N5); and

- code said compressed broadcast network information by segmenting said compressed broadcast network information into a number of blocks and linearly combining said blocks into a plurality of linear combinations of blocks.


 
13. A mobile wireless communication network (CN) comprising a plurality of network nodes (N1-N5) and a controller (C), said controller (C) being configured to:

- provide a compression of broadcast network information related to a group of coordinated network nodes (N1-N3) of said plurality of network nodes (N1-N5);

- code said compressed broadcast network information by segmenting said compressed broadcast network information into a number of blocks and linearly combining said blocks into a plurality of linear combinations of blocks;

and said group of coordinated network nodes (N1-N3) being configured to transmit said linear combinations of blocks.
 
14. The mobile wireless communication network (CN) according to claim 13, wherein said coordinated network nodes (N1-N3) implement a single frequency network, SFN.
 
15. The mobile wireless communication network (CN) according to claim 14, wherein said communication network (CN) is a long term evolution, LTE, communication network.
 


Ansprüche

1. Verfahren zum Übertragen von Rundsendungsnetzwerksinformationen in einem drahtlosen Mobilkommunikationsnetzwerk (Communication Network, CN), umfassend eine Mehrzahl von Netzwercknoten (N1 bis N5), wobei das Verfahren umfasst:

a) Bereitstellen einer Komprimierung von Rundsendungsnetzwerksinformationen, die sich auf eine Gruppe koordinierter Netzwerkknoten (N1 bis N3) der Mehrzahl von Netzwerkknoten beziehen (N1 bis N5);

b) Codieren der komprimierten Rundsendungsnetzwerksinformationen durch Segmentieren der komprimierten Rundsendungsnetzwerksinformationen in eine Anzahl an Blöcke, und lineares Kombinieren der Blöcke in eine Mehrzahl von linearen Kombinationen von Blöcken; und

c) Übertragen der linearen Kombinationen von Blöcken durch die Gruppe koordinierter Netzwerkknoten (N1 bis N3).


 
2. Verfahren nach Anspruch 1, wobei das Verfahren ferner das Assoziieren der Gruppe koordinierter Netzwerkknoten (N1 bis N3) mit einer Gruppenidentifizierung und jedes koordinierten Netzwerkknotens (N1 bis N3) mit einer gemeinsamen Zellenidentifizierung umfasst, umfassend die Gruppenidentifizierung und eine spezifische Zellenidentifizierung.
 
3. Verfahren nach Anspruch 1 oder 2, wobei das Bereitstellen einer Komprimierung von Rundsendungsnetzwerksinformationen das Eliminieren von Redundanzen in den Rundsendungsnetzwerksinformationen der Gruppe koordinierter Netzwerkknoten (N1 bis N3) umfasst.
 
4. Verfahren nach Anspruch 3, wobei das Bereitstellen einer Komprimierung von Rundsendungsnetzwerksinformationen das Implementieren eines verlustfreien Komprimierungsalgorithmus umfasst.
 
5. Verfahren nach einem der vorhergehenden Ansprüche, wobei es ferner nach dem Codieren das Anwenden eines Codierers eines Innenkanals umfasst, der unter einem Viterbi-Codierer und einem Turbo-Codierer ausgewählt wird.
 
6. Verfahren nach einem der vorhergehenden Ansprüche, wobei es ferner das Modulieren zur Übertragung der linearen Kombinationen umfasst, wobei das Modulieren das Anwenden einer QPSK-Modulation umfasst.
 
7. Verfahren nach einem der Ansprüche 2 bis 6, wobei es ferner das Übertragen durch jeden koordinierten Netzwerkknoten (N1 bis N3) mindestens eines Synchronisationssignals umfasst, das an einem Benutzerendgerät ermöglicht, die jeweilige gemeinsame Zellenidentifizierung wiederzugewinnen.
 
8. Verfahren nach einem der vorhergehenden Ansprüche, wobei das Übertragen der linearen Kombinationen von Blöcken das zyklische Übertragen derselben Sequenz der linearen Kombinationen durch jeden koordinierten Netzwerkknoten (N1 bis N3) auf eine synchronisierte Art und Weise über einen gemeinsamen physikalischen Rundsendungskanal umfasst.
 
9. Verfahren nach Anspruch 8, wobei es ferner das Erzeugen an den koordinierten Netzwerkknoten (N1 bis N3) auf der Grundlage der Gruppenidentifizierung eines oder mehrerer gemeinsamer Referenzsignale umfasst, wobei die gemeinsamen Referenzsignale dieselben für alle der koordinierten Netzwercknoten (N1 bis N3) sind, und wobei das Verfahren ferner das Verwenden an dem Benutzerendgerät der gemeinsamen Zellenidentifizierung umfasst, um die gemeinsamen Referenzsignale wiederzugewinnen und den gemeinsamen physikalischen Rundsendungskanal zu decodieren.
 
10. Verfahren nach einem der Ansprüche 1 bis 7, wobei das Übertragen der linearen Kombinationen von Blöcken das zyklische Übertragen einer unterschiedlichen Sequenz der linearen Kombinationen durch jeden koordinierten Netzwerkknoten (N1 bis N3) über einen gemeinsamen physikalischen Rundsendungskanal umfasst.
 
11. Verfahren nach Anspruch 10, wobei es ferner das Erzeugen an jedem koordinierten Netzwerkknoten (N1 bis N3) auf der Grundlage der spezifischen Zellenidentifizierung eines oder mehrerer Referenzsignale umfasst, wobei die Referenzsignale unter den koordinierten Netzwerkknoten (N1 bis N3) unterschiedlich sind, und wobei das Verfahren ferner das Verwenden an dem Benutzerendgerät der gemeinsamen Zellenidentifizierung umfasst, um die gemeinsamen Referenzsignale wiederzugewinnen und den gemeinsamen physikalischen Rundsendungskanal zu decodieren.
 
12. Steuergerät (Controller, C) für ein drahtloses Mobilkommunikationsnetzwerk (CN), umfassend eine Mehrzahl von Netzwercknoten (N1 bis N5), wobei das Steuergerät (C) dazu ausgestaltet ist:

- eine Komprimierung von Rundsendungsnetzwerksinformationen bereitzustellen, die sich auf eine Gruppe koordinierter Netzwerkknoten (N1 bis N3) der Mehrzahl von Netzwerkknoten beziehen (N1 bis N5); und

- die komprimierten Rundsendungsnetzwerksinformationen durch Segmentieren der komprimierten Rundsendungsnetzwerksinformationen in eine Anzahl an Blöcke zu codieren und diese Blöcke in eine Mehrzahl von linearen Kombinationen von Blöcken linear zu kombinieren.


 
13. Drahtloses Mobilkommunikationsnetzwerk (CN), umfassend eine Mehrzahl von Netzwerkknoten (N1 bis N5), und ein Steuergerät (C), wobei das Steuergerät (C) dazu ausgestaltet ist:

- eine Komprimierung von Rundsendungsnetzwerksinformationen bereitzustellen, die sich auf eine Gruppe koordinierter Netzwerkknoten (N1 bis N3) der Mehrzahl von Netzwerkknoten (N1 bis N5) beziehen;

- die komprimierten Rundsendungsnetzwerksinformationen durch Segmentieren der komprimierten Rundsendungsnetzwerksinformationen in eine Anzahl an Blöcke zu codieren und diese Blöcke in eine Mehrzahl von linearen Kombinationen von Blöcken linear zu kombinieren;
und wobei diese Gruppe koordinierter Netzwerkknoten (N1 bis N3) dazu ausgestaltet ist, die linearen Kombinationen von Blöcken zu übertragen.


 
14. Drahtloses Mobilkommunikationsnetzwerk (CN) nach Anspruch 13, wobei die koordinierten Netzwerkknoten (N1 bis N3) ein einzelnes Frequenznetzwerk, (Single Frequence Network) SFN, implementieren.
 
15. Drahtloses Mobilkommunikationsnetzwerk (CN) nach Anspruch 14, wobei es sich bei dem Kommunikationsnetzwerk (CN) um ein Langzeitentwicklungs- (Long Term Evolution) LTE, Kommunikationsnetzwerk handelt.
 


Revendications

1. Procédé de transmission d'informations de réseau de radiodiffusion dans un réseau de communication sans fil mobile (CN) comprenant une pluralité de noeuds de réseau (N1-N5), ledit procédé comprenant les étapes ci-dessous consistant à :

a) fournir une compression d'informations de réseau de radiodiffusion connexes à un groupe de noeuds de réseau coordonnés (N1-N3) de ladite pluralité de noeuds de réseau (N1-N5) ;

b) coder lesdites informations de réseau de radiodiffusion compressées en segmentant lesdites informations de réseau de radiodiffusion compressées en un nombre de blocs et en combinant linéairement lesdits blocs en une pluralité de combinaisons linéaires de blocs ; et

c) transmettre lesdites combinaisons linéaires de blocs par le biais dudit groupe de noeuds de réseau coordonnés (N1-N3).


 
2. Procédé selon la revendication 1, dans lequel le procédé comprend en outre l'étape consistant à associer ledit groupe de noeuds de réseau coordonnés (N1-N3) à un identificateur de groupe et chaque noeud de réseau coordonné (N1-N3) à un identificateur de cellule conjoint comprenant ledit identificateur de groupe et un identificateur de cellule spécifique.
 
3. Procédé selon la revendication 1 ou 2, dans lequel ladite étape de fourniture d'une compression d'informations de réseau de radiodiffusion comprend l'étape consistant à éliminer des redondances dans les informations de réseau de radiodiffusion dudit groupe de noeuds de réseau coordonnés (N1-N3).
 
4. Procédé selon la revendication 3, dans lequel ladite étape de fourniture d'une compression d'informations de réseau de radiodiffusion comprend l'étape consistant à mettre en oeuvre un algorithme de compression sans perte.
 
5. Procédé selon l'une quelconque des revendications précédentes, dans lequel le procédé comprend en outre, après ledit codage, l'étape consistant à appliquer un codeur de canal interne sélectionné parmi un codeur de Viterbi et un turbo-codeur.
 
6. Procédé selon l'une quelconque des revendications précédentes, dans lequel le procédé comprend en outre l'étape consistant à moduler, à des fins de transmission, lesdites combinaisons linéaires, dans lequel l'étape de modulation comprend l'étape consistant à appliquer une modulation QPSK.
 
7. Procédé selon l'une quelconque des revendications 2 à 6, dans lequel le procédé comprend en outre l'étape consistant à transmettre, par le biais de chaque noeud de réseau coordonné (N1-N3), au moins un signal de synchronisation permettant de récupérer, au niveau d'un terminal utilisateur, l'identificateur de cellule conjoint respectif.
 
8. Procédé selon l'une quelconque des revendications précédentes, dans lequel ladite étape de transmission desdites combinaisons linéaires de blocs consiste à transmettre de manière cyclique une même séquence desdites combinaisons linéaires, par le biais de chaque noeud de réseau coordonné (N1-N3), d'une manière synchronisée, sur un canal de radiodiffusion physique conjoint.
 
9. Procédé selon la revendication 8, dans lequel le procédé comprend en outre l'étape consistant à générer, au niveau des noeuds de réseau coordonnés (N1-N3), sur la base dudit identificateur de groupe, un ou plusieurs signaux de référence conjoints, lesdits signaux de référence conjoints étant identiques pour tous les noeuds de réseau coordonnés (N1-N3), et dans lequel le procédé comprend en outre l'étape consistant à utiliser, au niveau dudit terminal utilisateur, ledit identificateur de cellule conjoint, en vue de récupérer lesdits signaux de référence conjoints et de décoder ledit canal de radiodiffusion physique conjoint.
 
10. Procédé selon l'une quelconque des revendications 1 à 7, dans lequel ladite étape de transmission desdites combinaisons linéaires de blocs consiste à transmettre, de manière cyclique, une séquence différente desdites combinaisons linéaires, par le biais de chaque noeud de réseau coordonné (N1-N3), sur un canal de radiodiffusion physique conjoint.
 
11. Procédé selon la revendication 10, dans lequel le procédé comprend en outre l'étape consistant à générer, au niveau de chaque noeud de réseau coordonné (N1-N3), sur la base dudit identificateur de cellule spécifique, un ou plusieurs signaux de référence, lesdits signaux de référence étant différents parmi les noeuds de réseau coordonnés (N1-N3), et dans lequel le procédé comprend en outre l'étape consistant à utiliser, au niveau dudit terminal utilisateur, ledit identificateur de cellule conjoint, en vue de récupérer lesdits signaux de référence conjoints et de décoder ledit canal de radiodiffusion physique conjoint.
 
12. Contrôleur (C) pour un réseau de communication sans fil mobile (CN) comprenant une pluralité de noeuds de réseau (N1-N5), ledit contrôleur (C) étant configuré de manière à

- fournir une compression d'informations de réseau de radiodiffusion connexes à un groupe de noeuds de réseau coordonnés (N1-N3) de ladite pluralité de noeuds de réseau (N1-N5) ; et

- coder lesdites informations de réseau de radiodiffusion compressées en segmentant lesdites informations de réseau de radiodiffusion compressées en un nombre de blocs et en combinant linéairement lesdits blocs en une pluralité de combinaisons linéaires de blocs.


 
13. Réseau de communication sans fil mobile (CN) comprenant une pluralité de noeuds de réseau (N1-N5) et un contrôleur (C), ledit contrôleur (C) étant configuré de manière à :

- fournir une compression d'informations de réseau de radiodiffusion connexes à un groupe de noeuds de réseau coordonnés (N1-N3) de ladite pluralité de noeuds de réseau (N1-N5) ; et

- coder lesdites informations de réseau de radiodiffusion compressées en segmentant lesdites informations de réseau de radiodiffusion compressées en un nombre de blocs et en combinant linéairement lesdits blocs en une pluralité de combinaisons linéaires de blocs ; et

dans lequel ledit groupe de noeuds de réseau coordonnés (N1-N3) est configuré de manière à transmettre lesdites combinaisons linéaires de blocs.
 
14. Réseau de communication mobile sans fil (CN) selon la revendication 13, dans lequel lesdits noeuds de réseau coordonnés (N1-N3) mettent en oeuvre un réseau monofréquence, SFN.
 
15. Réseau de communication mobile sans fil (CN) selon la revendication 14, dans lequel ledit réseau de communication (CN) est un réseau de communication de technologie d'évolution à long terme, LTE.
 




Drawing




















Cited references

REFERENCES CITED IN THE DESCRIPTION



This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.

Patent documents cited in the description




Non-patent literature cited in the description