COMMUNICATION METHOD AND APPARATUS USING G-OFDM FOR HIGH SPEED WIRELESS COMMUNICATION

Abstract

Provided is a communication method and apparatus using G-OFDM that dramatically improve allocation and efficiency of frequencies, by simultaneously performing a filter bank (FB) scheme intended to reduce inter-channel interference by improving an OFDM technology, which is the current fourth generation wireless communication technology, and a scheme of overlapping and multiplexing signals of a plurality of hierarchical channels on the same frequency band using hierarchical composite functions and transmitting the plurality of overlapped and multiplexed signals.

Claims

1. A communication method using generalized orthogonal frequency division multiplexing (G-OFDM), wherein a plurality of hierarchical channels defined as predetermined frequency bands are present and digital data is carried in each of the hierarchical channels, the plurality of hierarchical channels are overlapped and multiplexed by a plurality of hierarchical composite functions that each correspond to the plurality of hierarchical channels, the plurality of hierarchical composite functions are defined as functions in a frequency domain and have orthogonality and frequency cut-off characteristic, such that transmission and reception are performed, and each of the hierarchical channel is divided into a plurality of subchannels.

2. The communication method of claim 1, wherein the respective frequency bands of the plurality of subchannels formed for each of the hierarchical channels are formed to be equal to each other for all hierarchical channels.

3. The communication method of claim 1, wherein when it is assumed that a matrix including the plurality of hierarchical composite functions is a composite matrix and a matrix including hierarchical split functions that each correspond to the plurality of hierarchical composite functions is a split matrix, the composite matrix and the split matrix are represented by a hierarchical function matrix G having the same structure, and the hierarchical function matrix G is formed so that G.sup.TG=I is established.

4. The communication method of claim 3, wherein the obtaining of the hierarchical function matrix G includes: determining an initial matrix G.sub.0 as a matrix having a length of a column of 1 and having orthogonality between columns; multiplying a jump removal matrix with the initial matrix G.sub.0 to have frequency cut-off characteristic by preventing an occurrence of a spectrum spreading or leakage phenomenon due to a jump at a start point, wherein the jump removal matrix performing an operation of subtracting a first row from each row; multiplying a filtering matrix with a product G.sub.0 of the jump removal matrix and the initial matrix G.sub.0 to perform a column smoothing; and generating the hierarchical function matrix G by transforming a product G.sub.0 of the filtering matrix , the jump removal matrix , and the initial matrix G.sub.0 by a transformation function $\left(f\left(x\right)={X\left(X^H.Math.X\right)}^{-\frac{1}{2}}\right)$ to re-secure orthogonality.

5. The communication method of claim 4, wherein a first column of a hierarchical function matrix G.sub.p,e1 generated with an initial matrix G.sub.p,e.sup.(0) and a jump matrix R.sub.p,e1 that have a length of an even-numbered column, or a hierarchical function matrix G.sub.p,o1 generated with an initial matrix G.sub.p,o.sup.(0) and a jump matrix R.sub.p,o1 that have a length of an odd-numbered column is used as a pilot vector, wherein the initial matrix G.sub.p,o.sup.(0) having the length of the even-numbered column is defined as $G_{p,e}^{\left(0\right)}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & 1& 1\\ & & & & \mathrm{.Math.}& & \\ & & 1& 1& & & \\ & 1& & & & & \\ 1& & & & & & \\ -1& & & & & & \\ & -1& & & & & \\ & & 1& -1& & & \\ & & & & & & \\ & & & & & 1& -1\end{array}\right],.Math.R_{p,e.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & & 0\\ & & & & 0& 1& \\ & & & \mathrm{.Math.}& & & \\ & 0& 1& & & & \\ 0& & & & & & \\ 0& & & & & & \\ & 0& 1& & & & \\ & & & & & & \\ & & & & 0& 1& \\ & & & & & & 0\end{array}\right],.Math..Math.G_{p,o}^{\left(0\right)}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccc}& & & & 1& 1\\ & & & \mathrm{.Math.}& & \\ & 1& 1& & & \\ 1& & & & & \\ 0& & & \mathrm{.Math.}& 0& 0\\ -1& & & & & \\ & 1& -1& & & \\ & & & & & \\ & & & & 1& -1\end{array}\right]$ $R_{p,o.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccc}& & & & 0& 0\\ & & & \mathrm{.Math.}& & \\ & & & & & \\ 0& 2& 0& \mathrm{.Math.}& 2& 0\\ & & & & & \\ & & & & & \\ & & & & 0& 0\end{array}\right].$ the jump matrix R.sub.p,e1 having the length of the even-numbered column is defined as $R_{p,e.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & & 0\\ & & & & 0& 1& \\ & & & \mathrm{.Math.}& & & \\ & 0& 1& & & & \\ 0& & & & & & \\ 0& & & & & & \\ & 0& 1& & & & \\ & & & & & & \\ & & & & 0& 1& \\ & & & & & & 0\end{array}\right],$ the initial matrix G.sub.p,o.sup.(0) having the length of the odd-numbered column is defined as $G_{p,o}^{\left(0\right)}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccc}& & & & 1& 1\\ & & & \mathrm{.Math.}& & \\ & 1& 1& & & \\ 1& & & & & \\ 0& & & \mathrm{.Math.}& 0& 0\\ -1& & & & & \\ & 1& -1& & & \\ & & & & & \\ & & & & 1& -1\end{array}\right],$ and the jump matrix R.sub.p,e1 having the length of the odd-numbered column is defined as $R_{p,o.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccc}& & & & 0& 0\\ & & & \mathrm{.Math.}& & \\ & & & & & \\ 0& 2& 0& \mathrm{.Math.}& 2& 0\\ & & & & & \\ & & & & & \\ & & & & 0& 0\end{array}\right].$

6. The communication method of claim 1, wherein the communication method includes overlapping and transmitting frequencies in which data consisting of digital signals is converted into an analog signal and is transmitted through the plurality of hierarchical channels, and the data carried in the hierarchical channels is overlapped in the frequency domain using the hierarchical composite functions and is converted into a time domain signal and is then transmitted to one communication channel; and splitting and receiving the frequency in which the data of a form of the analog signal transmitted by the overlapping and transmitting of the frequencies is received and is converted to the frequency domain signal from a time domain signal, and the data consisting of the digital signals carried in each of the hierarchical channels is split and restored using hierarchical split functions corresponding to the hierarchical composite functions.

7. The communication method of claim 1, wherein the communication method uses one modulation scheme selected from BPSK, QPSK, M-PSK, and M-QAM (where M=2.sup.N, N=1, 2, 3, . . . ) when the data is carried in each of the subchannels, and the modulation schemes used for each of the hierarchical channels are the same as or different from each other.

