KR20160121358A - Apparatus and method for communicating through random access - Google Patents

Apparatus and method for communicating through random access Download PDF

Info

Publication number
KR20160121358A
KR20160121358A KR1020150130823A KR20150130823A KR20160121358A KR 20160121358 A KR20160121358 A KR 20160121358A KR 1020150130823 A KR1020150130823 A KR 1020150130823A KR 20150130823 A KR20150130823 A KR 20150130823A KR 20160121358 A KR20160121358 A KR 20160121358A
Authority
KR
South Korea
Prior art keywords
message
index
preamble
base station
random access
Prior art date
Application number
KR1020150130823A
Other languages
Korean (ko)
Other versions
KR101678792B1 (en
Inventor
성단근
장한승
김수민
Original Assignee
한국과학기술원
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 한국과학기술원 filed Critical 한국과학기술원
Priority to PCT/KR2016/001728 priority Critical patent/WO2016163642A1/en
Priority to US15/502,857 priority patent/US10231196B2/en
Publication of KR20160121358A publication Critical patent/KR20160121358A/en
Application granted granted Critical
Publication of KR101678792B1 publication Critical patent/KR101678792B1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/24Radio transmission systems, i.e. using radiation field for communication between two or more posts
    • H04B7/26Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
    • H04B7/2612Arrangements for wireless medium access control, e.g. by allocating physical layer transmission capacity
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0007Code type
    • H04J13/0055ZCZ [zero correlation zone]
    • H04J13/0059CAZAC [constant-amplitude and zero auto-correlation]
    • H04J13/0062Zadoff-Chu

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Provided is user equipment (UE) including a processor and executing a random access procedure with a base station (E-UTRAN node B (eNodeB), also known as evolved node B). The UE is at least temporarily embodied by the processor. The UE includes: a determination unit for determining a message size which enables transmission and corresponds to a physical random access channel according to an assigned communication scheme with the base station; a calculation unit for configuring a message to correspond to the message size, and respectively calculating a preamble index and at least one message index from the message; and an encoder for encoding the preamble index and the at least one message index each, to transmit the encoding result to the base station.

Description

TECHNICAL FIELD [0001] The present invention relates to a communication apparatus and a method for communicating through a random access procedure,

The present invention relates to a method of communication between terminals performing wireless communication and / or between a terminal and a base station, and more particularly relates to a communication method of devices performing a random access (RA) process for communication.

The rapid development of Information and Communications Technologies (ICT) is expected to be a Hyper-connected Society in the not-too-distant future. The second connection society is known as a society in which all objects including people, processes, data, and objects are connected by a network. The core constituent of this technology is Machine to Machine (M2M) or Internet Things.

In such a hyperlinked society, the number of independent devices performing communication will increase exponentially. According to Cisco data, things connected to the Internet (machines, communications equipment, terminals, etc.) will increase from about 10 billion in 2013 to about 50 billion by 2020, and all objects (people, processes, data, It is called Internet of Everything (IoE). In the case of such a rapid expansion of the Internet infrastructure of objects, a very large number of nodes must perform wireless connection, thereby causing radio access collision and radio resource shortage due to the radio resource request processing.

Meanwhile, among the conventional communication methods, the cellular communication method maintains connection disconnection to the network except for message transmission in order to save energy and starts communication through a random access when communication with the network is required. In the above-described hyperlinked society, the communication nodes often transmit relatively small-sized data such as device status messages, sensing data, and smart metering data. In this case, If communication is performed by allocating a separate resource after connection, the communication overhead may be large compared with the data transmission amount.

Various aspects and embodiments of a method of data transmission through a random access procedure and an apparatus therefor are presented. More concretely, a new random access procedure can be performed in parallel with and / or instead of the previous random access scheme, and the devices can more efficiently transmit data in this process. Illustrative, but not limiting, aspects are described below.

According to an aspect of the present invention, a UE includes a processor, a base station (eNodeB: E-UTRAN Node B, also known as Evolved Node B) and a UE (User Equipment) performing a random access procedure. The terminal may be implemented at least temporarily by the processor. Wherein the terminal comprises: a determining unit for determining a size of a transmittable message corresponding to a physical random access channel according to a designated communication scheme with the base station; a message setting unit for setting a message corresponding to the message size and extracting a preamble index and at least one message index And an encoder for encoding each of the preamble index and the at least one message index and transmitting the encoded data to the base station.

According to an embodiment, the determining unit may determine the transmittable message size according to the number of the jadopu sequence length, the number of preamble sequences, and the number of the message root index functions corresponding to the designated communication method. In addition, in the case of transmitting a message that is larger than the Zadoff Chu sequence length corresponding to the designated communication scheme, the determination unit determines to transmit the increased message using a plurality of subframes corresponding to the physical random access channel .

According to another embodiment, the operation unit may calculate at least one message route index different from the preamble root index by using each of at least one message route index function having the preamble index as an independent variable. In another embodiment, the operation unit repeatedly extracts at least one message bit string corresponding to each of the at least one message route index from a start bit of the set message, and extracts a preamble bit string from the remaining message .

According to another embodiment, the encoder may further comprise: a preamble sequence in which a jadopause sequence corresponding to a preamble root index is cyclically shifted by a constant value corresponding to the preamble index, and a preamble sequence corresponding to each of the at least one message root index And generating a message sequence in which a chime sequence is circularly shifted by a sum of a constant value corresponding to the preamble index and the at least one message index, and transmits the message sequence to the base station.

According to another embodiment, the terminal further comprises a selection unit for selecting any one of a preamble transmission mode and a message concurrent transmission mode, and when the selection unit selects the preamble transmission mode, the encoder encodes the preamble index To the base station.

According to another aspect of the present invention, there is provided a terminal for recognizing a preamble collision and performing a backoff in a second stage of random access. Wherein the terminal comprises: a determination unit for determining whether a random access response message corresponding to the transmitted sequence is received; and a backoff corresponding to a predetermined time interval when the random access response message is not received according to a result of the determination And a control unit for performing the control. The transmitted sequence may include a preamble and at least one message.

According to an embodiment, when the random access response message is received according to a result of the determination, the controller may transmit an additional message to the base station using uplink resources included in the random access response message.

According to another aspect, a base station is provided that includes a processor and performs a random access procedure with a terminal. The base station may be at least temporarily implemented by the processor. The BS can determine whether the preamble collision is to be performed in the first stage of random access using the correlation value of the message index related to the preamble.

The base station includes an operation unit operable to calculate a received preamble index using a sequence received from the mobile station and a Zadoff Chu sequence associated with the preamble, and a mobile station to transmit the preamble sequence using a Zadoff Chu sequence associated with a message route index determined by the preamble index. And a determination unit for determining whether the preamble is collided. The determination unit may calculate a correlation value between the received sequence and the Zadoff Chu sequence associated with the message route index, and may determine the collision of the preamble when the peak value of the correlation value exceeds a predetermined threshold value .

According to an embodiment, the base station may further include a decoder for decoding a message transmitted by the terminal through the random access procedure using the preamble index and the message index. When the preamble does not collide with the result of the determination by the determination unit, the operation unit may calculate the message index using the received sequence and the Zadoff Chu sequence associated with the message root index.

According to another aspect of the present invention, there is provided a base station that simultaneously detects a preamble index and a message index to implement connectionless data transmission / reception with a terminal. The BS calculates a correlation value corresponding to a correlation value corresponding to a preamble index and at least one message index using a sequence received from the MS and a correlation value corresponding to the preamble index and a correlation value corresponding to the at least one message And a detector for detecting each of the preamble index and the at least one message index based on the correlation value corresponding to each index.

According to an embodiment, the arithmetic unit may calculate at least one message route index determined according to the preamble index using at least one message index function, and calculate a Zadoff Chu sequence corresponding to the at least one message route index To calculate a correlation value corresponding to each of the at least one message index.

According to another embodiment, the detector compares the position number corresponding to the peak of the correlation value corresponding to the preamble index and the position number corresponding to each peak of the correlation value corresponding to the at least one message index, Each one of the message indexes can be detected.

According to another embodiment, the apparatus may further include a decoder for decoding the message transmitted by the terminal through the random access procedure using the at least one message index and the preamble index. The decoder may identify a predetermined prefix bit in the decoded message and determine an operation mode of the terminal according to the prefix bit. The decoder may further include a first mode for transmitting a subsequent message using random access resources, a second mode for transmitting the message over a single frame and terminating the transmission, and a third mode for transmitting the subsequent message through an additional frame May be determined as the operation mode. More specifically, when the operation mode is the first mode, the decoded message may include a scheduling request including resource block size information for transmitting the subsequent message. On the other hand, when the operation mode is the third mode, the decoder can determine that the message is part of the entire message transmitted by the terminal, and merge the subsequent message decoded in the additional frame.

According to another aspect, a method is provided in which a base station performing a random access procedure with a plurality of terminals controls a connection load. The method comprising the steps of: detecting at least one message index corresponding to each of the preamble indices in a plurality of received sequences; calculating an access load corresponding to the number of detected at least one message index; And comparing the connection load and controlling the connection period of the physical random access channel according to the comparison result.

According to an embodiment, the controlling of the connection period may set the T RACH corresponding to the connection period to be larger when the connection load is smaller than the threshold, and when the connection load is larger than the threshold, And setting the T RACH corresponding to the period to be smaller.

1 is a flowchart illustrating a random access procedure between a mobile station and a base station according to an exemplary embodiment of the present invention.
2 is a flowchart illustrating a random access procedure using a single frame of a terminal and a base station according to an exemplary embodiment.
3A and 3B are flowcharts illustrating a random access procedure using a dual frame of a terminal and a base station according to an exemplary embodiment.
4A and 4B are flowcharts illustrating a random access procedure using a multi-frame of a terminal and a base station according to an exemplary embodiment.
5 is a flowchart illustrating a random access procedure between a terminal and a base station according to another embodiment.
6 is a block diagram illustrating a terminal according to one embodiment.
FIG. 7 illustrates an example of a method for determining at least one message index and a preamble index according to an exemplary embodiment of the present invention. Referring to FIG.
8A and 8B are flowcharts of a communication method in which a terminal according to an embodiment performs a random access procedure to a base station.
9 is a block diagram illustrating a terminal according to another embodiment.
10 is a block diagram illustrating a base station in accordance with one embodiment.
11 is a graph illustrating a process of detecting a message index according to an embodiment of the present invention.
FIG. 12 is an exemplary diagram illustrating a method for determining a first message index, a second message index, and a preamble index to decode a message according to an exemplary embodiment.
13 is a block diagram illustrating a base station in accordance with another embodiment.
14A and 14B are graphs showing a process of detecting a preamble collision according to an embodiment.
15 is a flowchart of a method of detecting a preamble collision by a base station using a sequence transmitted from a terminal in a random access procedure according to an embodiment.
16 is a flowchart illustrating a communication method of a base station that controls access load using a detected message index according to an embodiment.

In the following, embodiments will be described in detail with reference to the accompanying drawings. However, the scope of the rights is not limited or limited by these embodiments. Like reference symbols in the drawings denote like elements. The terms used in the following description are chosen to be generic and universal in the art to which they are related, but other terms may exist depending on the development and / or change in technology, customs, preferences of the technician, and the like. Accordingly, the terminology used in the following description should not be construed as limiting the technical thought, but should be understood in the exemplary language used to describe the embodiments.

Also, in certain cases, there may be a term chosen arbitrarily by the applicant, in which case the meaning shall be stated in the corresponding description. Therefore, the term used in the following description should be understood based on the meaning of the term, not the name of a simple term, and the contents throughout the specification.

1 is a flowchart illustrating a random access procedure between a mobile station and a base station according to an exemplary embodiment of the present invention. Referring to FIG. 1, a terminal may encode a message together with a preamble using a physical random access channel (PRACH), and transmit the message to a base station. In one embodiment, the message may be scheduling request information for additional data transmission. In another embodiment, the message may be an alarm message to inform the base station of an emergency based on the sensed data. Considering the fact that the Internet age is accelerating, there is a need for a communication method that can control extremely many nodes using limited control plane resources. Accordingly, a communication method that performs transmission and reception without connection between a terminal and a base station through a random access for a short message like the present embodiment can be presented as a solution thereof.

In step 110, the mobile station transmits a message including a scheduling request to a base station together with a preamble using a physical random access channel. In step 120, a resource is allocated from a base station. In step 130, the UE may transmit UE ID (User Equipment Identification) information and a desired message to the BS to increase the transmission efficiency.

In step 110, the terminal may send a transmission sequence including a preamble and a message to the base station. In one embodiment, the terminal may set a specific bit of the message as a prefix bit. The prefix bit is a bit that enables the base station to identify and determine the application technology associated with the decoded message. In one embodiment, the prefix bit may be associated with a scheduling request. In this case, the terminal transmits a message including size information of a desired resource block together with the prefix bit. The size of the resource block is associated with a subsequent message size to be transmitted subsequently. In the following description, a scheduling request message is initiated as an example of a message transmitted together with a preamble in step 110, but the message may be changed into various types of messages that can be transmitted according to resources of a physical random access channel.

Step 120 is a step in which the base station transmits a random access response message to the terminal. The base station may calculate a second correlation value between the received sequence and a second Zadoff-Chu sequence corresponding to the first message. The BS may compare the size of the second correlation value with a threshold value to determine whether the random access scheme of the MS is a conventional scheme or a new message concurrent transmission scheme. Illustratively, the base station may determine based on the decoded prefix that the message is associated with a scheduling request. Therefore, the base station can allocate the resource block in response to the scheduling request. The base station can send an ACK for the message to the terminal. In addition, the base station can transmit uplink resource grant information to the node through the random access response message.

In step 130, the terminal can transmit data using the PUSCH allocated from the base station. In step 130, the terminal may transmit a desired message and a terminal identifier together.

In step 140, the base station may receive data including a desired message and a terminal identifier from the terminal. In addition, the base station may transmit an ACK for the data to the terminal. The transmission may be performed through a PDSCH (Physical Downlink Shared Channel). Also, in step 140, the base station may send a contention resolution message to the terminal.

2 is a flowchart illustrating a random access procedure using a single frame of a terminal and a base station according to an exemplary embodiment. FIG. 2 illustrates a process of transmitting and receiving a message using a resource corresponding to a first step and a second step in a random access procedure. Transmission efficiency can be expected because transmission and reception of small data can be performed in a random access procedure without using resources of a separate PUSCH.

In step 210, the terminal may transmit a transmission sequence including a preamble and a message to the base station. The message bits may include at least one of a prefix, a terminal identifier and a desired message. The prefix may transmit all of the message and indicate there is no further message transmission thereafter.

As an example, the terminal identifier may use location information such as the latitude and longitude of the machine node. Since there is no need to separately allocate other special unique terminal identifiers, it is possible to describe applicability to more machine nodes and high applicability. For example, it is possible to set up wildlife location information as a terminal identifier and state information in a desired message to realize a network capable of rapid localization and state recognition.

In another embodiment, the Logical ID designated by the base station may be used as the terminal identifier. By constructing a space group in a cell, it is possible to recycle the same Logical ID among different space groups, so that it is possible to provide a terminal identifier to many nodes and terminals.

In another embodiment, the base station can set a group of TA ranges by assigning a range of values of Timing Alignment (TA) only to fixed nodes. Each node belongs to a corresponding respective TA group. In addition, the base station can assign the same Logical ID to the nodes belonging to different TA groups, recycle the Logical ID, and provide the terminal identifier to many nodes.

In step 220, the base station may send a random access response message to the terminal. As described above, since the data can be transmitted and received without using the resources of the PUSCH, the random access response message may not include the uplink resource grant. In addition, in step 220, the base station may transmit an ACK of the message received in step 210 to the terminal.

3A and 3B are flowcharts illustrating a random access procedure using a dual frame of a terminal and a base station according to an exemplary embodiment. Referring to FIGS. 3A and 3B, there is a similarity with FIG. 2 in that a message is transmitted and received using a resource corresponding to a first step and a second step in a random access procedure. However, there is a difference from the embodiment shown in FIG. 2 in that data is divided into two frames instead of one frame.

Referring to FIG. 3A, in step 310, a terminal may transmit a transmission sequence including a preamble and a message to a base station. In step 310, the message bit may comprise a first prefix. In the embodiment shown in FIG. 3A, the terminal transmits a part of a message through a first frame and transmits a subsequent message through a second frame. Accordingly, the first prefix included in the message bits transmitted in step 310 may represent a communication method of transmitting a part of the entire message and then transmitting a subsequent message. More specifically, the first prefix may indicate the number of frames in which the entire message is divided. The base station may decode the first prefix to determine whether it should receive an additional number of frames to be transmitted from the terminal.

As an example, in step 310, the message bits may include a terminal identifier. In this case, the terminal may transmit the entire desired message (step 330).

In another embodiment, at step 310, the message bits may include a portion of a terminal identifier and a portion of a desired message. In this case, the terminal may transmit the remaining portion of the terminal identifier and the remaining portion of the desired message to the base station at step 330. [ The base station may decode the message by combining the received messages in steps 310 and 330. [ In this case, the base station may perform an effective matching between the terminal identifier and the desired message. In addition, the base station may use the TA (Timing Alignment) information used in steps 310 and 330 to perform the matching of the terminal and the dual frame message.

In step 320, the base station may send a random access response message and an ACK to the terminal. However, unlike the case illustrated in FIG. 3B, in FIG. 3A, in each case of receiving a portion of a message, the base station may send a random access response message and an ACK, such as step 320 and step 340, to the terminal.

As described above, since the data can be transmitted and received without using the resources of the PUSCH, the random access response message may not include the uplink resource grant. In addition, in step 320, the base station may transmit an ACK of the message received in step 310 to the terminal.

In step 330, the terminal may transmit a transmission sequence including a preamble and a message to the base station. At step 330, the message bit may comprise a second prefix. The second prefix may indicate the communication method of transmitting the remainder of the entire message and ending the transmission.

In step 340, the base station may send a random access response message to the terminal. In addition, in step 340, the base station may transmit an ACK of the message received in step 330 to the terminal.

Referring to FIG. 3B, in step 350, the terminal may transmit a transmission sequence including a preamble and a message to a base station. In a manner similar to step 310, the message bits may include a first prefix, which may represent a communication method of transmitting a portion of an entire message and subsequently transmitting a subsequent message.

In step 360, the terminal may transmit a transmission sequence including a preamble and a message to the base station. At step 360, the message bit may comprise a second prefix. The second prefix may indicate the communication method of transmitting the remainder of the entire message and ending the transmission.

In step 370, the base station may send a random access response message to the terminal. In addition, in step 370, the base station may transmit the ACK of the message received in step 350 and step 360 to the terminal. The communication method described in FIG. 3B is different from the communication method described in FIG. 3A. In step 370, the base station transmits a random access response message and an ACK to the UE after receiving the second prefix indicating that the transmission of the entire message is completed. Compared with the case of FIG. 3A, the base station will transmit an ACK once to the terminal when the second prefix is decoded. With the advent of the supercomputing society, efficient use of control plane resources used to control the very large number of nodes has been controversial. According to the embodiment as shown in FIG. 3B, the UE can perform connectionless data transmission / reception without consuming control plane resources for connection, and the base station transmits an ACK only once when complete data transmission / You will save resources.

4A and 4B are flowcharts illustrating a random access procedure using a multi-frame of a terminal and a base station according to an exemplary embodiment. Referring to FIG. 4A, steps 401, 403, 405, 407 and 409 are performed when the UE transmits a message and a preamble using resources of a PRACH for a random access procedure . Step 402, step 404, step 406, step 408 and step 410 are the steps in which the base station transmits a random access response message with an ACK for the message sent to the terminal.

The communication method of FIG. 4A will be apparent to those of ordinary skill in the art when referring to the communication methods described in FIGS. 2, 3A, and 3B. However, there may be a difference between the prefixes at each step. In step 401, the terminal may send a message bit containing the first prefix to the base station. In one embodiment, the first prefix may indicate that the terminal identifier is transmitted with the start of the message transmission. In steps 403, 405, and 407, the terminal may send a message bit containing the second prefix to the base station. In one embodiment, the second prefix may represent a method of communicating a continuous message. In another embodiment, in step 403, step 405 and step 407, the terminals can each transmit a different prefix to the base station. Each of the prefixes may indicate a succession of consecutive messages. Also, in step 409, the terminal may send a message bit containing the third prefix to the base station. The third prefix may indicate the end of transmission of the consecutive messages.

Referring to FIG. 4B, steps 411, 412, 413, 414, and 415 as described above are repeated until the terminal receives a message And transmitting the preamble. Referring to the description of Figure 4a to those skilled in the art, the steps of Figure 4b will be self explanatory. However, step 416 differs from that of FIG. 4A. In step 416, the base station will transmit a random access response message and an ACK to the terminal after receiving the prefix indicating that the transmission of the entire message is completed as in step 370.

5 is a flowchart illustrating a random access procedure between a terminal and a base station according to another embodiment. In step 510, the terminal may send a transmission sequence including a preamble and a message to the base station. The MS can select and use an arbitrary preamble corresponding to the designated communication scheme with the BS. More specifically, given the length N ZC of the Zadoff Chu sequence and the cyclic shifting size Ncs of the preamble sequence, the number N PA of preamble sequences that the terminal can transmit to the base station is given by the following equation 1 < / RTI >

Figure pat00001

Illustratively, when the terminal and the base station comply with the LTE standard, N ZC = 839 and Ncs = 13 are given, and the number N PA of preamble sequences can be determined to be N PA = 64 according to the following equation (1). Accordingly, the MS may select any one of the 64 preamble sequences and transmit the selected preamble to the MS through the physical random access channel.

However, in the case of the conventional random access method, a random access response message corresponding to the preamble will be transmitted from the base station to the mobile station using a Physical Downlink Shared Channel (PDSCH). If the base station does not decode a message received from a mobile station by using a physical uplink shared channel (PUSCH), the base station can recognize that there is a collision in the preamble used by the terminal.

There is a problem that the base station recognizes the collision of the preamble after transmitting a random access response message to the terminal and additionally allocating a resource part of the physical uplink shared channel to the terminal. There is a need to improve the conventional random access procedure considering the wireless network environment in which the number of nodes will rapidly increase in that it uses only unnecessary control plane resources and recognizes the collision of the preamble only through decoding failure of the message.

In step 520, the base station can detect the preamble index using the received sequence. In addition, the base station can additionally detect the message index using the received sequence. The BS can determine whether the preamble collides with the number of the detected message indexes. More specifically, when there are a plurality of detected message indexes, the base station may determine that a plurality of terminals use the same preamble and detect a collision of the preamble. If a collision of the preamble is detected, the base station may not transmit a random access response message for the preamble. The process by which the base station detects the message index will be described in more detail with the drawings added below.

In step 530, the terminal may determine whether a random access response message corresponding to the preamble has been transmitted. If it is determined that the random access response message has not been received, the terminal may perform a backoff corresponding to a predetermined time interval.

Although not shown in FIG. 5, when the random access response message is received according to the determination result, the terminal generates a scheduling request message using the uplink resources included in the random access response message, To the base station.

6 is a block diagram illustrating a terminal according to one embodiment. The terminal 600 may transmit a message to the base station using a physical random access channel in a random access procedure. Since the short messages can be transmitted and received together in the random access procedure, the transmission efficiency can be increased.

The terminal 600 may include a determination unit 610, an operation unit 620, and an encoder 630. The determining unit 610 may determine a transmittable message size corresponding to a physical random access channel according to a designated communication method with the base station. More specifically, the determination unit 610 can determine the size of a message that can be transmitted based on the random access information received from the base station. The random access information includes a preamble cyclic shift size Ncs, a number of preamble sequences N PA , a length of a subchord sequence N ZC , a preamble root index r and a message root index function set {k 1 = f 1 (i), k 2 = f 2 (i), ... , k N = f N (i)}. Where N is the number of elements in the message root index function set.

The determining unit 610 may determine the size of a message that can be transmitted based on Equation (2) below.

Figure pat00002

Assuming that Ncs = 13, N PA = 64, and N ZC = 839 are given when the LTE standard is followed, and N is 1, the determination unit 610 can determine that the message size of the current 15- have.

Illustratively, but not necessarily, assuming N equals 1, the determiner 610 may calculate the transmittable message size corresponding to N PA and N ZC as shown in Table 1 below. In the existing LTE standard, a 1-ms subframe is transmitted with a Zadoff-Chu sequence having a length of Nzc = 839 with a PRACH time axis length. In order to transmit the Zadoff Chu sequence of the increased length (Nzc> 839), the time axis length of the PRACH should be configured using a plurality of subframes.

In addition, when it is necessary for the terminal 600 to transmit a message that is greater than the Zadoff Chu sequence length corresponding to the designated communication mode, the determination unit 610 uses a plurality of subframes corresponding to the physical random access channel To send the increased message.

Nzc (length) 109 211 419 839 (LTE) 1667 3329 6659 N PA (number) 8 16 32 64 (LTE) 128 256 512 Message bit 9 11 13 15 (LTE) 17 19 21

In addition, when it is assumed according to the LTE standard that Ncs = 13, N PA = 64, and N ZC = 839, the determiner 610 determines the transmittable message size corresponding to the number of elements N of the message root index function set As shown in Table 2 below.

N (number) One 2 3 4 5 6 7 Message bit 15 24 33 42 51 60 69

The operation unit 620 may set a message to be transmitted by the terminal 600 within a transmittable message size, and may calculate a preamble index and at least one message index from the message, respectively. The operation unit 620 can set a message to be transmitted to the base station within the calculated message size. The arithmetic unit 620 calculates a preamble index based on the first bit string in the message from the first message index to the Nth message index based on the respective bit strings from the second bit string to the (N + 1) Each message index up to the index can be determined.

Wherein the first bit stream includes a first

Figure pat00003
Bit < / RTI > More specifically, the calculation unit 620 calculates
Figure pat00004
The preamble index i can be determined by converting a binary value corresponding to a bit into a decimal number. Each bit string from the second bit string to the (N + 1) th bit string is transmitted to each of the first to
Figure pat00005
Bit < / RTI > Similarly, the arithmetic operation unit 620 compares each of the first to N < th >
Figure pat00006
Converts a binary value corresponding to a bit into a decimal number,
Figure pat00007
To Nth message index
Figure pat00008
Can be determined. In one embodiment, the preamble index i is 0
Figure pat00009
- can be any one of integers up to 1. Illustratively, when N PA is a multiple of 2, the preamble index i can be any of the integers from 0 to N PA - 1. First message index
Figure pat00010
From 0
Figure pat00011
- can be any one of integers up to 1.

In another embodiment, the operation unit 620 repeatedly extracts at least one message bit string corresponding to each of the at least one message index from the start bit of the set message, and extracts a preamble bit string from the left message .

The encoder 630 may encode each of the preamble index and the at least one message index and provide them for transmission to the base station. Illustratively, the message index set includes a first message index

Figure pat00012
To Nth message index
Figure pat00013
To < / RTI > In addition, the encoder 630 may generate a preamble sequence using a Zadoff Chu sequence. The general formula for the Zadoffu sequence is shown in Equation 3 below.

Figure pat00014

r is a preamble root index and n is an integer from 0 to N ZC - 1. Based on Equation (3), the encoder 630 may generate a preamble sequence. In one embodiment, the generated preamble sequence is expressed by Equation (4) below.

Figure pat00015

N CS represents the cyclic shifting size determined based on the radius of a given cell. The encoder 630 generates a preamble sequence by cyclically shifting the Zadoff Chu sequence to a multiple of N CS . The encoder 630 can generate a preamble sequence by substituting the preamble index i calculated by the operation unit 620 according to Equation (4).

Meanwhile, the operation unit 620 may calculate at least one message route index different from the preamble root index r by using each of the at least one message route index function having the preamble index i as an independent variable. In addition, the encoder 630 may generate the message sequence using the Zadoff Chu sequence. Encoder 630 may generate a first message sequence using a Zadoff Chu sequence associated to the k 1, the first message route index. Encoder 630 may determine the first message, the root index k 1 based on the first message, the root index function k 1 = f 1 (i) . f 1 (i) is an arbitrary function that outputs the first message root index k 1 as an input with a preamble index i, and determines k 1 such that the preamble root index r and the first message root index k 1 have different values do. The preamble root index and the first message root index must have different values in order for the first and second subordinate subsequences associated with the preamble and the first message to have cross correlation. The encoder 630 may generate a first message sequence as shown in Equation 5 below.

Figure pat00016

The encoder 630 calculates the first message index < RTI ID = 0.0 >

Figure pat00017
To generate a first message sequence. Compared to the preamble sequence described above, the first message sequence is a sequence of preamble,
Figure pat00018
The sequence is additionally circulated. It will be apparent to those skilled in the art to extend the method of generating the first message sequence described above to generate the N-th message sequence from the second message sequence.

In other words, the encoder 630 generates a preamble sequence corresponding to the preamble root index, a preamble sequence that is cyclically shifted by a constant value corresponding to the preamble index, and a preamble sequence corresponding to each of the at least one message root index And a message sequence that is circularly shifted by a sum of a constant value corresponding to the preamble index and the at least one message index, and transmits the message sequence to the base station.

The entire transmission sequence transmitted from the terminal 600 to the base station according to the present invention may be expressed by Equation (6) below.

Figure pat00019

The terminal 600 may transmit a transmission sequence including both a preamble sequence and a message sequence.

Figure pat00020
Is the signal strength associated with the preamble sequence,
Figure pat00021
and
Figure pat00022
Are the signal strengths associated with the first message sequence and the Nth message sequence, respectively.

The terminal 600 can perform random access by selecting either the simultaneous message transmission mode for transmitting the preamble and the message together and the preamble transmission mode corresponding to the conventional random access method. Accordingly, the terminal 600 may further include a selection unit (not shown in FIG. 6). The selecting unit can select any one of the preamble transmission mode and the message simultaneous transmission mode. Accordingly, when the selector selects the preamble transmission mode, the encoder 630 can encode the preamble index and transmit it to the base station. In this case, the terminal 600 can perform random access by transmitting only the preamble to the base station as in the conventional art.

FIG. 7 illustrates an example of a method for determining at least one message index and a preamble index according to an exemplary embodiment of the present invention. Referring to FIG. Referring to FIG. 7, in case of N PA = 64, N ZC = 839 and N = 2 according to the LTE standard, a transmittable 24-bit message is shown. 010001000011000111011000 indicates a bit string to be transmitted to the base station by the terminal. In this case, the terminal may start from the beginning of the message

Figure pat00023
It is possible to extract the first bit string 710 corresponding to the bit. According to one embodiment, 010001000 may be extracted as the first bit string 710. At this time, a decimal value 136 corresponding to the binary number 010001000 can be calculated. The terminal sends 136 the first message index associated with the first message
Figure pat00024
. Similarly, from the next bit of the first bit string
Figure pat00025
It is possible to extract the second bit string 720 corresponding to the bit. According to one embodiment, 011000111 may be extracted into the second bit stream 720. At this time, a decimal value 199 corresponding to the binary number 011000111 can be calculated. The terminal sends 199 a second message index associated with the second message
Figure pat00026
. Similarly, from the next bit of the second bit string 720
Figure pat00027
The third bit string 730 corresponding to the bit can be extracted. According to one embodiment, 011000 may be extracted as the third bit stream 730. At this time, the decimal value 24 corresponding to the binary number 011000 can be calculated. The terminal may determine 24 as the preamble index i associated with the preamble.

8A and 8B are flowcharts of a communication method in which a terminal according to an embodiment performs a random access procedure to a base station. In accordance with the communication method of one embodiment, the terminal may perform a step 811 of determining a transmittable message size in a start step of performing a random access procedure. The terminal can determine the size of a transmittable message corresponding to the communication scheme with the base station. Step 811 can be executed by a determination unit temporarily implemented by the processor included in the terminal. The base station can broadcast random access information corresponding to the communication scheme designated to terminals within a predetermined range. The terminal may determine the size of the message using the received random access information in step 811. More specifically, the random access information may include at least one of a size of a preamble cyclic shift, a number of preambles, a length of a preamble sequence, a preamble root index, and a set of message root index functions.

In addition, step 812 is to determine a preamble index and at least one message index based on the established message. The terminal may determine a message corresponding to the message size determined in step 811. [ The message may be a desired message that the terminal wishes to transmit to the base station. In step 812, the terminal starts from the beginning of the message

Figure pat00028
Extracts the first bit string corresponding to the bit,
Figure pat00029
The second bit string corresponding to the bit can be extracted. In addition, the terminal can extract the Nth bit string by repeating such bit string extraction. In addition,
Figure pat00030
(N + 1) th bit sequence corresponding to the bit can be extracted. The terminal may then determine each of the at least one message index by converting a binary number corresponding to each bit string from the first bit string to the Nth bit string to a decimal value. Wherein the at least one message index comprises a first message index < RTI ID = 0.0 >
Figure pat00031
N < th > bit index < RTI ID = 0.0 >
Figure pat00032
. ≪ / RTI > Also, the terminal can determine the preamble index i by converting binary numbers corresponding to the (N + 1) bit string into decimal values.

Step 813 is a step of encoding the message and the preamble. In addition, in step 813, a preamble sequence and a message sequence may be generated. In step 813, a preamble sequence and a message sequence may be generated using the Zadoff-Chu sequence. A detailed description of step 813 may be applied to the description of the encoder 630 described above with reference to FIG. The terminal may complete the first step for a random access procedure by sending a preamble and at least one message encoded sequence to the base station as in step 814. [ More specifically, the transmission may be performed using a physical random access channel.

However, referring to FIG. 8B, a flowchart of a communication method in which a terminal according to another embodiment performs a random access procedure to a base station is shown. The communication method may include several additional performable steps as compared to the embodiment of FIG. 8A. The terminal may optionally perform step 821. [ In step 821, the terminal may select either a preamble transmission mode corresponding to a conventional random access method, or a message transmission mode for simultaneously transmitting a preamble and a message. In the steps 822, 823, and 824 performed when the message transmission mode is selected, the description of steps 811, 812, and 813 described above may be applied.

However, when the preamble transmission mode is selected in step 821, a step 826 of determining a preamble index and a step 827 of encoding a preamble are performed. There is a difference in that the step of determining the message index and the step of encoding the message are not performed when compared to step 823 and step 834. [

9 is a block diagram illustrating a terminal according to another embodiment. The terminal 900 may include a processor, and may be a terminal that performs a random access procedure with a base station. In addition, the terminal 900 may be in a form temporarily implemented by the processor. The terminal 900 may include a determination unit 910 and a control unit 920.

The determination unit 910 may determine whether or not to receive the random access response message corresponding to the transmitted sequence. The transmitted sequence may include a preamble and at least one message. In addition, the transmitted sequence may be a sequence transmitted from the terminal 900 to the base station using resources of a physical random access channel. In one embodiment, the determination unit 910 may determine whether a random access response message is received for a predetermined first time interval from the time point when the sequence is first transmitted. Accordingly, if the random access response message is not received after the first time interval, the determination unit 910 may determine that the random access response message has failed to be received.

The control unit 920 may perform a backoff corresponding to the predetermined second time interval when the random access response message is not received according to the determination result of the determination unit 910. [ The terminal 900 may perform a backoff to delay the start of a new random access procedure if a failure of reception is confirmed in the random access response message. Therefore, the random access procedure with the current base station or another terminal in the course of data transmission / reception using the random access procedure can complete the transmission / reception of its own data in a more relaxed communication environment.

On the other hand, when the determination unit 910 determines that the random access response message is successfully received, the controller 920 may transmit an additional message to the base station using the uplink resource included in the random access response message. In an embodiment, the additional message may be a scheduling request message. More specifically, the determination unit 910 can find the random response message corresponding to the MS 900 through the preamble identifier included in the random access response message, and confirm the information on the uplink resource. In addition, the determination unit 910 can confirm that the base station has successfully decoded the message included in the transmitted sequence, together with the successful reception of the random access response message.

10 is a block diagram illustrating a base station in accordance with one embodiment. The base station 1000 according to one embodiment may include at least one processor. The base station 1000 may be implemented at least temporarily by at least one processor.

The base station 1000 may include an operation unit 1010, a detection unit 1020, and a decoder 1030. The operation unit 1010 can calculate the first correlation value to the (N + 1) -th correlation value based on the received sequence. The signal associated with the sequence received by the base station 1000 may be expressed as Equation (7) below.

Figure pat00033

h j denotes a channel coefficient corresponding to the j-th multipath, and t j denotes a delay movement corresponding to the j-th multipath. K is a message root index function set K = {k 1 = f 1 (i), k 2 = f 2 (i), ... , k N = f N (i)}. W [n] represents a noise signal having 0 as an average and σ 2 as a variance.

The arithmetic operation unit 1010 may calculate a correlation value between Y r, K [n] and a first subchapter sequence associated with the preamble root index r. More specifically, the operation unit 1010 can calculate a first correlation value associated with a preamble index using Equation (8) below.

Figure pat00034

Referring to Equation (8), the position number of the sequence having the peak value associated with the preamble is N CS

Figure pat00035
It can be calculated as t i + j. The detection unit 1020 can determine the number of the preamble detection areas, and calculate the preamble index i. Illustratively, as described in Equation (8) above, the preamble index i is set to be τ = N CS
Figure pat00036
(i-1) or more τ = N CS
Figure pat00037
i-1 < / RTI > or less.

In addition, the operation unit 1010 can calculate at least one message route index determined according to the preamble index i, using the message index function set K. [ In addition, the operation unit 1010 may calculate a correlation value corresponding to each of the at least one message index using a Zadoff Chu sequence corresponding to at least one message root index.

Illustratively, the arithmetic operating unit 1010 computes Y r, K [n] and the second Zadoff associated with the first message root index k 1 to calculate the position number of the sequence having the peak value associated with the first message The second correlation value of the chonse sequence can be calculated. More specifically, the operation unit 1010 can obtain the second correlation value through Equation (9) below.

Figure pat00038

Referring to Equation (9), the position number of the sequence having the peak value associated with the first message is N CS

Figure pat00039
i + t j +
Figure pat00040
. ≪ / RTI > The detection unit 1020 may calculate a first message index by calculating a difference between a location number associated with the preamble and a location number associated with the first message. A description of the process of detecting each of at least one message index will be described with reference to the following additional drawings.

The decoder 1030 can decode a message transmitted by the terminal through the random access procedure using at least one message index and a preamble index detected through the detection unit 1020. [ The message may include at least one of Quality of Service (QoS) information, Scheduling Request Information, and User Equipment Identification Information.

If the magnitude of the peak value associated with the first message is less than the threshold, the decoder 1030 can decode only the preamble corresponding to the preamble index, as in the conventional random access scheme.

In addition, the decoder 1030 may identify a predetermined prefix bit in the decoded message, and determine an operation mode of the terminal according to the prefix bit. More specifically, the decoder 1030 may include a first mode for transmitting a subsequent message using random access resources, a second mode for transmitting the message over a single frame and terminating the transmission, and for transmitting the subsequent message over an additional frame The third mode may be determined as the operation mode.

If the operation mode of the terminal is the first mode, the decoded message may include resource block size information for transmitting the subsequent message. If the operation mode is the third mode, the decoder 1030 determines that the message is part of the entire message transmitted by the terminal, and merges the subsequent message decoded in the additional frame.

11 is a graph illustrating a process of detecting a message index according to an embodiment of the present invention. The x-axis represents the position number of the correlation value, and the y-axis represents the magnitude of the correlation value. In the embodiment of FIG. 11, a case where a sequence in which a terminal encodes a preamble and a first message through a random access procedure is transmitted to a base station. However, as described above, the MS can transmit at least one message to the BS together with the preamble according to the message size corresponding to the communication scheme.

11, reference numeral 1110 denotes a peak value associated with a preamble.

The base station can calculate the correlation value of the first subchoduject sequence associated with Y r, K [n] and the preamble root index r using Equation (7). The base station can calculate the position number 1130 of the peak value 1110 associated with the preamble using the calculated correlation value of the first Zadoff-Chu sequence.

Referring to Equation (8) described above, the position number 1130, which has a peak value 1110 associated with the preamble, is N CS

Figure pat00041
It can be calculated as t i + j. The base station can determine the number of preamble detection areas including the position number corresponding to 1110 and calculate the preamble index i. Illustratively, the preamble index i may be expressed as τ = n = N CS
Figure pat00042
(i-1) or more τ = N CS
Figure pat00043
i-1 < / RTI > or less.

In addition, a first message route index k 1 different from the preamble root index r can be calculated by substituting the preamble index i for the first message route function k 1 = f 1 (i). In order for the base station to simultaneously decode the preamble received from the terminal and at least one message as described above, the cross-correlation property of the Zadoff-Chu sequence will be used. Thus, there is a need for the base station to set and calculate a message root index that is different from the preamble root index.

1120 indicates a peak value associated with the first message. The base station may determine the location of the second Zadoff Chu sequence associated with Y r, K [n] and the first message route index k 1 to detect a location number 1140 that will have a peak value 1120 associated with the first message The second correlation value can be calculated using Equation (9).

Referring to Equation (9), the position number 1140, which has a peak value 1120 associated with the first message, is N CS

Figure pat00044
i + t j +
Figure pat00045
. ≪ / RTI > The base station calculates the difference between the location number 1130 and the location number 1140,
Figure pat00046
(1150) can be obtained. In some cases, the first message index
Figure pat00047
Can be obtained through Equation (10).

Figure pat00048

? Pre represents a position number corresponding to the preamble peak value, Ω msg indicates the position number corresponding to the message peak value. First message index

Figure pat00049
Can be determined by subtracting from the pre Ω Ω Ω msg msg if greater than a pre Ω. On the other hand, in addition to the N ZC at a value less the pre Ω Ω msg in the case where Ω is larger than the pre msg Ω can be obtained.

FIG. 12 is an exemplary diagram illustrating a method for determining a first message index, a second message index, and a preamble index to decode a message according to an exemplary embodiment. 11, the base station receives a first message index < RTI ID = 0.0 >

Figure pat00050
, The second message index
Figure pat00051
And the preamble index i. As an example, if N PA = 64, N ZC = 839 and N = 2 according to the LTE standard, the transmittable message bits are assumed to be 24 bits and are described. The base station receives the first message index < RTI ID = 0.0 >
Figure pat00052
= 136, the second message index
Figure pat00053
= 199, and the preamble index i = 24 can be detected. First message index
Figure pat00054
= 136
Figure pat00055
The binary number of the bit, the first bit string 1210 becomes 010001000. Second message index
Figure pat00056
= 199
Figure pat00057
The binary bit value of the bit, and the second bit string 1220 becomes 011000111. In addition, the preamble index i = 24
Figure pat00058
And the third bit string 1230 is 011000. [0064] By arranging the bit strings 1210, 1220 and 1230 obtained previously, the base station can decode message bits of 010001000011000111011000. Through the message bits, the base station can obtain message information including a prefix, a terminal identifier, and a desired message.

13 is a block diagram illustrating a base station in accordance with another embodiment. The base station 1300 may include a processor and performs a random access with the terminal. In addition, the base station 1300 may be implemented at least temporarily by the processor.

The base station 1300 may include an operation unit 1310, a determination unit 1320, and a decoder 1330. The operation unit 1310 can calculate the received preamble index i by using the sequence received from the mobile station and the Zadoff Chu sequence associated with the preamble. More specifically, the operation unit 1310 can calculate the preamble index i by calculating the correlation value between the first and second subchondrocypeques associated with the preamble root index r and the received sequence. The operation unit 1310 can determine whether the position number of the correlation value is present in the preamble detection area, and calculate the preamble index i.

In addition, the operation unit 1310 can calculate the message root index k determined according to the preamble index i using the message index function. In the random access method, when a preamble and a message are simultaneously transmitted by a terminal, the BS determines whether a preamble used by a plurality of terminals is a random access first The second step. More specifically, the determination unit 1320 may determine whether a preamble collides with a second sub-pilot sequence associated with a message root index k determined by the preamble index i. According to this embodiment, the base station can transmit information of the message root index k corresponding to the preamble index i to the terminal as random access preamble information in advance.

The determination unit 1320 may calculate a correlation value between the received sequence and a second subchondochus sequence associated with the message root index k. In addition, the determination unit 1320 can determine a collision of preambles among a plurality of terminals when there are two or more peaks of correlation values exceeding a preset threshold value. More specifically, the determination unit 1320 can determine a preamble collision if a position number in which a peak of a correlation value exceeding a threshold exists is detected in an area corresponding to at least two or more message indexes. If the preamble collision is determined, the base station 1300 may terminate the random access procedure by not transmitting the random access response message to the terminal. The MS may determine that a random access response message corresponding to the sequence transmitted by the MS has not been received and determine that a collision has occurred in the transmitted preamble.

As described above, a method of detecting a preamble index or a message index is determined using a region in which a position number in which a peak of a correlation value is detected exists. However, in the case of the preamble index, the area corresponding to one preamble index is not sufficiently large, and the base station determines whether a plurality of peaks due to the multipath of the same terminal have been detected or a preamble of a plurality of terminals is collided It was impossible. However, in the case of using the embodiment of the present invention, by detecting a message index that can have a larger area than a region where a peak value associated with a preamble is detected, the number of terminals that have transmitted the same preamble at present is detected An effect that can be expected can be expected.

However, when the preamble does not collide according to the determination result of the determination unit 1320, the operation unit 1310 may calculate the message index using the received sequence and the Zadoff Chu sequence associated with the message root index. In the above operation, the description of the calculating unit 1010 and the detecting unit 1020 described above may be applied.

The decoder 1330 can decode a message transmitted through the random access procedure by the terminal using the preamble index i and the message index l calculated by the operation unit 1310. [ Similarly, the description of the decoder 1030 described above may be applied to the operation of the decoder 1330. [

14A and 14B are graphs showing a process of detecting a preamble collision according to an embodiment. The X-axis of the graph represents the position number of the correlation value, and the Y-axis represents the magnitude of the calculated correlation value. In this embodiment, it can be assumed that, for example, three different terminals attempt random access to the base station using the same preamble index and a preamble collision occurs.

The base station may compute a first correlation value between the received sequence and the jaadobe sequence associated with the preamble root index r. The base station can calculate the first correlation value using Equation (8) described above. In addition, the base station can detect a position number having a correlation value equal to or greater than a predetermined threshold value 1410 as a position number having a peak value. According to the present embodiment, the base station can detect the position numbers corresponding to the three peaks 1421, 1422, and 1423. In addition, the base station can determine the area where the position numbers exist in the three peaks 1421, 1422, and 1423. According to this embodiment, nine regions 1431, 1432, 1433, 1434, 1434, and 1434, such as a first region 1431 corresponding to the first preamble index 0 to a ninth region 1439 corresponding to the ninth preamble index 8, 1435, 1436, 1437, 1438, 1439). Referring to FIG. 14A, the base station can determine that a position number corresponding to three peaks 1421, 1422, and 1423 exists in a fourth region 1434 corresponding to the fourth preamble index 3. However, the base station can not confirm whether or not the preamble collides only with the fact that the three peaks 1421, 1422, and 1423 are detected in an area corresponding to the same preamble index. A plurality of peaks can be generated by a sequence transmitted by one terminal, for example, when the same terminal has undergone multipath. Thus, the base station can substitute the detected preamble index 3 into the message root index function to compute the corresponding message root index.

By way of example, suppose f (3) = 5 is defined in this embodiment, and the calculated message root index is derived as 5. The base station can calculate the second correlation value using the calculated message root index 5 and the Zadoff Chu sequence associated with the received message sequence index 5 and the received sequence. The base station may calculate the second correlation value using Equation (9) described above. The base station can determine the number of peaks of the second correlation value in the region corresponding to the entire jadobject sequence. As described in Fig. 14A, the base station can detect a position number having a correlation value of a predetermined threshold value 1410 or more as a position number having a peak value. The base station may detect three peaks 1441, 1442, 1443 as peaks corresponding to the message indexes. Accordingly, the base station can detect that the current preamble index 3 has been collided by three terminals. The base station does not transmit a random access response message to the three terminals, and can still terminate the random access procedure.

15 is a flowchart of a method 1500 for a base station to detect a preamble collision using a sequence transmitted from a terminal in a random access procedure according to an embodiment. Step 1501 is a step in which the base station receives the sequence from the terminal. In one embodiment, in step 1501, the base station may receive a sequence from a plurality of terminals simultaneously.

Step 1502 is a step of calculating a correlation value corresponding to the preamble using the received sequence and the Zadoff Chu sequence corresponding to the preamble. In one embodiment, step 1502 may be performed by the operation unit 1310 of the base station 1300. Illustratively, step 1502 may be performed using equation (8). In addition, even if a base station receives a sequence from a plurality of terminals in step 1501, since a plurality of terminals use the same preamble root index, the base station can calculate a correlation value corresponding to one preamble.

Step 1503 is a step of detecting a preamble index. In step 1503, the base station detects the peak position of the correlation value corresponding to the preamble and detects the position number corresponding to the peak position. Referring to Equation (8), the position number is N CS

Figure pat00059
It can be calculated as t i + j. In step 1503, the base station can determine the number of preamble detection areas including the position numbers corresponding to the peaks of the correlation values corresponding to the preamble, and calculate the preamble index i. Illustratively, the preamble index i τ = N CS corresponding to the detection zone as described in the equation (8)
Figure pat00060
(i-1) or more τ = N CS
Figure pat00061
i-1 < / RTI > or less. In step 1503, the base station can detect the preamble index i.

Step 1504 is a step in which the message root index k is calculated by the base station. More specifically, in step 1504, the base station may calculate the message root index k corresponding to the detected preamble index i using the message root index function. Step 1504 may be performed by the operation unit 1310 of the base station 1300 as an embodiment.

In another embodiment, the base station can establish a plurality of message root index function sets when the base station randomly connects with at least one terminal at the same time. There may be a need for such an embodiment if it is necessary for an exemplary transmitted and received message to be prevented from decoding into a conventional communication method for security reasons. Prior to performing the random access procedure, the base station may match a particular message root index function set to a particular terminal and send it to the particular terminal. In step 1504, the base station may calculate a specific set of message root indexes corresponding to a particular terminal.

Step 1505 is a step of calculating a correlation value using the received sequence and the Zadoff Chu sequence corresponding to the message root index k. Step 1505 can be performed using equation (9) described above.

As another embodiment, in step 1505, if the base station has set up a plurality of message root index function sets, it may compute a Zadoff Chu sequence corresponding to each message root index of a particular message root index set. Illustratively, if the number of elements in the message root index set is N, then in step 1505, the base station calculates the number of elements in the message root index set from the Zadoff Chu sequence corresponding to the first message root index to the Zadoff Chu sequence Can be calculated. In addition, the correlation value corresponding to each of the above-mentioned Zadoff Chu sequences can be calculated.

In step 1506, the base station may compare a peak of the correlation value corresponding to the message root index k with a predetermined threshold, and determine whether the number of peaks of the correlation value exceeding the threshold is at least two or more.

If it is determined in step 1506 that the number of peaks of the correlation value exceeding the threshold exceeds one, the base station recognizes the preamble collision between the plurality of terminals in step 1507 and terminates the random access procedure have.

However, if it is determined in step 1506 that the number of peaks of the correlation value exceeding the threshold is one, the base station can determine that no preamble collision has occurred. Accordingly, the base station may proceed to decode the preamble and at least one message (step 1508) and to transmit a random access response message (step 1509).

16 is a flowchart illustrating a communication method of a base station that controls access load using a detected message index according to an embodiment. The base station communication method 1600 includes a step 1610 corresponding to each preamble index in a plurality of received sequences, a step 1620 of calculating an access load corresponding to the number of detected at least one message index, And comparing the threshold and the connection load and controlling the connection period of the physical random access channel according to the comparison result (1630).

In step 1610, the base station may calculate a corresponding message route index using each of the preamble indices used in the random access procedure. In addition, in step 1610, the base station may detect the number of message indexes received from the plurality of terminals using the Zadoff Chu sequence corresponding to each of the message root indices.

In step 1620, the base station may calculate the number of message indexes corresponding to any one preamble index and store the calculated result. In addition, the base station can calculate the number of message indexes detected on average in the current random access procedure. Using the number of message indices, the base station can determine the connection load corresponding to the current random access procedure.

In step 1630, the base station may compare the connection load with a preset threshold and control the connection period of the physical random access channel according to the comparison result. Step 1630 sets the T RACH corresponding to the connection period to be larger if the connection load is smaller than the threshold value and if the connection load is larger than the threshold value, the T RACH corresponding to the connection period is smaller And a step of setting the step. If a new T RACH is set according to step 1630, the base station can broadcast the corresponding contents to the respective terminals as random access pre-information.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced. Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

Claims (22)

A terminal comprising a processor and performing a random access procedure with a base station, the terminal being at least temporarily embodied by the processor:
A determining unit determining a size of a message that can be transmitted corresponding to a physical random access channel according to a designated communication scheme with the base station;
An arithmetic unit configured to set a message corresponding to the message size and to calculate a preamble index and at least one message index from the message; And
An encoder for encoding each of the preamble index and the at least one message index and transmitting the encoded index to the base station,
Lt; / RTI >
The method according to claim 1,
Wherein the determining unit determines the transmittable message size according to the number of the jadopu sequence length, the number of preamble sequences, and the number of the message root index functions corresponding to the designated communication method.
The method according to claim 1,
Wherein the operation unit calculates at least one message route index different from a preamble root index by using each of at least one message route index function having the preamble index as an independent variable.
The method according to claim 1,
Wherein the operation unit repeatedly extracts at least one message bit string corresponding to each of the at least one message index from a start bit of the set message and extracts a preamble bit string from the remaining message.
The method according to claim 1,
Wherein the determining unit determines that the mobile station determines to transmit the increased message using a plurality of subframes corresponding to the physical random access channel, .
The method according to claim 1,
Wherein the encoder includes a preamble sequence in which a jadopause sequence corresponding to a preamble root index is circularly shifted by a constant value corresponding to the preamble index and a jadopulse sequence corresponding to each of the at least one message root index are associated with the preamble index And generating a message sequence that is circularly shifted by a sum of the constant value and the at least one message index, and transmits the message sequence to the base station.
The method according to claim 1,
A preamble transmission mode and a message simultaneous transmission mode,
Further comprising:
And if the selector selects the preamble transmission mode, the encoder encodes the preamble index and transmits the encoded index to the base station.
A terminal comprising a processor and performing a random access procedure with a base station, the terminal being at least temporarily embodied by the processor:
A determination unit for determining whether or not to receive a random access response message corresponding to the transmitted sequence; And
And a controller for performing a backoff corresponding to a predetermined time interval when the random access response message is not received according to a result of the determination,
Lt; / RTI >
Wherein the transmitted sequence comprises a preamble and at least one message.
9. The method of claim 8,
And when the random access response message is received according to a result of the determination, the controller transmits an additional message to the base station using uplink resources included in the random access response message.
A base station comprising a processor and performing a random access procedure with a terminal, the base station being at least temporarily implemented by the processor:
An arithmetic unit operable to calculate a received preamble index using a sequence received from the terminal and a Zadoff Chu sequence associated with the preamble; And
Determining a collision of the preamble using a Zadoff Chu sequence associated with a message route index determined by the preamble index;
/ RTI >
11. The method of claim 10,
The determination unit may calculate a correlation value between the received sequence and the Zadoff Chu sequence associated with the message root index and may determine a collision of the preamble when the peak value of the correlation value exceeds a preset threshold value Base station.
11. The method of claim 10,
A decoder for decoding a message transmitted by the terminal through the random access procedure using the preamble index and the message index;
Further comprising:
Wherein the operation unit computes the message index using the received sequence and a Zadoff Chu sequence associated with the message root index according to a result of the determination.
A base station comprising a processor and performing a random access procedure with a terminal, the base station being at least temporarily implemented by the processor:
An arithmetic unit for calculating a correlation value corresponding to each of the correlation value and at least one message index corresponding to the preamble index using the sequence received from the terminal; And
A detector for detecting each of the preamble index and the at least one message index based on a correlation value corresponding to the preamble index and a correlation value corresponding to each of the at least one message index,
/ RTI >
14. The method of claim 13,
Wherein the operation unit calculates at least one message route index determined according to the preamble index using at least one message index function and calculates the at least one message route index using the at least one message route index, And calculates a correlation value corresponding to each message index.
14. The method of claim 13,
Wherein the detector compares a position number corresponding to a peak of a correlation value corresponding to the preamble index and a position number corresponding to a peak of each correlation value corresponding to the at least one message index to detect each of the at least one message index .
14. The method of claim 13,
A decoder for decoding a message transmitted by the terminal through the random access procedure using the at least one message index and the preamble index;
And a base station.
17. The method of claim 16,
Wherein the decoder identifies a predetermined prefix bit in the decoded message and determines an operation mode of the terminal according to the prefix bit.
18. The method of claim 17,
The decoder may include a first mode for transmitting a subsequent message using random access resources, a second mode for transmitting the message over a single frame and terminating the transmission, and a third mode for transmitting the subsequent message over an additional frame, And judges one of them as the operation mode.
19. The method of claim 18,
Wherein the decoded message includes a resource block size information for transmitting the subsequent message when the operation mode is the first mode.
19. The method of claim 18,
Wherein if the operation mode is the third mode, the decoder determines that the message is part of an overall message transmitted by the terminal, and merges the subsequent message to be decoded in the additional frame.
A method of controlling a connection load by a base station performing a random access procedure with a plurality of terminals, the method comprising:
Detecting at least one message index corresponding to each of the preamble indices in the received plurality of sequences;
Calculating an access load corresponding to the number of detected at least one message index; And
Comparing the predetermined threshold with the connection load and controlling a connection period of the physical random access channel according to the comparison result
≪ / RTI >
22. The method of claim 21,
Wherein the step of controlling the connection period further comprises setting T RACH corresponding to the connection period to be larger when the connection load is smaller than the threshold value and setting the T RACH corresponding to the connection period when the connection load is larger than the threshold, Is set to a smaller value.
KR1020150130823A 2015-04-10 2015-09-16 Apparatus and method for communicating through random access KR101678792B1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/KR2016/001728 WO2016163642A1 (en) 2015-04-10 2016-02-23 Communication apparatus and method using random access procedure
US15/502,857 US10231196B2 (en) 2015-04-10 2016-02-23 Communication apparatus and method using random access procedure

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020150050842 2015-04-10
KR20150050842 2015-04-10

Publications (2)

Publication Number Publication Date
KR20160121358A true KR20160121358A (en) 2016-10-19
KR101678792B1 KR101678792B1 (en) 2016-12-06

Family

ID=57250983

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020150130823A KR101678792B1 (en) 2015-04-10 2015-09-16 Apparatus and method for communicating through random access

Country Status (1)

Country Link
KR (1) KR101678792B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112740770A (en) * 2018-07-20 2021-04-30 株式会社Ntt都科摩 Base station and user terminal

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20080013649A (en) * 2006-08-09 2008-02-13 삼성전자주식회사 Method and apparatus for transmitting/receiving information using random access procedure in wireless telecommunications system
KR20100032266A (en) * 2008-09-17 2010-03-25 삼성전자주식회사 Apparatus and method for processing interrupt of upper message is happened by adaptive retransmission command during random access procedure in mobile communication system
KR101033689B1 (en) * 2007-03-15 2011-05-12 한국전자통신연구원 Preamble allocation method and random access method in mobile communication system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20080013649A (en) * 2006-08-09 2008-02-13 삼성전자주식회사 Method and apparatus for transmitting/receiving information using random access procedure in wireless telecommunications system
KR101033689B1 (en) * 2007-03-15 2011-05-12 한국전자통신연구원 Preamble allocation method and random access method in mobile communication system
KR20100032266A (en) * 2008-09-17 2010-03-25 삼성전자주식회사 Apparatus and method for processing interrupt of upper message is happened by adaptive retransmission command during random access procedure in mobile communication system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112740770A (en) * 2018-07-20 2021-04-30 株式会社Ntt都科摩 Base station and user terminal

Also Published As

Publication number Publication date
KR101678792B1 (en) 2016-12-06

Similar Documents

Publication Publication Date Title
CN108289337B (en) Uplink scheduling request method, user equipment and base station equipment
KR101366263B1 (en) A Method of Random Access and a method of transforting information in Broadband Wireless Access system
KR101133868B1 (en) Method for selection of an available transmission channel by sending a negative decision value and an additional positive decision value and corresponding base station mobile terminal and mobile radio network
US20180124626A1 (en) Method of Data Transmission and Reception in Random Access Procedure
US10231196B2 (en) Communication apparatus and method using random access procedure
RU2493658C2 (en) Method and apparatus for communication over radio channel
EP2953390B1 (en) Data transmission method, user equipment, base station, and system
JP7171547B2 (en) Method for notifying and determining uplink data repetition mode, user equipment and base station
EP3014943A1 (en) Method and apparatus for preamble determination
CN108617001B (en) Uplink data transmission method and device
CN109964496B (en) Method and device in wireless communication
US20230050533A1 (en) Transmission method and device, computer readable storage medium
EP3905828A1 (en) Transmission device, reception device, transmission method, and reception method
CN109803340B (en) Message transmission method, user equipment, base station and computer readable storage medium
KR101678792B1 (en) Apparatus and method for communicating through random access
WO2018082768A1 (en) Device and method for wireless communication network synchronization
US20210029744A1 (en) Methods and apparatus for mapping random access preamble groups to uplink channel configurations
CN107006031B (en) Method, device and system for sending PRACH (physical random Access channel) preamble
KR101875285B1 (en) Method for random access in wireless communication system
KR101874177B1 (en) Apparatus and method of communicating for allocating non-orthogonal resource
CN111294769B (en) Method and device for determining and indicating synchronization source information, storage medium and terminal
US10694542B2 (en) Classification of user equipment using extended set of random access preambles
Kim et al. A random access for low latency communications
RU2684421C1 (en) Device and method for transmitting and receiving emergency signals using a wireless communication network
CN111434171A (en) Group-based system information communication

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E701 Decision to grant or registration of patent right
GRNT Written decision to grant