KR20140058372A - Apparatus and method for paging in communication systems with large number of antennas - Google Patents

Abstract

The present invention relates to a method for paging configuration performed by a mobile station in a wireless network. The method according to the present invention includes the steps of: transmitting, to a base station, a parameter M representing the number of receiving (RX) beam instances at the mobile station in an idle mode for the mobile station to finish one round of beam steering; determining a timing for receiving a paging message from the base station; and receiving a paging message from the base station based on the determined timing, wherein the timing is a function of the parameter M, and the paging message comprises a mobile station identifier.

Description

Field of the Invention [0001] The present invention relates to a paging apparatus and method in a communication system having a plurality of antennas,

The present invention relates to an apparatus and method for paging in a wireless communication, in particular, in a communication system having multiple antennas.

As we enter the modern era, wireless communications have evolved significantly. In recent years, the number of subscribers to wireless communication services has surpassed 5 million and continues to increase rapidly. The rapid increase in consumers and operators of other mobile data devices such as smartphones and tablets, "notepad" computers, netbooks, and e-book users is rapidly increasing demand for wireless data traffic. In order to meet the rapid growth in mobile data traffic, improvements in air interface efficiency and allocation to the new spectrum are becoming very important.

In the following description, (i) F. Khan and Z. Pi, "MmWave Mobile Broadband (MMB): Unleashing The 3-300 GHz Spectrum ", in Proc. Z. Pi and F. Khan, "An Introduction to Millimeter-Wave Mobile Broadband Systems ", IEEE Communication Magazine, June 2011 (hereinafter referred to as " REF2"), and Sarnoff Symposium, 2011 (hereinafter "REF1" See, for example, Khan, "System Design And Network Architecture For A Millimeter-Wave Mobile Broadband (MMB) System", in Proc. Sarnoff Symposium, 2011 ("REF3").

In order to meet the rapid growth of wireless data traffic, improvement in air interface efficiency is important. One approach to this is to use multiple antennas. In many cellular systems, the receiver is omnidirectional. When the receiving device returns from a discontinuous receive (DRX) mode (e.g., wakes up in idle mode and monitors the paging message), the receiving device may receive from the node (e.g., the base station) being transmitted using its omni-directional receiver Lt; / RTI > However, in some systems with multiple antennas, a directional beam may be used for communication. In a system using a directional beam, if a previously used receive direction is used to receive a signal from a base station, the receiver will not receive the signal. For example, the receive (RX) pattern used in the immediately previous idle mode is no longer available. Therefore, in a device using multiple RX beams, it is necessary to determine what RX beam pattern to use when returning from the idle mode. Accordingly, there is a problem in how to support paging in a communication system having a plurality of antennas.

The present invention aims at determining an RX beam pattern to be used when an apparatus using multiple RX beams in a wireless communication system returns from the idle mode, and to be able to support paging.

Further, the present invention reduces the overhead for the paging signal by allowing the terminal to receive the paging message at the paging message timing based on the parameter representing the receive beam instance for one-time beam steering in idle mode in a system with multiple antennas The purpose is to show.

According to a first aspect of the present invention there is provided a method of configuring paging by a mobile station in a wireless network, the method comprising the steps of: determining, by the mobile station, the number of receive (RX) beam instances of the mobile station for ending a one- Transmitting a parameter M to a base station; Determining a timing for receiving a paging message from the base station; And receiving the paging message from the base station based on the determined timing, wherein the timing is a function of the parameter M and the paging message comprises a mobile station identifier.

According to a second aspect of the present invention, a mobile station apparatus for receiving a paging message in a wireless network includes at least one antenna; And a processor coupled to the at least one antenna, wherein the processor: transmits to the base station a parameter M indicative of the number of receive (RX) beam instances of the mobile station for terminating the beam adjustment once in the idle mode ; Determining a timing for receiving a paging message from the base station and receiving the paging message from the base station based on the determined timing, wherein the timing is a function of the parameter M and the paging message comprises a mobile station identifier .

According to a third aspect of the present invention, there is provided a method for configuring paging by a base station in a wireless network, the method comprising the steps of: determining a parameter representing a number of RX beam instances of the mobile station for ending one- M from the mobile station; Determining a timing for transmitting a paging message to the mobile station; And transmitting the paging message to the mobile station based on the determined timing, wherein the timing is a function of the parameter M and the paging message comprises a mobile station identifier.

According to a fourth aspect of the present invention, a base station apparatus for receiving a paging message in a wireless network includes at least one antenna; And a processor coupled to the at least one antenna, wherein the processor: receives from the mobile station a parameter M indicative of the number of receive (RX) beam instances of the mobile station for terminating the beam adjustment once in the idle mode Determines a timing for transmitting a paging message to the mobile station, and transmits the paging message to the mobile station based on the determined timing, wherein the timing is a function of the parameter M, and the paging message includes a mobile station identifier.

According to the present invention, by knowing the RX beam pattern to be used when a device using multiple RX beams in a wireless communication system is returned from the idle mode, it is possible to reduce the overhead for the paging signal or reduce the length of the paging message .

1 illustrates a wireless communication network in accordance with an embodiment of the present invention.
2A is a high-level diagram of an orthogonal frequency division multiple access (OFDMA) or millimeter wave transmission path according to an embodiment of the present invention.
2B is a high-level diagram of an OFDMA or millimeter wave receive path according to an embodiment of the present invention.
3A shows a transmit path for analog beamforming and multiple input multiple output (MIMO) baseband processing with multiple antennas in accordance with an embodiment of the present invention.
Figure 3B illustrates another transmit path for analog beamforming and MIMO baseband processing with multiple antennas in accordance with an embodiment of the present invention.
3C illustrates a receive path for analog beamforming and MIMO baseband processing with multiple antennas in accordance with an embodiment of the present invention.
FIG. 3D illustrates another receive path for analog beamforming and MIMO baseband processing with multiple antennas in accordance with an embodiment of the present invention.
4 illustrates a wireless communication system in which the present invention uses an antenna array different from the embodiments.
Figure 5 illustrates several beams having different shapes for different purposes within a sector or cell according to an embodiment of the invention.
6A and 6B illustrate the use of a beam to convey the same or different information to a mobile station or base station in a cell according to an embodiment of the present invention.
7 illustrates signal processing in a transmitter and a receiver in a millimeter wave system according to an embodiment of the present invention.
8A shows a process for paging a mobile station in an idle mode in another wireless communication system according to an embodiment of the present invention.
8B to 8C illustrate processing for paging a mobile station in an idle mode including a paging interval in a base station and a paging listening interval in a mobile station according to an embodiment of the present invention.
Figures 9A and 9B show examples of numbers M according to embodiments of the present invention.
FIG. 10 shows an example of a process for determining timing for a paging message according to an embodiment of the present invention.
11 shows another example of a process for determining timing for a paging message according to an embodiment of the present invention.
12A and 12B show examples of the number N according to an embodiment of the present invention.
13 illustrates an exemplary process for conveying timing configuration information in accordance with an embodiment of the present invention.
Figure 14 shows beam related definitions and terms used in accordance with an embodiment of the present invention.
Figures 15-18 illustrate paging messages and timing decisions using a mapping function according to an embodiment of the present invention.
19A-19H illustrate examples of using beams transmitted in a previous step to adjust a user equipment (UE) receive beam in accordance with an embodiment of the present invention.

Figures 1 to 19h are provided by way of illustration to illustrate the principles of the invention and are not intended to limit the scope of the invention. Those skilled in the art will appreciate that the principles of the present invention may be implemented in a wireless communication system that is arbitrarily designed and modified.

The present invention relates to a paging method and apparatus in a communication system having multiple antennas. Although the embodiments according to the present invention are described in terms of millimeter wave communication, it is also applicable to other communication media with radio waves having a frequency of 3 GHz-30 GHz, which exhibits characteristics similar to millimeter waves, for example. In some cases, embodiments of the present invention can be applied to electromagnetic waves having terahertz frequencies, infrared rays, visible light, and other optical media. For purposes of illustration, the terms "cellular band" and "millimeter wave band" are used herein, wherein "cellular band" refers to frequencies of approximately several megahertz to several gigahertz, and "millimeter wave band" Quot; refers to a frequency in the range of from 1 Hz to several hundred gigahertz. The difference between the two is that the cellular band requires multiple antennas, although radio waves have less propagation loss and better coverage. On the other hand, millimeter-wave radio waves typically exhibit high propagation loss, but a high gain antenna or antenna array design is possible with a small form factor.

The embodiments described herein are primarily described for communication between a base station and a mobile station (e.g., mobile station transmission from a base station). It will be appreciated by those skilled in the art that the embodiments described herein are also applicable to communication between base stations (transmission from a base station to a base station) and communication between mobile stations (e.g., from a mobile station to a mobile station). The embodiments described herein are applicable to communication systems having multiple antennas such as MMB, RF band, and the like.

1 illustrates a wireless communication network in accordance with an embodiment of the present invention. The wireless communication network 100 of the embodiment shown in FIG. 1 is for illustrative purposes only. Other embodiments of the wireless communication network 100 may be used without departing from the scope of the present invention.

In the illustrated embodiment, the wireless communication network 100 includes a base station (BS) 101, a base station 102, a base station 103, and other similar base stations (not shown). The base station 101 communicates with the base station 102 and the base station 103. The base station 101 also communicates with the Internet 130 or a similar IP-based system (not shown).

Base station 102 provides broadband wireless access to the Internet 130 (via base station 101) to a first plurality of subscriber stations (also referred to herein as mobile stations) within its coverage area 120. Throughout this specification, the term mobile station (MS) is used the same as the term subscriber station. The subscriber station of the first plurality is a subscriber station 111 located in a small business SB, a subscriber station 112 located in a business entity E, a subscriber station 113 located in a WiFi hot spot HS, A subscriber station 114 located at a residence R, a subscriber station 115 located at a second residence R and a subscriber station 115 which may be a mobile device M such as a cell phone, wireless laptop, wireless PDA, 116).

Base station 103 provides a broadband wireless connection to the Internet 130 (via base station 101) to a second plurality of subscriber stations within its coverage area 125. The second plurality of subscriber stations includes a subscriber station 115 and a subscriber station 116. In an exemplary embodiment, base stations 101-103 communicate with each other using subscriber stations 111-116 using OFDM or OFDMA techniques.

Each base station 101-103 has a globally unique base station identifier (BSID). BSID is often a media access control (MAC) ID. Each base station 101-103 has a plurality of cells (e.g., one sector may be one cell), each having a physical layer cell identifier or a preamble sequence that is often transmitted on a synchronization channel.

Although only six subscriber stations are shown in FIG. 1, the wireless communication network 100 may provide broadband wireless access to additional subscriber stations. The subscriber station 115 and the subscriber station 116 are located at the edges of both the coverage area 120 and the coverage area 125. Each of subscriber station 115 and subscriber station 116 may communicate with both base station 102 and base station 103 and operate in a handoff mode as is well known to those skilled in the art.