8. A communication apparatus using G-OFDM performing communication using the communication method wherein a plurality of hierarchical channels defined as predetermined frequency bands are present and digital data is carried in each of the hierarchical channels, the method comprising: overlapping and multiplexing the plurality of hierarchical channels using a plurality of hierarchical composite functions that each correspond to the plurality of hierarchical channels, the plurality of hierarchical composite functions are defined as functions in a frequency domain and have orthogonality and frequency cut-off characteristic, such that transmission and reception are performed; and each of the hierarchical channel is divided into a plurality of subchannels.

Description

DESCRIPTION OF DRAWINGS

[0023] FIG. 1 illustrates a conventional OFDM communication scheme principle

[0024] FIG. 2 illustrates a case in which two hierarchical channels are overlapped and divided using a G-OFDM scheme according to the present invention.

[0025] FIG. 3 illustrates a case in which a plurality of hierarchical channels composed of one subchannel are combined and divided using the G-OFDM scheme according to the present invention.

[0026] FIG. 4 illustrates a communication scheme principle using the G-OFDM scheme according to the present invention.

[0027] FIG. 5 illustrates oversampling.

[0028] FIG. 6 illustrates a transmitter structure that implements a step of overlapping and transmitting frequencies.

[0029] FIG. 7 illustrates a receiver structure that implements a step of separating and receiving the frequencies.

[0030] FIG. 8 illustrates a structure of a transmitter and a receiver using the G-OFDM scheme according to the present invention.

[0031] FIG. 9 illustrates a process of generating a hierarchical function matrix having orthogonality and frequency cut-off property.

[0032] FIG. 10 illustrates a set of hierarchical composite functions in a time domain of G(8,6)-OFDM.

[0033] FIG. 11 illustrates frequency response characteristic of hierarchical composite functions of G(8,6)-OFDM.

[0034] FIG. 12 illustrates density of a power frequency including hierarchical composite functions of OFDM and G(8,6)-OFDM.

[0035] FIG. 13 illustrates a set of hierarchical composite functions in a time domain of G(7,5)-OFDM.

[0036] FIG. 14 illustrates frequency response characteristic of hierarchical composite functions of G(7,5)-OFDM.

[0037] FIG. 15 illustrates density of a power frequency including hierarchical composite functions of OFDM and G(7,5)-OFDM.

BEST MODE

[0038] Hereinafter, a communication method and apparatus using G-OFDM according to the present invention having the configuration as described above will be described in detail with reference to the accompanying drawings.

[0039] FIG. 1 conceptually illustrates a conventional OFDM communication scheme principle. It was already described that a single user uses the frequency f of all bands in the existing TDMA(2G), CDMA(3G), and the like. On the other hand, in the OFDM scheme, the allocated frequency band is divided into subchannels (indicated as subchannel 1, subchannel 2, . . . on FIG. 1) including a plurality of small frequency bands, and the data is divided to be transmitted and received, as illustrated in FIG. 1, instead of carrying and communicating one signal in the entire frequency band. In this case, one subchannel is occupied by one information symbol. That is, referring to FIG. 1, wireless communication is performed such that a symbol 1 transmits and receives the data using a frequency of the subchannel 1, a symbol 2 transmits and receives the data using a frequency of the subchannel 2, and the like.

[0040] Here, the symbol refers to a minimum unit of data which is transmitted at a time in data communication. For example, in the case of 4-PSK modulation, the symbol may be transmitted in four forms of 1, j, 1, and j at a time. In this case, information corresponding to 2 bits may be transmitted at a time, and as a result, the symbol may be regarded to be approximately equal to 2 bits. Examples of the modulation scheme include BPSK, QPSK, M-PSK, M-QAM, and the like, and since above-mentioned modulation schemes are well known, a detailed description thereof will be omitted.

[0041] Conventionally, the data is transmitted and received by carrying the data in one channel including the plurality of subchannels. That is, according to the conventional scheme, only one information symbol may be carried in one subchannel. On the other hand, according to the present invention, a plurality of hierarchical channels including a plurality of subchannels are overlapped by using a hierarchical composite function in a frequency domain. That is, a plurality of information symbols may be carried in one subchannel by overlapping the plurality of hierarchical channels, thereby making it possible to significantly reduce frequency interference as compared to the conventional scheme. An overlapping scheme according to the present invention as described above is referred to as generalized orthogonal frequency division multiplexing (G-OFDM).

[0042] FIG. 2 illustrates a case in which two hierarchical channels are overlapped and divided using a G-OFDM scheme according to the present invention. It is the same to use the entire frequency band by dividing it into small bands of subchannel 1, subchannel 2, . . . , but the subchannels herein do not need to have the same size range as each other. Accordingly, FIG. 2 illustrates an example in which sizes of the subchannels are different from each other. According to the present invention, a signal in which a symbol of a hierarchical channel 1 is carried in the subchannel 1 and a signal in which a symbol of a hierarchical channel 2 is carried in the subchannel 2 are overlapped using the hierarchical composite function in the frequency domain. As a result, an overlapped symbol 1 is carried in the subchannel 1 and is transmitted. That is, in the transmitted signal, the overlapped symbol 1 is carried in the subchannel 1, an overlapped symbol 2 is carried in the subchannel 2, and so on. A receiving side receives overlapped symbols through a process of receiving the overlapped symbol 1 through the subchannel 1, receiving the overlapped symbol 2 through the subchannel 2, and so on, and may obtain original symbols by splitting the original symbols through a process of obtaining a symbol 11 and a symbol 21 by splitting the overlapped symbol 1, and so on using the hierarchical split function for each of the subchannels.

[0043] That is, according to the present invention, unlike the conventional case in which only symbol may be carried in one subchannel and transmitted, a plurality of symbols may be overlapped and carried in one band and transmitted by overlapping and splitting the information symbol signal using the hierarchical composite and analytic functions in the frequency domain. Accordingly, according to the present invention, the same frequency band may be efficiently controlled, thereby making it possible to significantly reduce interference. As described above, the wireless communication method according to the present invention may contribute to substantially increase communication capacity by reducing frequency interference between systems.

[0044] The wireless communication method according to the present invention as described above is conceptually summarized as follows. In the wireless communication method according to the present invention, a plurality of hierarchical channels defined as predetermined frequency bands exist, such that digital data is carried in each of the hierarchical channels, and the plurality of hierarchical channels are overlapped and multiplexed by a plurality of hierarchical composite functions corresponding to the plurality of hierarchical channels, respectively, and defined as the function in the frequency domain, thereby performing transmission and reception. In this case, the respective hierarchical channels are divided into a plurality of subchannels such that the data may be more efficiently carried. In this case, the respective frequency bands of the plurality of subchannels formed for each of the hierarchical channels are formed to be same as each other for all of the hierarchical channels. Accordingly, as described above, unlike the conventional case in which only one information symbol is carried in one subchannel and transmitted and received, according to the present invention, information symbols corresponding to the number of hierarchical channels may be carried in one subchannel and transmitted and received.

