WO2018194365A1 - Method and device for transmitting information by using sparse coding - Google Patents

Abstract

A method by which a transmitting end operates in a wireless communication system comprises the steps of: performing sparse coding on information so as to have sparsity of which the number of non-zero symbols is K; configuring a codebook by including a code for spreading for each user; spreading the coded information by using one or more codes in the codebook; and transmitting a channel by overlapping the spread information. Therefore, even if the number of encoded symbols increases, the number of symbols actually having a value is very sparsely configured such that the complexity of a transmitter and a receiver does not increase, and thus restoration performance improves.

Description

Method and apparatus for transmitting information using sparse coding

BACKGROUND OF THE INVENTION Field of the Invention [0001] The present invention relates to information transmission technology, in particular sparse coding and multi-code spreading and to transmit information in ultra-reliable and low latency communication (URLLC). An apparatus and method for using a recovery receiver by compressed sensing.

Recently, high-reliability low-delay communications as a future technology is increasing its interest to utilize in real time, virtual reality, unmanned facilities, factory automation facilities. This URLLC technology should transmit with minimal transmission delay while transmitting so that transmission failure rarely occurs.

However, existing data channel transmission methods rely on complex channel coding and channel decoding methods to prevent transmission failure. Thus, low latency is difficult to achieve with complex signal processing. In addition, the CRC (cyclic redundancy check) is transmitted together with the control information to determine whether the error exists. This method has a problem of using too many resources for additional information for high reliability transmission. In addition, for high reliability transmission, the code rate of channel coding must be taken small. In this case, the length of an encoded symbol becomes longer as the code rate becomes smaller.

Accordingly, improved reliability can be obtained, but the complexity of the receiver required for demodulating the received signal in the receiver increases in proportion to the length of the symbol. Therefore, the demodulation delay is increased, making it difficult to achieve low latency. That is, existing channel coding schemes have a trade-off relationship between high reliability transmission and low latency transmission.

The present invention provides a sparse coding apparatus capable of significantly increasing the transmission success rate of a channel without increasing computational complexity while making a code rate very low for high reliability transmission, an apparatus for spreading transmission using a plurality of codes, and receiving the rare signal It provides an apparatus and method for restoring.

In order to achieve the above object, according to an aspect of the present invention, a method of operating a transmitting end in a wireless communication system, the step of sparse coding the information to have a sparsity (sparsity) of the number of non-zero symbols K, for each user Constructing a codebook including code for spreading, spreading the coded information using one or more codes in the codebook, and transmitting the channel by overlapping the spreaded information. .

According to an embodiment of the present invention, the sparse coding of the information may include: integer mapping that allows one-to-one correspondence of an integer value that can be expressed through location information where sparse K non-zero symbols are located to a size N of a symbol; sparse coding by an integer mapping method.

According to an embodiment of the present invention, the sparse coding of the information may include a structure in which the number of nonzero symbols of the column and the row of the matrix corresponding to the information is the same through the size N and the sparity K of the symbol. Sparse coding in a structured mapping method.

According to an embodiment of the present invention, the rare coding of the information may include a table mapping method in which positions of non-zero symbols are preconfigured according to information fields corresponding to the respective information. Sparse coding.

According to an embodiment of the present disclosure, the spreading may include spreading the coded information using one or more codes having non-orthogonal characteristics in the codebook. .

According to an embodiment of the present disclosure, the method may further include allocating a resource according to the information, and transmitting a data channel through the allocated resource.

According to another aspect of the present invention, a method of operating a receiving end in a wireless communication system includes: obtaining a codebook including a code for spreading for each user, receiving a channel including sparse coded information, and Based on the codebook, determining the information from the received channel.

According to an embodiment of the present disclosure, the determining of the information may include identifying one or more codes used for spreading the received channel at the transmitting end using the codebook, and based on the one or more codes. And recovering the sparse coded information from the received channel using a compressed sensing technique.