Subscriber stations 111-116 may access voice, data, video, video conferencing, and / or other broadband services over the Internet 130. For example, subscriber station 116 may be a number of mobile devices, including a plurality of wireless-enabled laptop computers, personal data devices, notebooks, portable devices, or other wireless-enabled devices. The subscriber stations 114 and 115 may be, for example, a wireless-enabled personal computer (PC), a laptop computer, a gateway, or other device.

2A is a high-level diagram of an orthogonal frequency division multiple access (OFDMA) or millimeter wave transmission path according to an embodiment of the present invention. 2B is a high-level diagram of an OFDMA or millimeter wave receive path according to an embodiment of the present invention. 2A and 2B, a transmit path 200 is implemented in a base station (BS) 102 and a receive path 250 is implemented in a subscriber station 116, such as, for example, . However, receive path 250 may be implemented in a base station (e.g., base station 102 in FIG. 1), and transmit path 200 may be implemented in a subscriber station. All or some of the transmit path 200 and the receive path 250 include one or more processors.

The transmission path 200 includes a channel coding and modulation unit 205, a S-to-P conversion unit 210, a size N IFFT 215, a P-to- Converter 220, a cyclic prefix adder 225, and an up-converter UC 230. The receive path 250 includes a down-converter (DC) 255, a cyclic prefix removal unit 260, a S-to-P conversion unit 265, a size N FFT 270, (P-to-S) conversion unit 275, and a channel decoding and demodulation unit 280. [

At least some of the components of FIGS. 2A and 2B may be implemented in software, but other components may be implemented in hardware or a mixture of software and configurable hardware. In particular, the FFT block and the IFFT block may be implemented with configurable software algorithms, where the value of the size N may vary depending on the implementation.

Moreover, although the present specification is described as implementing FFT and IFFT, it is for the purpose of illustration only and is not intended to limit the scope of the invention. In another embodiment of the present invention, the FFT and IFFT may be replaced by a DFT function and an IDFT function, respectively. The value of the size N variable in the FFT and IFFT functions is an arbitrary integer that is a power of 2, although the value of the size N variable for the DFT and IDFT functions is an arbitrary integer (for example, 1, 2, 3, 4, (E.g., 1, 2, 4, 8, 16, ...).

In transmission path 200, channel coding and modulation section 205 receives a set of information bits and applies modulation (e.g., QPSK or QAM) to the input bits by applying coding (e.g., LDPC coding) Create a sequence. The parallel-to-serial converter 210 converts the serial modulation symbols into parallel data (e.g., demultiplexes) to generate N parallel symbol streams, where N is the number of IFFT / FFT size. Next, a size N IFFT 215 performs an IFFT operation on the N parallel symbol streams to generate a time-domain output signal. The parallel-to-serial converter 220 converts (e. G., Multiplexes) the parallel time-domain output symbols from the size N IFFT 215 to generate a serial time-domain signal. The periodic prefix adder 225 inserts a periodic prefix into the time-domain signal. Finally, the up-converter 230 modulates (e.g., upconverts) the output of the periodic prefix adder 225 and converts it to an RF frequency for transmission over a radio channel. In addition, these signals are filtered at the baseband prior to conversion to RF frequency.

The transmitted RF signal arrives at the SS 116 via the wireless channel and undergoes an arithmetic operation contrary to the operation performed at the BS 102. The down-converter 255 downconverts the received signal to a baseband frequency and removes the periodic prefix signal from the periodic prefix canceling unit 260 to generate a serial time-domain baseband signal. The serial-to-parallel converter 265 converts the time-domain baseband signal into a parallel time-domain signal. Size N FFT 270 performs an FFT algorithm to generate N parallel frequency-domain signals. The parallel-to-serial converter 275 converts the parallel frequency-domain signal into a modulated data symbol sequence. The channel decoding and demodulation unit 280 demodulates and decodes the modulation symbols to recover the original input data stream.

Each base station 101-103 implements a transmission path similar to that transmitted on the downlink to the subscriber stations 111-116 and a receive path similar to that received on the uplink from the subscriber stations 111-116 . Similarly, each subscriber station 111-116 implements a transmission path corresponding to the architecture for transmitting on the uplink to the base stations 101-103, and receives the downlink from the base stations 101-103 To implement a receive path corresponding to the architecture for < RTI ID = 0.0 >

In an embodiment of the present invention, a base station (BS) includes one or more cells, each cell comprising one or more antenna arrays, each array having a different frame structure in a cell, e.g., a Time Division Duplex (TDD) And other uplink and downlink ratios. Multiple TX / RX (transmit / receive) chains may be applied to one array or one cell. One or more antenna arrays may have the same downlink control channel (e.g., synchronization channel, physical broadcast channel, etc.) transmission in a cell, while other channels (e.g., data channels) may have a frame structure unique to each antenna array Lt; / RTI >

The base station uses one or more antennas or antenna arrays to perform beamforming. The antenna array forms a beam having multiple widths (e.g., wide beam, narrow beam, etc.). The DL control channel information, the broadcast signal and the message, and the broadcast data channel and the control channel are transmitted in a wide beam. The wide beam includes a single wide beam transmitted once or a series of narrow beams transmitted over a continuous time. Multicast and unicast data and control channel signals and messages are transmitted in a narrow beam.

The cell identifier is transmitted on the synchronization channel. An identifier, such as an array, beam, etc., is implicitly or explicitly transmitted to a downlink control channel (e.g., a synchronization channel, a physical broadcast channel, etc.). These channels are transmitted in a wide beam. By acquiring these channels, the mobile station (MS) detects the identifier.

The mobile station MS performs beamforming using one or more antennas or antenna arrays. As in the BS antenna array, the antenna array at the MS forms beams of various widths (e.g., wide beam, narrow beam, etc.). The broadcast signal and the message and broadcast data channels and the control channel are transmitted in a wide beam. Multicast and unicast data and control signals and messages are transmitted in a narrow beam.

FIG. 3A illustrates a transmit path for multiple-input multiple-output (MIMO) baseband processing and analog beamforming with multiple antennas in accordance with an embodiment of the present invention. The transmit path 300 includes a beamforming architecture in which all signal outputs that have undergone baseband processing are coupled to a phase shifter and a power amplifier (PA) of the antenna array.

As shown in FIG. 3A, the Ns information stream is processed by a baseband processor (not shown) and input to a baseband TX MIMO processing unit 310. After the baseband TX MIMO processing, the information stream is converted at a digital to analog converter (DAC) 312 and transmitted to an intermediate frequency (IF) and radio frequency (RF) up-converter 314 that converts the baseband signal to the RF carrier band. Lt; / RTI > In some embodiments, one information stream may be divided into I (in-phase) and Q (quadrature) for modulation. After the IF and RF up-converter 314, the signal is input to the TX beamforming module 316.

FIG. 3A illustrates one possible architecture for the beamforming module 316, wherein the signal is coupled to all of the phase shifters of the transmit antenna and to the power amplifier (PA). Each of the signals from the IF and RF up-converter 314 passes through one phase shift 318 and one PA 320 and all of the signals are passed through the combiner 322 to the TX antenna array 324's antenna Lt; / RTI > In Fig. 3A, TX array 324 has Nt transmit antennas. Each antenna transmits a signal wirelessly. The controller 330 communicates with a transmitter including a baseband processor, an IF and RF up-converter 314, a TX beamforming module 316, and a TX antenna array module 324. The receiving unit 332 receives the feedback signal, and the feedback signal is input to the control unit 330. The control unit 330 processes the feedback signal and adjusts the transmission unit.

3B illustrates another transmission path for MIMO baseband processing and analog beamforming with multiple antennas according to an embodiment of the present invention. The transmit path 301 has a beamforming architecture coupled to the phase shifter and power amplifier (PA) of the sub-array of antenna arrays, which is the baseband processed signal output. The transmit path 301 is similar to the transmit path 300 shown in FIG. 3A except for the differences in the beamforming portion 316. FIG.

3B, the signal from the baseband is processed through IF and RF up-converter 314 and is fed to phase shifter 318 of sub-array of antenna array 324 and power amplifier 320 Where the sub-array has Nf antennas. For a Nd signal from baseband processing (e.g., an output of a MIMO process), if each signal goes to a sub-array with Nf antennas, the total number of transmit antennas Nt should be Nd * Nf. The transmit path 301 includes the same number of antennas for each sub-array. However, the present invention is not limited to this. Rather, the number of antennas for each sub-array need not be the same for all sub-arrays.

The transmit path 301 includes one output signal from the MIMO process because it is input as RF processing into one sub-array of antennas. However, the present invention is not limited to this. Rather, one or more signal outputs (e.g., the output of a MIMO process) of the Nd signal from baseband processing are input into one of the sub-arrays. When a plurality of output signals from the MIMO process are input to one of the sub-arrays, each of the plurality of output signals from the MIMO process is connected to all or a part of the sub-array antennas. For example, the IF and RF signal processing in each sub-array of antennas may be the same as the processing in the array of antennas in FIG. 3A, or any of IF and RF signal processing in the antenna array. The processing associated with one sub-array of antennas is referred to as one "RF chain ".

3C illustrates a receive path for MIMO baseband processing and analog beamforming with multiple antennas in accordance with an embodiment of the present invention. The receive path 350 includes a beamforming architecture in which all signals received at the RX antenna are processed through an amplifier (e.g., a low noise amplifier (LNA)) and a phase shifter. These signals are then combined to form an analog stream, which is converted to a baseband signal and processed in the baseband.

As shown in FIG. 3C, the RX receive antenna 360 receives a signal wirelessly transmitted by a transmit antenna. The signal from the RX antenna is processed through the LNA 362 and the phase shifter 364. Next, the signals are combined in a combiner 366 to form an analog stream. Overall, Nd analog streams are formed. Each analog stream is converted to a baseband signal via an RF and IF down-converter 368 and an analog-to-digital converter (ADC) 370. The converted digital signal is processed in the baseband RX MIMO processing section 372 and the other baseband processing section to generate the reconstructed Ns information streams. The control unit 380 communicates with a receiver including a baseband processor, an RF and IF down-converter 368, an RX beamforming unit 363 and an RX antenna array unit 360. The control unit 380 transmits a signal to the transmitting unit 382, and the transmitting unit transmits a feedback signal. The control unit 380 controls the receiving unit and confirms and forms the feedback signal.

FIG. 3D illustrates another receive path for MIMO baseband processing and analog beamforming with multiple antennas in accordance with an embodiment of the present invention. The receive path 351 includes a beamforming architecture in which the signal received by the sub-array of antenna arrays is processed by an amplifier and a phase shifter and forms an analog stream that can be transformed and processed in the baseband. The receive path 351 is similar to the receive path 350 of FIG. 3C except for differences in the beamforming portion 363.

As shown in Figure 3D, the signals received at the NfR antennas of the sub-array of antenna array 360 are processed in LNA 362 and phase shifter 364 and combined in combiner 366 to provide an analog stream . There may be NdR sub-arrays (NdR = NR / NFR), and each sub-array forms one analog stream. Thus, an overall NdR analog stream can be formed. Each analog stream is converted to a baseband signal via RF and IF down-converter 368 and ADC 370. NdR digital signals are processed in the baseband unit 372 to be restored into Ns information streams. The receive path 351 includes the same number of antennas for each sub-array. However, the present invention is not limited to this. Rather, the number of antennas for each sub-array need not be the same for all sub-arrays.

Receive path 351 includes one output signal that is RF processed into one sub-array of antennas, such as one of the inputs to baseband processing. However, the present invention is not limited thereto. Rather, one or more output signals that have been RF processed into one sub-array of antennas may be input to baseband processing. When a plurality of RF processed output signals are input into one sub-array of antennas, each of the plurality of RF processed output signals into one sub-array of antennas may be connected to all or a portion of the sub-array antennas. For example, RF and IF signal processing in each sub-array of antennas may be the same as any type of RF and IF signal processing in an antenna array or in an antenna array as in FIG. 3C. The processing associated with sub-arrays of antennas is referred to as one "RF chain ".

In another embodiment, multiple transmit and receive paths similar to the transmit and receive paths in Figures 3A-3D but with different beamforming structures are possible. For example, the power amplifier 320 may be located after the combiner 322, so that the number of amplifiers can be reduced.

4 illustrates a wireless communication system using an antenna array according to an embodiment of the present invention. The embodiment of the wireless communication system 400 shown in FIG. 4 is for illustrative purposes only. Other embodiments of the wireless communication system 400 that do not depart from the scope of the present invention are available.

As shown in FIG. 4, system 400 includes base stations 401-403 and mobile stations 410-430. Base stations 401-403 represent one or more base stations 101-103 in FIG. Similarly, mobile stations 410-430 represent one or more subscriber stations 111-116 of FIG.

BS 401 includes three cells, cell 0, cell 1, and cell 2. Each cell contains two arrays, array 0 and array 1. In cell 0 of BS 401, array 0 and array 1 transmit the same downlink control channel to the wide beam. However, array 0 may have a different frame structure than array 1. For example, array 0 receives uplink unicast communication from MS 420, while array 1 transmits downlink backhaul communication to array 0 of cell 2 of BS 402. BS 402 includes a wired backhaul to which one or more are connected to a backhaul network. The synchronization channel (SCH) and the broadcast channel (BCH) may be transmitted from the BS 401 shown in FIG. 4 through multiple beams having a beam width not as wide as the largest transmission beam. Each of these multiple beams for SCH and BCH has a wider beam width than the beam for unicast data communication, which is for communication between the base station and a single mobile station.

Throughout this specification, the transmit beam can be formed by a transmit path as shown in Figs. 3A and 3B. Similarly, the receive beam may be formed by a receive path as shown in Figures 3C and 3D.

One or more of the wireless links depicted in FIG. 4 are broken due to LOS blocking (e.g., a failure such as a person or vehicle moving into the LOS) or NLOS that is not strong enough to maintain communication. Even if the MS approaches the BS and the MS moves only a very short distance, the link is broken. In this situation, the MS will need to change the link if the current link can not be restored. Even if the MS is not located at the cell edge, the link needs to be changed.

If each antenna in the array is not located at a high elevation angle, a TX or RX beam with substantially spherical coverage is used. For example, if each beam is shaped like a pencil, a 180 degree elevation search is required at each sampling point in a 360 degree circular azimuth search. Alternatively, if the antenna is located at a high elevation angle, elevation angles of 180 degrees or less may be sufficient at each sampling point in a 360 degree circular azimuth search.

5 illustrates an example of multiple beams having different beam shapes and widths for different purposes within a sector or cell according to an embodiment of the present invention. The example shown in Fig. 5 is for illustrative purposes only. Other embodiments are possible without departing from the scope of the present invention. The sector / cell shown in FIG. 5 represents one or more base station cells shown in FIG. Throughout this specification, a beam (including a TX beam and an RX beam) has a plurality of beam widths or shapes, may be shaped or irregular, and is not limited to that shown in the drawings.

In a sector or cell, one or more arrays with one or more RF chains generate different types of beams for different purposes. 5, the vertical axis represents an elevation angle and the horizontal axis represents an azimuth angle. As shown in Fig. 5, wide beam BB1 and BB2 (referred to as broadcast beam or "BB") constitute a physical configuration indication channel, physical broadcast channel or synchronization channel indicating where the physical data control channel is located . The wide beams BB1 and BB2 transmit the same information to the cell.

Although two wide beams BB1 and BB2 are shown in Fig. 5, a cell may constitute one or more BBs. If there are multiple BBs in a cell, the BB is distinguished by an implicit identifier or an explicit identifier, which is used by the MS to monitor and report the BB. The BB beam continues to propagate. Repeating information on the BB beam depends on the number of MSs of the RX beam receiving the BB beam. That is, in one embodiment, the number of repetitions of information for the BB beam is equal to the number of RX beams at the MS receiving the BB beam.

 A wide control channel beam B1-B4 (collectively, "B beam") may be used for the control channel. The control channel beams B1-B4 may use the same beam width as the wide beams BB1 and BB2 and may use different beam widths. The beams B1-B4 may use the same reference signals as the wide beams BB1 and BB2 for the MS to be measured and monitored, or may use other reference signals. The wide beam B1-B4 is used not only for broadcast or multicast to the MS group, but also for control information for a specific MS, e.g. MS-specific control information such as resource allocation for the MS.

Although four control channel beams B1-B4 are shown in Fig. 5, one cell can constitute one or more B beams. When there are multiple B beams in a cell, the B beams are distinguished by an implicit or explicit identifier, which is used by the MS to monitor and measure the B beam. The B beam continues to propagate. Repeating information on the B beam depends on the number of MSs of the RX beam receiving the B beam. That is, in one embodiment, the number of repetitions of information for the B beam is equal to the number of RX beams at the MS receiving the B beam. The MS may or may not search for beams B1-B4 using information for beams BB1 and BB2.

Beam b11-b44 (collectively, "b-beam") is used for data communication. The b beam has an adaptive beam width. For some MSs (e.g., MSs with low speeds), narrow beam is used, and for some MS wide beam is used. The reference signal is transmitted over the b-beam. Although 19 b-beams are shown in Fig. 5, one cell can constitute one or more b-beams. When there are multiple b-beams in a cell, the b-beams are distinguished by implicit or explicit identifiers, which are used by the MS to monitor and report the b-beam. The b beam continues to propagate. The repetition of information on the b-beam depends on the number of MSs of the RX beam receiving the b-beam. That is, in one embodiment, the number of iterations of information for the b beam is equal to the number of RX beams at the MS receiving the b beam. After the MS monitors the beam, the TX beam b is locked with the RX beam. If the data information is transmitted via the locked RX beam, iteration of the information of the b beam is not necessary.

6A and 6B illustrate the use of a beam for transmitting the same or different information to a mobile station or base station in one cell, respectively, in accordance with an embodiment of the present invention. The embodiment shown in Figs. 6A and 6B is for illustrative purposes only. Other embodiments are possible without departing from the scope of the present invention.

As shown in Figures 6A and 6B, the beams B1-B4 (collectively, "B beam") include control channels such as control information broadcast / multicast to device groups such as MS and BS, , MS- or BS-specific control information such as resource allocation for the MS). The control channel is, for example, a physical downlink control channel (PDCCH), and includes resource allocation information of a system information block (SIB) for all MSs in a cell, resource allocation for a specific MS, Provide relevant MS-specific information.

All B beams in the cell transmit the same information to all MSs in the cell. The B beam implicitly or explicitly transmits identifiers to the MS to identify themselves for monitoring and reporting purposes. In some embodiments, the B beam may not transmit any identifier information. In this case, the MS will not be able to identify themselves, and the B beam will behave like a wide beam with coverage of all B beams in the cell.

In some embodiments, the intra-cell B beam transmits different information to the MS in the cell. These B beams transmit the identifiers implicitly or explicitly to the MS to identify themselves for monitoring and reporting purposes. The B beam transmits information related to the MS in its coverage, such as resource allocation (e.g., resource block, power control, etc.) to the data beam to the MS in its coverage.

Combinations of the above are also applicable. For example, control information can be divided into two categories. For example, one category is common information common to all MSs in a cell, and the other category is information related only to MS groups in the coverage of each B beam. The common information for the entire MS group in the cell is transmitted over all B beams, whereas information related only to the MS in the B beam coverage is transmitted only through such a B beam.

In a sector or cell, one or more arrays with one or more RF chains generate different types of beams for different purposes. One RF chain may be for one or more antenna sub-arrays. One antenna sub-array may form one or more beams.

Digital beamforming may be performed for baseband MIMO processing. Analog beamforming may be performed by adjusting a phase shifter, a power amplifier (PA), or other low noise amplifier (LNA). The wide beam can be generated using either analog beamforming or both analog and digital beamforming. Narrow beams are generated by analog and digital beamforming.

7 shows an example of signal processing in a transmitter and a receiver in a millimeter wave system according to an embodiment of the present invention. The millimeter wave system 700 shown in FIG. 7 is for illustration only. Other embodiments are possible without departing from the scope of the present invention.

7, the millimeter wave system 700 includes a transmitting unit 701 and a receiving unit 702. [ Transmitter 701 represents one or more base stations 401-403 or mobile stations 410-430 in FIG. Similarly, receiver 702 represents one or more base stations 401-403 or mobile stations 410-430. The transmission unit 701 includes a plurality of transmission (TX) RF chains 1-n. The receiving unit 702 includes a plurality of receiving (RX) RF chains 1-n. TX RF chain 1 forms beams B1 and B2. B1 and B2 are formed by beam adjustment. That is, B1 and B2 are not simultaneously generated beams, and they are sequentially formed in the time domain. TX RF chain 2 forms beams B3 and B4. B3 and B4 are formed by beam adjustment. The RX RF chain 1 forms beams U1 and U2. U1 and U2 are formed by beam adjustment. The RX RF chain 2 forms beams U3 and U4. U3 and U4 are formed by beam adjustment. As shown in Fig. 7, U2 receives B2. U3 is received after B4 is reflected by the reflector. B3 reaches U1. Thus, there are three possible links B2, U2, B3, U1, B4, U3. The three links B2, U2, B3, U1, B4, U3 do not occur at the same time since the beam from each RF chain is formed by beam adjustment. The two possible concurrent connections are (B2, U2) and (B4, U3) as shown in Fig.

The B beam contains information of the b beam in the coverage of the other B beam. For example, referring to FIGS. 6A-7, the data control beam B1 includes information about the data beam b21 if the base station determines that the data beam b21 is used for data communication. The mobile station receives beam B1 to decode B1, and determines that beam b21 is scheduled for data communication.

One RF chain may be for one or more antenna sub-arrays. One antenna sub-array forms one or more beams. Digital beamforming is performed in baseband MIMO processing. Analog beamforming is performed by adjusting a phase shifter, a power amplifier (PA) or a low noise amplifier (LNA). The wide beams BB, B are formed by either analog beamforming or both analog and digital beamforming. The narrow beam is formed by both analog and digital beamforming.

8A illustrates paging a mobile station in an idle mode in a wireless communication system according to an embodiment of the present invention. The embodiment shown in FIG. 8A is for illustrative purposes only. Other embodiments are possible without departing from the scope of the present invention.

In FIG. 8A, a paging control unit (not shown) informs one or more base stations which mobile station is to be paged. The base station then broadcasts a paging message, which includes the mobile station identifier and some other auxiliary information. The mobile station in the idle mode wakes up at a certain time when it receives the paging message. If the mobile station confirms that the identifier is included in the paging message, the mobile station recognizes that it is paged and exits the idle mode and performs additional operations such as network re-entry. Otherwise, the mobile station enters a paging unavailable interval in which the MS remains idle without listening.

In idle mode, the MS has a repetition period of paging listening time and paging non-listening time: this period is called a paging cycle. During the paging cycle, the paging message is transmitted by the BS at one or more time offsets within the paging cycle. The timing at which the BS broadcasts the paging message to the MS must match the timing at which each MS hears the paging message. The timing alignment of the BS and the MS is accomplished by explicitly signaling using the same pre-established algorithm in both the BS and the MS to calculate the timing information for the paging message. This preset algorithm includes a paging cycle function (e.g., a hash function) and a predetermined timing offset for the paging message in the paging cycle.

During the paging cycle, multiple MSs may be paged in different paging slots, and the paging message may be shortened. For example, an MS can be divided into several MS groups that are paged at different time offsets. The pre-set algorithm in both BS and MS for calculating the timing information for the paging message can be added to a function (e.g., a hash function) of the MS identifier so that the MS can determine which section So that the MS does not need to know when the interval for another MS group is. For example, the preset algorithm can hash the MS identifier in the index of the paging slot. For example, the hash algorithm allows MSs with identifiers ending with 00, 01, 10, and 11 to be located in the first, second, third, and fourth slots, respectively. Instead of a preset algorithm, explicit signaling may be additionally or alternatively used to notify which slot the BS should listen to the MS. In some systems, to shorten the paging message, a globally unique identifier of the MS may be hashed into a short identifier.

8B and 8C illustrate paging for a mobile station in an idle mode including a paging interval in a base station and a paging listening interval in a mobile station according to an embodiment of the present invention. The embodiment shown in Figures 8b and 8c is for illustration only. Other embodiments are possible without departing from the scope of the present invention.

As shown in FIGS. 8B and 8C, within the paging cycle, the BS defines one or more paging intervals to be paged to the MS. The paging interval offset determines the start time of the paging interval; In general, the paging interval offset is an attribute of the BS. In many systems, the paging interval offset is determined by the paging area identifier or base station paging group ID (BSPG ID), where all base stations with the same BSPG ID have the same paging interval offset. Note that the paging area includes many base stations with one BSPG ID. Similarly, the base station is included in multiple paging areas, so that one BS has multiple BSPG IDs. Generally, the BS broadcasts its BSPG ID to one or more MSs. The MS has a paging listening interval offset according to the paging interval offset of the BS. During the paging interval, the BS can page to multiple MS groups, each group having a different paging listening offset (excluding the common paging interval offset), which is associated with the MS identifier. As shown in FIG. 8C, the paging listening offset is defined in relation to the time of the paging listening interval. During one listening interval, the MS only listens when it does not hear all of the time, but only when a message associated with it occurs. Also, all timing offsets are determined by explicit signaling or pre-set algorithms on both BS and MS.

In other systems, it will be appreciated that the terms used in Figures 8a-8c, such as paging cycle, paging offset, paging message, paging interval, paging interval offset, and paging listening interval, For the sake of clarity and convenience, the terminology used in FIGS. 8A to 8C is used herein.

In the embodiment described herein, the MS sends a number or parameter M to the base station. Where M is the number of RX beam instances at the MS in the idle mode for the receiver to end the one-beam adjustment to cover the required spatial coverage. The MS sends the number M to the base station or network upon initial network entry, network re-entry, or any state to which the MS is connected. Alternatively, the MS may be able to determine whether the MS is in an idle state or before the MS performs a location update (e.g., when the MS detects another paging area or paging ID and, as a result, And transmits the number M to the network. Here, the beam instance refers to one or more beams that can be generated and used simultaneously at a time. The term beam can be used interchangeably with the term beam pattern.

The number M may also be interpreted as the number of iterations at the BS TX associated with allowing RX to finish the one-beam adjustment to cover the required spatial coverage. The number M is referred to as the number of RX beams per RF chain when each RF chain is tuning the same number of RX beams, where the RF chain may be a signal processing chain for one antenna sub-array of antenna arrays. In certain cases, if all RX beams are formed by beam adjustment one by one, the number M may be the number of RX beams.

Figures 9A and 9B show an example of the number M according to an embodiment of the present invention. The embodiment shown in Figures 9A and 9B is for illustration only. Other embodiments are possible without departing from the scope of the present invention.

In Example 1 shown in FIG. 9A, four RX beams are generated from one RF chain by beam-adjusting one beam at a time. To finish the RX beam adjustment once, 4 RX instances are required, so M = 4. In Example 2 shown in FIG. 9B, there are two RF chains or two sub-arrays, and each array forms two different beams. Two simultaneously occurring RX beams are formed by having one RX beam from RF chain 1 and one RX beam from RF chain 2. In Example 2, a 2 RX beam instance is needed to finish the RX beam adjustment once (e.g., RX1 and RX3 require a second instance for the first instance RX2 and RX4), and accordingly M = 2.

In some embodiments, after the MS sends the number M to a base station or a network entity (e.g., gateway), the base station or network entity may send an MS identifier (e.g., MS ID) to a network or other network entity having a paging function, ) To transmit the number M. Where M is the number of MS RX beam instances used in the idle mode for the MS RX to terminate the beam adjustment once in the idle mode.

In some embodiments, the network or paging controller is configured to determine the number of MS RX beam instances used in the idle mode for MS RX to terminate the beam adjustment once in idle mode (number of MS RX beam instances used in idle mode) , A pre-set algorithm is used to determine the timing for the BS in the same paging area (i.e., with the same PG ID) as the MS to transmit the paging message to the MS. When there is a paging message for an MS for which the MS belongs to a certain paging area, the network or paging controller queries the base station with the MS's PG ID to transmit the paging message to the MS at the determined timing. In the paging area with the PG ID of the MS, there may be more than one BS. The BS then sends the paging message to the MS at a known time via the network or paging control.

The timing for the BS to transmit the timing of the paging message or the paging message may include a paging offset for the paging message or a timing associated with offset to the paging slot for the paging message, Or the timing at which the BS transmits the paging message or a portion of the paging message associated with the MS to the MS.

The paging offset for the paging message may include the number of MS RX beam instances used in the MS RX to terminate the one-time beam adjustment in the idle mode of the MS, some sequence and / or base station identifiers from the mobile station identifier or mobile station identifier, May be a function or mapping (e.g., a hash function) to a number M that may be another parameter such as an identifier, a base station paging group identifier, and so on.

For the timing for the BS to send the paging information in the paging slot for the paging message or a portion of the paging message or paging message associated with the MS to the MS, the BS includes a number of parameters for determining the timing itself, The parameters include the number of MS RX beam instances used in the MS RX to terminate the one-time beam adjustment in the idle mode of the MS, some sequence and / or base station identifiers obtained from the mobile station identifier or mobile station identifier, paging cycle, paging area identifier, Lt; RTI ID = 0.0 > M, < / RTI > which may be other parameters such as group identifiers.

The MS uses the same pre-set algorithm as the network or paging control to determine the timing for the paging message considering its MSID, number M and other factors. The MS uses its RX beam to monitor the paging message at the determined timing. If there is a message transmitted by the BS, the MS receives the paging message at the determined time and decodes the message.

In certain embodiments, before the paging message is transmitted, the BS may send a paging indicator that indicates whether a paging message is present for a particular superframe or frame (e.g., whether a paging identifier is being sent to the current superframe or frame) . The MS first monitors its paging indicator using its RX beam. If the paging indicator indicates that a paging message is present, the MS monitors the paging message transmitted at the time determined by the BS. If the paging indicator indicates that there is no paging message, the MS omits the paging message monitor. In order for the MS to receive the paging indicator because the MS has one or more RX beam instances and the RX / TX beam has not yet been coordinated, the BS transmits a paging indicator at least a predetermined number of times, It is the maximum value of the M parameter.

FIG. 10 illustrates a process of determining timing for a paging message according to an embodiment of the present invention. The embodiment shown in FIG. 10 is for illustrative purposes only. Other embodiments are possible without departing from the scope of the present invention.

10, steps 1001 through 1017 illustrate how the network or paging controller and the MS determine the timing of the paging message for the BS having the same paging ID as the MS in order to transmit the paging message to the MS, Lt; / RTI >

In some embodiments, if there is a paging message for an MS that belongs to a particular paging area with a particular paging identifier (PG ID), the network or paging controller may send a base station with the same PG ID as the MS (Steps 1007 to 1011). The network or paging control sends the MS ' s MS ID of the MS and the number M (as described above) to the base station. In the paging area with the PG ID of the MS, there may be more than one BS. If the BS knows the number M of the MS in advance (e.g., if the BS has already transmitted the number M from the MS to the network), then the network or paging control need not send the number M back to the BS. In some embodiments, after the MS performs location update, it is possible for the network to allow all BSs with the new PG ID of the MS to know about the number M of the MS.

In some embodiments, the base station may determine timing for the BS in the same paging area (i.e., having the same PG ID) as the MS to transmit the paging message to the MS, taking into account the MS ID, the number M of the MS, Use a pre-set algorithm to determine. Then, the BS transmits a paging message to the MS at the determined timing.

The MS uses the same preset algorithm as the network or paging controller to determine the paging message considering its MSID, number M and other factors (step 1007). The MS monitors the paging message at a timing determined by using its RX beam. If there is a message sent by the BS, the MS receives the paging message at the determined time and decodes the message (step 1017).

The paging timing or BS timing for transmitting the paging message may include a paging offset of the paging message or a timing associated with the offset to the paging slot for the paging message, including the paging message, the timing associated with the TX beam instance of the BS, Timing of the paging information or a portion of the paging message or paging message associated with the MS to the BS, and so on.

The paging offset of the paging message may include the number of MS RX beam instances for use with the MS RX to terminate the one-time beam adjustment during the idle mode of the MS, some sequence and / or base station identifiers obtained from the mobile station identifier or mobile station identifier, (E.g., a hash function), which may be another parameter such as a paging area identifier, a base station paging group identifier, or the like.

For the timing for the BS to transmit the paging information or a portion of the paging message or paging message associated with the MS in the paging slot for the paging message to the MS, the BS includes a number of parameters for defining the timing itself, The number of MS RX beam instances for use with the MS RX to end the one-time beam adjustment during the idle mode of the MS, some sequence and / or base station identifiers obtained from the mobile station identifier or mobile station identifier, the paging cycle, Lt; RTI ID = 0.0 > M, < / RTI > which may be another parameter such as a paging group identifier.

11 shows an example of a process for determining the timing of a paging message according to an embodiment of the present invention. The embodiment shown in Fig. 11 is for illustrative purposes only. Other embodiments are possible without departing from the scope of the present invention.

As shown in steps 1101 to 1121 of FIG. 11, the BS and the MS use the same pre-set algorithm to determine the timing of the paging message for the BS having the same paging ID as the MS to transmit the paging message to the MS do.

Optionally, the number M of the MS (which may be the number of RX beam instances of the MS RX to terminate the one-beam adjustment in the idle mode) may be preset by the system and may be determined by the network or network entity including the paging controller, And the MS can know the value of the number M. For example, the number M may be included in the SIM card. The number M may be transmitted by the network or BS to the MS (steps 1101-1103), for example, in the initial network entry or network re-entry capabilities negotiation or any communication state prior to the idle mode since the MS is located in the system.

Optionally, the number M is associated with a mobile device type. For example, one type of MS (e.g., a tablet with a particular size) is associated with one value of M, another type of MS (e.g., a mobile phone) is associated with another value of M, Of the MS (e.g., laptop computer) is associated with another value of M.

In some embodiments, the base station may page the MS with a TX beam. This capability may be determined or configured by the network, pre-configured or preconfigured. For example, this capability may be fixed or pre-set so that all BSs and MSs know this capability in advance. Additionally or alternatively, the BS and the MS will know and remember the time at which they first connect to the system. This capability may be configured by a device having a paging function such as a network, a network entity such as a gateway, or a paging controller. Next, this capability is sent to the BS to enable the BS to use the configured capabilities. As another example, a BS may transmit its general beamforming related capabilities (e.g., the number of RX chains, the maximum number of beams supportable, etc.) to the network or network entity. The network or network entity then constitutes a particular capability for the BS used to transmit the paging related signal from the idle mode to the MS. The network or network entity may determine the general beamforming related capabilities of all base stations in the same paging area as the paging ID (step 1105).

This capability includes the number N and N is the number of times the TX in the BS for transmitting the paging related signal to one or more MSs in the idle mode to allow the BS TX to finish the one- The number of beam instances. Here, the beam instance refers to one or more beams that are used simultaneously at a time. The term beam is used interchangeably with the beam pattern.

If each RF chain can adjust the same TX beam, it can be interpreted as the number of TX-by-RF TX beams, where the RF chain can be a signal processing chain for one antenna sub-array of antenna arrays. In certain cases, if all TX beams are formed by beam adjustment one by one, the number N is the number of TX beams.

The ability of the BS to TX the beam to page the MS may include the number K and K is the number of the BS TX beam instance or beam adjustment. Each TX beam instance occurs K times. In some embodiments, the number K may be interpreted as the number of signal transmissions during a BS TX beam instance, such that a receiver with K RX beam instances or beam adjustments as a number of signal transmissions for each RX beam instance So that it can be received. In this case, K > = max (M_i) for all M_i of MS_i, where MS_i has BS.

However, in a particular embodiment, the number K is equal to the number of BS TX beam instances or beam adjustments, and the number K is independent of the number M of the MS. Thus, the number K does not belong to the category associated with the TX beam capability, but the number K serves as a parameter of the TX beam configuration.

12A and 12B show an example of the number N according to an embodiment of the present invention. 12A and 12B are for illustration only. Other embodiments are possible without departing from the scope of the present invention.

In Example 1 of Fig. 12A, four TX beams are formed from one RF chain by adjusting one beam at a time. A 4TX beam instance is required to terminate the TX beam adjustment once, ie, N = 4. In Example 2 of Fig. 12B, there are two RF chains or two sub-arrays, each of which forms two different beams. Two simultaneous TX beams can have one RF chain 1 and one RF chain 2. In Example 2, two TX beam instances (eg, TX1 and TX3 for the first instance and TX2 and TX4 for the second instance) are required to terminate the one TX beam adjustment.

In some embodiments, the network determines the timing for the TX beam instance to send paging to the MS, taking into account the TX beam capabilities of all base stations within the paging ID and the paging ID of each base station. The TX beam instance timing for transmitting paging related information to the MS includes the start of each TX beam instance, the duration of each TX beam instance, the ability of the BS to TX the beam to paging the MS, the number of TX beam instances, The number of instances, the beam adjustment type, and the like.

The beam steering type includes Type 1 where the BS adjusts the beam and the MS maintains one RX beam and Type 2 where the BS maintains one TX beam and the MS adjusts the RX beam.

The network informs the BS about the timing determined for the TX beam instance. The MS acquires the timing for the TX beam instance as one of the inputs to calculate the RX timing for receiving the paging message. The MS acquires this information in any state, such as when entering the initial network entry, network re-entry, connection mode, or entering the same system as before entering the idle mode. If the network reconfigures the timing of the BS TX beam instance for the paging related signal to be sent to the MS, then such reconfiguration must be sent to the BS and MS. That is, the BS and the MS must be able to obtain any updated configuration or reconfiguration.

In certain embodiments, the timing of the BS for transmitting the TX beam instance for paging the MS may be preconfigured, preconfigured, fixed, pre-allocated or predefined. The BS knows the timing information and informs the MS of the timing information. Optionally, the timing information may be known by the MS when the MS is first entering the system and is storing the timing information.

FIG. 13 shows an example of a process of transmitting timing configuration information according to an embodiment of the present invention. Figure 13 is for illustration only. Other embodiments are possible without departing from the scope of the present invention.

As shown in steps 1301 through 1305 in FIG. 13, the network determines and informs information regarding the timing configuration for the TX beam instance for transmitting a signal (e.g., a paging related signal) to the MS in the idle mode. In steps 1307 and 1309, the MS obtains this information as an input to determine the RX timing for receiving the signal in the idle mode.

 In some embodiments, the TX beam instance timing for transmitting paging related information to the MS includes one or more of the following: the start of each TX beam instance, the duration of each TX beam instance, The number of TX beam instances, the number of TX beam instances, the type of beam steering, the number of BS TX beam instances or beam adjustments in a single BS TX beam instance, the number of beam instances in each beam instance Time duration, BS TX beam instance, or beam start time. The TX beam instance timing may additionally or alternatively include a timing offset from the first start time, an offset from the time of the paging slot including the paging message, an offset from the beginning of the paging message in one beam instance, Lt; / RTI > of the signal transmission of < RTI ID = 0.0 >

The beam steering type includes Type 1 where the BS adjusts the beam and the MS maintains one RX beam, and Type 2 where the BS maintains one TX beam and the MS adjusts the RX beam.

Table 1 shows examples of information that the BS transmits to the MS with respect to the BS TX beam instance to be used to transmit paging related information.

■ Information Notes ■ IMODES of transmissions:
'0' means Type 1
'1' means Type 2 Type 1: The base station can steer the BS TX beams or beam instances to transmit signal. The MS RX beams are steered in a certain direction while the BS TX beams or beam instances are steered. Then MS RX moves to next direction and hold beam, while BS TX beams start over beam steering.
Type 2: The base station can hold the BS TX beams for a certain direction to transmit signals while the MS RX beams are steered to different directions. Then the BS can move to another direction while the MS RX beams start over the beam steering. ■ If Type 1, include Timing information for Type 1 See below table ■ If Type 2, include Timing information for Type 2 See below table

For Type 1, the base station adjusts the BS TX beam or beam instance to transmit the signal. The MS RX beam is maintained in a particular direction in which the BS TX beam or beam instance is adjusted. The MS RX is then moved and maintained in the next direction, and the BS TX starts beam adjustment.

The information of the BS TX beam for Type 1 includes all or part of, for example, as shown in Table 2. Timing information may have units such as such symbols, subframes, frames, and the like.

The number of BS TX beam instances N ■ The number of rounds of BS TX beam instances or beam steering K ■ Within one round of BS TX beam instances, the length of each beam instance for N instances T_Ins_1, T_Ins_2, .., T_Ins_N ■ If N instances are not immediately one after another, then it may also include the beginning time of each instance within the current round of instances (the beginning time of the first instance can be omitted if it is the same as the beginning time of a the BS may transmit the timing information to the base station at a predetermined timing offset from the beginning of the paging message, , or the offset from the beginning of the paging message) t_Ins_b_2, t_Ins_b_3, ..., t_Ins_b_N ■ The time duration of each instance may also be included (I is the index of rounds, and j is the index of the instances), T_Ins_i_j, for i = 1, ..., K, and j = 1, ..., N. If some of the durations are the same, then the information can be compressed. ■ The beginning of a burst of BS TX instances or beam steering (which can alternatively be offset from the beginning of the starting time or offset from the beginning of the paging message, the paging message) t_TX_1
t_TX_2,
.......
t_TX_K

For Type 2, while the MS RX beam is being adjusted in the other direction, the base station maintains the BS TX beam in a specific direction for transmitting the signal. Then, while the MS RX beam starts beam adjustment, the BS TX moves in the other direction.

The information of the BS TX beam for Type 2 includes all or part of the information shown in Table 3, for example. Timing information has units such as symbols, subframes, frames, and the like.

■ BS TX is the number of BS TX beam instances N The number of signal transmissions during a BS TX beam instance K ■ The beginning time of a BS TX beam instance
(This can alternatively be the timing offset from the beginning time, or offset from the beginning of the paging slot, which contains the paging message, or the offset from the beginning of the paging message. T_Ins_1, T_Ins_2, .., T_Ins_N ■ Within one beam instance, the duration of each signal transmission for all K signals t_TX_1, t_TX_2, ...
t_TX_K If the K signal transmissions are not immediately one after another, then it may also include the beginning of each signal transmission within one beam instance (the beginning time of the first signal can be omitted if the same as the beginning time of the current BS TX beam instance) (this can alternatively be the timing offset from the beginning of the current BS TX beam instance, the timing offset from the beginning time, or offset from the beginning of the paging slot, or the offset from the beginning of the paging message. t_TX_b_1, t_TX_b_2, ....
t_TX_b_K

Figure 14 illustrates beam related definitions and terms used in embodiments of the present invention. The embodiment shown in Fig. 14 is for illustrative purposes only. Other embodiments are possible without departing from the scope of the present invention. Similarly, other definitions or terms may be applied to other embodiments in which they are used.

The timing of the paging message or the timing of the BS for transmitting the paging message includes the paging offset for the paging message or the timing associated with the offset for the paging slot for the paging message, The timing of the BS to send the paging information or a portion of the paging message or paging message to the MS associated with the MS in the paging slot.

 The paging offset of the paging message may be a number M, which may be the number of MS RX beam instances used by the MS RX to terminate the one-time beam adjustment in the idle mode of the MS, a sequence obtained from the mobile station identifier or mobile station identifier and / A paging area identifier, a base station paging group identifier, or the like (e.g., a hash function).

For the timing of the BS for transmitting the paging information or a portion of the paging message or the paging message associated with the MS in the paging slot for the paging message to the MS, the BS includes a number of parameters for defining the timing itself, The parameter may be a number M that may be the number of MS RX beam instances used by the MS RX to terminate the beam adjustment once in the idle mode of S, a sequence obtained from the mobile station identifier or mobile station identifier and / or base station identifier, a paging cycle, A base station paging group identifier, and the like.

The following description is for illustrative purposes only. Assume that there are P number of paging offsets (1, ..., P) and P related paging slots (1, ..., P) for one paging cycle. Where each paging slot is associated with one paging offset. Each paging slot is for one paging message. The paging offset is defined, for example, as described above.

If the number M = 1 (where M is the number of MS RX beam instances used to end the beam adjustment once in the idle mode), the number M does not need to be considered and an algorithm for calculating the paging / paging- May be a function of the MS identifier (ID) (e.g., a hash function). For example, the paging offset / slot I for the MS with the identifier MS_ID, where I is the index of the paging slot or paging message in one paging cycle, is calculated as:

Since the M of the MS RX beam instance is used in the idle mode for the MS RX to finish one beam adjustment in the idle mode, a new algorithm for calculating the paging timing is needed, which is calculated taking the number M into consideration. Assume that there are P paging offsets (1, ... P) and P related paging slots (1, ... P) in one paging cycle. Where each paging slot is associated with one paging offset. Each paging slot is for one paging message. Assuming one paging slot, there are K beam adjustments for the paging message instance (1, ..., K).

The paging timing of the MS with the number M and MS_ID as the MS RX beam instance for use in the idle mode for the MS RX to end the one-beam adjustment in the idle mode is calculated as follows.

15 illustrates an example of paging message and timing determination using a mapping function according to an embodiment of the present invention. Figure 15 is for illustrative purposes only. Other embodiments are possible without departing from the scope of the present invention.

In Fig. 15, the base station adjusts the TX beam or beam pattern 1, 2, ..., N, where N = 3. During the duration of the paging message, the number of beam adjustments is K. In Fig. 15, K = 4, but may have different values according to other embodiments. There are two paging slots in one paging cycle, each slot for one paging message.

For each MS, if its MSID is odd and a paging message is present in the MS, it is included in the first slot (i.e., paging message 1). If the MSID is even and there is a paging message for the MS, then it is included in the second slot (i.e., paging message 2)

The paging message for the MS with the number M = 1 is included in the one-time BS TX beam adjustment in its paging slot determined by the MSID, where M is the MS used in the idle mode for the MS RX to terminate the one- The number of RX beam instances. The paging message for the MS with the number M = x is the BS TX of the first y = 1, 2, ..., x using its own y-th RX beam instance in its paging slot determined by the MSID, Are included in each of the beam instances. Here, x has any value of 1, 2, 3, and K = 4.

If the MS has a number M = 1, the MS monitors the first TX beam instance or beam adjustment within its paging slot determined by the MSID for the paging message. If the MS has M = x, then the MS uses the y-th RX beam instance for each paging message to determine the BS of the first y = 1, 2, ..., x in its paging slot, And monitors the TX beam instance or beam steering. Here, x has an arbitrary value of 1, 2, 3, and K = 4.

Optionally, if the MS has a number M = x, then the MS sends a BS TX beam instance or beam adjustment of the first y = 1, 2, ..., x in its paging slot determined by the MSID to the paging message Monitor. Note that the MS does not need to use its y-th RX beam instance to receive the y-th BS TX beam instance or beam adjustment: Rather, it should be noted that the MS has already determined which RX beam is superior or which beam pair (BS TX, If the MS knows information about a good pair of good signal strengths or good pairings with good measurement values, then the MS needs to know more than one good RX beam of superior beam pair (BS TX, MS RX) Pattern or beam instance or one or more RX beam, beam pattern or beam instance. Then, the MS receives a BS TX message at the appropriate timing at which the desired message is received. For example, the MS may transmit a BS TX beam of a superior beam pair (BS TX, MS TX), a beam pattern Lt; RTI ID = 0.0 > RX. Here, x has an arbitrary value of 1, 2, 3, and K = 4. In another embodiment, the MS monitors a selected M subsets of BS TX beam instances to monitor.

In this embodiment, each BS TX beam instance (or beam adjustment) has a different sized paging message. For example, a first BS TX beam instance (or beam steering) includes a paging signal for MS 1, 3, 5, 7, 9, 11, 13 and 15 in a first paging slot for paging message 1, The second BS TX beam instance (or beam steering) in the first paging slot for paging message 1 includes the paging signal for MS 5, 7, 9, 11, 13 and 15.

An MS with a different number M monitors a different number of BS TX beam instances or beam adjustments. It is necessary to monitor the number of BS TX beam instances (or beam steering) including the paging signal to the MS.

This embodiment reduces the overhead for the paging signal or reduces the paging message signal.

In one embodiment, the paging time for an MS with a number M and an identifier MS_ID as an MS RX beam instance for use in an idle mode for the MS RX to end the one-time beam adjustment in the idle mode is as follows:

In another embodiment, the paging timing for the MS with the number M and identifier MS_ID as an MS RX beam instance for use in the idle mode for the MS RX to terminate the one-time beam adjustment in the idle mode is as follows:

where:

,

Here, the hash function may be, for example, a modulo function, a randomization function or any mapping, where A may be a function g of MS_ID and P, and B may be a function of M and K. [

For example, use modulo as a hash function and assume:

Here, the function int (.) Takes the integer part of the value, and B is the number of possible ways in choosing M in K. In this example, the paging timing is:

J is the index of the (K choose M) choice, and the MS uses the (J) choice from the (K choose M) selection.

In another example, B may be selected as follows:

B = number of possible methods for selecting successive M in K

The paging timing can be based on a random extraction function, which is as follows:

Here, random_f (B) is a function for arbitrarily selecting a value from the set (1, ..., B).

Examples of other random extraction functions are:

Where random_num is a random number generated by a particular seed.

For example, random_num may be any integer generated using a particular seed. The MS and the network or BS must both use the same random number generation and the same seed exactly.

16 illustrates another example of a paging message and timing determination using a mapping function according to an embodiment of the present invention. Figure 16 is for illustrative purposes only. Other embodiments are possible without departing from the scope of the present invention.

 In Fig. 16, the base station adjusts TX beam or beam patterns 1, 2, N, where N = 3. During the duration of one paging message, the number of beam adjustments is K. In Fig. 16, K = 4, but it may be different in other embodiments. During the paging cycle, there are two paging slots, one for each paging message.

For each MS, it is included in the first slot (e.g., paging message 1) if its MSID is odd and there is a paging message for the MS. If the MSID is even and there is one paging message for the MS, it is included in the second slot (e.g., paging message 2).

The paging message for the MS with the number M = 1 is included in the selected number of times (of the total 4 times) of the BS TX beam instance (beam adjustment) in its paging slot defined by the MSID, The number of MS RX beam instances for use in the idle mode for MS RX to terminate, and the selection is selected by a predefined algorithm. The paging message for the MS in the number M is the sum of the BS TX beam instance (beam coordination) (total of four (2), ..., M) RX beam instances in their paging slots determined by the MSID, ), Where M is chosen according to the predefined algorithm.

If the MS has a number M, then the MS uses its own 1,2, ..., Mth RX beam instance for the paging message to determine the BS TX beam instance or beam steering in its paging slot defined by the MSID, (Of a total of 4 times), where the algorithm for selection for M is the same as the algorithm used in the network or base station.

Optionally, the MS monitors the BS TX beam instance within its paging slot determined by the MSID, or M times selected (of a total of 4 times) of beam steering. The MS does not necessarily need to use its 1, 2, ..., Mth RX beam instance to receive M BS TX beam instances or beam adjustments, respectively, and rather the MS needs to know which RX beam is better, If the MS knows the information about the superior pair of beams (BS TX, MS RX) that represents the strength or good measurement, the MS may use one or more good RX beams, beam patterns or beam instances or one or more good beams RX beam, beam pattern or beam instance of the pair (BS TX, MS RX). Then, the MS receives the BS TX message at the timing of receiving the desired message. That is, the MS transmits the BS TX beam of the superior beam pair (BS TX, MS RX), the beam pattern or the timing for reception of the beam instance It is only necessary to open the RX of FIG. In another embodiment, the MS monitors a subset of the selected number M of BS TX beams for monitoring.

The MS determines the number M of BS TX beam instances for the paging message that delivers the desired information, and the algorithm for selecting the number M is the same as the algorithm used in the network or base station.

In this example, each BS TX beam instance (or beam steering) has a balanced sized paging message. For example, a first BS TX beam instance (or beam steering) in a first paging slot for paging message 1 includes a paging signal for MSs 1, 5, 9, 13, and 15, The second BS TX beam instance (or beam steering) in one paging slot includes the paging signal for MS 7, 9, 11, 13 and 15. Thus, the length of the paging signal included in each BS TX beam adjustment is substantially balanced.

An MS with a different number M monitors another number of BS TX beam instances or beam steering. It is only necessary to monitor this number of BS TX beam instances (beam steering) including the paging signal to the MS.

This embodiment not only balances the payload in each BS TX beam adjustment, but also reduces the overhead of the paging signal or reduces the length of the paging message. For example, P = 2 and K = 4 for MS3 and MS5 and M = 2 in Fig. Thus, another choice of (4 choose 2) = 6 is possible to have two BS TX beam instances or beam adjustments as in Table 4.

Index One 2 3 4 5 6 Number of selected 2 (1,3) (2,4) (1,4) (2,3) (1, 2) (3,4)

For MS3, int (MS_ID / P) = int (3/2) = 1, so J = 1 modulo 6 = 1, so that MS3 selects the first pattern in Table 4, BS TX beam adjustment.

For MS5, int (MS_ID / P) = int (5/2) = 2, so J = 2 modulo 6 = 2, so MS5 selects the second pattern in Table 4, BS TX beam adjustment.

In another example, B may be selected as follows:

B = number of possible methods for selecting successive M in K

For example, P = 2 and K = 4 for MS3 and MS5 and M = 2 in Fig. Thus, three different choices are possible to have two consecutive BS TX beam instances or beam adjustments, thus B = 3, as in Table 5.

Index One 2 3 Number of selected 2 (1, 2) (2,3) (3,4)

The timing of the paging message or the timing of the BS for transmitting the paging message may include a paging offset of the paging message or an offset for the paging message or an offset for the paging message, paging information associated with the MS along with the TX beam instance of the BS within the paging slot Or timing associated with a portion of the paging message or paging message.

The paging offset of the paging message may be a number M, which may be the number of MS RX beam instances for use in the MS RX to terminate the one-time beam adjustment in the MS's idle mode, some sequence derived from the mobile station identifier or mobile station identifier, and / , A paging cycle, a paging area identifier, a base station paging group identifier, or the like (e.g., a hash function).

For BS timing to send the paging information or a portion of the paging message associated with the MS in the paging slot for the paging message or paging message, the BS includes a number of parameters for defining the timing itself, A number M that can be the number of MS RX beam instances used in the MS RX to terminate the one-beam adjustment in the idle mode of the MS, some sequence derived from the mobile station identifier or mobile station identifier and / or base station identifier, paging cycle, , A base station paging group identifier, and the like may be a specific function.

Hereinafter, an example will be described. Assuming that there are P number of paging offsets (1, ..., P) and P associated paging slots (1, ..., P) during one paging cycle, each paging slot is associated with one paging offset Let's assume. The paging offset may be defined, for example, as described above.

If M, which may be the number of MS RX beam instances used for the MS RX to terminate the one-time beam adjustment in idle mode, is M = 1 then the number M does not need to be considered and an algorithm for calculating the paging / paging- May be a function of the MS identifier (ID) (e.g., a hash function). For example, the paging offset / slot I for the MS with the identifier MS_ID (I is the index of the paging slot or the paging message in one paging cycle) can be calculated as follows.

Since M for the MS RX beam instance is used in the idle mode for the MS RX to terminate the one-time beam adjustment in the idle mode, a new algorithm for calculating the paging timing considering the number M is needed. Assume that there are P paging offsets (1, ..., P) and P associated paging slots (1, ..., P) during one paging cycle, and each paging slot is associated with one paging offset . Each paging slot is for one paging message.

The paging timing for an MS with an identifier MS_ID and a number M as an MS RX beam instance for use in an idle mode for the MS RX to terminate the one-time beam adjustment in the idle mode may be calculated as follows, where Paging_message_signal_transmission L is Lt; RTI ID = 0.0 > TX < / RTI > beam instance.

17 illustrates another example of paging message and timing determination using a mapping function according to an embodiment of the present invention. Figure 17 is for illustration only. Other embodiments are possible without departing from the scope of the present invention.

In Figure 17, during one paging message duration, the base station keeps its TX beam or beam instance for a particular time, then moves to a second beam or beam instance, until the BS finishes N beam instances Where N = 3. In one beam instance, BS TX performs K signal transmissions, where the K signals may be the same or different. There are two paging slots in the paging cycle, each slot for one paging message.

For each MS, it is included in the first slot (e.g., paging message 1) if its MSID is odd and there is one paging message for the MS. If the MSID is even and there is one paging message for the MS, it is included in the second slot (e.g., paging message 2).

The paging message for the MS with M = 1, the number of MS RX beam instances for use in the idle mode for the MS RX to terminate the one-time beam adjustment, is determined by the N-beam of the BS TX in its paging slot determined by the MSID And is included in the first signal transmission in each instance. The paging message for the MS with number M has its own M RX beam instance (y = 1, 2, 1, 2, 3, 4) for transmission of these first M signals from the N beam instance of each BS TX in its paging slot, , ..., M) to be included in the first M signal transmissions (y = 1, 2, ..., M) in the N beam instances of each BS TX. Here, M may be any value among 1, 2, 3, and K = 4.

If the MS has M = 1, which is the number of MS RX beam instances for use in the idle mode for the MS RX to terminate the one-time beam adjustment, then the MS will determine that each BS in its paging slot, It monitors the first signal transmission in the N beam instance of TX.

If the MS has a number M, then the MS sends its M RX beam instance (y = 1, 2, 3, 4) to each of these BS TX beam instances in its paging slot determined by the MSID, ..., M) are used to monitor each of the first M signal transmissions (y = 1, 2, ..., M) in the N beam instances of each BS TX. Here, M may be any value among 1, 2, 3, and K = 4.

Alternatively, the MS monitors each first M signal transmission (y = 1, 2, ..., M) in each of the N Beam instances of the BS TX, in its paging slot determined by the MSID. Here, the MS does not need to use its MS RX beam instance (y = 1, 2, ..., M) for the first M signal transmission from each BS TX beam instance, (BS TX, MS RX) has good signal strength or a good specific value, the MS may know that one or more of the RX beam, beam pattern or beam Instance or one or more RX beams, beam patterns or beam instances of a good beam pair (BS TX, MS RX). The MS receives a BS TX message at the exact timing at which the desired message is received. For example, the MS may transmit a BS TX beam of a superior beam pair (BS TX, MS RX), a beam pattern, Lt; RTI ID = 0.0 > RX. In another example, the MS monitors a subset of the first M signal transmissions of the BS TX beam instance to be monitored.

In this example, each signal transmission in the same BS TX beam instance (or beam adjustment) has a different sized paging message. For example, the first signal transmission in the first BS TX beam instance in the first paging slot for the first paging message includes the paging signal for MS 1, 3, 5, 7, 9, 11, 13 and 15 , The second signal transmission in the first BS TX beam instance within the first paging slot for the first paging message includes the paging signal for MS 5, 7, 9, 11, 13 and 15.

An MS with a different number of M monitors different number of signal transmissions in each BS TX beam instance. It only has to monitor these signal transmissions in each BS TX beam instance including the paging signal to the MS.

This example can reduce the overhead of the paging signal or reduce the paging message length.

In one embodiment, the paging timing for the MS with the identifier MS_ID and number M as the MS RX beam for use in the idle mode for the MS RX to terminate the one-beam adjustment in the idle mode is calculated as paging_message_signal_transmission May be an index set of signal transmissions in a TX beam instance or an index of a set:

In another embodiment, the paging timing for the MS with the identifier MS_ID and number M as MS RX for use in the idle mode for the MS RX to terminate the one-time beam adjustment in the idle mode may be calculated as follows:

Here, the hash function may be, for example, a modulo function, an arbitrary extraction function or any mapping, where A is a function g of MS_ID and P, and B is a function of M and K.

For example, you can use the modulo as a hash function and assume the following:

Here, the function int (.) Takes on the integer part of the value, and B is the number of possible ways of choosing M of K times. In this example, the paging timing is:

The result value J is the index of the (K choose M) choice, and the MS uses the (K choose M) selection from the J-th choice.

Alternatively, you can choose the number of possible ways to select consecutive M's of B = K.

Paging timing can be used based on an arbitrary extraction function as follows:

Where random_f (B) is a function arbitrarily selected from set (1, ..., B).

Another example of an arbitrary extraction function is as follows:

Where random_num is a random number generated by a particular seed.

For example, random_num may be any integer random number generated using a particular seed. The MS and the network or the BS must use exactly the same random number generation and the same seed.

18 shows another example of the paging message and the timing using the mapping function according to the embodiment of the present invention. Figure 11 is for illustration only. Other embodiments are possible without departing from the scope of the present invention.

In FIG. 18, during one paging message duration, the base station keeps its TX beam or beam instance for a predetermined time, then moves to a second beam or beam instance and ends until it ends the N beam instance, where N = 3. In one beam instance, BS TX transmits a K signal transmission, and the K signals may be the same or different. There are two paging slots in one paging cycle, each slot for one paging message.

For each MS, it is included in the first slot (e.g., paging message 1) if its MSID is odd and there is a paging message for the MS. If the MSID is even and there is one paging message for the MS, it is included in the second slot (e.g., paging message 2).

The paging message for the MS with M = 1, the number of MS RX beam instances for use in the idle mode for the MS RX to terminate the one-time beam adjustment, is determined by the N-beam of the BS TX in its paging slot determined by the MSID And is included in the first signal transmission in each instance. The paging message for the MS with the number M has its own RX beam instance (y = 1, 2, ..., N) for transmission of these first M signals from each BS TX beam instance in its paging slot determined by the MSID. ..., M), it is included in the first M signal transmissions (y = 1, 2, ..., M) in the N beam instances of each BS TX. Here, M may be any value among 1, 2, 3, and K = 4.

If the MS has a number M which is the number of MS RX beam instances for use in the idle mode for the MS RX to terminate the one-time beam adjustment, then the MS shall determine each BS TX beam instance (Y = 1, 2, ..., M) for their first M signal transmission from each BS TX, using their M RX beam instances (y = 1, 2, ..., M). Here, M may be any value among 1, 2, 3, and K = 4.

Alternatively, the MS monitors each first M signal transmission (y = 1, 2, ..., M) in each of the N Beam instances of the BS TX, in its paging slot determined by the MSID. Here, the MS does not need to use its own RX beam instance (y = 1, 2, ..., M) for the first M signal transmission from each BS TX beam instance, (BS TX, MS RX) has good signal strength or a good specific value, the MS may know that one or more of the RX beam, beam pattern or beam Instance or one or more RX beams, beam patterns or beam instances of a good beam pair (BS TX, MS RX). The MS receives a BS TX message at the exact timing at which the desired message is received. For example, the MS may transmit a BS TX beam of a superior beam pair (BS TX, MS RX), a beam pattern, Lt; RTI ID = 0.0 > RX. In another example, the MS monitors a subset of the first M signal transmissions of the BS TX beam instance to be monitored.

The MS may determine M specific selected signal transmissions (y = 1, 2, ..., M) in the N beam instances of each BS TX for a paging message conveying its desired information, The algorithm for selection is the same as the algorithm used in the network or base station.

In this example, each signal transmission in the same BS TX beam instance (or beam adjustment) has a different sized paging message. For example, the first signal transmission in the first BS TX beam instance in the first paging slot for the first paging message includes the paging signal for MS 1, 3, 5, 9, 11, 13 and 15, The second signal transmission in the first BS TX beam instance in the first paging slot for the first paging message includes the paging signal for MS 7, 9, 11, 13 and 15.

The MS with the other M monitors the different number of signal transmissions in each BS TX beam instance. It only has to monitor these signal transmissions in each BS TX beam instance including the paging signal to the MS.

This example can reduce the overhead of the paging signal or reduce the paging message length. The timing is within a unit of, e.g., a slot, a subframe, a frame, or a superframe.

In one embodiment, a paging beam, beam or beam pattern (beam shape, number of beams, beam width, beam direction, etc.) for the paging channel is used for paging (e.g., beam for sync channel, beam for BCH, physical data a beam for a PDCCH providing data control information such as a beam for a physical control format indicator channel (PCFICH), a resource allocation for data, power control information, etc. indicating a format for the control channel) (I.e., the MS can know which RX beam is superior to receive the TX beam) before the downlink RX paging message is transmitted, and if the result is the same as the downlink beam used by the MS The MS may use an already known good RX beam to receive the paging message.

When the UE is in idle mode and the UE wakes up to monitor paging, the UE returns to the original state to first monitor the BS's sync channel. Through measurements from the sync channel, the UE can determine what beam is good reception beam to receive the downlink signal. The UE receives the broadcast channel information. If the beam for another channel (e.g., the beam for PCFICH indicating the format for the PDCCH, for PDCCH, etc.) is the same as the beam for the sync channel or PBCH (e.g., beam pattern, (In terms of number of beams, beam width, beam direction, etc.), the UE uses an RX beam that is superior to receive the beams of the PCFICH and PDCCH that are the same as the RX beam to receive the beam for the sync channel or PBCH.

An indication indicating whether a paging message is sent in a subframe or frame, etc. may be transmitted over the same TX beam as the sync channel, PBCH, PCFICH, PDCCH, and so on. These indications are explicitly sent to the payload or implicitly in the message. For example, the indication may include a reserved scrambling code for paging (e.g., Radio Network Temporary Identifier reserved for paging, P-RNTI) used to de-mask the CRC to scramble the cyclic redundancy check (CRC) ). ≪ / RTI >

If the paging message is transmitted using the same beam pattern as the beam pattern for the sync channel, PBCH, PCFICH, or PDCCH, etc., then the UE may determine that the detected paging indication Lt; RTI ID = 0.0 > RX < / RTI > The reference signal is located in the beam for the sync channel, PBCH, PCFICH, or PDCCH, so that MS measurements are performed on the reference signal. If the reference signal is not located in the same beam as this sync channel, the measurement is performed on the beam signal itself.

For example, MSs 1, 3, 5, ..., 15 in Figures 15 and 16 are RXs of the best beam pair (BS TX, MS RX) to receive transmission from the BS TX beam among the best beam pairs Beam is used. Because the BS TX of the best pair is already known to the MS, the MS can open its RX at the correct timing to receive the best of the pair BS TX, It is not necessary to open RX (i.e., the monitoring window of the MS (the graph shown in Figs. 15 and 16) becomes shorter). Also, the MS does not need to use the RX beam except for the RX beam in the best beam pair (BS TX, MS RX). Furthermore, the number K in the figure does not need to be larger than the maximum value of M in the MS. K is independent of M. The maximum value of K is 1.

In the embodiment shown in Figures 15 and 16, each RX beam in the best beam pair (BS TX, MS RX) has the same K to obtain the paging message associated with the MS. For example, MS1 has 3 as well as MS7 has 3 as well. In another embodiment, multiple MS RX beam instances may be used to receive the desired message, instead of the best MS RX beam. Microsoft uses soft decodings for soft combinals to decode the information it needs. The best beam pair (BS TX, MS RX) is based on a metric such as signal strength, signal to noise ratio, reference signal received power (RSRP), reference signal received quality (RSRQ), signal to interference ratio,

For example, in FIGS. 17 and 18, each MS 1, 3, 5, ..., 15 may be configured to receive the best beam pair (BS TX, MS RX) RX beam is used. Because the BS TX beam of the best beam pair is already known to the MS, the MS has to open its RX at the correct timing to receive the best beam's BS TX, and the MS has its RX It is not necessary to open the beam (i.e. only the MS RX graph immediately below the best pair BS TX is shown in the figure, and no other MS RX graph under BS TX except the best pair BS TX is needed). Moreover, the number K in Figures 17 and 18 need not be greater than the maximum value of M in the MS. K is independent of M. The maximum value of K is 1.

Each RX beam in the best beam pair (BS TX, MS RX) shown in Figures 17 and 18 has the same K to obtain the paging message associated with the MS. For example, MS1 has 3 as well as MS7 has 3 as well. In another embodiment, multiple MS RX beam instances may be used to receive the desired message, instead of the best MS RX beam. Microsoft uses soft decodings for soft combinals to decode the information it needs.

In one embodiment, the beam pattern (beam shape, number of beams, beam width, beam direction, etc.) for the paging message is the same as the downlink beam pattern used by the MS in the previous step to receive the paging message. For example, the beam pattern for the paging message is the same as the beam's downlink beam pattern that conveys information about the paging indicator that indicates whether the paging message is included in the current subframe, frame, or the like.

Figures 19A-19H illustrate some examples according to embodiments of the present invention. Figures 19a-19h are for illustration only. Other embodiments are possible without departing from the scope of the present invention.

19A-19H, the UE uses the beam transmitted in the previous step to obtain the paging message for coordinating the UE RX beam. The paging message uses the same beam pattern as the beam in some previous steps, so that the UE uses an excellent RX beam to receive the paging message. In steps 1901 to 1905 in FIG. 19A and steps 1952 to 1956 in FIG. 19B, the UE uses the PCFICH to adjust the UE RX beam. The paging message uses the same beam pattern as the PCFICH. In steps 1907 to 1911 of FIG. 19C and steps 1958 to 1962 of FIG. 19D, the UE uses the sync channel beam to adjust the UE RX beam. The paging message uses the same beam pattern as the sync channel. In steps 1913 to 1917 of FIG. 19E and steps 1964 to 1968 of FIG. 19F, the UE uses a PBCH (primary broadcast channel or master information block (MIB)) to adjust the UE RX beam. The paging message uses the same beam pattern as the PBCH. In steps 1919 to 1923 of FIG. 19g and steps 1970 to 1974 of FIG. 19h, the UE uses the reference signal to adjust the UE RX beam. The paging message uses the same beam pattern as the reference signal.

The UE uses one or more of the following steps to obtain a paging message: a sync channel, a PBCH, a PCFICH, a PDCCH (indicating an indication of whether there is a resource allocation for a paging message and a paging message) Or a paging channel including a paging message).