[0045] The wireless communication method according to the present invention as described above will be described in more detail. The wireless communication method according to the present invention includes a step of overlapping and transmitting frequencies and a step of splitting and receiving the frequency.

[0046] In the step of overlapping and transmitting the frequencies, data consisting of digital signals is converted into an analog signal and is transmitted through the plurality of hierarchical channels (here, the hierarchical channels are defined as predetermined frequency bands and include the plurality of subchannels as illustrated, and the entire band and bands of the respective subchannels are equal to each other for each of the hierarchical channels). In this case, the data carried in the respective hierarchical channels is overlapped in the frequency domain and is converted into a time domain signal using the hierarchical channel composite functions, and is then transmitted to one communication channel.

[0047] In the step of splitting and receiving the frequency, the data of the form of the analog signal transmitted by the step of overlapping and transmitting the frequencies is received and is then converted into a frequency domain signal from the time domain signal, and the data of the digital signal carried in each of the hierarchical channels is split and restored using the hierarchical split functions corresponding to the hierarchical composite functions.

[0048] Hereinafter, a frequency overlapping principle, which is a main principle of the present invention, will be first described, and a detailed example in which the frequency overlapping principle is actually applied to a digital communication system will be then described.

[0049] Frequency Overlapping Principle

[0050] FIG. 3 conceptually illustrates a principle of transmitting and receiving information symbols of a plurality of hierarchical channels to one subchannel using a G-OFDM scheme according to the present invention.

[0051] Here, as an example of the hierarchical composite function to describe a principle of the present invention, an orthogonal waveform will be described by way of example. In a frequency domain, an orthogonal function has the following property.

[00006]$\begin{array}{cc}{}_{-B.Math..Math.2}^{B.Math..Math.2}.Math.H_p\left(f\right).Math.H_q\left(f\right).Math.\mathrm{df}=\{\begin{array}{cc}E,& p=q\\ 0,& pq\end{array}& \left(1\right)\end{array}$

[0052] Here, H.sub.p() and the like denote pulses in the frequency domain, B denotes a bandwidth of all H.sub.p(), and E denotes a real number. When an information symbol is s.sub.p, J information symbols may be combined as follows.

[00007]$\begin{array}{cc}U\left(f\right)=\underset{p=0}{\overset{J-1}{.Math.}}.Math.s_p.Math.H_p\left(f\right)& \left(2\right)\end{array}$

[0053] A signal J of the frequency domain formed by overlapping the s.sub.p information symbols U() may be expressed as follows through an inverse Fourier transform.

[00008]$\begin{array}{cc}\begin{array}{c}u\left(t\right)=F^{-1}.Math.\left\{U\left(f\right)\right\}\\ =\underset{p=0}{\overset{J-1}{.Math.}}.Math.s_p.Math.h_p\left(t\right)\end{array}& \left(3\right)\end{array}$

[0054] Actually, a signal u(t) expressed in Equation (3) is transmitted through a communication channel. That is, the information symbol s.sub.p is carried in H.sub.p(), which is a pulse in a time domain corresponding to h.sub.p(t), which is a pulse in the frequency domain, and is transmitted. However, in a case in which channel noise is introduced into the above-mentioned signal, the signal may be expressed as follows.

r(t)=u(t)+n(t)(4)

[0055] Here, n(t) is a noise signal. In order to extract the information symbol from the above-mentioned signal, the following procedures are performed. First, the signal r(t) is Fourier-transformed as follows.

[00009]$\begin{array}{cc}\begin{array}{c}R\left(f\right)=F.Math.\left\{r\left(t\right)\right\}\\ =U\left(f\right)+N\left(f\right)\end{array}& \left(5\right)\end{array}$

[0056] Integration is performed by a R()-th pulse for the Fourier-transformed signal p in the frequency domain as follows.

[00010]$\begin{array}{cc}\begin{array}{c}{v}_p=.Math.{}_{-B.Math..Math.2}^{B.Math..Math.2}.Math.R\left(f\right).Math.H_p\left(f\right).Math.\mathrm{df}\\ =.Math.{}_{-B.Math..Math.2}^{B.Math..Math.2}.Math.\left[\underset{p=0}{\overset{J-1}{.Math.}}.Math.s_p.Math.H_p\left(f\right)+N\left(f\right)\right].Math.H_p\left(f\right).Math.\mathrm{df}\\ =.Math.{\mathrm{Es}}_p+n_p\end{array}& \left(6\right)\end{array}$

[0057] Here, n.sub.p is a noise component introduced into a p-th channel. An estimation of the information symbol s.sub.p is performed as follows.

[00011]$\begin{array}{cc}{\hat{s}}_p=\mathrm{dec}.Math.\left\{\frac{1}{E}.Math.v_p\right\}& \left(7\right)\end{array}$

[0058] Here, dec{} is logic that determines the information symbol. By performing the procedures as described above, even if the frequencies are overlapped and transmitted, the principle capable of receiving the information has been shown.

Applying Frequency Overlapping Principle to Digital Communication System

[0059] In the description of the frequency overlapping principle above, the principle in which the information symbols of the plurality of hierarchical channels are transmitted to one subchannel has been described. However, in order to practice the frequency overlapping principle, much more information symbols need to be transmitted. To this end, as illustrated in FIG. 2, a plurality of hierarchical channels are overlapped using the hierarchical composite functions and a plurality of subchannels are placed in one hierarchical channel, thereby transmitting a larger amount of data.

[0060] FIG. 4 conceptually illustrates a principle of transmitting a large amount of data to a channel having a plurality of subchannels using G-OFDM scheme according to the present invention. A detailed example for applying the respective steps (the step of overlapping and transmitting the frequencies and the step of splitting and receiving the frequency) of the wireless communication method according to the present invention will be described in more detail with reference to FIG. 4.

Step of Overlapping, Multiplexing and Transmitting Frequencies

[0061] First, an input data column d.sub.l(k) of a digital form to be transmitted is indexed to each of the hierarchical channels l and the subchannels k by a symbol mapper, and corresponds to a symbol u.sub.l(k) on a complex number plane. This will be described in detail as follows. In the digital communication system, data to be transmitted has a digital form. Such an input data column d.sub.l(k) is modulated through a baseband modulator, which is called the symbol mapper. As a modulation scheme, all baseband digital modulation schemes such as BPSK, QPSK, M-PSK, M-QAM, and the like may be applied. A symbol mapping for a k-th hierarchical channel and a k-th subchannel may be expressed as follows.

C:d(k).fwdarw.s.sub.l(k), k=0,1,2, . . . ,M1, l=0,1,2 . . . ,J1(8)

[0062] The symbol mapping serves to map a data bit collection k carried in the d.sub.l(k)-th subchannel to a symbol u.sub.l(k) on the complex number plane.

[0063] Next, the symbol u.sub.l(k) of each channel is over-sampled N times and is transformed into an over-sampled signal x.sub.l(k). N The N1 times over-sampling may be implemented by inserting N1 zeros between symbols. FIG. 5 illustrates an example of the over-sampling in which N is 4.

[0064] Next, the over-sampled signal x.sub.l(k) of each of the hierarchical channel is convoluted by an orthogonal function h.sub.l(k) in the frequency domain and is formed as formation signal y.sub.l(k). In this case, the number of orthogonal functions h.sub.l(k) is equal to the number of hierarchical channels, and the orthogonal function h.sub.l(k) in the present exemplary embodiment corresponds to the hierarchical composite function in the previous principle description. In other word, as described above, if the hierarchical overlapping and splitting may be made, any function may be used as the hierarchical composite function, but since the orthogonal function may be easily implemented most intuitively, the orthogonal function is merely used in the present exemplary embodiment and the hierarchical composite function other than the orthogonal function may also be applied if necessary. A condition of the hierarchical composite function is that a function expressed by a product of the composite function and the analytic function has orthogonality when the hierarchical analytic function is used to split the hierarchical channel later.

y.sub.l(k)=(x.sub.l(k)*h.sub.l(k)).sub.LN(9)

[0065] As described above, the over-sampled signal x.sub.l(k) formed in the frequency domain, that is, the formation signal y.sub.l(k) may be split for each of the channels at a receiving stage by a hierarchical split function to be described below by using orthogonality with the hierarchical composite function in a neighboring channel.

[0066] A convolution process of the over-sampled signal x.sub.l(k) and the orthogonal function h.sub.l(k) in the frequency domain will be described in more detail as follows. First, the hierarchical composite function may be expressed as in Equation (10).

[00012]$\begin{array}{cc}{H}_l\left(z\right)=\underset{k=0}{\overset{M-1}{.Math.}}.Math.h_l\left(k\right).Math.z^{-k},.Math.0lJ-1& \left(10\right)\end{array}$

[0067] In addition, a formation filtering by the hierarchical composite function means that a convolution is circulative so that a total sample length becomes L by a length N of an input data vector and a parameter LN, and the circulating convolution is calculated as follows.

{tilde over (y)}.sub.l(k)=x.sub.l(k)*h.sub.l(k)(11)

[0068] A length of {tilde over (y)}.sub.l(k) obtained by doing so is MN+L1. {tilde over (y)}.sub.l(k) The circulating convolution may be obtained by overlapping as follows.

y.sub.l={tilde over (y)}.sub.l[((L+1)/2),{tilde over (y)}.sub.l(L+1)/2+1),{tilde over (y)}.sub.l((L+1)/2+2), . . . ,{tilde over (y)}(.sub.l(L+1)/2+MN1)]+[0,0,0, . . . ,0,{tilde over (y)}.sub.l(0),{tilde over (y)}.sub.l(1),{tilde over (y)}.sub.l(2), . . . ,{tilde over (y)}.sub.l((L+1)/21)] (12)