According to an embodiment of the present disclosure, the determining of the information may include determining the information by performing a reverse process of sparse coding on the sparse coded information.

According to an embodiment of the present disclosure, the method may further include receiving a data channel based on the information.

According to another aspect of the present invention, in a wireless communication system, a transmitting apparatus sparsely codes information so that the number of nonzero symbols has a degree of scarcity of K, and configures a codebook including codes for spreading for each user, At least one processor for spreading the coded information using one or more codes in the codebook, and a transceiver for transmitting a channel by overlapping the spread information.

According to an embodiment of the present disclosure, the at least one processor may be an integer mapping method in which an integer value that is representable through position information where sparse K nonzero symbols are located with a size N of a symbol is one-to-one corresponded to the information. It can be sparse coded.

According to an embodiment of the present disclosure, the at least one processor is configured to have the same number of nonzero symbols in a column and a row of a matrix corresponding to the information through a size N and a sparity K of a symbol. It can be sparse coded with.

According to an embodiment of the present invention, the at least one processor may sparse code with a table mapping method such that a position of a non-zero symbol is preconfigured according to an information field corresponding to each information.

According to an embodiment of the present disclosure, the at least one processor may spread the coded information using one or more codes having non-orthogonal characteristics in the codebook.

According to an embodiment of the present disclosure, the at least one processor may allocate resources according to the information, and the transceiver may transmit a data channel through the allocated resources.

As the number of encoded symbols in the prior art increases, the complexity of the transmitter and receiver increases, whereas in the present invention, even though the number of encoded symbols increases, the number of symbols that actually have a value is very sparse. In this case, the complexity of the transmitter and the receiver does not increase.

In addition, in the present invention, rather than transmitting information to each transmitted symbol, by using the position of the non-zero symbol among the transmitted symbols, the next information is mapped and transmitted to each other at different positions to use the information transmission method of the previous method. Is that. This has the advantage of high reception performance and high reliability transmission.

In addition, in the present invention, by spreading the spreading codebook differently for each user rather than sending the user information together with the control information, the amount of total control information can be significantly reduced, and the amount of resources required for control channel transmission can be reduced. have.

Therefore, high reliability and low delay communication can be implemented by reducing transmission delay while enabling high reliability transmission through the technique proposed by the present invention.

1 is an example of a data channel configuration of a downlink URLLC system to which the present invention is applied.

2 is a diagram illustrating a conventional control channel transmission process.

3 is a diagram illustrating a control channel transmission process according to an embodiment of the present invention.

4 illustrates a sparse coding method according to an embodiment of the present invention.

5 is a diagram illustrating a multiple code spreading method according to an embodiment of the present invention.

6 is a diagram illustrating a control channel and a pilot signal transmission method according to a second embodiment of the present invention.

7 is a graph for comparing BLER performance of a control channel and a general control channel according to an embodiment of the present invention.

8A is a graph for comparing BLER performance of a control channel and a general control channel according to the amount of control information according to an embodiment of the present invention.

8B is a graph for comparing BLER performance of a control channel and a general control channel according to an embodiment of the present invention with or without interference signals.

9 is a graph for comparing transmission latency performance of a control channel and a general control channel according to an embodiment of the present invention.

10 is a flowchart illustrating a transmission process according to an embodiment of the present invention.

11 is a flowchart illustrating a receiving process according to an embodiment of the present invention.

12 is a diagram illustrating a transmission apparatus according to an embodiment of the present invention.

13 is a diagram illustrating a receiver according to an embodiment of the present invention.

Advantages and features of the present invention, and methods for achieving them will be apparent with reference to the embodiments described below in detail in conjunction with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, but may be implemented in various forms, and only the embodiments of the present invention make the disclosure of the present invention complete and the general knowledge in the technical field to which the present invention belongs. It is provided to fully convey the scope of the invention to those skilled in the art, and the present invention is defined only by the scope of the claims. Like reference numerals refer to like elements throughout.