As shown in FIG. 19A, when the UE wakes up from the idle mode and monitors paging, it skips the sync channel and the PBCH and proceeds to the PCFICH immediately (step 1901). If the PCFICH conveys the beam index (step 1903) and the UE can repeatedly determine which UE RX beam is good or which DL beam TX and RX pair is better, then the UE can use the PDCCH to receive information about the PDCCH and the PDSCH Knowing which RX beam is superior. The PDCCH carrying the paging index may use the same beam pattern as the PCFICH (although it does not have to be repeated for UE RX beam steering purposes). Then, if the paging indicator indicates that a paging message is received, the UE goes to the location of the paging message to acquire the paging message (step 1905). A similar scenario is applied to the sync channel, the PBCH channel and the reference signal in Figures 19b-19h.

In one embodiment, the beam for the PDCCH may carry a signal with the PDCCH or PCFICH. The signal is used for beam steering by the MS to determine a good RX beam or a good beam pair (BS TX, MS RX). The signal may be, for example, a reference signal, a cell specific reference signal, or the like.

Some channels, such as the sync channel, PBCH, PCFICH, PDCCH, reference signal, cell specific reference signal, reference signal for beam, etc., are designed in a repetitive manner for the beam instance and the beam is designed to be a good RX beam or a good beam pair TX, and MS RX). When the MS returns from the DRx mode, although in the connected mode, the MS transmits a sync channel, a PBCH, a PCFICH, a PDCCH, a reference signal, Such as a reference signal for the downlink beam.