[0069] Next, the formation signals y.sub.l(k) of the respective hierarchical channels are added element by element and are vector-mixed, and are thereby overlapped to one overlapped signal w. This operation may be expressed as follows.

w=y.sub.0+y.sub.1+ . . . +y.sub.J-1(13)

[0070] Equation (13) represents that all outputs of the J hierarchical channels are added.

[0071] Next, the overlapped signal w is transformed from the frequency domain signal to the time domain signal by an inverse Fourier transform and becomes a transmitted signal s of an analog signal form.

s=F.sup.1(w)(14)

[0072] In Equation (14), F.sup.1 denotes an inverse Fourier transform operator.

[0073] Finally, the transmitted signal s, which is the analog signal of the time domain is transmitted to one communication channel. FIG. 6 illustrates a structure of a transmitter that implements the step of overlapping and transmitting the frequencies as described above.

Step of Splitting and Receiving Frequency

[0074] First, the received signal s in which the transmitted signal n transmitted through the communication channel and the noise signal r introduced into the communication channel are summed is received (see Equation (15)). Ideally, although the transmitted signal transmitted in the step of overlapping and transmitting the frequencies should be received as it is, noise is necessarily introduced into the transmitted signal in an actual communication environment. In consideration of the above-mentioned point, it is assumed that the received signal includes not only the transmitted signal but also the noise signal. As shown in Equation (15), the transmitted signal s, the noise signal n, and the received signal r are all expressed by a vector form.

r=s+n(15)

[0075] Next, the received signal r is transformed from the time domain signal to the frequency domain signal by a fast Fourier transform (FFT), and becomes a transformed signal b. Such an operation will be expressed as follows.

b=F(r)(16)

[0076] Next, the transformed signal b is convoluted by the hierarchical split function g.sub.i(k) in the frequency domain and is split into a split signal p.sub.i(k) for each of the hierarchical channels, which is a form of a digital signal.

p.sub.l(k)=(b(k)*g.sub.l(k)).sub.LN(17)

[0077] The hierarchical split function corresponds to the hierarchical composite function which is used in the step of overlapping the frequencies, and is determined so that the function expressed by the product of the composite function and the analytic function has orthogonality as described above. That is, a relationship between a composite function h and an analytic function g is as follows.