In describing the embodiments of the present disclosure, when it is determined that a detailed description of a known function or configuration may unnecessarily obscure the subject matter of the present disclosure, the detailed description thereof will be omitted, and the following terms are used in the embodiments of the present disclosure. Terms are defined in consideration of the function of the may vary depending on the user or operator's intention or custom. Therefore, the definition should be made based on the contents throughout the specification.

Combinations of each block of the block diagrams and respective steps of the flowcharts may be performed by computer program instructions (executable engines), which may be executed on a processor of a general purpose computer, special purpose computer, or other programmable data processing equipment. As such, instructions executed through a processor of a computer or other programmable data processing equipment create means for performing the functions described in each block of the block diagram or in each step of the flowchart.

These computer program instructions may also be stored in a computer usable or computer readable memory that can be directed to a computer or other programmable data processing equipment to implement functionality in a particular manner, and thus the computer usable or computer readable memory. The instructions stored therein may also produce an article of manufacture containing instruction means for performing the functions described in each block of the block diagram or in each step of the flowchart.

And computer program instructions can also be mounted on a computer or other programmable data processing equipment, such that a series of operating steps can be performed on the computer or other programmable data processing equipment to create a computer-implemented process that can be executed by the computer or other programmable data. Instructions for performing data processing equipment may also provide steps for performing the functions described in each block of the block diagram and in each step of the flowchart.

In addition, each block or step may represent a portion of a module, segment or code that includes one or more executable instructions for executing specific logical functions, and in some alternative embodiments referred to in blocks or steps It should be noted that the functions may occur out of order. For example, the two blocks or steps shown in succession may, in fact, be performed substantially concurrently, or the blocks or steps may be performed in the reverse order of the corresponding function, as required.

Hereinafter, an embodiment of a transmitter and a receiver for transmitting and receiving a control channel using sparse coding in a wireless communication system will be described in detail with reference to the accompanying drawings. In the present specification, a transmitting end (transmitting device) describes a base station, and a receiving end (receiving device) describes a terminal as an example. However, embodiments of the present invention illustrated in the following may be modified in many different forms, the scope of the present invention is not limited to the embodiments described in the following. In addition, the present invention describes a control channel transmission as an embodiment, but is not necessarily limited thereto, and may be generally applied to a channel configuration having a small size of information to be transmitted. Embodiments of the present invention are provided to more fully describe the present invention to those skilled in the art.

1 is an example of a data channel configuration of a downlink URLLC system to which the present invention is applied.

In FIG. 1, the graph 101 shows a conventional data channel transmission method and the graph 102 shows a data transmission method for URLLC. In the conventional data channel transmission method, the pilot 103, the control channel 104, and the data channel 105 are transmitted in the order of time and frequency. The data channel is mapped to two-dimensional resources of time and frequency. Is assigned based on

On the other hand, since URLLC needs to have a very short transmission time, the pilot 106, the control channel 107, and the data channel 108 have a very long structure along the frequency axis, and transmit only a very short time on the time axis. . That is, the channel may be configured to transmit for a short time while using a wide frequency resource.

2 is a diagram illustrating a conventional control channel transmission process. The control channel signal of the data transmission signal includes information for demodulating the data channel. The conventional method for transmitting the control channel is as follows.

First, scheduling information (control information or control information or scheduling information, 203) is transmitted along with a cyclic redundancy check (CRC) 201 for determining whether an error exists. The CRC 201 generally uses a user index value 204. The data is scrambled through the scrambler 202 and concatenated 205 together with the scheduling information 203 and sent to the channel encoder 206.

For example, if the CRC is a binary signal consisting of 16 bits and the user index is also a binary signal consisting of 16 bits, scramble means that the two binary signals are exclusive OR (XOR) operations for each bit. The CRC 201 concatenated with the scheduling information 203 is made into a control channel through the channel encoder 206.