In one embodiment, a paging beam or beam or beam pattern (beam shape, number of beams, beam width, beam direction, etc.) for the paging channel is used for paging (e.g., beam for sync channel, beam for BCH, The downlink RX beam is not adjusted before the paging message is transmitted (i.e., when the MS determines that some RX beam is in the TX Knowing that it is better to receive the beam), so that the MS uses all RX beams to receive the paging message. The number K need not be larger than the maximum value of M among all MSs.

The paging method described herein may be used for the purpose of transmitting a system call to an MS under certain circumstances, such as updating of system information, earthquake, emergency situation, or the like. Some other reserved scrambled coders may be used for the PDCCH. However, messages required by the MS (eg, new system information, earthquakes, emergency situations, and paging messages for public safety) may indicate that information about the paging indicator or paging message is present, And uses the same beam or beam pattern as the PDCCH or other channel to convey an indicator indicating whether a message for public safety, etc. is present in a subframe or frame or the like.

In one embodiment, the UE monitors the PDCCH at the timing set by the DRx parameter to check whether scramble code for paging (e.g., the P-RNTI used to demodulate the CRC of the PDCCH) is held in the idle mode. The PDCCH is used to adjust the RX beam of the UE. The paging message must be transmitted on the same beam as the PDCCH beam. The UE then uses its own excellent RX beam for receiving the paging message.

Alternatively, the paging indication may be sent on the same beam as the SCH or BCH. The UE then adjusts the RX beam. The paging message shall be transmitted in the same beam as the SCH or BCH. The shared channel, PDSCH, may be, for example, the same TX beam configuration for the paging message and for the SIB. If a paging message is transmitted over the unregulated beam for the RX of the UE, further coordination is needed.

Although the present invention has been described through an exemplary embodiment, It will be apparent to those skilled in the art that various modifications and variations are possible. Modifications and variations are possible without departing from the scope of the appended claims.

Claims (20)

A method for configuring paging by a mobile station in a wireless network,
Transmitting to the base station a parameter M indicative of the number of receive (RX) beam instances of the mobile station for ending the one-time beam adjustment in the idle mode;
Determining a timing for receiving a paging message from the base station; And
And receiving the paging message from the base station based on the determined timing,
Wherein the timing is a function of the parameter M and the paging message comprises a mobile station identifier.
2. The method of claim 1, wherein the function comprises at least one of a hash function and an arbitrary extraction function.
2. The method of claim 1, wherein the function is configured to balance the length of a plurality of paging signals transmitted from the base station for each beam adjustment of a base station transmitter.
2. The method of claim 1, wherein the timing for receiving the paging message is a function of at least one of a parameter associated with beam transmission of the base station and the mobile station identifier.
2. The method of claim 1, wherein the parameter M is transmitted to the base station at the initial network entry, before entering the idle mode at network re-entry, or at location update.
A mobile station apparatus for receiving a paging message in a wireless network,
At least one antenna; And
A processor coupled to the at least one antenna,
The processor comprising:
The mobile station sends a parameter M to the base station indicating the number of RX beam instances of the mobile station to end the beam adjustment once in the idle mode;
Determining a timing for receiving a paging message from the base station,
And receiving the paging message from the base station based on the determined timing,
Wherein the timing is a function of the parameter M and the paging message comprises a mobile station identifier.
7. The apparatus of claim 6, wherein the function comprises at least one of a hash function and an arbitrary extraction function.
7. The apparatus of claim 6, wherein the function is configured to balance the length of a plurality of paging signals transmitted from the base station for each beam adjustment of a base station transmitter.
7. The apparatus of claim 6, wherein the timing for receiving the paging message is a function of at least one of a parameter associated with beam transmission of the base station and the mobile station identifier.
7. The apparatus of claim 6, wherein the processor transmits the parameter M to the base station when the mobile station enters an initial network, before entering a idle mode upon network re-entry, or when updating a location.
A method for configuring paging by a base station in a wireless network,
Receiving, from the mobile station, a parameter M indicative of the number of receive (RX) beam instances of the mobile station for ending the one-time beam adjustment in the idle mode;
Determining a timing for transmitting a paging message to the mobile station; And
And transmitting the paging message to the mobile station based on the determined timing,
Wherein the timing is a function of the parameter M and the paging message comprises a mobile station identifier.
12. The method of claim 11, wherein the function comprises at least one of a hash function and an arbitrary extraction function.
12. The method of claim 11, wherein the function is configured to balance the length of a plurality of paging signals transmitted from the base station for each beam adjustment of a base station transmitter.
12. The method of claim 11, wherein the timing for receiving the paging message is a function of at least one of a parameter associated with the beam transmission of the base station and the mobile station identifier.
12. The method of claim 11, wherein the parameter M is received from the mobile station at the initial network entry, before entering the idle mode at network re-entry, or at location update.
A base station apparatus for receiving a paging message in a wireless network,
At least one antenna; And
A processor coupled to the at least one antenna,
The processor comprising:
Wherein the mobile station receives from the mobile station a parameter M indicative of the number of receive (RX) beam instances of the mobile station for ending the one-time beam adjustment in the idle mode,
Determining a timing for transmitting a paging message to the mobile station,
Transmitting the paging message to the mobile station based on the determined timing,
Wherein the timing is a function of the parameter M and the paging message comprises a mobile station identifier.
17. The apparatus of claim 16, wherein the function comprises at least one of a hash function and an arbitrary extraction function.
17. The apparatus of claim 16, wherein the function is configured to balance the length of a plurality of paging signals transmitted from the base station for each beam adjustment of a base station transmitter.
17. The apparatus of claim 16, wherein the timing for receiving the paging message is a function of at least one of a parameter associated with the beam transmission of the base station and the mobile station identifier.
17. The apparatus of claim 16, wherein the processor receives the parameter M from the mobile station at an initial network entry, before entering the idle mode at network re-entry, or at location update.

Images