[00013]$\begin{array}{cc}\underset{k=0}{\overset{M-1}{.Math.}}.Math.h_i\left(k\right).Math.g_j\left(k\right)=\{\begin{array}{cc}E& i=j\\ 0& ij\end{array}& \left(18\right)\end{array}$

[0078] Next, a signal p.sub.i(k) before transform, which is a signal of a point at which the magnitude of the signal is maximum is obtained for every N signals from the split signal N. That is, the N times over-sampled signal in the step of overlapping and transmitting the frequencies above is returned to an original form.

q(k)=p(kN) k=0,1,2, . . . ,N1(19)

[0079] Next, the output data column q(k) for each of the hierarchical channels is restored by applying symbol determination logic dec{} to the signal {circumflex over (d)}.sub.i(k) before transform.

{circumflex over (d)}.sub.i(k)=dec{q(k)}, k=0,1,2, . . . ,N1(20)

[0080] FIG. 7 illustrates a structure of a receiver that implements the step of splitting and receiving the frequency as described above.

Example of Generating Hierarchical Composite Function and Hierarchical Split Function

[0081] As described above, in the wireless communication method according to the present invention, data for each of the hierarchical channels is overlapped in the frequency domain using the hierarchical composite functions. Such hierarchical composite functions are waveforms having property (e.g., orthogonality) that they may be split from each other and has excellent frequency cut-off characteristic. As an example, since the Hadamard matrix has excellent orthogonality, but has no frequency cut-off characteristic, it is unsuitable for application to the communication method according to the present invention.

[0082] The present invention will propose new hierarchical composite function and hierarchical split function that simultaneously satisfy orthogonality and frequency cut-off characteristic. An example of forming the above-mentioned function will be described below, but since it is not very effective to list the hierarchical function one by one, orthogonality and frequency cut-off characteristic of each column will be discussed by introducing a matrix.

G.sup.TG=1(21)

[0083] A process of forming a matrix G of the hierarchical functions is shown in FIG. 9. Structures of a composite matrix and a split matrix are equal to each other. The matrix G of the hierarchical functions is obtained by Equation below.

G=f(G.sub.0)(22)

[0084] Here, G.sub.0 is an initial matrix, is a matrix for removing a jump, and is a filtering matrix for column smoothing of the matrix. The respective functions may be expressed by Equations below.

[00014]$\begin{array}{cc}=W^T.Math.F.Math..Math..Math..Math.F^{-1}.Math.W& \left(23.Math.a\right)\\ =W^T.Math.F.Math..Math..Math..Math.F^{-1}.Math.W& \left(23.Math.b\right)\\ f\left(X\right)={X\left(X^H.Math.X\right)}^{-\frac{1}{2}}& \left(23.Math.c\right)\end{array}$

[0085] Matrixes F.sup.1W and W.sup.TF are matrixes transformed from the frequency domain to the time domain, and from the time domain to the frequency domain, respectively. Matrixes and perform a function of removing a jump in the columns in the matrix and a filtering function in the time domain, respectively.

[0086] Hereinafter, it will be more detail described that a process of deriving the matrix G.sub.0 of the hierarchical function starting with the initial matrix G is finally shown as in Equation (22).

[0087] The initial matrix G.sub.0 is related to a length of the column necessary to transmit the data, and a shape thereof is different when it is an even number and an odd number. A common characteristic is that the length of the column is 1 and the respective columns are orthogonal to each other.

[0088] When, the length of the column is the even number, that is, N is the even number, the initial matrix has a shape below.

[00015]$\begin{array}{cc}{G}_e^{\left(0\right)}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccccc}& & & & & & 1& 1\\ & & & & & \mathrm{.Math.}& & \\ & & & 1& 1& & & \\ & 1& 1& & & & & \\ 1& & & & & & & \\ -1& & & & & & & \\ & 1& -1& & & & & \\ & & & 1& -1& & & \\ & & & & & & & \\ & & & & & & 1& -1\end{array}\right]& \left(24\right)\end{array}$

[0089] When, the length of the column is the odd number, that is, N is the odd number, the initial matrix has a shape below.

[00016]$\begin{array}{cc}{G}_o^{\left(0\right)}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & 1& 1\\ & & & & \mathrm{.Math.}& & \\ & & 1& 1& & & \\ 1& 1& & & & & \\ 0& 0& & & \mathrm{.Math.}& 0& 0\\ 1& -1& & & & & \\ & & 1& -1& & & \\ & & & & & & \\ & & & & & 1& -1\end{array}\right]& \left(25\right)\end{array}$

[0090] In addition, as seen in Equations (24) and (25), most of the elements of the matrix are zero, which means that there are operations with other matrices, an object of the operation is achieved with minimal operation. Space portions are 0, and a center row of Equation 25 is all 0s.

[0091] Now, it is necessary to process such a matrix G.sub.0 to have the desired property, but it is not easy to have intuitive force in the frequency domain. This is because it is familiar with signal processing in the time domain rather than in the frequency domain. Therefore, G.sub.0 is first switched to the time domain.

[0092] G.sub.0 In order to switch G.sub.0 to the time domain, the columns of the matrix are expanded to a required size and are zero-padded, and in this case, a matrix required for permuting and zero-padding is defined as follows.

##STR00001##

[0093] G.sub.0 A matrix in which G.sub.0 is permuted and zero-padded may be expressed as follows.

A.sub.1=WG.sub.0(27)

[0094] In order to switch the matrix A.sub.1 to the time domain, IFFT is performed for each column as follows.

P.sub.1=F.sup.1A.sub.1(28)

[0095] Here, F is expressed in as Equation (29) and =2/L.

[00017]$\begin{array}{cc}F=\left[\begin{array}{ccccc}1& 1& 1& \mathrm{.Math.}& 1\\ 1& e^{-j.Math..Math.}& e^{-j.Math..Math.2.Math..Math.}& \mathrm{.Math.}& e^{-j\left(L-1\right).Math.}\\ 1& e^{-j.Math..Math.2.Math..Math.}& e^{-j.Math..Math.4.Math..Math.}& \mathrm{.Math.}& e^{-j.Math..Math.2.Math.\left(L-1\right).Math.}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}\\ 1& e^{-j\left(L-1\right).Math.}& e^{-j.Math..Math.2.Math.\left(L-1\right).Math.}& \mathrm{.Math.}& e^{-j\left(L-1\right).Math.\left(L-1\right).Math.}\end{array}\right]& \left(29\right)\end{array}$

[0096] Since a first row of the matrix F is all is, a first row the matrix transformed by IDFT may be written as follows.

[00018]$\begin{array}{cc}{p}_1=\left[\begin{array}{cccc}\underset{l=0}{\overset{L-1}{.Math.}}.Math.a_{l,1}& \underset{l=0}{\overset{L-1}{.Math.}}.Math.a_{l,2}& \mathrm{.Math.}& \underset{l=0}{\overset{L-1}{.Math.}}.Math.a_{l,M}\end{array}\right]& \left(30\right)\end{array}$

[0097] The reason for a spectrum spread phenomenon in OFDM is that each carrier function has a sudden jump at a starting point. In other words, a spectrum spread or leakage phenomenon occurs due to the jump including a large amount of high frequency at the start point. Therefore, such a jump may be removed by subtracting the first row from each row. This is mathematically expressed as follows.

[00019]$\begin{array}{cc}{Q}_1=.Math..Math.P_1=\left[\begin{array}{c}{p}_1\\ \mathrm{.Math.}\\ p_L\end{array}\right]-\left[\begin{array}{c}{p}_1\\ \mathrm{.Math.}\\ p_1\end{array}\right]=P-J_P& \left(31\right)\end{array}$

[0098] Here, serves as an operator that removes the jump from the columns of the matrix P.sub.1. Q.sub.1 The matrix may be transformed to the frequency domain by performing DFT for the columns of Q.sub.1. This may be mathematically expressed as follows.

B.sub.1=F.sub.1(32)

[0099] Most of the matrix B.sub.1 is zero and is not required for operation. Therefore, the matrix may be reduced without loss of information through permutation and truncation, and this may be mathematically expressed as follows.

H=W.sub.TB.sub.1(33)