In general, the channel encoder adjusts the length of a coded signal through a code rate. When encoding a b bit signal at a code rate of 1/3, the length N of the coded signal becomes 3b bit. The smaller the code rate, the larger the N, the higher the reliability of the control channel and the higher the complexity. This is in accordance with the basic principle of channel coding.

The basic principle of channel coding is to map any signal represented by b bit to a hyper-space with N degrees of freedom greater than b, with 2 powers of 2 codepoints farthest from each other in the N-dimensional hyper-space. Means how to configure.

Accordingly, in order to obtain b bit information, a symbol having a size of N may be received, and it may be determined which codepoint is closest to the codepoint configured by the received signal. Therefore, as N increases, the distance between the codepoints increases, the detection performance increases and the reliability increases, but the complexity increases because the dimension of the hyper-space for searching increases. The present invention proposes a control channel transmission method using a sparse coding method as a coding method in which the complexity does not increase even when N increases.

3 is a diagram illustrating a control channel transmission process according to an embodiment of the present invention. In the present invention, the length of a symbol encoded using the sparse coding technique proposed by the scheduling information 301 through the sparse encoder 302 is much longer than the scheduling information (length N), and the non-zero symbol is very small. Suggest how to make.

In other words, it uses a method of differently selecting the hyper-space used by the information corresponding to the power of 2 in the N-dimensional hyper-space. Another way to express it is to configure the codepoints to overlap each other in the N-order hyper-space, and to choose the largest sum of the energy of the regions of the codepoints, not the distance between the codepoints.

After sparse coding is used, spreading codebook generator 304 is used to construct different spreading codebooks for different users using the user index 305. The spreading codebook has a spreading code of N, and uses sparse coding to selectively select one or more spreading codes from the codebook and send them to the same resource simultaneously. This is done by selective diffuser 303. The spread signal becomes the control channel 306.

4 illustrates a sparse coding method according to an embodiment of the present invention. A detailed method is described as an embodiment for sparse coding. The first method is an integer mapping (integer allocation) method. The scheduling information z may be expressed as an integer, and for example, 00, 01, 10, and 11 may be expressed as 0, 1, 2, and 3. In the case of sparse coding, when N is 4 and the number of non-zero elements K is 2, five types of 0011, 0110, 1001, 1010, and 1100 are possible, which are expressed as integers 3, 6, 9, 10, and 12. Can be. Therefore, sparse coding can be expressed as a process of mapping integers between z and x.

For example, sparse coding is possible through integer mapping between z and x with z = 0 → x = 3, z = 1 → x = 6, z = 2 → x = 9, z = 4 → x = 10. The mapping method of sparse coding may use the same mapping between users, but the present invention also includes using different mappings for security.

The second method is a structured mapping method. If the scheduling information z is 00, 01, 10, 11, for example, N is 4 and the number K of non-zero elements is 2

0011

0110

1001

1100

When four are used, the number of zero or non-zero elements in a column and a row is the same in a matrix composed of four binaries. Using this configuration, integers can be expressed as 3, 6, 9, 12.

The difference between the first method and the second method may be that demodulation performance may be improved since the sparse component of the reconstructable signal is unique in the case of the reconstruction of the sparse signal (the number of non-zeros is the same in columns and rows). .

The third method is a table mapping method. The table mapping method is a method of mapping a location of a non-zero element of an encoded symbol to a field of z by mapping a field of a scheduling signal. Table 405 of FIG. 4 is a part of scheduling information consisting of an information name and a bit field. Here, the encoding process is performed such that each field configures the position of 1 of the encoded symbol 406 differently. In this way, information is organized.

Through this sparse coding, a non-sparse signal is encoded as a sparse signal x having a length of N and a number of non-zero elements among them. In case of K, when using QPSK symbol, K is composed of 2, and the value of the non-zero element uses 1 of 2 and j of 1 is used. If both use 1, they can be transmitted through BPSK symbols. When 16QAM is used, K = 4 is configured and four non-zero elements are set to 1, j, 2, and 2j regardless of the order.