[0100] Meanwhile, a method for removing the jump in the columns of the matrix by Equation (31) may be variously considered. The fact that the first row in the time domain is all zero has the same meaning that the sum for each column in the frequency domain is zero. Therefore, the method for removing the jump is not unique, but all of the methods for removing the jump are not useful. Whether or not the method for removing the jump is useful is determined by diversity capable of designating frequency characteristic and a pilot vector as described below.

[0101] A relationship between the initial matrix G.sub.0 and an intermediate matrix H is as follows.

H=G.sub.0(34)

[0102] Here, is used as an operator that removes the jump in the columns of the initial matrix G.sub.0 to make the sum for the respective columns in the matrix H zero. This is mathematically expressed as follows.

I.sub.1NH=.sub.1(N-1)(35)

[0103] An important fact when devising the method for removing the jump is that a rank of the matrix from which the jump is removed should not be reduced as compared to an original rank.

[0104] First, for N, which is an even number, two N(N1) matrixes that satisfy Equation (35) may be defined as follows.

[00020]$\begin{array}{cc}{R}_{e.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccccc}& & & & & & & 0\\ & & & & & 0& 1& \\ & & & & \mathrm{.Math.}& & & \\ & & 0& 1& & & & \\ 0& 1& & & & & & \\ 0& 1& & & & & & \\ & & 0& 1& & & & \\ & & & & & & & \\ & & & & & 0& 1& \\ & & & & & & & 0\end{array}\right]& \left(36.Math.a\right)\\ R_{e.Math..Math.2}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccccc}& & & & & & & 0\\ & & & & & 0& 1/2& \\ & & & & \mathrm{.Math.}& & 1/2& \\ & & 0& 1/2& & & & \\ 0& 1& & 1/2& & & & \\ 0& 1& & 1/2& & & & \\ & & 0& 1/2& & & & \\ & & & & & & 1/2& \\ & & & & & 0& 1/2& \\ & & & & & & & 0\end{array}\right]& \left(36.Math.b\right)\end{array}$

[0105] It may be seen that the sum of even-numbered columns of Equations (36a) and (36b) is all {square root over (2)}. If the jump matrix is subtracted from the initial matrix, a matrix from which the jump is removed may be obtained as follows.

[00021]$\begin{array}{cc}{H}_{e.Math..Math.1}={}_{e.Math..Math.1}.Math.G_e^{\left(0\right)}=G_e^{\left(0\right)}-R_{e.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & & 1\\ & & & & & 1& -1\\ & & & 1& \mathrm{.Math.}& & \\ & 1& 1& -1& & & \\ 1& -1& & & & & \\ -1& -1& & & & & \\ & 1& -1& -1& & & \\ & & & 1& & & \\ & & & & & -1& -1\\ & & & & & & 1\end{array}\right]& \left(38.Math.a\right)\\ H_{e.Math..Math.2}={}_{e.Math..Math.2}.Math.G_e^{\left(0\right)}=G_e^{\left(0\right)}-R_{e.Math..Math.2}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & & 1\\ & & & & & 1& -1/2\\ & & & 1& \mathrm{.Math.}& & .Math.-1/2\\ & 1& 1& -1/2& & & \\ 1& -1& & -1/2.Math.& & & \\ -1& -1& & -1/2.Math.& & & \\ & 1& -1& -1/2& & & \\ & & & 1& & & -1/2.Math.\\ & & & & & -1& -1/2\\ & & & & & & 1\end{array}\right]& \left(38.Math.b\right)\end{array}$

[0106] It may be seen that the sum for columns of the above two matrixes is all zero. It may be seen from the above-mentioned fact that such a matrix becomes a matrix in which there is no jump in the time domain.

[0107] Next, for N, which is an odd number, two N(N1) matrixes that satisfy Equation (35) may be defined as follows.

[00022]$\begin{array}{cc}{R}_{o.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccc}& & & 0& 0\\ & & \mathrm{.Math.}& & \\ 0& 0& & & \\ 2& 0& \mathrm{.Math.}.Math.& 2.Math.& .Math.0\\ .Math.0& 0& & & \\ & & & 0& 0\end{array}\right]& \left(39.Math.a\right)\\ R_{o.Math..Math.2}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccc}& & & & 0.5& 0\\ & & & \mathrm{.Math.}& & \\ 0& 0& 0.5.Math.& & & \\ 2& 0& 1.Math.& \mathrm{.Math.}& 1& 0\\ .Math.0& 0& 0.5& & & \\ & & & & & \\ & & & & 0.5& 0\end{array}\right]& \left(39.Math.b\right)\end{array}$

[0108] It may be seen that the sum of odd-numbered columns of Equations (39a) and (39b) is all {square root over (2)}. If the jump matrix is subtracted from the initial matrix, a matrix from which the jump is removed may be obtained as follows.

[00023]$\begin{array}{cc}{H}_{o.Math..Math.1}={}_{o.Math..Math.1}.Math.G_o^{\left(0\right)}=G_o^{\left(0\right)}-R_{o.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & 1& 1\\ & & & & \mathrm{.Math.}& -1& \\ & & 1& 1& & & \\ 1& 1& -1& & & & \\ -2& 0& & & \mathrm{.Math.}& & 0\\ 1& -1& -1& & & & \\ & & 1& -1& & & \\ & & & & & -1& \\ & & & & & 1& -1\end{array}\right]& \left(40.Math.a\right)\\ H_{o.Math..Math.2}={}_{o.Math..Math.2}.Math.G_o^{\left(0\right)}=G_o^{\left(0\right)}-R_{o.Math..Math.2}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & 1& 1\\ & & & & \mathrm{.Math.}& -0.5& \\ & & 1& 1& & & \\ 1& 1& -0.5& & & & \\ -2& 0& -1& & \mathrm{.Math.}& -1& 0\\ 1& -1& -0.5& & & & \\ & & 1& -1& & & \\ & & & & & -0.5& \\ & & & & & 1& -1\end{array}\right]& \left(40.Math.b\right)\end{array}$

[0109] It may be seen that the sum for columns of the above two matrixes is all zero. It may be seen from the above-mentioned fact that such a matrix becomes a matrix in which there is no jump in the time domain.

[0110] Now, in order to improve spectrum characteristic of the matrix from which the jump is removed, a filtering is performed. This is mathematically expressed as follows.

.sub.1=F.sup.1WH(41)

[0111] Here, is expressed as in Equation (42).

[00024]$\begin{array}{cc}=\frac{1}{2}\left[\begin{array}{ccccccc}1& 1& & & & & \\ & 1& 1& & & & \\ & & 1& 1& & & \\ & & & & & & \\ & & & & & 1& 1\\ & & & & & & 1\end{array}\right]& \left(42\right)\end{array}$

[0112] After performing the filtering, DFT, permutation, and truncation, the filtered matrix as follows may be obtained.

U=WF.sub.1=H=G.sub.0(43)