If all four non-zero elements comprise 1, they can be transmitted in 9QAM. In case of using 64QAM, K = 6 and 1, j, 2, 2j, 3, 3j, regardless of order, among 6 non-zero elements. If all six non-zero elements are composed of 1, 16QAM including zero points can be used.

5 is a diagram illustrating a multiple code spreading method according to an embodiment of the present invention. If the resource size of the transmitted transmission signal is m, the length of the spreading code is m, so the number of different binary codes that can be made to length m is the power of 2 m.

Of these, each user uses a code of N, so each 2 ^m / N users can use a different codebook C. Of the N codes, the codes actually used for transmission are K codes, which are configured according to the position of the non-zero element selected in the encoding process.

Accordingly, the encoded signal x 505 of FIG. 5 includes zero elements 506 and non-zero elements 507 and 508, which are multiplied by a codebook C 503 configured differently for each user and thus having K out of N codes. The code is selected and the selected code is nested in the resource of m.

Therefore, when K is 2, two spreading codes are transmitted simultaneously. In this case, x may use x whose location is changed for each location transmitted by user for time for security. For example, in the case where the encoded x is 0110, 1100 may be used at time t = 1 and 1001 may be used at t = 2. Such a change may be determined based on a rule previously defined between the transmitter and the receiver.

In the codebook C used in the present invention, each code c may have an orthogonal or non-orthogonal characteristic. For example, in codebook C, each code c has a non-orthogonal characteristic but has a very low correlation, and thus may have a very low detectability when different users receive using different codebooks. The spread signal may pass through channel 502 and be received at the receiver in the form of y 501.

6 is a diagram illustrating a control channel and a pilot signal transmission method according to a second embodiment of the present invention. 5 illustrates a method of transmitting a pilot and a control channel to different symbols or resources. 6 illustrates a method in which a pilot and a control channel are configured and transmitted as one. This method is possible in the case where there is a separate pilot and a method in which no pilot exists.

If the pilot does not exist separately, the received signal is a multi-code spread signal is received and the receiver does not determine the position of the non-zero element in x as shown in Figure 5 rather than the non-zero elements (604, 605) Both channel and control channel information can be obtained by judging both the position and value.

The reception process of the present invention is according to the following table. Table 1 below is a table describing the operation of the receiver.

The receiver can determine the position and value of the non-zero element of x from the signal y received with the reconstructor to recover the sparse signal. Here, the present invention describes a process of determining user information in the sparse signal restoration process.

If after detecting the non-zero element of K, the residual of the signal remaining after the detection does not reduce the energy of the original signal y much. In this case, the detected K non-zero elements are regarded as false detection and are ignored. . If a non-zero element is not detected during the detection process, it is determined that it is not a control channel assigned to it and is ignored.

FIG. 7 is a graph for comparing BLER performance of a control channel based on control channel sparse encoding (CCSE) and a physical downlink control channel (PDCCH) which is a general control channel according to an embodiment of the present invention. Referring to FIG. 7, the proposed technique provides 4dB performance in additive white Gaussian noise (AWGN) and various real channel environments (extended typical urban model (ETU), extended pedestrian A model (EPA)), compared to the conventional technology. You can see that there are benefits.

8A is a graph for comparing BLER performance of a control channel and a general control channel according to an amount of control information according to an embodiment of the present invention. According to an embodiment of the present invention, in FIG. 8A, the size b of information shows a BLER measurement result when the information is changed from 12 bits to 96 bits. Referring to FIG. 8A, it can be seen that the smaller the size of the information proposed by the present invention, the larger the gain, and the larger the size of the information, the smaller the difference in performance of the PDCCH using channel coding. This means that when the signal to noise ratio (SNR) is small, more than twice as much information as the conventional PDCCH can be transmitted to the same resource.