[0113] The initial matrix is started with the matrix having orthogonal columns, but may be deviated from the matrix having the orthogonal columns while removing the jump and performing the filtering. Therefore, the matrix given by Equation (43) may be transformed to a matrix having the closest orthogonal column while maintaining property thereof, as follows.

[00025]$\begin{array}{cc}G={U\left(U^H.Math.U\right)}^{-\frac{1}{2}}& \left(44\right)\end{array}$

[0114] Here, U.sup.H is the Hermitian matrix of U. By so doing, it was shown that G is generated from G.sub.0 by Equation (22).

[0115] A communication path between the transmitter and the receiver may have a plurality of channel paths. In order to obtain information on the paths, an existing OFDM uses pre-known pilot symbol between the transmitter and the receiver. G-OFDM does not use one subchannel, but uses one column in the matrix as a pilot vector.

[0116] A process of generating the matrix including the pilot vector may be defined in the same way as the process of generating G from the initial matrix G.sub.0. In the matrix including the pilot vector, all other vector elements corresponding to the rows that are located in non-zero elements that make up the pilot vector should be all be zero.

[0117] N When N is an even number, the initial matrix may be defined as follows.

[00026]$\begin{array}{cc}{G}_{p,e}^{\left(0\right)}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & 1& 1\\ & & & & \mathrm{.Math.}& & \\ & & 1& 1& & & \\ & 1& & & & & \\ 1& & & & & & \\ -1& & & & & & \\ & -1& & & & & \\ & & 1& -1& & & \\ & & & & & & \\ & & & & & 1& -1\end{array}\right]& \left(45\right)\end{array}$

[0118] In addition, jump matrixes may be defined as follows.

[00027]$\begin{array}{cc}{R}_{p,e.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & & 0\\ & & & & 0& 1& \\ & & & \mathrm{.Math.}& & & \\ & 0& 1& & & & \\ 0& & & & & & \\ 0& & & & & & \\ & 0& 1& & & & \\ & & & & & & \\ & & & & 0& 1& \\ & & & & & & 0\end{array}\right]& \left(46.Math.a\right)\\ R_{e.Math..Math.2,p}=\frac{1}{\sqrt{2}}\left[\begin{array}{ccccccc}& & & & & & 0\\ & & & & 0& 1/2& \\ & & & \mathrm{.Math.}& & 1/2& \\ & 0& 1/2& & & & \\ 0& & 1/2& & & & \\ 0& & 1/2& & & & \\ & 0& 1/2& & & & \\ & & & & & 1/2& \\ & & & & 0& 1/2& \\ & & & & & & 0\end{array}\right]& \left(46.Math.b\right)\end{array}$

[0119] N When N is an odd number, the initial matrix may be defined as follows.

[00028]$\begin{array}{cc}\begin{array}{cc}{G}_{p,o}^{\left(0\right)}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccc}& & & & 1& 1\\ & & & \mathrm{.Math.}& & \\ & 1& 1& & & \\ 1& & & & & \\ 0& & & \mathrm{.Math.}& 0& 0\\ -1& & & & & \\ & 1& -1& & & \\ & & & & & \\ & & & & 1& -1\end{array}\right]& \end{array}& \left(47\right)\end{array}$

[0120] In addition, jump matrixes may be defined as follows.

[00029]$\begin{array}{cc}{R}_{p,o.Math..Math.1}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccc}& & & & 0& 0\\ & & & \mathrm{.Math.}& & \\ & & & & & \\ 0& 2& 0& \mathrm{.Math.}& 2& 0\\ & & & & & \\ & & & & & \\ & & & & 0& 0\end{array}\right]& \left(48.Math.a\right)\\ R_{p,o.Math..Math.2}=\frac{1}{\sqrt{2}}\left[\begin{array}{cccccc}& & & & 0.5& 0\\ & & & \mathrm{.Math.}& & \\ & & 0& & & \\ 0& 0.5& & & & \\ 0& 1& & \mathrm{.Math.}& 1& 0\\ 0& 0.5& & & & \\ & & 0& & & \\ & & & & & \\ & & & & 0.5& 0\end{array}\right]& \left(48.Math.b\right)\end{array}$

Simulation and Result

[0121] In order to confirm whether or not the frequency cut-off characteristic is well made when the filter matrix, which is a key of the present invention, is actually applied, a simulation was performed. That is, a simulation process will be briefly described below. The matrix of the hierarchical function is obtained using the initial matrix which is appropriately set, the jump matrix, and Equation (22), and it is confirmed whether a first column of the matrix of the hierarchical function may be used as the pilot vector. In general, a reference signal known to both the transmitter and the receiver for channel estimation is called a pilot, and if the first column of the matrix of the hierarchical function obtained in the simulation satisfies the conditions described above, it may be determined that the first column of the matrix of the hierarchical function has high frequency cut-off characteristic and may be used as the pilot vector.

Inventive Example 1: G(8,6)-OFDM

[0122] First, G.sub.p,e1.sup.(86)=G.sub.p,e1,real.sup.(86)+jG.sub.p,e1,imag.sup.(86) may be obtained from Equation (22) with an initial matrix G.sub.p.sup.(0)(86) and a jump matrix R.sub.p,e1.sup.(86). Here, G.sub.p,e1,real.sup.(86) and G.sub.p,e1,imag.sup.(86) are shown in Tables 1(a) and 1(b), respectively. Referring to Tables 1(a) and 1(b), when it is assumed that a first column is a pilot vector, all elements of other vectors become zero for element other than first zero, and as a result, it may be seen that the first column may be used as the pilot vector.

TABLE-US-00001 TABLE 1(a) 0.0000 0.0000 0.1494 0.0000 0.5577 0.7071 0.0000 0.0000 0.4082 0.7071 0.4083 0.0000 0.0000 0.7071 0.5577 0.0000 0.1494 0.0000 0.7071 0.0000 0.0000 0.0000 0.0000 0.0000 0.7070 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.7070 0.5576 0.0000 0.1494 0.0000 0.0000 0.0000 0.4082 0.7070 0.4082 0.0000 0.0000 0.0000 0.1494 0.0000 0.5575 0.7069

TABLE-US-00002 TABLE 1(b) 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0013 0.0022 0.0013 0.0000 0.0000 0.0043 0.0034 0.0000 0.0009 0.0000 0.0065 0.0000 0.0000 0.0000 0.0000 0.0000 0.0087 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0108 0.0086 0.0000 0.0023 0.0000 0.0000 0.0000 0.0075 0.0130 0.0075 0.0000 0.0000 0.0000 0.0032 0.0000 0.0120 0.0152