8B is a graph for comparing BLER performance of a control channel and a general control channel according to an embodiment of the present invention with or without an interference signal. Referring to FIG. 8B, it can be seen that the technique proposed by the present invention is less affected by interference. This is because it uses a spreading code. In case of interference caused by spreading codes for other users, the existing technology has a great performance deterioration, but the proposed technique has excellent performance because the amount of interference remaining after dispreading is very small.

9 is a graph for comparing transmission latency performance of a control channel and a general control channel according to an embodiment of the present invention. Referring to FIG. 9, since the technique proposed by the present invention has a low BLER performance, a transmission failure probability is low, and thus a low transmission error condition may be satisfied with a high probability without retransmission (n = 1). For example, as shown in FIG. 9, it can be seen that the technique proposed in the present invention satisfies a transmission error condition of 0.00001, which is a requirement of URLLC, within 0.85 msec. On the other hand, under the same conditions, it can be seen that the existing transmission method requires 1.28 msec to satisfy the transmission error condition of 0.00001. In other words, it can be seen that the transmission by CCSE proposed in the present invention has a performance gain of reducing the transmission delay.

10 is a flowchart illustrating a transmission process according to an embodiment of the present invention. First, as in step 1001 of FIG. 10, the base station generates a spread codebook for each user and delivers it to each terminal. The transferring process may be previously recorded in the storage device for each terminal or may be indicated by signaling or delivering configuration information.

Next, as shown in step 1003 of FIG. 10, when scheduling information is required to be delivered, a sparse coding process is first performed. Subsequently, multi-code spreading is performed by using the coded symbols as in step 1005 of FIG. 10 and allocated to the resource to be transmitted as in step 1007 of FIG. 10 and a transmission signal is generated. That is, the control channel including the scheduling information is transmitted. The data channel is transmitted as shown in step 1009 of FIG. 10 based on the scheduling information.

11 is a flowchart illustrating a receiving process according to an embodiment of the present invention. The terminal configures the spreading codebook by receiving the spreading codebook from the base station or receiving corresponding information as shown in step 1101 of FIG. Thereafter, in step 1103, the spreading codebook is identified from the reception control channel signal by using the spreading codebook. At this time, reconstruction of the transmitted rare code may be performed through a compression sensing technique. Compression sensing is a technique for reconstructing a transmitted signal based on a small number of measurements. For example, a compression sensing algorithm such as multipath match pursuit with death first (MMP-DF) may be used.

Using the value or index of the code determined in step 1105, sparse decoding corresponding to the reverse process of sparse coding is performed to confirm scheduling information. Thereafter, as shown in step 1107, the data channel is received and demodulated with reference to the scheduling information.

12 is a diagram of a transmitter according to an embodiment of the present invention, and shows the signal processing flow in the transmitter. The scheduling information 1201 of FIG. 12 is converted into a sparse signal through the sparse encoder 1202. The spreading codebook is then spread through the spreader 1203 using the spreading codebook. The spreading codebook is generated using the codebook generator 1204 from the user index 1205, which is a unique identifier of the user (terminal).

The amount of control channel is then adjusted to the amount of resources transmitted through rate matcher 1206, which is mapped to time / frequency resources via resource allocator 1207.

Then, when transmitting using one or more antennas, signal processing for multi-antenna transmission is performed through the layer mapper 1208, transmitted to the RF module 1209, and a signal is generated.

For example, the transmitting device may include at least one processor, the sparse encoder 1202, the spreader 1203, the codebook generator 1204, the rate matcher 1206, and the resource allocator 1207. The function of may be performed by at least one processor. In addition, the transmitting apparatus may include a transceiver, and the functions of the radar mapper 1208 and the RF module 1209 may be performed by the transceiver.