[0123] FIG. 10 shows columns of the matrix G.sup.(86) in the time domain, and it may be seen that all curves start with 0 and end at 0. This prevents a spectrum spread by not sharply changing a function used as a carrier wave. FIG. 11 shows the columns of the matrix G in the frequency domain, and it may be seen that spectrum characteristics are different for each of the columns. FIG. 12 illustrates a comparison between existing OFDM and power spectral density (PSD) of G-OFDM according to the present invention. It may be confirmed from FIG. 12 that G-OFDM shows very high spectrum use efficiency.

[0124] Meanwhile, G.sub.p,e2.sup.(86)=G.sub.p,e2,real.sup.(86)+jG.sub.p,e2,imag.sup.(86) may be obtained from Equation (22) with an initial matrix G.sub.p.sup.(0)(86) and a jump matrix R.sub.p,e2.sup.(86). Here, G.sub.p,e2,real.sup.(86) and G.sub.p,e2,imag.sup.(86) are shown in Tables 2(a) and 2(b), respectively. Referring to Tables 2(a) and 2(b), when it is assumed that a first column is a pilot vector, all elements of other vectors are not zero for elements other than first zero, and as a result, it may be seen that the first column may not be used as the pilot vector.

TABLE-US-00003 TABLE 2(a) 0.0000 0.0000 0.0490 0.0000 0.5835 0.7071 0.0000 0.0000 0.5590 0.7071 0.2428 0.0000 0.0000 0.7071 0.3162 0.0000 0.3162 0.0000 0.7071 0.0000 0.2917 0.0000 0.0245 0.0000 0.7070 0.0000 0.2917 0.0000 0.0245 0.0000 0.0000 0.7070 0.3162 0.0000 0.3162 0.0000 0.0000 0.0000 0.5589 0.7070 0.2427 0.0000 0.0000 0.0000 0.0490 0.0000 0.5833 0.7069

TABLE-US-00004 TABLE 2(b) 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0017 0.0022 0.0007 0.0000 0.0000 0.0043 0.0019 0.0000 0.0019 0.0000 0.0065 0.0000 0.0027 0.0000 0.0002 0.0000 0.0087 0.0000 0.0036 0.0000 0.0003 0.0000 0.0000 0.0108 0.0049 0.0000 0.0049 0.0000 0.0000 0.0000 0.0103 0.0130 0.0045 0.0000 0.0000 0.0000 0.0011 0.0000 0.0125 0.0152

Inventive Example 2: G(7,5)-OFDM

[0125] First, G.sub.p,o1.sup.(75)=G.sub.p,o1,real.sup.(75)+jG.sub.p,o1,imag.sup.(75) may be obtained from Equation (22) with an initial matrix G.sub.p.sup.(0)(75) and a jump matrix R.sub.p,o1.sup.(75). Here, G.sub.p,o1,real.sup.(75) and G.sub.p,o1,imag.sup.(75) are shown in Tables 3(a) and 3(b), respectively. Referring to Tables 3(a) and 3(b), when it is assumed that a first column is a pilot vector, all elements of other vectors become zero for element other than first zero, and as a result, it may be seen that the first column may be used as the pilot vector.

[0126] FIG. 13 shows columns of the matrix G.sup.(75) in the time domain, and it may be seen that all curves start with 0 and end at 0. This prevents a spectrum spread by not sharply changing a function used as a carrier wave. FIG. 14 shows the columns of the matrix G in the frequency domain, and it may be seen that spectrum characteristics are different for each of the columns. FIG. 15 illustrates a comparison between existing OFDM and power spectral density (PSD) of G-OFDM according to the present invention. It may be confirmed from FIG. 15 that G-OFDM shows very high spectrum use efficiency.

TABLE-US-00005 TABLE 3(a) 0.0000 0.1954 0.0000 0.5117 0.7071 0.0000 0.5117 0.7071 0.1954 0.0000 0.7071 0.0000 0.0000 0.0000 0.0000 0.0000 0.6324 0.0000 0.6324 0.0000 0.7070 0.0000 0.0000 0.0000 0.0000 0.0000 0.5116 0.7070 0.1954 0.0000 0.0000 0.1954 0.0000 0.5116 0.7070

TABLE-US-00006 TABLE 3(b) 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0016 0.0022 0.0006 0.0000 0.0043 0.0000 0.0000 0.0000 0.0000 0.0000 0.0058 0.0000 0.0058 0.0000 0.0087 0.0000 0.0000 0.0000 0.0000 0.0000 0.0078 0.0108 0.0030 0.0000 0.0000 0.0036 0.0000 0.0094 0.0130

[0127] Meanwhile, G.sub.p,o2.sup.(75)=G.sub.p,o2,real.sup.(75)+jG.sub.p,o2,imag.sup.(75) may be obtained from Equation (22) with an initial matrix G.sub.p.sup.(0)(75) and a jump matrix R.sub.p,o2.sup.(75). Here, G.sub.p,o2,real.sup.(75) and G.sub.p,o2,imag.sup.(75) a are shown in Tables 4(a) and 4(b), respectively. Referring to Tables 4(a) and 4(b), when it is assumed that a first column is a pilot vector, all elements of other vectors are not zero for elements other than first zero, and as a result, it may be seen that the first column may not be used as the pilot vector.

TABLE-US-00007 TABLE 4(a) 0.0000 0.0435 0.0000 0.5827 0.7071 0.0000 0.5175 0.7071 0.2479 0.0000 0.7071 0.2914 0.0000 0.3131 0.0000 0.0000 0.5392 0.0000 0.0435 0.0000 0.7070 0.2913 0.0000 0.3131 0.0000 0.0000 0.5174 0.7070 0.2479 0.0000 0.0000 0.0435 0.0000 0.5826 0.7070

TABLE-US-00008 TABLE 4(b) 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0016 0.0022 0.0008 0.0000 0.0043 0.0018 0.0000 0.0019 0.0000 0.0000 0.0050 0.0000 0.0004 0.0000 0.0087 0.0036 0.0000 0.0038 0.0000 0.0000 0.0079 0.0108 0.0038 0.0000 0.0000 0.0008 0.0000 0.0107 0.0130

[0128] From the above simulation results, it was confirmed that a technology capable of simultaneously controlling orthogonality and the spectrum by the method for generating G from G.sub.0 according to the present invention is developed. It is also confirmed that the matrix for implementing the system is not unique, but the useful matrixes are matrixes capable of accommodating the pilot vector when R.sub.p,e1 and R.sub.p,o1, which are the proposed jump matrixes, are used.

[0129] The present invention is not limited to the above-mentioned exemplary embodiments but may be variously applied, and may be variously modified by those skilled in the art to which the present invention pertains without departing from the gist of the present invention claimed in the claims.

INDUSTRIAL APPLICABILITY

[0130] According to the present invention, since the existing frequency interference problem may be perfectly solved by using the G-OFDM technology, the G-OFDM technology is expected to be a very useful technology for the next generation communication technology as well as the fifth generation.