13 is a diagram illustrating a receiving apparatus according to an embodiment of the present invention, and shows a signal processing flow in the receiving apparatus. Referring to FIG. 13, the terminal receives a control channel 1301 signal through an RF device. Recognizes the code transmitted through the compressed sensing based receiver 1302 proposed from the received control channel 1301 signal, which is obtained through the codebook generator 1303 from the user index 1304 which is a unique identifier of the user (terminal). This is done using the generated codebook. Compression sensing is a technique for reconstructing a transmitted signal based on a small number of measurements. For example, a compression sensing algorithm such as MMP-DF may be used. For example, the user (terminal) identifier 1307 may be first distinguished from the code reconstructed by the compression sensing based receiver 1302 based on the codebook, and may be recognized as control channel information transmitted to the receiving device.

Thereafter, the reverse process of sparse coding is performed through the decoder 1305 through the identified information, thereby obtaining the confirmed scheduling information 1306. The receiving device may receive a data channel from the transmitting device based on the confirmed scheduling information 1306.

Although described above with reference to the embodiments, those skilled in the art can be variously modified and changed within the scope of the present invention without departing from the spirit and scope of the invention described in the claims below. I can understand.

Claims (16)

In the operating method of the transmitting end in a wireless communication system, Sparse coding the information to have a sparity in which the number of non-zero symbols is K; Constructing a codebook including code for spreading for each user; Spreading the coded information using one or more codes in the codebook; And Transmitting a channel by overlapping the spread information. The method of claim 1, Sparse coding the information, And sparingly coding an integer value that can be expressed through the position information where sparse K non-zero symbols are located on the size N of the symbol by an integer mapping method in which the information is one-to-one corresponded with the information. . The method of claim 1, Sparse coding the information, And sparing coding by a structured mapping method in which the number of nonzero symbols in the column and the row of the matrix corresponding to the information is equal through the size N and the sparity K of the symbol. Way. The method of claim 1, Sparse coding the information, Sparse coding with a table mapping method such that the position of a non-zero symbol is preconfigured according to an information field corresponding to each piece of information. The method of claim 1, The spreading step, Spreading the coded information using one or more codes having non-orthogonal characteristics in the codebook. The method of claim 1, Allocating resources according to the information; And And transmitting a data channel through the allocated resource. In the method of operation of the receiving end in a wireless communication system, Obtaining a codebook including a code for spreading for each user; Receiving a channel comprising sparse coded information; And And determining the information from the received channel based on the codebook. The method of claim 7, wherein The determining of the information may include: Identifying one or more codes used for spreading the received channel at the transmitting end using the codebook; And Based on the one or more codes, recovering the sparse coded information from the received channel using a compressed sensing technique. The method of claim 8, The determining of the information may include: And performing the reverse process of sparse coding on the sparse coded information to determine the information. The method of claim 7, wherein Receiving a data channel based on the information. A transmitting device in a wireless communication system, The information is sparse coded so as to have a sparity with a number of non-zero symbols, and a codebook including a code for spreading for each user, the codebook being configured using one or more codes in the codebook. At least one processor for spreading; And And a transceiver for transmitting a channel by superimposing the spread information. The method of claim 11, The at least one processor, And a sparse coding of an integer value expressible through positional information where sparse K non-zero symbols are located in the size N of the symbol by an integer mapping method in which the information is one-to-one corresponded with the information. The method of claim 11, The at least one processor, And sparse coding by a structured mapping method in which the number of nonzero symbols in a column and a row of a matrix corresponding to the information is equal through a size N and a sparity K of a symbol. The method of claim 11, The at least one processor, And sparse coding by a table mapping method such that the position of a non-zero symbol is preconfigured according to an information field corresponding to each piece of information. The method of claim 11, The at least one processor, And spread the coded information using one or more codes having non-orthogonal characteristics in the codebook. The method of claim 11, The at least one processor allocates resources according to the information, And the transceiver transmits a data channel through the allocated resource.

Images