KR20060110261A - Digital communication method and system - Google Patents

Abstract

A digital communication method and its system are provided to lower a puncturing probability of the second communication station positioned at a cell boundary which is relatively disadvantageous, through soft handover. A systematic bit and a parity bit among output bits of a systematic channel encoder are discriminated. The systematic bit is transmitted according to an orthogonal resource division multiplexing method. The parity bit is transmitted according to an orthogonal resource hopping multiplexing method. The systematic channel encoder is a turbo encoder.

Description

Digital communication method and system {DIGITAL COMMUNICATION METHOD AND SYSTEM}

1 is a system conceptual diagram illustrating a first communication station and a second communication station according to the prior art and an embodiment of the present invention.

2A is a block diagram of a transmitter in a first communication station corresponding to a common component according to the related art and an embodiment of the present invention.

2B is a block diagram of a transmitter for a traffic channel in a first communication station according to an embodiment of the prior art.

3A is a block diagram of a transmitter of a first communication station using a code division multiplexing scheme according to an embodiment of the prior art (when BPSK data modulation is used and the same orthogonal code symbol is used for an I / Q channel).

3B is a block diagram of a transmitter of a first communication station using a code division multiplexing scheme according to an embodiment of the prior art (when BPSK data modulation and other orthogonal code symbols may be used for an I / Q channel).

3C is a block diagram of a transmitter of a first communication station using a code division multiplexing scheme according to an embodiment of the prior art (when QPSK data modulation and using the same orthogonal code symbol for an I / Q channel).

3D is a block diagram of a transmitter of a first communication station using a code division multiplexing scheme according to an embodiment of the prior art (when QPSK data modulation and other orthogonal code symbols may be used for an I / Q channel).

3E is a block diagram of a transmitter of a first communication station using a code division multiplexing scheme according to an embodiment of the prior art using a quasi-orthogonal code (when QPSK data modulation and using the same orthogonal code symbol for an I / Q channel).

3F is a block diagram of a transmitter of a first communication station using a code division multiplexing scheme according to an embodiment of the prior art using a quasi-orthogonal code (when QPSK data modulation and other orthogonal code symbols may be used for an I / Q channel) .

4A is a transmission signal diagram at a first communication station for each frame according to an embodiment of the prior art.

4B is a transmission signal diagram at a first communication station for each frame according to another embodiment of the prior art.

4C is a transmission signal diagram of a first communication station for each frame according to another embodiment of the prior art.

4D is a transmission signal diagram in a first communication station using a conventional frequency division multiplexing (FDM) scheme.

4E is a transmission signal diagram in a first communication station using a conventional time division multiplexing (TDM) scheme.

4F is a transmission signal diagram in a first communication station using a conventional time division multiplexing (TDM) scheme (when a frequency hopping scheme in units of slots is applied).

4G is a transmission signal diagram at a first communication station in the conventional frequency hopping multiplexing (FHM) scheme for frequency diversity (regular frequency hopping in symbols).

4H is a transmission signal diagram at a first communication station by a conventional frequency hopping multiplexing (FHM) scheme for frequency diversity and eavesdropping (irregular frequency hopping in symbols).

4I is a transmission signal diagram of a first communication station using a conventional Orthogonal Code Division Multiplexing (OCDM) scheme (fixed orthogonal code assignment for each channel).

4J is a transmission signal diagram in a first communication station using a conventional orthogonal resource division multiplexing (ORDM) scheme (fixed orthogonal resource allocation for each channel).

FIG. 5 is a block diagram of a receiver in a second communication station using a code division multiplexing scheme according to the prior art embodiment of FIG.

6 is a configuration diagram of a common part of a receiver in a second communication station according to the prior art and the embodiment of the present invention.

7 is a block diagram of a receiver in a second communication station according to an embodiment of the prior art.

8 is a configuration diagram of a common part of a receiver in a second communication station according to the prior art and the embodiment of the present invention.

FIG. 9A is a block diagram of a transmitter at a first communication station for an orthogonal resource hopping multiplexed traffic channel according to an embodiment of the present invention, and a diagram of a common physical control channel for the traffic channel (orthogonal resource = orthogonal code).

9B is a signal diagram of a common physical control channel (CPCCH) according to an embodiment of the present invention.

10A is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (corresponding to FIG. 3A).

FIG. 10B is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (shown in FIG. 10A as a complex signal).

10C is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (corresponding to FIG. 3B).

FIG. 10D is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (shown in FIG. 10C as a complex signal).

FIG. 10E is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (corresponding to FIG. 3C).

10F is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (FIG. 10E is represented by a complex signal).

10G is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (corresponding to FIG. 3D).

10H is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (FIG. 10G is represented by a complex signal).

FIG. 10I is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (corresponding to FIG. 3E).

10J is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (FIG. 10I is represented by a complex signal).

FIG. 10K is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (corresponding to FIG. 3F).

10L is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention (FIG. 10K is represented by a complex signal).

11 is a block diagram of a multi-dimensional orthogonal resource hopping pattern generator according to an embodiment of the present invention.

12A is a diagram illustrating an example of a subcarrier group for frequency hopping according to an embodiment of the present invention (orthogonal resource = frequency).

12B is a configuration diagram of a subcarrier synthesizer according to the output of the frequency hopping pattern generator according to the embodiment of the present invention.

FIG. 12C is a diagram illustrating an example of a transmission data symbol location interval for a transmission time leap in symbol units according to an embodiment of the present invention (orthogonal resource = time, "1" = ON, "0" = OFF).

12D is a block diagram of a symbol position selector (or buffer) according to the output of the time hopping pattern generator at the transmitting side of the first communication station according to the embodiment of the present invention.

12E is a block diagram of an orthogonal gold code generator according to an orthogonal code hopping pattern according to an embodiment of the present invention (orthogonal resource = orthogonal gold code).

Fig. 12F is a diagram showing a tree orthogonal Walsh code according to various diffusion coefficients (Orthogonal Resources = Orthogonal Walsh Code).

12G is a block diagram of an orthogonal Walsh code generator according to an orthogonal code hopping pattern according to an embodiment of the present invention (orthogonal resource = orthogonal Walsh code).

12H is a block diagram of a symbol position selector (or buffer) according to the output of the time hopping pattern generator at the receiving side of the second communication station according to the embodiment of the present invention.

FIG. 13A is a receiver diagram of a second communication station for an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention of FIG. 10A.

FIG. 13B is a block diagram of a receiver in a second communication station for an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention of FIG. 10C.

FIG. 13C is a block diagram of a receiver in the second communication station for the orthogonal resource hopping multiplexing scheme according to the embodiment of the present invention of FIG. 10E.

FIG. 13D is a receiver diagram of a second communication station for an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention of FIG. 10G.

FIG. 13E is a block diagram of a receiver in a second communication station for the orthogonal resource hopping multiplexing scheme according to the embodiment of the present invention of FIG. 10I.

FIG. 13F is a receiver diagram of a second communication station for the orthogonal resource hopping multiplexing scheme according to the embodiment of the present invention of FIG. 10K.

14A is a transmission signal diagram at a first communication station for each frame according to an embodiment of the prior art.

14B is a transmission signal diagram at a first communication station for each frame according to an embodiment of the present invention.

14C is a transmission signal diagram of a first communication station in a frame having a transmission rate lower than the basic transmission rate R (hereinafter, referred to as a sparse frame) according to an embodiment of the present invention (regular transmission time jump).

14D is a transmission signal diagram of a first communication station in a sparse frame according to an embodiment of the present invention (irregular transmission time hopping).

FIG. 14E is a transmission signal diagram at a first communication station by frequency hopping multiplexing (FDM) scheme in a sparse frame according to an embodiment of the present invention (irregular transmission time hopping). FIG.

FIG. 14F is a diagram illustrating a case where a collision occurs in which a jump pattern represented by two-dimensional coordinates of (transmission time, subcarrier) is simultaneously selected by a plurality of channels in FIG. 14E. ).

FIG. 14G is a diagram exemplifying whether to compare data symbols of coordinates at which collision occurs in FIG. 14F and determining whether to transmit them (a black rectangle is transmitted, and a dotted rectangle is not transmitted).

14H is a transmission signal diagram at a first communication station by a time hopping multiplexing scheme in a sparse frame according to an embodiment of the present invention (regular transmission time hopping).

14I is a transmission signal diagram at a first communication station by a time hopping multiplexing scheme in a sparse frame according to an embodiment of the present invention (irregular transmission time hopping).

FIG. 14J is a diagram illustrating a case where a collision occurs in which a jump pattern represented by one-dimensional coordinates of (transmission time) is simultaneously selected by a plurality of channels in FIG. 14I (data symbol in which a square of a solid solid line collides).

FIG. 14K is a diagram exemplifying whether to transmit data by comparing data symbols of coordinates at which collision occurs in FIG. 14J (a black rectangle is transmitted, and a dotted rectangle is not transmitted).

FIG. 14L is a transmission signal diagram in a first communication station using an orthogonal code hopping multiplexing scheme in a frame (dense frame) of a basic data rate R according to an embodiment of the present invention.

FIG. 14M is a transmission signal diagram of a first communication station using transmission time hopping multiplexing and orthogonal code hopping multiplexing for a sparse frame according to an embodiment of the present invention. FIG.

FIG. 14N is a diagram illustrating a case in which a collision occurs in which a jump pattern represented by two-dimensional coordinates of (transmission time, orthogonal code) is simultaneously selected by a plurality of channels in FIG. 14M. symbol).

FIG. 14O is a diagram exemplifying whether to transmit data by comparing data symbols of coordinates at which collision occurs in FIG. 14N (a black rectangle is transmitted, and a dotted rectangle is not transmitted).

FIG. 14P is a transmission signal diagram of a first communication station using a symbolic regular transmission time hopping multiplexing and orthogonal code hopping multiplexing scheme for a sparse frame according to an embodiment of the present invention (when a start symbol of a frame is in the same position) ).

FIG. 14Q is a diagram illustrating a case where a collision occurs in which a jump pattern represented by two-dimensional coordinates of (transmission time, orthogonal code symbol) is simultaneously selected by a plurality of channels in FIG. 14P. Data symbols).

FIG. 14R is a diagram exemplifying whether to transmit data by comparing data symbols of coordinates at which collision occurs in FIG. 14Q (a black rectangle is transmitted, and a dotted rectangle is not transmitted).

14S is a transmission signal diagram of a first communication station using a regular transmission time hopping multiplexing and orthogonal code hopping multiplexing method for a coarse frame according to an embodiment of the present invention (when a start symbol of a frame is in a staggered position). ).

FIG. 14T is a diagram illustrating a case in which a collision occurs in which a jump pattern represented by two-dimensional coordinates of (transmission time, orthogonal code) in FIG. 14S is simultaneously selected by a plurality of channels. symbol).

FIG. 14U is a diagram exemplifying whether to transmit data by comparing data symbols of coordinates at which collision occurs in FIG. 14T (a black rectangle is transmitted, and a dotted rectangle is not transmitted).

FIG. 14V is a transmission signal diagram of a first communication station using an irregular transmission time hopping multiplexing and an orthogonal code hopping multiplexing method per channel for a sparse frame according to an embodiment of the present invention.

FIG. 14W is a diagram illustrating a case where a collision occurs in which a jump pattern represented by two-dimensional coordinates of (transmission time, orthogonal code) is simultaneously selected by a plurality of channels in FIG. 14V. symbol).

FIG. 14x is a diagram exemplifying whether to transmit data by comparing data symbols of coordinates at which collision occurs in FIG. 14w (a black rectangle is transmitted, and a dotted rectangle is not transmitted).

FIG. 14Y illustrates a transmission signal diagram of a first communication station using a random carrier frequency hopping multiplexing, a transmission time hopping multiplexing, and an orthogonal code hopping multiplexing method in units of symbols for a sparse frame according to an embodiment of the present invention.

FIG. 14z is a diagram illustrating a case where a collision occurs in which a jump pattern represented by three-dimensional coordinates of (carrier frequency, transmission time, orthogonal code) in FIG. 14y occurs simultaneously by a plurality of channels (collision marking is bold). Solid cuboid).

FIG. 14A is a diagram illustrating whether data transmission of coordinates in which collision occurs in FIG. 14Z is performed to determine whether to transmit or not (a white cube is transmitted, and a dotted cube is not transmitted).

15 is an average required by the channel decoder to satisfy a desired communication quality when transmission is stopped in a multi-dimensional hop pattern collision interval as shown in FIGS. 14G, 14K, 14O, 14R, 14U, 14X, and 14AA. A diagram illustrating increasing the transmit power of a first communication station during a period of a frame containing data symbols not transmitted to compensate for received energy.

FIG. 16 is a diagram illustrating that transmission interruption due to multi-dimensional hop pattern collision and transmission data symbol mismatch operates independently for each transmit antenna beam of a first communication station that guarantees spatial orthogonality.

FIG. 17 is a diagram illustrating a difference between transmit powers of a first communication station allocated to a second communication station located near and a second communication station located close to the first communication station for the same data service.

18A is a flowchart illustrating a transmission signal determination method I for each orthogonal radio resource unit in a transmitter in a direction of a second communication station in a first communication station according to an embodiment of the present invention (two methods of transmission and puncturing).

FIG. 18B is a diagram illustrating an example of final transmission signal determination by the scheme of FIG. 18A when two-dimensional orthogonal resource hopping patterns of two channels collide with each other. FIG.

FIG. 18C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of two channels (c, l) to explain final transmission signal determination by the scheme of FIG. 18A.

FIG. 18D is a diagram illustrating a final transmission signal determined by the algorithm of FIG. 18A in the case of FIG. 18C.

19A is a flowchart for explaining a transmission signal determination method II for each orthogonal radio resource unit in a transmitter in a direction from a first communication station to a second communication station according to an embodiment of the present invention (method having a limit value of transmission power).

FIG. 19B is a diagram illustrating an example of final transmission signal determination by the scheme of FIG. 19A when two-dimensional orthogonal resource hopping patterns of two channels collide with each other. FIG.

FIG. 19C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of two channels (c, l) in order to explain the final transmission signal determination by the scheme of FIG. 19A.

FIG. 19D is a diagram illustrating the final transmission signal determined by the algorithm of FIG. 19A in the case of FIG. 19C.

20A is a flowchart illustrating a transmission signal determination method III for each orthogonal radio resource unit at a transmitter in a direction from a first communication station to a second communication station according to an embodiment of the present invention.

FIG. 20B is a diagram illustrating an example of final transmission signal determination by the method of FIG. 20A when a multi-dimensional orthogonal resource hopping pattern of two channels collides.

20C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) in order to explain the final transmission signal determination by the scheme of FIG. 20A.

FIG. 20D is a diagram illustrating an order of amplitude magnitudes of transmission signals of four channels (c, j, l, and s) to explain final transmission signal determination by the method of FIG. 20A.

FIG. 20E is a diagram illustrating a final transmission signal determined by the algorithm of FIG. 20A in the case of FIG. 20C.

FIG. 21A is a flowchart illustrating a transmission signal determination method IV for each orthogonal radio resource unit in a transmitter in a direction of a second communication station in a first communication station according to an embodiment of the present invention.

FIG. 21B is a diagram illustrating an example of final transmission signal determination by the method of FIG. 21A when the multi-dimensional orthogonal resource hopping patterns of two channels collide with each other. FIG.

FIG. 21C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain final transmission signal determination by the method of FIG. 21A.

FIG. 21D is a diagram illustrating an order of amplitude magnitudes of transmission signals of four channels (c, j, l, and s) to explain final transmission signal determination by the method of FIG. 21A.

FIG. 21E is a diagram illustrating a final transmission signal determined by the algorithm of FIG. 21A in the case of FIG. 21C.

22A is a flowchart illustrating a transmission signal determination method V for each orthogonal radio resource unit in a transmitter in a direction from a first communication station to a second communication station according to an embodiment of the present invention.

FIG. 22B is a diagram illustrating an example of final transmission signal determination according to the scheme of FIG. 22A when a multi-dimensional orthogonal resource hopping pattern of two channels collides. FIG.

FIG. 22C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain the final transmission signal determination by the scheme of FIG. 22A.

FIG. 22D is a diagram illustrating an order of amplitude magnitudes of transmission signals of four channels (c, j, l, and s) to explain final transmission signal determination by the method of FIG. 22A.

FIG. 22E is a diagram illustrating the final transmission signal determined by the algorithm of FIG. 22A in the case of FIG. 22C.

23A is a flowchart illustrating a transmission signal determination method VI for each orthogonal radio resource unit in a transmitter in a direction of a second communication station in a first communication station according to an embodiment of the present invention.

FIG. 23B is a diagram illustrating an example of final transmission signal determination by the scheme of FIG. 23A when the multi-dimensional orthogonal resource hopping patterns of two channels collide with each other. FIG.

FIG. 23C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain the final transmission signal determination by the scheme of FIG. 23A.

FIG. 23D is a diagram illustrating an order of amplitude magnitudes of transmission signals of four channels (c, j, l, and s) to explain final transmission signal determination by the method of FIG. 23A.

FIG. 23E is a diagram illustrating a final transmission signal determined by the algorithm of FIG. 23A in the case of FIG. 23C.

24A is a flowchart illustrating a method for determining transmission signal for each orthogonal radio resource unit in a transmitter in a direction from a first communication station to a second communication station according to an embodiment of the present invention.

FIG. 24B is a diagram illustrating an example of final transmission signal determination by the scheme of FIG. 24A when a multi-dimensional orthogonal resource hopping pattern of two channels collides. FIG.

FIG. 24C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain the final transmission signal determination by the scheme of FIG. 24A.

FIG. 24D is a diagram illustrating an order of amplitude magnitudes of transmission signals of four channels (c, j, l, and s) to explain final transmission signal determination by the method of FIG. 24A.

FIG. 24E is a diagram showing the final transmission signal determined by the algorithm of FIG. 24A in the case of FIG. 24C.

25A is a flowchart illustrating a method for determining transmission signal for each orthogonal radio resource unit at a transmitter in a direction of a second communication station from a first communication station according to an embodiment of the present invention.

FIG. 25B is a diagram illustrating an example of final transmission signal determination according to the method of FIG. 25A when two-dimensional orthogonal resource hopping patterns of two channels collide.

FIG. 25C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain the final transmission signal determination by the method of FIG. 25A.

FIG. 25D is a diagram illustrating an order of amplitude magnitudes of transmission signals of four channels (c, j, 1, and s) to explain final transmission signal determination by the method of FIG. 25A.

FIG. 25E is a diagram illustrating the final transmission signal determined by the algorithm of FIG. 25A in the case of FIG. 25C.

FIG. 26 is a diagram illustrating a method for determining a transmission signal for each orthogonal radio resource unit I to V in a transmitter toward a second communication station in a first communication station according to an embodiment of the present invention, where the reception strength of a signal from the first communication station is relatively weak ( Is a diagram showing that the disadvantages of the second communication station located at the cell boundary, etc.) are compensated through soft handoff.

FIG. 27A illustrates a conventional technique for performing orthogonal resource division multiplexing on all of the output bits of a systematic channel encoder without distinguishing between the same information bits as the input bits and the parity bits generated by the channel encoder. It is a figure which shows the Example of this invention which multiplexes an embodiment and orthogonal resource jump.

FIG. 27B is a diagram illustrating an embodiment of the prior art in which orthogonal resource division multiplexing all output bits of a turbo encoder and an embodiment of the present invention in orthogonal resource hopping multiplexing.

FIG. 27C shows that an orthogonal resource division multiplexing of information bits identical to an input bit in an output bit of a systematic channel encoder and parity bits generated by a channel encoder are orthogonal resource hopping multiplexing. (Dividing division orthogonal radio resource region of leap multiplexing).

FIG. 27D is a diagram illustrating a time division between an orthogonal resource division multiplexing region and an orthogonal resource hopping multiplexing region according to the embodiment of FIG. 27C.

FIG. 27E illustrates that orthogonal resource division multiplexing of information bits identical to input bits in an output bit of a turbo encoder and parity bits generated by a channel encoder are orthogonal resource hopping multiplexing. to be.

FIG. 28A is a diagram illustrating a magnitude relationship between a collision probability or a puncturing probability of a multi-dimensional orthogonal resource hopping pattern for each frame according to an embodiment of the present invention, and a reference value in FIG. 4C.

28B is intentionally transmitting all of the transmission frames from the first communication station to the second communication station having the least impact so that the collision probability or puncturing probability of the multi-dimensional orthogonal resource hopping pattern for each frame according to the embodiment of the present invention is smaller than the reference value. It is a figure which shows not.

29A illustrates an orthogonal radio resource unit for orthogonal resource division multiplexing and a set including an orthogonal radio resource unit for orthogonal resource leap multiplexing for wide multidimensional orthogonal resource hopping multiplexing according to an embodiment of the present invention; A diagram illustrating dividing into a set including a.

FIG. 29B is a diagram illustrating a relative relationship between a channel to which an orthogonal radio resource unit for fixed multi-dimensional orthogonal resource hopping multiplexing according to an embodiment of the present invention and a channel to which an orthogonal radio resource unit is allocated according to a hopping pattern.

29C illustrates a channel request, radio resource allocation and channel termination process over time in an orthogonal resource division multiplexing scheme according to an embodiment of the prior art and a negotiated multidimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention. A conceptual diagram.

29D is a conceptual diagram illustrating a channel request, radio resource allocation, mode switching, and channel termination process over time in a coordinated multi-dimensional orthogonal resource hopping multiplexing scheme according to another embodiment of the present invention.

30A is a conceptual diagram illustrating a division mode in a narrow multidimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention.

30B is a conceptual diagram illustrating a hopping mode in a negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention.

30C is a conceptual diagram illustrating a hybrid mode in a negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention.

30D is a conceptual diagram illustrating a group mode for a single channel in the negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention.

30E is a conceptual diagram illustrating a group mode for multiple channels in the negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention.

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a digital communication method and a system thereof. In particular, in a wired / wireless communication system in which a plurality of low-activity communication channels are synchronized through a single medium, the transmission data rate of each channel is less than or equal to the basic transmission rate (R). The present invention relates to a method and apparatus for statistical multiplexing the channels by a multi-dimensional orthogonal resource hopping scheme when transmitted at a variable bit rate.

More specifically, in a system consisting of a plurality of second communication stations synchronized with the first communication station, the first communication station identifies a channel to each second communication station in a multidimensional orthogonal resource hopping pattern, and the multidimensional corresponding to the second communication station. The orthogonal resource hopping pattern consists of a random hopping pattern assigned by the first communication station at call setup or a random-random hopping pattern inherent in the second communication station, and a multi-dimensional orthogonal resource in a hopping pattern of different channels at a moment. Can be matched (hereinafter referred to as "multidimensional jump pattern collision").

In this case, the transmission data symbols are examined for all transmission channels of the first communication station involved in the collision, and if a single data channel transmits data symbols that do not coincide with other channels, the corresponding data symbol interval is turned off. The present invention relates to a multiplexing scheme and apparatus for increasing transmission power of all channels for which transmission of data symbols is turned off by an amount specified during a period defined by a communication protocol in order to compensate for average bit energy of lost data of all related channels.

Further, the first communication station and the second communication station in the present invention correspond to a base station and a mobile station, respectively, in an existing commercialized system. One first communication station communicates with a plurality of second communication stations, and the present invention relates to a statistical multiplexing method that can be applied within a synchronized channel group having orthogonality in the direction of the second communication station at the first communication station.

Quasi-Orthogonal Code (QOC) to be used in cdma2000, a candidate technology of the next generation mobile communication system IMT-2000, which is currently being standardized, and multiple scrambling code (MSC: Multi-) to be used in W-CDMA For a system in which orthogonality is maintained only in each channel group, such as a scrambling code, the present invention may be independently implemented in each channel group.

In addition, when the channels of the first communication station are classified into channel groups having the same transmission antenna beam, such as sectorization or smart antenna system, the present invention can be independently implemented in each channel group.

In order to easily explain what changes and modifications in the prior art can implement the multiplexing scheme proposed by the present invention, the conventional technique to be compared will be described based on IS-95, a mobile communication system that is commercially available and in service.

In the conventional digital and analog frequency division multiplexing (FDM) communication scheme, the first communication station allocates an empty frequency band (FA) to a second communication station when establishing a call regardless of channel activity. It returns the frequency band allocated when the call is released and makes it available to other second communication stations.

Conventional time division multiplexing (TDM) provides a method for assigning an unassigned time slot to a second communication station among several time slots in one frequency band at the time of call setup regardless of channel activity. Allocate and communicate and return the assigned timeslots when the call is released so that other second stations can use them.

Conventional frequency hopping multiplexing (FHM) communication scheme uses a frequency hopping pattern promised between a first communication station and a second communication station when a call is established, regardless of channel activity, and the first communication station communicates with the device. The new channel is determined according to the number of allocated channels, but as in the present invention, a control function such as not transmitting a corresponding symbol of a related channel in order to reduce the possibility of error in a channel decoder of a receiver in case of collision of a jump pattern is performed. Does not have it.

In the conventional method of Orthogonal Code Division Multiplexing (OCDM), a first communication station allocates an unsigned orthogonal code symbol to a second communication station in an orthogonal code at the time of call establishment regardless of channel activity. Communicate and return the orthogonal code symbol assigned upon release of the call back to the first communication station for use by another second communication station.

In describing the embodiments of the prior art, the same reference numerals will be used to refer to the same reference numerals in the drawings to describe the embodiments of the present invention.

1 shows a system according to the prior art and an embodiment of the invention, wherein each communication channel 121, 122, 123 from the first communication station 101 to the second communication station 111, 112, 113 is synchronized. And orthogonal to each other.

FIG. 2A is a transmitter configuration diagram of a first communication station for a portion corresponding to common components in the prior art and the embodiment of the present invention, and FIG. 2B is a view of the first communication station for the traffic channel in the embodiment of the prior art. Transmitter configuration diagram.

2A and 2B, since the pilot channel 200 is used as a channel estimation signal for initial synchronization acquisition and tracking and synchronization demodulation in the second communication station of FIG. 1, each subcarrier (SC) is used. It must be present and is a channel shared by all second communication stations in the area controlled by the first communication station, and transmits a symbol of a known pattern without channel coding and channel interleaving as shown in FIG. 2A. Provide a phase reference.

The synchronization channel 210 is a broadcast channel unilaterally transmitted to all second communication stations in the area controlled by the first communication station, such as the pilot channel 200, and information necessary for all the second communication stations in common in the first communication station. (For example, time information or an identifier of the first communication station).

In addition, the data transmitted through the synchronization channel includes a channel encoder 214, an iterator 216 for symbol rate adjustment, a channel interleaving 218 for overcoming a concatenation error, an iterator 219 for adjusting the transmission data symbol rate, and the like. Through the transmission to the spreader and the modulator to be mentioned in FIG.

In addition, the call channel 220 is a shared channel used for the purpose of receiving an incoming message to the second communication station or responding to a request of the second communication station, and there may be a plurality of call channels.

In addition, data transmitted to the call channel passes through the channel encoder 224, the symbol repeater 226, and the channel interleaver 228, and then the long code generator 232 generated by the long code mask 230 for the call channel. And the exclusive logical OR 236 of the decimated 234 output to the spread and modulator of FIG.

The traffic channel 240 of FIG. 2B is a channel allocated to each second communication station and used exclusively until the call ends. When there is data to be sent from the first communication station to each second communication station, Transmit using a traffic channel.

In this case, the traffic channel is subjected to cyclic redundancy check (CRC) encoding 241 for error checking in a specific time unit called a frame (20 ms in IS-95), and all of the traffic channels are independently formed in each frame unit. A tail bit 242 composed of 0 "is inserted, channel coding 244 is performed, and symbol repetition 246 is performed to adjust the transmission data symbol rate according to the data rate being transmitted.

Next, after the symbol repetition, channel interleaving 248 is performed to convert the concatenation error into a uniform distribution error. The data completed up to the channel interleaving 248 decimates the output of the long code generator 232 using the long code mask 250 generated from an identifier (ESN: Electronic Serial Number) assigned to each second communication station. Scrambling (256) by a pseudo-noise (PN) sequence.

In the decimated PN sequence, a position where a command (PCB) for controlling transmit power from a second communication station is inserted is extracted 258. The data symbols corresponding to the extracted power control command insertion positions of the scrambled 256 data symbols are punctured to insert the power control commands 260, and are transmitted to the spreading and modulation unit of FIG. 3.

In the present invention, the position of a transmission data symbol for transmission time hopping multiplexing may be determined using a decimated value in a PN sequence.

3A to 3C illustrate an embodiment of a spreading and modulation unit using a conventional code division multiplexing technique.

FIG. 3A corresponds to an existing commercialized IS-95 scheme in which a data modulation scheme is binary phase shift keying (BPSK).

FIG. 3B is a case where I / Q channel transmission data can be spread using different orthogonal code symbols in the structure of FIG. 3A.

FIG. 3C illustrates a spreading and modulation unit when a data modulation scheme is used as QPSK to transmit twice as much data as FIG. 3A with the same bandwidth, and is adopted in the cdma2000 scheme, which is a candidate technology of IMT-2000.

FIG. 3D illustrates a spreading and modulation unit when a data modulation scheme is used as QPSK to transmit twice the data compared to FIG. 3B with the same bandwidth.

FIG. 3E illustrates a spreading and modulation unit in the case of using a quasi-orthogonal code (QOC) used in cdma2000, which is a candidate technology of IMT-2000.

FIG. 3F is a case where I / Q channel transmission data can be spread using different orthogonal code symbols in the structure of FIG. 3E.

3A to 3F, the signal converters 310, 330, 326, 346, and 364 in FIG. 3A are logical signals “0” and “1”, respectively, and physical signals “+1” and “-1” that are actually transmitted. ", Each channel of Figure 2 is spread (312, 332) by the output of the corresponding Walsh code generator 362 via a signal converter, the relative transmit power of each channel is an amplifier (314) , 334).

Thereafter, all channels of the first communication station are spread (312, 332) by the orthogonal Walsh function (362) fixedly assigned to each channel, and then amplified (314, 334), and then orthogonal code division multiplexing (316). 336).

The multiplexed signal is subjected to Quadrature Phase Shift Keying (QPSK) spread modulation (318, 338) by short PN sequences (324, 344) for first communication station identification. Further, the spread modulated signal is modulated by carrier waves (322, 342) to transition to the transmission band via low pass filters (320, 340). The signal modulated by the carrier wave is transmitted through an antenna via a wireless unit such as high power amplification, which is omitted in the drawing.

In FIG. 3B, the signal converters 310, 330, 326, 346, 364, and 365 are apparatuses for converting logical signals "0" and "1" into physical signals "+1" and "-1" which are actually transmitted, respectively. 2 are spread (312, 332) by the outputs of corresponding Walsh code generators 362, 363 for each I / Q channel through a signal converter, and the relative transmit power of each channel is an amplifier. (314, 334).

Thereafter, all channels of the first communication station are spread (312, 332) and then amplified (314, 334) by orthogonal Walsh functions (362, 363) fixedly assigned to each channel, and then orthogonal code division multiplexing (316, 336). The multiplexed signal is subjected to Quadrature Phase Shift Keying (QPSK) spread modulation (318, 338) by short PN sequences (324, 344) for first communication station identification.

In addition, the spread modulated signal is modulated by carrier waves (322, 342) to transition to the transmission band via the low pass filters (320, 340). The signal modulated by the carrier wave is transmitted through an antenna via a wireless unit such as high power amplification, which is omitted in the drawing.

FIG. 3C is the same as FIG. 3A except that different information data is carried on the in-phase channel and the quadrature channel through the demultiplexer 390 to transmit the signal generated in FIG. 2 to QPSK instead of BPSK. . In this case, as the demultiplexer 390 and the signal converters 310 and 330 are set, quadrature amplitude modulation (QAM) may be used instead of QPSK.

FIG. 3D is the same as FIG. 3B except that different information data is carried on the in-phase channel and the quadrature channel via the demultiplexer 390 to transmit the signal generated in FIG. 2 to the QPSK instead of the BPSK. .

FIG. 3E is a diagram illustrating a case where the channel division from the first communication station to the second communication station in FIG. 3C is spread with a spread code generated using a quasi-orthogonal code mask. In this case, orthogonality is not maintained in a code symbol group using different quasi-orthogonal code masks, and orthogonality is maintained only in a code symbol group using the same orthogonal code mask. Therefore, the scheme proposed in the present invention will be applied within an orthogonal code symbol group using the same quasi-orthogonal code mask that maintains orthogonality.

FIG. 3F shows that the Walsh code generators independent of the I and Q channels exist to spread the I / Q channel transmission data using different orthogonal code symbols in the structure of FIG. 3E as shown in FIGS. 3B and 3D. Is the same as in FIG. 3E.

4A to 4C are examples of signal diagrams for explaining a multiplexing scheme for allocating orthogonal resources for each channel and transmitting the signals generated by the aforementioned FIGS. 2 and 3A to 3F.

First, when communication is performed between the first communication station and the second communication station, the data rate transmitted for each second communication station may vary with time. For convenience of explanation, when the maximum transmission rate for each channel allocated by the first communication station to the second communication station is referred to as a basic transmission rate (R), the average transmission rate per frame according to the amount of data for each frame transmitted from the first communication station to the second communication station Are R, R / 2, R / 4,... , 0, and the like.

4A illustrates a case in which the instantaneous data rate of each frame is adjusted to an average data rate, and is a method adopted in the forward link in an IS-95 orthogonal code division multiplexed communication system.

FIG. 4B illustrates a method in which the instantaneous data rate for each frame is set to the default data rate by filling up a lacking portion using dummy information when the transmission data for each frame does not meet the basic data rate.

FIG. 4C illustrates a method of adjusting an average data rate in a corresponding frame according to a ratio of an interval having R and 0 as a transmission rate by setting an instantaneous data rate as a base rate R and 0 (not transmitting).

Although the method of FIG. 4C is not ON / OFF of a transmission symbol unit which is a unit of spreading to be used in the present invention, the average transmission rate per frame is maintained while maintaining the amplitude of the reference signal for closed loop power control of the reverse link in the IS-95 method. To adjust, use the time slot unit ON / OFF which is the unit of power control. At this time, in the IS-95 reverse link, channel orthogonality is not guaranteed unlike in the present invention.

4A to 4C, although the common pilot channel is transmitted in parallel with the channel to the second communication station, the pilot channel is a channel used as a reference for synchronization, channel estimation, and power control in the receiver. It may be transmitted by a time division multiplexing scheme such as in the Global System for Mobile (WDM) scheme and the Wideband CDMA (W-CDMA) scheme.

In this case, the pilot channel is called various names such as preamble, midamble, post-amble, etc. according to pilot symbols or multiplexed positions.

4d illustrates a conventional frequency division multiplexing scheme in which communication channels from the first communication station to each second communication station use different frequency bands (FA). The frequency division multiplexing scheme in the present invention includes an orthogonal frequency division multiplexing (OFDM) scheme, which is being studied for satellite broadcasting.

In the case of OFDM, although the frequency bands of the respective subcarrier channels are not overlapped completely, they may be included in the orthogonal resources according to the present invention because orthogonality is ensured between the subcarrier channels.

FIG. 4E illustrates a conventional time division multiplexing scheme such as a GSM system, in which a communication channel from a first communication station to each second communication station uses the same frequency band (FA) but dedicates a time slot in a frame to each second communication station. Used by assigning.

4F to 4H apply the frequency hopping method to the conventional frequency division multiplexing method of FIG. 4D for the purpose of frequency diversity and security enhancement.

FIG. 4F shows frequency hopping in time slot units, FIG. 4G shows regular frequency hopping in units of transmitted data symbols, and FIG. 4H shows irregular frequency hopping in units of transmitted data symbols. The method of FIG. 4G is a method used to focus on frequency diversity, and the method of FIG. 4H is a method that emphasizes security to prevent interception by frequency diversity and an unauthorized receiver.

Frequency hopping multiplexing includes fast frequency hopping multiplexing in symbol and partial symbol units and slow frequency hopping multiplexing in several symbol units. 4F-4H may provide frequency diversity by applying to the time division multiplexing scheme of FIG. 4E.

In fact, in order to enhance frequency diversity rather than security in the second generation mobile communication system, it is optional to use frequency hopping in time slots and frames.

4I illustrates a conventional orthogonal code division multiplexing scheme such as IS-95, cdma2000, and W-CDMA systems, in which a communication channel from a first communication station to each second communication station has the same frequency band (FA) and all in the frame. The first communication station allocates a fixed orthogonal code symbol for each channel at the time of call setup and returns to the second communication station where a new call is set up when the call ends.

Therefore, all data symbols in the frame are spread by the same orthogonal code symbol. The transmitter structure of the first communication station corresponding to FIG. 4I is given in FIG. 3A to FIG. 3F described above.

4J is a transmission signal diagram of a first communication station using a conventional Orthogonal Resource Division Multiplexing (ORDM) scheme, and shows allocation of fixed orthogonal resources for each channel. Most conventional digital communication systems adopt such an orthogonal resource division multiplexing scheme.

Since the structure of the receiver of the second communication station corresponding to the transmitter of the first communication station according to the embodiment of the prior art given in FIG. 4I is similar except for the part where despreading is performed according to the transmitter structure of FIGS. 3A to 3F, FIG. 5 schematically shows a receiver structure corresponding to the transmitter structure of FIG. 3A.

The signal received through the antenna is demodulated (510, 530) to the carrier wave and low pass (512, 532) to generate a baseband signal, and the same sequence (520, 540) received by the same PN sequence used on the transmitting side received Despreading (516, 536) is performed by multiplying the baseband signal (514, 534) and accumulating for the transmission data symbol period.

A pilot channel component is extracted from the baseband signal by an orthogonal code symbol assigned to a pilot channel to estimate a transmission channel (550), and the phase distortion of the baseband signal is corrected (560) using the estimated phase distortion value.

If the pilot channel is not code division multiplexed as described above, but is time division multiplexed, only a portion of the pilot signal is extracted using a demultiplexer, and the phase shift between the extracted intermittent pilot signals is estimated by interpolation. do.

6 is a structure of a receiver for a channel in which a command for controlling the transmission power from the second communication station to the first communication station is not inserted in the first communication station as in the call channel, and FIG. When combining (610, 612) QPSK data modulation on the transmitting side as shown in FIG. 3B, multiplexing 614 (adding two signals when BPSK data modulation is performed), soft decision 616, and then each Inverse scrambling is performed by multiplying (618) the result of the decimation 624 of the output of the long code generator generated by the long code mask 620 corresponding to the call channel.

In the embodiment of the present invention, the receiver structure at the second communication station for the orthogonal code hopping multiplexed channel is similar to that of FIG. In the case of the synchronization channel, the descrambling process 620, 622, 624, 626, 618 by the long code is omitted.

FIG. 7 illustrates a structure of a receiver for a channel in which a transmission power control command from a second communication station to a first communication station is inserted in the first communication station as in the traffic channel, and the maximum ratio combining signal 710 having completed the phase correction in FIG. 712), when QPSK data modulation is performed on the transmitting side as shown in FIG. 3C, the in-phase component and quadrature component are multiplexed (714) (when BPSK data modulation is performed on the transmitting side as shown in FIG. 3A, in-phase component). After the sum of the quadrature and quadrature components, the signal component corresponding to the power control command sent from the first communication station is extracted (740) from the received signal and hard-decided (744) to be transmitted to the transmission power control unit of the second communication station.

The long code generator 722 generated by the long code mask 720 generated from the identifier of the second communication station after soft decision 742 of the data symbol excluding the power control command from the multiplexed 714 received signal. Inverse scrambling is performed by multiplying the result of decimating the output of 724.

8 shows a function of restoring the data transmitted from the first communication station through the channel deinterleaving (818, 828, 838) and the channel decoding (814, 824, 834) of the received signal that has undergone the signal processing of FIGS. It is shown.

In the case of the synchronization channel 810, the symbol rate 819, which is a reverse process of the symbol repeater 219, is performed by accumulating the received signal from the soft decision signal to lower the symbol rate. The channel deinterleaving 818 of the symbol-compressed signal is performed to perform symbol compression 816, which is the inverse of the symbol repeater 216, of the channel deinterleaved signal again before the channel decoding 814.

Thereafter, the symbol-compressed signal is decoded by channel decoding 814 to restore the synchronization channel transmitted from the first communication station. In the case of the call channel 820, the soft decision signal is deinterleaved 828. The channel deinterleaved signal may perform symbol compression 826 which is an inverse process of the symbol repeater 226 according to the transmission data rate. The channel decoded 824 of the symbol-compressed signal is used to recover the call channel transmitted from the first communication station.

Thereafter, in the traffic channel 830, the soft decision signal is deinterleaved 838 regardless of the transmission data rate. The channel deinterleaved signal may perform symbol compression 836 which is an inverse process of the symbol repeater 246 according to the transmission data rate.

The symbol-compressed signal is channel decoded (834), the tail bit for frame-independent transmission signal generation is generated (832), and then CRC bits are generated for the transmitted data portion in the same manner as the transmitting side to decode the channel. After performing, check whether there is an error by comparing the recovered CRC bit. Traffic channel data is recovered by determining that there are no errors when the two CRC bits match.

In addition, when the transmitting side does not include the information on the transmission data rate in frame units of 20 ms, the first communication station performs channel decoding of the channel deinterleaved signal independently for all possible transmission data rates, and compares the CRC bits. The transmission data rate of can be determined. For a system in which the transmission data rate is separately transmitted, only a channel decoding process corresponding to the data rate is required.

Meanwhile, as shown in FIG. 1, four conventional methods used to maintain orthogonality between channels from a first communication station to a second communication station can be classified into four types.

First, as shown in FIG. 4D, the first communication station uses a frequency division multiplexing scheme in which a frequency band is fixedly allocated.

Secondly, as shown in FIG. 4E, when the call is established, the first communication station uses a time division multiplexing scheme in which time slots are fixedly allocated.

Third, as shown in Figs. 4f to 4h, the total bandwidth consisting of several subcarriers at a given time in a given area, such as in the military, or assigned a hopping pattern adjusted so that the first communication station does not collide in call setup, Is used only by a second communication station.

Fourth, as shown in FIG. 4I, when the call is set up, the first communication station allocates an empty orthogonal code symbol to spread the channel to the second communication station.

Among the four schemes, the commonalities of the three schemes except for the frequency hopping multiplexing scheme are that the first communication station allocates resources (frequency, time, orthogonal code) having fixed orthogonality to the second communication station.

The frequency hopping multiplexing scheme is not intended for efficient use of resources because it is mainly used for security purposes in applications with a large amount of resources such as military use.

Therefore, when the above scheme is used, efficient use of resources is difficult if fixed orthogonal resources are limitedly allocated to a channel having relatively low activity or a variable transmission data rate below the basic transmission rate.

In order to increase resource utilization while fixedly assigning resources as in the conventional method, fast channel allocation and return should be accompanied, but by transmitting and receiving control signal information for frequent channel allocation and return, limited resources actually transmit data. Rather than being used for, much of the data is allocated to control information for data transmission.

In addition, no matter how fast the channel allocation and return process is performed, when the channel allocation (or return) message is transmitted and the acknowledgment thereof, the data to be transmitted must be buffered until it reaches the first communication station. In this case, the capacity of the buffer increases as the time for which the process is processed increases.

In addition, when a handoff occurs to a neighbor cell, a method of fixedly allocating resources causes a phenomenon in which handoff cannot occur because there is no new resource to be allocated despite the low activity of a channel serviced in the neighbor cell. do.

In addition, important information that must be checked for proper transmission, such as control information, should be buffered for retransmission, but in a transmission such as a datagram method that does not require verification, a delay as short as possible as long as resources are allowed The required buffer capacity must also be transferred with.

The technical problem to be solved by the present invention is that the orthogonal resource and the channel have a one-to-one relationship by fixedly allocating orthogonal resources such as frequency, time, orthogonal code, etc. in the related art. Considering the variability of the rate, traffics with low activity or variable transmission data rate are statistically multiplexed using multi-dimensional orthogonal resource hopping multiplexing, thereby allowing more channels from the first communication station to the second communication station and utilizing limited orthogonal resources. To increase the number, reduce the signal traffic for unnecessary channel allocation and return, to reduce the transmission scheduling process, to reduce the buffer capacity required in the first communication station, to reduce the data transmission delay time, the burden free handoff to the neighbor cell.

Another technical challenge is statistically called multi-dimensional orthogonal resource hopping multiplexing with frequency, time, orthogonal codes, orthogonal axis, if the activity of the synchronized channels that maintain orthogonality is low or the channel has a variable data rate below the base rate. Adopt multiple channels to accommodate more channels from the first station to the second station, increase utilization of limited orthogonal resources, reduce signal traffic for unnecessary channel allocation and return, ease transmission scheduling, buffer capacity required by the first station Reduction, data transmission latency, burdenless handoff to neighbor cells, and the like.

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art can easily implement the present invention.

Although a detailed description of an embodiment of the present invention for a mobile communication system by wireless, the statistical multiplexing scheme proposed in the present invention can be applied to a wired communication system as well as wireless.

In the description of the embodiments of the present invention, the same parts as the embodiments according to the related art already described have the same reference numerals. Explain the parts that need to be added.

9A is a structure for multi-dimensional orthogonal resource hopping multiplexing on a coarse channel, except that puncturing insertion of a transmission power control command for a second communication station.

Typically, there are two-way communication and one-way communication, and for one-way communication, a transmission power control command for the second communication station does not need to be transmitted. However, in bidirectional communication, transmission power control is necessary because system capacity can be maximized through efficient power control.

Also, for fast processing, power control commands usually do not go through channel coding. Random orthogonal code hopping patterns inevitably cause collisions between different channels.

Therefore, the power control command needs to be transmitted to a channel where collision does not occur. To this end, the common power control channel adopted by the cdma2000 scheme, which is one of candidate technologies of the IMT-2000 system, is introduced. CPCCH: Common Physical Control CHannel.

The common physical control channel is spread by a separate orthogonal code symbol like the pilot channel, and transmits a control command of a physical layer to the plurality of second communication stations by time division multiplexing. The position of the power control command for each second communication station is assigned during the call setup process. 9A illustrates an embodiment of a common physical control channel controlling IS-95, for example, a total of 24 second communication stations.

When the channel from the first communication station to the second communication station is variable below the basic data rate R, it is determined that it is necessary to be transmitted without collision, such as information on the actual data rate (RI) in each frame. The information may be transmitted by time division multiplexing through a common control channel, such as a transmission power control command of the second communication station.

If the information on the actual data rate is not transmitted, the receiver determines the data rate actually transmitted through channel decoding and CRC check sequentially for all possible combinations. It is common practice that a possible combination is agreed between the first communication station and the second communication station at the time of initial call setup.

9B is a signal diagram of a common physical control channel (CPCCH) according to an embodiment of the present invention, in which the first communication station transmits only the transmission power control command of the second communication station, and the first communication station. CPCCH # 2 may also be transmitted with the transmission data rate information.

10A is an implementation method when the present invention is applied to the embodiment of the prior art shown in FIG. 3A. The collision detector for detecting the collision of the multi-dimensional hop pattern generated by the multi-dimensional hop pattern generator 380 and the independent hop pattern generation between channels for statistical multiplexing by the multi-dimensional orthogonal resource hopping multiplex proposed in the present invention And controller 384 is required. An embodiment of a multidimensional jump pattern generator is given in FIG. 11.

It is a structure for generating a multi-dimensional jump pattern using a general PN sequence generator. Alternatively, a multi-dimensional jump pattern may be implemented. The multi-dimensional jump pattern includes a one-dimensional jump pattern such as (frequency), (transmission time), (orthogonal code), and a two-dimensional jump pattern (frequency, transmission time), (frequency, orthogonal code), (transmission time, orthogonal code), etc. Hop pattern, a three-dimensional hop pattern such as (frequency, transmission time, orthogonal code), and the like. At the system development stage, only some orthogonal resources are involved in the leap, and other orthogonal resources can be fixedly allocated in a split manner.

It is also possible to implement all orthogonal resources to participate in the hop multiplexing and then control only some orthogonal resources to participate in the hop multiplexing by a control command example. An orthogonal code generator 382 generating frequency synthesizers 388 for frequency hopping, buffers 392 and 393 for time hopping, and spreading orthogonal code symbols for orthogonal code hopping in accordance with the multi-dimensional hopping pattern generator 380. Is needed.

The number of bits representing the frequency axis coordinate value at the output of the multi-dimensional hopping pattern generator 380 differs depending on the number of (sub) carriers used for frequency hopping as shown in FIG. 12A in the carrier or subcarrier generated by the frequency synthesizer 388. . Among the outputs of the hopping pattern generator 380, a signal corresponding to the frequency coordinate value is input to the frequency synthesizer 388, and a prescribed (sub) carrier is generated according to the input value.

In the multi-dimensional orthogonal resource hopping multiplexing scheme, unlike frequency hopping and orthogonal code hopping in which carriers do not change, frequency hopping makes channel estimation and phase compensation difficult in a receiver.

Therefore, if multi-carriers are basically implemented like the MC (Multi-Carrier) method of cdma2000, and channel estimation is performed in parallel independently in each receiver for each carrier, the carriers involved in the multi-carrier can be used as a hopping carrier. Frequency hopping multiplexing is facilitated.

In the transmission time hopping buffers 392 and 393, a signal corresponding to a time axis coordinate value is input to the buffers 392 and 393 among the outputs of the multi-dimensional hopping pattern generator 380, and data in the buffer according to the input value. The transmission position of is determined as shown in Fig. 12C.

In FIG. 12C, "1" indicates that there is transmission data and "0" indicates that there is no transmission data. FIG. 12D illustrates an example in which the number of positions (PP: Probable Position) where transmission data can be placed is 16 in FIG. 12C.

In the multi-dimensional orthogonal resource hopping multiplexing scheme, transmission time hopping maximizes statistical multiplexing and facilitates tracing of communication channels to a second communication station. Make it happen.

Hopping symbolically within such a frame makes it relatively easy to track channel changes at the receiver of the second communication station because the transmission symbols are stochastically uniformly distributed within the frame.

The orthogonal code generated by the orthogonal code generator 382 is an orthogonal gold code generated by an orthogonal gold code generator as shown in FIG. 12E, or an orthogonal variable spreading coefficient having a hierarchical structure that is a Walsh code for a specific spreading coefficient as shown in FIG. 12F. Orthogonal Variable Spreading Factor (OVSF) can be any orthogonal code that maintains only orthogonality.

If the orthogonal code axis coordinates are fixed among the outputs of the multi-dimensional leap pattern generator 380, the orthogonal code division multiplexing method is the same as in the prior art. One orthogonal code is divided into two orthogonal code symbol groups, and one orthogonal code symbol group can be used for orthogonal code division multiplexing by fixed assignment, and the other orthogonal code symbol group can be used for orthogonal code hopping multiplexing by a leap pattern. .

Alternatively, one orthogonal code symbol group of the divided two orthogonal code symbol groups is orthogonal code hop multiplexed using a hop pattern selected randomly so that a collision of collision patterns does not occur, and the other orthogonal code symbol groups generate a collision of hopping patterns. Orthogonal code hopping multiplexing by statistical multiplexing is performed using independent hop patterns between channels.

In both cases, the former allocates when the transmission data is relatively important or the channel activity is high, and the latter allocates to the channel generating relatively sparse traffic to obtain statistical multiplexing gain.

In the case of using a hierarchical orthogonal code that supports a variable spreading gain as shown in FIG. 12F as a spreading code, when the orthogonal code is divided as described above, the same parent code symbols 391 and 395, such as "01" or "0110", are used. It is easy to divide the orthogonal code by dividing it into orthogonal code symbol groups 393 and 397 composed of all self-signed symbols.

As mentioned earlier, when the multi-dimensional jump pattern generator 380 generates a multi-dimensional jump pattern randomly so that different channels do not select the same orthogonal resource for each channel at the same moment, no collision occurs.

However, in the above-described method, the multi-dimensional hop pattern cannot be determined by the second communication station, the multi-dimensional hop pattern must be allocated at the time of call setup by the first communication station, and the number of multi-dimensional hop patterns that can be allocated by the first communication station is required. It is limited by the number of orthogonal resources and has a disadvantage in that when a handoff occurs to a neighbor cell, a new multidimensional leap pattern must be allocated from the neighbor cell.

As mentioned above, allocating a multi-dimensional leap pattern between channels to a second communication station without collision is not aimed at statistical multiplexing but rather diversity gain. If the channel to the second communication station is a highly active and dense channel, it may be efficient to operate without collisions.

However, if the activity of the channel to the second communication station is low and sparse depending on the characteristics of the service, resources may be wasted, so that each channel is obtained in order to obtain statistical multiplexing gain and frequency and time diversity according to the data activity of each channel. Generate an independent multidimensional jump pattern for.

This inevitably results in a collision of multi-dimensional jump patterns in which different channels select the same multi-dimensional orthogonal resource coordinates at the same time point.

Accordingly, in order to solve this problem, the present invention uses collision detectors and controllers 384 and 386 to determine whether a hop pattern collides by receiving hop patterns for all channels and data symbols to be transmitted. Since all multidimensional jump patterns for each second communication station are generated in the first communication station, and data to be transmitted to each second communication station also passes through the first communication station, whether the collision of the multidimensional hop pattern and the transmission data are the same or different before the collision actually occurs. Can determine whether or not.

When a multi-dimensional hop pattern collision occurs, the transmission data symbols of all corresponding channels are compared, and when all transmission data symbols match, the data symbols existing in the collision interval are transmitted. This is because an error is not caused in the channel decoding process of the second communication station concerned.

However, if any one does not match, data symbols in the collision section of the associated channel are not transmitted. That is, depending on the results of the collision detectors and comparators 384 and 386, the inputs of multipliers 385 and 387 become "+1" or "0". Transmission is interrupted in a section in which the input of the multiplier is "0".

In order to compensate for the shortage of the average received energy at the second communication station required to satisfy the desired quality due to the interruption of transmission of the spread data symbol, the system during the period given by the system parameters as shown by reference numerals 1072 and 1074 of FIG. The gain of the amplifiers 315, 335 of the corresponding channel is adjusted by the size given by the parameter to increase the transmit power of the first communication station. Apart from this, the first communication station transmit power control by the second communication station in the conventional manner can be performed.

FIG. 10B is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention in which FIG. 10A is represented by a complex signal.

FIG. 10C is an implementation method when the present invention is applied to the embodiment of the prior art shown in FIG. 3B. It is the same as FIG. 10A except that the multi-dimensional hop pattern generator 380 generates a multi-dimensional hop pattern independent of the in-phase (I) channel and the quadrature (Q) channel.

For statistical multiplexing by the multi-dimensional orthogonal resource hopping multiplexing proposed in the present invention, a collision detector and a controller 384 and 386 for determining whether the multi-dimensional hopping pattern generator 380 and the independent collision for the I / Q channel are transmitted or not are provided. need.

FIG. 10D is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention in which FIG. 10C is represented by a complex signal.

10E is an implementation method when the present invention is applied to the embodiment of the prior art shown in FIG. 3C. Unlike in FIG. 10A, which performs BPSK data modulation, QPSK data modulation is the same as FIG. 10A except that data transmitted to an I channel and a Q channel are different.

FIG. 10F is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention in which FIG. 10E is represented by a complex signal.

10G is an implementation method when the present invention is applied to the embodiment of the prior art shown in FIG. 3D. It is the same as FIG. 10E except that the multi-dimensional jump pattern generator 380 generates a multi-dimensional jump pattern independent of the in-phase (I) channel and the quadrature (Q) channel.

Accordingly, the collision detectors and controllers 384 and 385 for determining whether or not to independently collide with the multidimensional hop pattern generator 380 and the I / Q channel for statistical multiplexing by the multidimensional orthogonal resource hopping multiplex proposed in the present invention. Is needed.

10H is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention in which FIG. 10G is represented by a complex signal.

10I is an implementation method when the present invention is applied to the embodiment of the prior art shown in FIG. 3E. Same as FIG. 10E except that a quasi-orthogonal code (QOC) is used.

FIG. 10J is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention in which FIG. 10I is represented by a complex signal.

FIG. 10K is an implementation method when the present invention is applied to the embodiment of the prior art shown in FIG. 3F. Same as FIG. 10G except that a quasi-orthogonal code (QOC) is used.

FIG. 10L is a block diagram of a transmitter in a first communication station using an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention in which FIG. 10K is represented by a complex signal.

FIG. 13A illustrates a receiver configuration in a second communication station for the orthogonal resource hopping multiplexing scheme according to the embodiment of the present invention of FIG. 10A. The signal from the first communication station received via the antenna is demodulated (510, 530) by the frequency synthesizer (588) controlled by the multi-dimensional hop pattern generator (580) and then passed through the low pass filters (512, 532).

Orthogonal code axis coordinates output from the multi-dimensional hopping pattern generator 580 in synchronization with the first communication station transmitter by inverse scrambling 522 and 542 using the same scrambling codes 520 and 540 as the transmitting side. An orthogonal code symbol is generated 582 according to the value, multiplied (514, 534), and integrated (516, 536) during the symbol period to perform despreading.

The despread signal is compensated for using a channel estimator 550 to compensate for the phase difference 560 to perform synchronous demodulation. The compensated data symbols are input to buffers 592 and 593 in accordance with the transmission time axis coordinate values of the multi-dimensional leap pattern generator.

Next, since the first communication station transmitter of FIG. 10A performs BPSK data modulation, the corresponding second communication station receiver of FIG. 13A sums 596 the I channel and Q channel received data having the same information. If there is an independent interleaver for each I channel and Q channel in the transmitter of the first communication station to give time diversity, the second communication station passes the deinterleaver and then adds the I channel and the Q channel received data.

FIG. 13B illustrates a receiver configuration in a second communication station for the orthogonal resource hopping multiplexing scheme according to the embodiment of the present invention of FIG. 10B. It is the same as FIG. 13A except that independent quadrature code generators 582 and 584 exist for each of the I and Q channels.

FIG. 13C illustrates a receiver configuration in a second communication station for an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention of FIG. 10C. Since the first communication station transmitter of FIG. 10C performs QPSK data modulation, the corresponding second communication station receiver of FIG. 13C is the same as that of FIG. 13A except that the I channel having different information and the Q channel reception data do not sum. .

FIG. 13D illustrates a receiver configuration in a second communication station for an orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention of FIG. 10D. At this time, it is the same as FIG. 13C except that independent quadrature code generators 582 and 584 exist for each of the I and Q channels.

FIG. 13E illustrates a receiver configuration in a second communication station for the orthogonal resource hopping multiplexing scheme according to the embodiment of the present invention of FIG. 10E. At this time, it is the same as FIG. 13C except that it is despread using the quasi-orthogonal code 566.

FIG. 13F illustrates a receiver configuration in a second communication station for the orthogonal resource hopping multiplexing scheme according to the embodiment of the present invention of FIG. 10F. At this time, it is the same as FIG. 13E except that independent quadrature code generators 582 and 584 exist for each of the I and Q channels.

14A is a conceptual diagram of a transmission signal at a first communication station according to an embodiment of the present invention.

14A is the same as the transmission signal diagram in the first communication station for each frame according to the prior art embodiment of FIG. 4A. The channel from the first communication station to each second communication station varies according to the characteristics of the service as shown in reference numerals 920 and 930 and the frame rate varies below the basic rate allocated to the call setup (R) or as shown in reference numerals 940 and 950. The transmission (ON) and the transmission (OFF) may be repeated at the basic transmission rate (R). Channels such as 940 and 950 may be represented as channel activity.

In the present invention, channels such as 920 and 930 are multiplied by transmission time leap according to the transmission data rate of each frame as in the channels 924 and 934 of FIG. 14B. The transfer time jump is implemented in the same manner as in FIG. 12D.

14C and 14D show in what form practically the hopped transfer time can be determined according to an example of the transmission data rate per frame. FIG. 14C shows a regular and periodic leap, and FIG. 14D shows an irregular and random jump. 14C is advantageous for time diversity and channel estimation, but is not suitable for statistical multiplexing. FIG. 14D illustrates that collision can be achieved using independent multi-dimensional jump patterns for each channel, but is easy for statistical multiplexing.

FIG. 14E illustrates a scheme in which frequency hopping multiplexing (FHM) and time hopping multiplexing (THM) are performed in a coarse frame according to an embodiment of the present invention. We distinguish 2 communication stations.

FIG. 14F illustrates a case in which a collision occurs in which a multi-dimensional jump pattern represented by two-dimensional coordinates of (transmission time, subcarrier) is simultaneously selected by a plurality of channels in FIG. 14E, and a circumference is represented by a double solid line in the drawing. Denotes the data symbol position where the multi-dimensional leap pattern collided, and the square indicated by the single solid line represents the data symbol position where no collision occurred.

FIG. 14G illustrates a comparison of data symbols of coordinates at which collision occurs in FIG. 14F to finally determine whether to transmit the data symbols. An internal black index rectangle indicates that the multidimensional hopping pattern has collided but is transmitted because the data symbols of all the channels involved in the collision are the same, and the dotted rectangle does not transmit because the data symbols of all the channels involved in the collision are not the same. Display.

FIG. 14H is a transmission signal diagram of a first communication station using a time division multiplexing method of symbol units in a sparse frame according to an embodiment of the present invention. FIG. As shown in FIG. 4E, it is not time division multiplexing in units of time slots concentrated only in a specific section within a frame, but is symbol division time division multiplexing uniformly distributed within a frame. You can get it.

Since the hopping pattern is periodic, it focuses on the channel estimation and time diversity mentioned above rather than on the purpose of statistical multiplexing, so there can be no independence between channels to the second communication station. Refer to the result assigned to the existing second communication station and assign.

Therefore, time division multiplexing in symbol units as shown in FIG. 14H is advantageous when the instantaneous data rate of each channel is constant.

FIG. 14I illustrates that, unlike FIG. 14H, a random-random selection of a transmission data symbol interval of a channel to a second communication station is performed to obtain statistical multiplexing. The transmission time hopping patterns of the respective second communication stations are independent of each other.

FIG. 14J illustrates a case in which a collision occurs in which a multi-dimensional jump pattern represented by one-dimensional coordinates of (transmission time) is simultaneously selected by a plurality of channels in FIG. 14I. The hop pattern indicates the location of the collided data symbol, and the square represented by a single solid line indicates the location of the data symbol where no collision occurred.

FIG. 14K illustrates a comparison of data symbols of coordinates at which collision occurs in FIG. 14J to finally determine whether to transmit. An internal black index rectangle indicates that the multidimensional hopping pattern has collided but is transmitted because the data symbols of all the channels involved in the collision are the same, and the dotted rectangle does not transmit because the data symbols of all the channels involved in the collision are not the same. Display.

14L illustrates orthogonal code hopping multiplexing, a special case of multi-dimensional orthogonal resource hopping multiplexing that randomly selects an orthogonal code that spreads the transmitted data symbols of a channel to a second communication station to obtain statistical multiplexing. It is. The orthogonal code hopping patterns of the respective second communication stations are independent of each other. The present invention has a detailed description of the present method in the orthogonal code hopping multiplexing method and apparatus of the present inventor (Korean Patent Application No. 1999-32187).

FIG. 14M is a transmission signal diagram of a first communication station having a time slot-based transmission time hopping multiplexing and an orthogonal code hopping multiplexing of FIG. 14L according to an embodiment of the present invention. To obtain statistical multiplexing, randomly select a transmission time slot of a channel to a second communication station and an orthogonal code symbol for spreading each transmission data symbol. The two-dimensional hopping pattern of (transmission time, orthogonal code) of each second communication station is independent of each other.

FIG. 14N illustrates a case in which a collision occurs in which a multi-dimensional jump pattern represented by two-dimensional coordinates of (transmission time, orthogonal code) is simultaneously selected by a plurality of channels in FIG. 14M, and a circumference is indicated by a double solid line in the drawing. The rectangles represent data symbol locations where the multi-dimensional hop pattern has collided, and the squares represented by a single solid line represent data symbol locations where no collision has occurred.

14O illustrates an example of comparing data symbols of coordinates at which collision occurs in FIG. 14N to finally determine whether to transmit the data symbols. The inner black index rectangle indicates that the multidimensional hopping pattern collided but transmitted because the data symbols of all channels involved in the collision are the same, and the dotted rectangle also indicates that the data symbols of all channels involved in the collision are not the same. Indicates not to transmit.

FIG. 14P is a transmission signal diagram of a first communication station in which time division multiplexing of FIG. 14H and orthogonal code hopping multiplexing of FIG. 14L are mixed. As mentioned above, although FIG. 14H has a structure in which statistical multiplexing gain cannot be obtained, it is statistically multiplexed by applying the orthogonal code hopping multiplexing method of FIG. 14L which can obtain statistical multiplexing gain. The position of the first transmission symbol to all second communication stations is the same regardless of the transmission rate of each channel in the frame. Pseudo-Random randomly selects an orthogonal code symbol for spreading each transmission data symbol of the channel to the second communication station. The one-dimensional hopping pattern of (orthogonal code) of each second communication station is independent of each other.

FIG. 14Q illustrates a case in which a collision occurs in which a multi-dimensional jump pattern represented by one-dimensional coordinates of (orthogonal code) in FIG. 14O is simultaneously selected by a plurality of channels. The hop pattern indicates the location of the collided data symbol, and the square represented by a single solid line indicates the location of the data symbol where no collision occurred.

FIG. 14r illustrates comparing data symbols of coordinates at which collision occurs in FIG. 14q to finally determine whether to transmit. The inner black index rectangle indicates that the multidimensional hopping pattern collided but transmitted because the data symbols of all channels involved in the collision are the same, and the dotted rectangle also transmits because the data symbols of all channels involved in the collision are not the same. Indicates not to do it.

14S is a variation of the time division and orthogonal code hopping multiplexing scheme of FIG. 14P. The first communication station staggers the positions of the first transmission symbol from the frame to the second communication station to balance transmission power. As in FIG. 14P, orthogonal code symbols are randomly selected for spreading each transmission data symbol of the channel to the second communication station. The one-dimensional hopping pattern of the (orthogonal code) of each second communication station is independent of each other.

FIG. 14T illustrates a case in which a collision occurs in which a multi-dimensional jump pattern represented by one-dimensional coordinates of (orthogonal code) in FIG. 14S is simultaneously selected by a plurality of channels. The hop pattern indicates the location of the collided data symbol, and the square represented by a single solid line indicates the location of the data symbol where no collision occurred.

FIG. 14U illustrates a comparison of data symbols of coordinates at which collision occurs in FIG. 14T to finally determine whether to transmit the data symbols. An internal black index rectangle indicates that the multidimensional hopping pattern has collided but transmitted because the data symbols of all channels involved in the collision are the same, and the dotted rectangle does not transmit because the data symbols of all channels involved in the collision are not the same. Indicates no.

FIG. 14V is a transmission signal diagram of a first communication station in which transmission time hopping multiplexing of FIG. 14I and orthogonal code hopping multiplexing of FIG. 14L are mixed. 14I is a complex statistical multiplexing method in which statistical multiplexing gain is obtained through transmission time hopping multiplexing of FIG. 14I and statistical multiplexing gain is obtained through orthogonal code hopping multiplexing of FIG. 14L. Orthogonal code symbols for spreading the transmission time of each channel and each transmission data symbol of the channel to the second communication station in the frame are randomly selected by a multidimensional (two-dimensional) hopping pattern. The two-dimensional hopping pattern of (transmission time, orthogonal code) of each second communication station is independent of each other.

FIG. 14W illustrates a case where a collision occurs in which a multi-dimensional jump pattern represented by two-dimensional coordinates of (transmission time, orthogonal code) is simultaneously selected by a plurality of channels in FIG. The rectangles represent data symbol locations where the multi-dimensional hop pattern has collided, and the squares represented by a single solid line represent data symbol locations where no collision has occurred.

FIG. 14x illustrates a comparison of data symbols of coordinates at which collision occurs in FIG. 14w to finally determine whether to transmit the data symbols. An internal black index rectangle indicates that the multidimensional hopping pattern has collided but is transmitted because the data symbols of all the channels involved in the collision are the same, and the dotted rectangle does not transmit because the data symbols of all the channels involved in the collision are not the same. Display.

The statistical multiplexing method based on the (transmission time, orthogonal code) value 2D hopping pattern of FIG. 14v is extended, and the statistical multiplexing method using the 3D hopping pattern of (frequency, transmission time, orthogonal code) as shown in FIG. 14y is also possible. .

FIG. 14Y illustrates a transmission signal diagram of a first communication station using a random carrier frequency hopping multiplexing, a transmission time hopping multiplexing, and an orthogonal code hopping multiplexing method in units of symbols for a sparse frame according to an embodiment of the present invention.

FIG. 14z is a diagram illustrating a case in which a collision occurs in which a jump pattern represented by three-dimensional coordinates of (carrier frequency, transmission time, orthogonal code) in FIG. 14y occurs simultaneously by a plurality of channels. Is represented by a bold solid cube. The white cuboid is a case where the data symbols to be sent match. The black cuboid is a case where the data symbols to be sent do not match.

FIG. 14A is a diagram exemplarily determining whether to transmit data by comparing data symbols of coordinates at which collision occurs in FIG. 14Z, and transmit a white rectangular parallelepiped and do not transmit a dotted rectangular parallelepiped.

If the method proposed by the present invention is further extended, statistical multiplexing is possible by N-dimensional orthogonal resource hopping multiplexing expressed as (orthogonal resource 1, orthogonal resource 2, ..., orthogonal resource N).

The statistical multiplexing gain due to the multidimensional orthogonal resource hopping multiplexing may be inferred through the probability of collision of the multidimensional hopping pattern and the transmission of the corresponding transmission data symbol. The channel recoverability of the untransmitted data symbols differs depending on which channel coding method is used.

In this analysis, when information is not loaded on the channel to the second communication station of interest, the analysis is meaningless, so only the information on the channel is analyzed.

The mathematical analysis below is based on the control algorithm in the multi-dimensional jump pattern collision shown in FIGS. 18 and 19, and the mathematical interpretation of the control algorithm in the multi-dimensional jump pattern collision shown in FIGS. 20 to 25 is more complicated. Do not describe.

M = total number of channels allocated by the first communication station

N = number of active channels in any time interval

α = channel activity (= average rate per frame / base rate)

π _i = probability that data symbol i is transmitted, provided that i ∈ {0, 1, 2,... , s-1}

s = number of data symbols

Ex) s = 8 when 8PSK and s = 16 when 16 QAM

1) About frequency hopping multiplexing

c ₁ = total number of frequency-axis subcarriers in multidimensional hopping pattern

(1) jump pattern collision probability

[Equation 1]

(2) Data symbol puncturing (transmission interruption) probability

[Equation 2]

(3) Data symbol puncture probability when all π _i are equal

[Equation 3]

2) Transmission Time Hopping Multiplexing

c ₂ = total number of time-base transmittable symbol intervals in a multi-dimensional leap pattern

(1) jump pattern collision probability

[Equation 4]

(2) puncturing probability of data symbols

[Equation 5]

(3) Data symbol puncture probability when all π _i are equal

[Equation 6]

3) About Orthogonal Code Hop Multiplexing

c ₃ = total number of orthogonal sign axis orthogonal sign symbols in a multidimensional leap pattern

(1) jump pattern collision probability

[Equation 7]

(2) puncturing probability of data symbols

[Equation 8]

(3) Data symbol puncture probability when all π _i are equal

[Equation 9]

4) Frequency, transmission time, orthogonal code hopping multiplexing

c ₁ = total number of frequency-axis subcarriers in multidimensional hopping pattern

c ₂ = total number of time-base transmittable symbol intervals in a multi-dimensional leap pattern

c ₃ = total number of orthogonal sign axis orthogonal sign symbols in a multidimensional leap pattern

(1) jump pattern collision probability

[Equation 10]

(2) puncturing probability of data symbols

[Equation 11]

(3) Data symbol puncture probability when all π _i are equal

[Equation 12]

FIG. 15 illustrates the average received energy required by the channel decoder to satisfy a desired communication quality when the transmission is stopped in the multi-dimensional hop pattern collision section as shown in FIGS. 14G, 14K, 14O, 14R, 14U, and 14X. In order to compensate, it is shown that the transmission power of the first communication station is increased during a period after the untransmitted data symbol.

If it is possible to determine the number of data symbols lost due to the collision of the multi-dimensional jump pattern in the frame before the start time of the frame, the received energy fluctuation due to the loss is adjusted and transmitted in advance, as shown by reference numeral 1076 of FIG. 15. This maximizes the statistical multiplexing gain while minimizing the impact of losses.

Transmission interruption due to multi-dimensional hopping pattern collisions and inconsistencies of transmission data symbols is made for a group of channels that exist in the same transmission antenna beam from the first communication station, and the transmission antenna beam from the first communication station, such as the smart antenna of FIG. If there are a plurality of 1120, 1130, and 1140, transmission is not interrupted in the collision section for the channels 1132, 1142, and 1144 in the non-overlapping transmit antenna beams 1130, 1140 even if the hopping pattern collides. Do not.

As can be seen in the embodiment of the present invention, when the multi-dimensional orthogonal resource leap multiplexing is performed by a random-random leap pattern, transmission data may be deliberately lost in a section where the multi-dimensional leap pattern collides. In order to recover the data existing in the lost section on the receiver side, channel coding is necessary at the transmitter side and channel decoding at the receiver side.

As mentioned above, multi-dimensional orthogonal resource hopping multiplexing by the independent channel-to-channel hopping pattern adopted to maximize the statistical multiplexing gain inevitably involves deliberate loss of transmission data. Various transmission signal control algorithms in the first communication station that can increase the channel decoding gain will now be presented.

FIG. 17 is a diagram illustrating a difference between a first communication station transmit power allocated to a second communication station 1720 located close to the first communication station 1710 and a second communication station 1730 located far away for the same data service.

Referring to FIG. 17, only the transmission power difference of the first communication station 1710 according to the distance is shown, but is actually based on the estimation by the strength of the signal from the second communication station received at the first communication station to overcome fading. A second communication station 1720 that is close in distance according to transmission power control (open loop transmission power control) of the first communication station or transmission power control (closed loop transmission power control) of the first communication station by a transmission power control command from the second communication station. Different from FIG. 17 may be required for larger transmit power.

However, since the core of the present invention does not change due to such a problem, for ease of explanation, in the present invention, it is assumed that the perspective of the distance between the first communication station and the second communication station is proportional to the magnitude of the transmission power of the first communication station. do.

First, a signal (transmission power is A _i ² ) having an amplitude A _i is transmitted to a second communication station 1720 located near, and a signal having a amplitude A _o is transmitted to a second communication station 1720 located at a far distance (transmission power is A _o ² ) is shown.

In the description of FIGS. 18 to 25, all signals are treated as complex numbers consisting of a real part (I channel) and an imaginary part (Q channel). The description is made only for the real part (I channel), but the same is true for the imaginary part. It can be handled in advance.

Since the real part may have three values of positive, zero, and negative values, an I channel transmission signal (A _I = A _I ⁺ + A) actually transmitted in the collision of a multi-dimensional orthogonal resource hopping pattern in this case. _I ^- a) is determined. At this time, A _I ⁺ represents the sum of the transmission signals of I channels having positive values in the collision, and A _I ⁻ represents the sum of the transmission signals of the I channels having negative values in the collision.

All channels allowed to be connected by the first communication station for each orthogonal radio resource unit in each data symbol interval unit have three sets S ⁰ , S ⁺ , and S- ^. It must be included in either.

A set of all channels permitted to be connected by the first communication station is called S, a set of channels for which the orthogonal radio resource unit is not selected is S ⁰ , and a set of channels having a positive value is selected from the selected channels. Call S ⁺ , and let S ^- be the set of negative channels.

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. 18A is a flowchart illustrating a transmission signal determination method I for each orthogonal radio resource unit in a transmitter directed from a first communication station to a second communication station according to an embodiment of the present invention. Method I is as follows. For S = S ⁰ (1830) is one channel is the orthogonal wireless due to the resources not selected for the unit ^{_{A I = 0 (A I +}} = 0, A I - = 0) the orthogonal by setting a wireless resource unit has the 1 The communication station does not transmit. If S = S ⁰ ∪ S ⁺ (1840), since all channels for which the orthogonal radio resource unit is selected are positive

The first communication station transmits the orthogonal radio resource unit having the value of.

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. S⁺≠{}이고 S^-≠{}인 경우(1860), A_I = 0(A_I ⁺ = 0, A_I ^- = 0)으로 설정함으로써 상기 직교 무선 자원 단위는 제1 통신국이 송신하지 않는다.Further, S = S ⁰ ∪S ^- For 1850, since the quadrature channel, select the radio resource units are all negative

The first communication station transmits the orthogonal radio resource unit having the value of. For ≠ {} (1860), A I = 0 (A I + = 0, A I - - = 0) S + ≠ {} and S set by the orthogonal wireless resource unit does not transmit a first communication station .

FIG. 18B illustrates an example of final transmission signal determination by the scheme of FIG. 18A when two-dimensional orthogonal resource hopping patterns of two channels collide. Assume that two channels select the same orthogonal radio resource unit in the same data symbol period.

At this time, if each data symbol value is + A _i , + A _o (A _i <A _o ), the final data symbol value transmitted by the orthogonal radio resource unit is A _I = A _i + A _o (1801) . If each data symbol value is -A _i , + A _o (A _i <A _o ), the final data symbol value transmitted by the orthogonal radio resource unit is A _I = 0 (1802).

FIG. 18C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of two channels (c, l) to explain final transmission signal determination by the scheme of FIG. 18A. For I channel, S ⁰ = {a, b, d, e, f, g, h, i, j, k, m, n, o, p, q, r, s, t}, S ⁺ = { c, l}, S ⁻ = {} = ψ (vacant), and for the Q channel, S ⁰ = {a, b, d, e, f, g, h, i, j, k, m, n, a ^{= {c} - o, p} , q, r, s, t}, s + = {1}, s.

FIG. 18D is a diagram illustrating a final transmission signal determined by the algorithm of FIG. 18A in the case of FIG. 18C. For I channel, although A _c + A _l > A _max, but the orthogonal radio resource unit has a value of A _I = A _c + A _l (A _I ⁺ = A _c + A _l , AI ⁻ = 0) by transmitting the original signals of channels c and l as they are. For the Q channel, channel c and l-channel transmission due encircling the sign of the signal is orthogonal wireless resource unit is ^{_{A Q = 0 (A Q +}} = 0, A Q - = 0) has a value of.

19A is a flowchart illustrating a transmission signal determination method II for each orthogonal radio resource unit in a transmitter directed from a first communication station to a second communication station according to an embodiment of the present invention.

Method II is as follows. For S = S ⁰ (1830) is one channel is the orthogonal wireless due to the resources not selected for the unit ^{_{A I = 0 (A I +}} = 0, A I - = 0) the orthogonal by setting a wireless resource unit has the 1 The communication station does not transmit.

이면(1842),

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. In this case, when S = S ⁰ ∪ S ⁺ (1840), since all channels in which the orthogonal radio resource unit is selected are positive,

Back side (1842),

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

이면(1852)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 단위를 제1 통신국이 송신한다. Further, S = S ⁰ ∪S ^- because the case (1850), the orthogonal channel, select the radio resource units are both negative, and if,

The back side (1852)

A first communication station transmits the orthogonal radio resource unit having a value of

A first communication station transmits the orthogonal radio unit having a value of.

In addition, S ⁺ ≠ {} and S ^- ≠ {} in the case (1960), the ^{_{A I = 0 (A I +}} = 0, A I - = 0) the orthogonal wireless resource unit by setting a first communication station transmits I never do that.

FIG. 19B illustrates an example of final transmission signal determination by the scheme of FIG. 19A when a multi-dimensional orthogonal resource hopping pattern of two channels collides. Assume that two channels select the same orthogonal radio resource unit in the same data symbol period.

If each data symbol value is + A _i , + A _c (A _i <A _o), the final data symbol value transmitted by the orthogonal radio resource unit is A _i + A _o> + A _max , so A _I = + A _max (1901). If each data symbol value is -A _i , + A _o (A _i <A _o ), the final data symbol value transmitted by the orthogonal radio resource unit is A _I = 0 (1902). The A _max for suppressing unnecessary interference increases is determined by a system parameter.

FIG. 19C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of two channels (c, l) in order to explain the final transmission signal determination by the scheme of FIG. 19A. For I channel, S ⁰ = {a, b, d, e, f, g, h, i, j, k, m, n, o, p, q, r, s, t}, S ⁺ = { c, l}, S ⁻ = {} = ψ (vacant), and for the Q channel, S ⁰ = {a, b, d, e, f, g, h, i, j, k, m, n, a ^{= {c} - o, p} , q, r, s, t}, S + = {l}, S.

FIG. 19D is a diagram illustrating a final transmission signal determined by the algorithm of FIG. 19A in the case of FIG. 19C. In the case of the I channel, even though A _c + A _l > A _max , the orthogonal radio resource unit is A _I = + A _max (A _I ⁺ = + A _max , A without transmitting the original signals of channels c and l as they are. _I ^- should have a value of 0). It has a value of ^- if the Q channel, channel c and l different channel because the sign of the transmission signal of the orthogonal wireless resource unit is _{A Q = 0 (= 0 A} Q + = 0, A Q).

20A is a flowchart illustrating a transmission signal determination method III for each orthogonal radio resource unit in a transmitter in a direction from a first communication station to a second communication station according to an embodiment of the present invention.

Method III is as follows. For S = S ⁰ (1830) is one channel is the orthogonal wireless due to the resources not selected for the unit ^{_{A I = 0 (A I +}} = 0, A I - = 0) the orthogonal by setting a wireless resource unit has the 1 The communication station does not transmit.

이면(1842)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. In addition, when S = S ⁰ ∪ S ⁺ (1840), since all channels in which the orthogonal radio resource unit is selected are positive,

The back side (1842)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

이면(1852)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. Further, S = S ⁰ ∪S ^- because the case (1850), the orthogonal channel, select the radio resource units are both negative, and if,

The back side (1852)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

과 음수값을 가지는 진폭 중에서 가장 작은 것

중에서 보다 큰 쪽

을 기준값으로 설정한다(2062). In addition, S ⁺ ≠ {} and, S ^- ≠ {} in the case 2060, the smallest amplitude having a positive value in

The smallest of negative and negative amplitudes

Greater than

Is set to a reference value (2062).

이라면 음수값을 가지는 채널 중에서 진폭의 크기가

보다 작은 값을 가지는 모든 채널의 집합을 S^*라고 정의한다(0≤θ≤1).If the smaller is the smallest of the positive amplitudes

If the magnitude of the amplitude among the channels with negative values is

A set of all channels having a smaller value is defined as S ^* (0 ≦ θ ≦ 1).

If the set S ^* is an empty set if _{(2081), A I = 0} (A I + = 0, A I - = 0) set by the orthogonal wireless resource unit has a first communication station does not transmit (2089).

보다 작 다면(2083),

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고(2083), 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2087). Plus the amplitudes of all channels in S ^*

If smaller (2083),

A first communication station transmits the orthogonal radio resource unit having a value of 2020;

A first communication station transmits the orthogonal radio resource unit having a value of 2020.

이라면 양수값을 가지는 채널 중에서 진폭의 크기가

보다 작은 값을 가지는 모든 채널의 집합을 S^*라고 정의한다.If the smaller is the smallest of the negative amplitudes

If the magnitude of the amplitude among positive channels

The set of all channels with smaller values is defined as S ^* .

보다 작다면(2084)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고(2086), 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2088).If the set S ^* is an empty set if the _{(2082) A I = 0 (} A I + = 0, A I - = 0) set by the orthogonal wireless resource unit has a first communication station does not transmit (2089). Recall that the sum of the amplitudes of all channels in S ^*

If less than (2084)

A first communication station transmits the orthogonal radio resource unit having a value of 2020;

A first communication station transmits the orthogonal radio resource unit having the value of 2020.

FIG. 20B illustrates an example of final transmission signal determination by the scheme of FIG. 20A when a multi-dimensional orthogonal resource hopping pattern of two channels collides. Assume that two channels select the same orthogonal radio resource unit in the same data symbol interval.

에 의해서 영향을 받는다.If each data symbol value is + A _i , + A _o (A _i <A _o), the final data symbol value transmitted by the orthogonal radio resource unit is A _i + A _o> + A _max , so A _I = + A _max (2001). If each data symbol value is -A _i , + A _o (A _i <A _o ), the final data symbol value transmitted by the orthogonal radio resource unit is A _i ≤ + θA _{o, where} A _I = -Ai (A _{I ^{+ = 0, a i - =}} -A i) and (2002) a _i> + θA _o If ^{_{AI = 0 (a i + =}} 0, a i - a = 0) (2003). In this case, A _max for suppressing unnecessary interference increase and θ for puncturing determination may be independently determined for each I channel and Q channel as system parameters, or may be determined dependently. The determination of A _max and θ is the

Affected by

20C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) in order to explain the final transmission signal determination by the scheme of FIG. 20A.

For I channel, S ⁰ = {a, b, d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {c, l, s}, S ^- a = {j}, if the Q ^{channels, S 0 = {a, b} , d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {j, l}, and S ⁻ = {c, s}.

FIG. 20D illustrates the orthogonal radio resource units arranged in order to compare the amplitude of the selected channel in the case of FIG. 20C. In the case of the I channel, the reference value determined through the processes of reference numerals 2062 and 2070 is the size of the j-th channel -A _j . In the case of the Q channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the s-th channel -A _s .

FIG. 20E is a diagram showing the final transmission signal determined by the algorithm of FIG. 20A in the case of FIG. 20C. For the I channel, it is less than θA _j, because only the l-th channel is the orthogonal wireless resource unit _{A I = + A l (A} I + = + A l, A I - = 0) to have a value of.

In FIG. 20E, channels c, j, and s are turned off (A _c = 0, A _j = 0, A _s = 0) and only channel l is transmitted (A _l ≠ 0), but the total amount (A _c + A _j + If A _l + A _s ) is satisfied (A _l ), the amplitude magnitude of each channel does not matter. In the case of the Q channel, since there is nothing smaller than θA _s , the orthogonal radio resource unit is A _Q. Has a value of ^{_{- = 0 (= 0 A Q}} + = 0, A Q).

21A is a flowchart illustrating a transmission signal determination method IV for each orthogonal radio resource unit in a transmitter directed from a first communication station to a second communication station according to an embodiment of the present invention.

Method IV is as follows. For S = S ⁰ (1830) is one channel also because it did not select the orthogonal wireless resource unit ^{_{A I = 0 (A I +}} = 0, A I - = 0) as hereinafter set to the orthogonal wireless resource unit is The first communication station does not transmit.

이면(1842)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다.In addition, when S = S ⁰ ∪ S ⁺ (1840), since all channels in which the orthogonal radio resource unit is selected are positive,

The back side (1842)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

이면(1852)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다.Further, S = S ⁰ ∪S ^- because the case (1850), the orthogonal channel, select the radio resource units are both negative, and if,

The back side (1852)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

과 음수값을 가지는 진폭 중에서 가장 작은 것

중에서 보다 큰 쪽

을 기준값으로 설정한다(2062). 만약, 보다 작은 쪽에 양수값을 가지는 진폭 중에서 가장 작은 것

이라면 음수값을 가지는 채널 중에 서 진폭의 크기가

보다 작은 값을 가지는 모든 채널의 집합을 S^*라고 정의한다(0≤θ≤1). S ⁺ ≠ {} and S ^- ≠ {} in the case 2160, the smallest amplitude having a positive value in

The smallest of negative and negative amplitudes

Greater than

Is set to a reference value (2062). The smallest of the amplitudes with positive values on the smaller side

If the magnitude of the amplitude in the negative channel is

A set of all channels having a smaller value is defined as S ^* (0 ≦ θ ≦ 1).

을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2187). If the set S ^* is an empty set if _{(2081), A I = 0} (A I + = 0, A I - = 0) set by the orthogonal wireless resource unit has a first communication station does not transmit (2089). If set S ^* is not empty, then the first communication station determines the value of the largest amplitude in set S ^* .

The first communication station transmits the orthogonal radio resource unit having a (2187).

이라면 양수값을 가지는 채널 중에서 진폭의 크기가

보다 작은 값을 가지는 모든 채널의 집합을 S^*라고 정의한다. If the smaller is the smallest of the negative amplitudes

If the magnitude of the amplitude among positive channels

The set of all channels with smaller values is defined as S ^* .

을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2188).If the set S ^* is an empty set if _{(2082), A I = 0} (A I + = 0, A I - = 0) set by the orthogonal wireless resource unit has a first communication station does not transmit (2089). If set S ^* is not empty, then the first communication station determines the value of the largest amplitude in set S ^* .

The first communication station transmits the orthogonal radio resource unit having a (2188).

FIG. 21B illustrates an example of final transmission signal determination by the method of FIG. 21A when two-dimensional orthogonal resource hopping patterns of two channels collide with each other. Assume that two channels select the same orthogonal radio resource unit in the same data symbol period.

If each data symbol value is + A _i , + A _o (A _i <A _o), the final data symbol value transmitted by the orthogonal radio resource unit is A _i + A _o> + A _max , so A _I = + A _max (2101).

이기 때문에 A_I = -Ai(A_I ⁺ = 0, A_I ^- = -Ai)이고(2102) A_i ＞ +θA_o이면 집합 S^*가 공집합이기 때문에 A_I = 0(A_I ⁺ = 0, A_I ^- = 0)이다(2103). 이때, 불필요한 간섭 증가를 억제하기 위한 A_max와 천공 결정을 위한 θ는 시스템 파라미터로 정해진다.If each data symbol value is -A _i , + A _o (A _i <A _o ), the final data symbol value transmitted by the orthogonal radio resource unit is A _i ≤ + θ A _o .

Is due ^{_{A I = -Ai (A I +}} = 0, A I - = -Ai) and (2102) A _i> + θA because _o If set S ^* is an empty set ^{_{A I = 0 (A I +}} = 0, a _I ^- a = 0), 2103. At this time, A _max for suppressing unnecessary interference increase and? For puncture determination are determined as system parameters.

FIG. 21C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain final transmission signal determination by the method of FIG. 21A.

For I channel, S ⁰ = {a, b, d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {c, l, s}, S ^- a = {j}, if the Q ^{channels, S 0 = {a, b} , d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {j, l}, and S ⁻ = {c, s}.

FIG. 21D illustrates the orthogonal radio resource units arranged in order to compare the amplitude of the selected channel in the case of FIG. 21C. In the case of the I channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the j-th channel -A _j . In the case of the Q channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the s-th channel -A _s .

FIG. 21E is a diagram showing the final transmission signal determined by the algorithm of FIG. 21A in the case of FIG. 21C. For the I channel, it flew less than θA _j the largest is because the l-th channel is the orthogonal wireless resource unit A _I = + A _l (A _I ⁺ = + A _l, A _I ^- = 0) to have a value of .

In FIG. 21E, channels c, j, and s are turned off (A _c = 0, A _j = 0, A _s = 0) and only channel l is transmitted (Al ≠ 0), but the total amount (A _c + A _j + A _{If l} + A _s ) is satisfied (A _l ), the amplitude of each channel does not matter. For the Q channel, the orthogonal radio resource unit is A _Q because the set S ^* is empty. Has a value of ^{_{- = 0 (= 0 A Q}} + = 0, A Q).

FIG. 22A is a flowchart illustrating a transmission signal determination method V for each orthogonal radio resource unit in a transmitter in a direction of a second communication station in a first communication station according to an embodiment of the present invention.

Method V is as follows. For S = S ⁰ (1830) is one channel also because it did not select the orthogonal wireless resource unit ^{_{A I = 0 (A I +}} = 0, A I - = 0) as hereinafter set to the orthogonal wireless resource unit is The first communication station does not transmit.

이면(1842)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다.In addition, when S = S ⁰ ∪ S ⁺ (1840), since all channels in which the orthogonal radio resource unit is selected are positive,

The back side (1842)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

이면(1852)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. S = S ⁰ ∪S ^- a case (1850), if there since the channel select the orthogonal wireless resource units are all negative,

The back side (1852)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

과 음수값을 가지는 진폭 중에서 가장 작은 것

중에서 보다 큰 쪽

을 기준값으로 설정한다(2062).S ⁺ ≠ {} and S ^- if ≠ {} (2260) has the smallest amplitude having a positive value in

The smallest of negative and negative amplitudes

Greater than

Is set to a reference value (2062).

이라면(2070) A_I ⁺ = 0, A_I ^- = 0으로 초기화(2271)한 다음 음수값을 가지는 채널 중에서 진폭의 크기가

보다 작으면서 가장 큰 값을 찾아서 A_I ^-로 지정(2273, 2283)하고, A_I = A_I ⁺ + A_I ^-의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다.If the smaller is the smallest of the positive amplitudes

If ^{_{(2070) A I + = 0}} , A I - = initialized (2271) to zero the magnitude of the amplitude from the channel having a negative value, and then

Flew find less than the maximum value A _I ^- designated as (2273, 2283) and, A = _I A ⁺ _I A + _I ^- the orthogonal wireless resource unit having a value of and transmits the first communication station.

이라면 A_I ⁺ = 0, A_I ^- = 0으로 초기화(2272)한 다음에, 양수값을 가지는 채널 중에서 진폭의 크기가 보다 작으면서 가장 큰 값을 찾아서 A_I ⁺ 로 지정(2274)하고, 이후 A_I = A_I ⁺ + A_I ^- 의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다.If the smaller is the smallest of the negative amplitudes

If A _I ⁺ = 0, A _I ^- = initialized to 0 (2272), and then, the flew the magnitude of the amplitude is less than in a channel having a positive value, find the maximum value specified by A _I ⁺ (2274) and, after _I = a + a ⁺ _I a _I ^- the orthogonal wireless resource unit having a value of and transmits the first communication station.

FIG. 22B shows an example of final transmission signal determination by the scheme of FIG. 22A when the multi-dimensional orthogonal resource hopping patterns of two channels collide. Assume that two channels select the same orthogonal radio resource unit in the same data symbol period.

If each data symbol value is + A _i , + A _o (A _i <A _o), the final data symbol value transmitted by the orthogonal radio resource unit is A _i + A _o> + A _max , so A _I = + A _max (2201).

If each data symbol value is -A _i , + A _o (A _i <A _o ), the final data symbol value transmitted by the orthogonal radio resource unit is A _i ≤ + θ A _o and A _i is the maximum value. _{a i = -A i (a i} + = 0, a i - = -A i) and _{(2202), a i> +} θA o If ^{_{a i = 0 (a i +}} = 0, a i - = 0) (2203). At this time, A _max for suppressing unnecessary interference increase and? For puncture determination are determined as system parameters.

FIG. 22C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain the final transmission signal determination by the scheme of FIG. 22A.

For I channel, S ⁰ = {a, b, d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {c, l, s}, S ^- a = {j}, if the Q ^{channels, S 0 = {a, b} , d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {j, l}, and S ⁻ = {c, s}.

FIG. 22D illustrates an orthogonal radio resource unit arranged in order to compare amplitudes of selected channels in the case of FIG. 22C. In the case of the I channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the j-th channel -A _j . In the case of the Q channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the s-th channel -A _s .

FIG. 22E is a diagram showing the final transmission signal determined by the algorithm of FIG. 22A in the case of FIG. 22C. Has a value of ^- for an I channel, flew less than θA _j the largest is because the second channel l times that the orthogonal wireless resource unit A _I = + A _l (= 0 A _I ⁺ = + A _l, A _I) do.

In FIG. 22E, channels c, j, and s are turned off (Ac = 0, Aj = 0, As = 0) and only channel l is transmitted (A _l ≠ 0), but the total amount (A _c + A _j + A _l When + A _s ) is satisfied (A _l ), the amplitude of each channel does not matter. In the case of the Q channel, since there is nothing smaller than θA _s , the orthogonal radio resource unit has a value of A _Q = 0 (A _Q ⁺ = 0, A _Q ⁻ = 0).

23A is a flowchart illustrating a transmission signal determination method VI for each orthogonal radio resource unit in a transmitter in a direction of a second communication station in a first communication station according to an embodiment of the present invention.

The method VI is as follows. For S = S ⁰ (1830) is one channel is the orthogonal wireless due to the resources not selected for the unit ^{_{A I = 0 (A I +}} = 0, A I - = 0) the orthogonal by setting a wireless resource unit has the 1 The communication station does not transmit.

이면(1842)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. In addition, when S = S ⁰ ∪ S ⁺ (1840), since all channels in which the orthogonal radio resource unit is selected are positive,

The back side (1842)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

이면(1852)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. Further, S = S ⁰ ∪S ^- because the case (1850), the orthogonal channel, select the radio resource units are both negative, and if,

The back side (1852)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

과 음수값을 가지는 진폭 중에서 가장 작은 것

중에서 보다 큰 쪽

을 기준값으로 설정한다(2062). In addition, S ⁺ ≠ {} and S ^- ≠ {} in the case (2360), the smallest amplitude having a positive value in

The smallest of negative and negative amplitudes

Greater than

Is set to a reference value (2062).

이라면 음수값을 가지는 채널 중에서 진폭의 크기가

보다 작은 값을 가지는 모든 채널의 집합을 S^*라고 정의한다(0≤θ≤1). If the smaller is the smallest of the positive amplitudes

If the magnitude of the amplitude among the channels with negative values is

A set of all channels having a smaller value is defined as S ^* (0 ≦ θ ≦ 1).

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2387). If the set S * is an empty set (2081), then by setting AI = 0 (AI + = 0, AI− = 0), the orthogonal radio resource unit is not transmitted by the first communication station (2089). Set S ^* is not empty (2081)

A first communication station transmits the orthogonal radio resource unit having the value of (2387).

이라면 양수값을 가지는 채널 중에서 진폭의 크기가

보다 작은 값을 가지는 모든 채널의 집합을 S^*라고 정의한다. If the smaller is the smallest of the negative amplitudes

If the magnitude of the amplitude among positive channels

The set of all channels with smaller values is defined as S ^* .

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2388).If the set S ^* is an empty set if _{(2082), A I = 0} (A I + = 0, A I - = 0) set by the orthogonal wireless resource unit has a first communication station does not transmit (2089). If set S ^* is not empty

The first communication station transmits the orthogonal radio resource unit having the value of S 2388.

FIG. 23B illustrates an example of final transmission signal determination by the scheme of FIG. 23A when the multi-dimensional orthogonal resource hopping patterns of two channels collide. Assume that two channels select the same orthogonal radio resource unit in the same data symbol period.

If each data symbol value is + A _i , + A _o (A _i <A _o), the final data symbol value transmitted by the orthogonal radio resource unit is A _i + A _o> + A _max , so A _I = + A _max (2301).

Each data symbol values _{-A i, + A o (A} i <A o) is the final data symbol value transferred by the orthogonal wireless resource unit is A _i ≤ + θA _o If AI = -θA _o (A _{I ^{+ = 0, a I - =}} -θA o) and (2302) a _i> + θA _o If ^{_{a I = 0 (a I +}} = 0, a I - a = 0), 2303. A _max for suppressing unnecessary interference increases and [theta] for puncture determination are determined by system parameters.

FIG. 23C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain the final transmission signal determination by the scheme of FIG. 23A.

For I channel, S ⁰ = {a, b, d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {c, l, s}, S ^- a = {j}, if the Q ^{channels, S 0 = {a, b} , d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {j, l}, and S ⁻ = {c, s}.

FIG. 23D illustrates the orthogonal radio resource units arranged in order to compare amplitudes of selected channels in the case of FIG. 23C. In the case of the I channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the j-th channel -A _j . In the case of the Q channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the s-th channel -A _s .

FIG. 23E is a diagram showing the final transmission signal determined by the algorithm of FIG. 23A in the case of FIG. 23C. In the case of an I channel, since there is a channel (channel l) having an amplitude smaller than θ A _{j, the} value of the orthogonal radio resource unit is A _I = + θ A _j (A _I ⁺ = + θ A _j , A _I ⁻ = 0) To have.

23E shows channels c, j and s as OFF (A _c = 0, A _j = 0, A _s = 0) and only channel l is transmitted (A _l ≠ 0), but if the total amount (A _c + A _j + A _l + A _s ) is satisfied (+ θA _j ), the amplitude of each channel Does not matter. In the case of the Q channel, since there is nothing smaller than θA _s , the orthogonal radio resource unit has a value of A _Q = 0 (A _Q ⁺ = 0, A _Q ⁺ = 0).

24A is a flowchart illustrating a method for determining transmission signal for each orthogonal radio resource unit in a transmitter in a direction from a first communication station to a second communication station according to an embodiment of the present invention.

The method VII is as follows. For S = S ⁰ (1830) is one channel is the orthogonal wireless due to the resources not selected for the unit ^{_{A I = 0 (A I +}} = 0, A I - = 0) the orthogonal by situation in the radio resource units are the 1 The communication station does not transmit.

이면(1842),

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. In addition, when S = S ⁰ ∪ S ⁺ (1840), since all channels in which the orthogonal radio resource unit is selected are positive,

Back side (1842),

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

이면(1852)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. Further, S = S ⁰ ∪S ^- If because the case (1850), the boards are all negative, while selecting the orthogonal wireless resource unit,

The back side (1852)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

과 음수값을 가지는 진폭 중에서 가장 작은 것

중에서 보다 큰 쪽

을 기준값으로 설정한다(2062). S ⁺ ≠ {} and S ^- ≠ {} in the case 2460, the smallest amplitude having a positive value in

The smallest of negative and negative amplitudes

Greater than

Is set to a reference value (2062).

이라면 음수값을 가지는 모든 채널의 합

이

보다 크다면(2481)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고(2483), 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2485). If the smaller is the smallest of the positive amplitudes

If is the sum of all negative channels

this

Greater than (2481)

A first communication station transmits the orthogonal radio resource unit having a value of 2424;

A first communication station transmits the orthogonal radio resource unit having a value of 2424.

이라면 양수값을 가지는 모든 채널 의 합

이

보다 작다면(2482)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고(2484), 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2486).If the smaller is the smallest of the negative amplitudes

If is the sum of all channels with positive values

this

If less than (2482)

A first communication station transmits the orthogonal radio resource unit having a value of 2448;

A first communication station transmits the orthogonal radio resource unit having a value of 2424.

FIG. 24B shows an example of final transmission signal determination by the scheme of FIG. 24A when the multi-dimensional orthogonal resource hopping patterns of two channels collide. Assume that two channels select the same orthogonal radio resource unit in the same data symbol period.

If each data symbol value is + A _i , + A _o (A _i <A _o), the final data symbol value transmitted by the orthogonal radio resource unit is A _i + A _o> + A _max , so A _I = + A _max (2401).

When each data symbol value is -A _i , + A _o (A _i <A _o ), the final data symbol value transmitted by the orthogonal radio resource unit is -A _i ≥ -θ A _{o, where} A _I = -A _i ( a -θA _o =) ^(- a _i ⁺ = 0, a _i ^- = -A _i) and _{(2402), -A i <-θA} o If _{a i = -θA o (a i} + = 0, a i 2403). At this time, A _max for suppressing unnecessary interference increase and? For puncture determination are determined as system parameters.

FIG. 24C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain the final transmission signal determination by the scheme of FIG. 24A. For I channel, S ⁰ = {a, b, d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {c, l, s}, S ^- a = {j}, if the Q ^{channels, S 0 = {a, b} , d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {j, l}, and S ⁻ = {c, s}.

FIG. 24D illustrates the orthogonal radio resource units arranged in order to compare amplitudes of selected channels in the case of FIG. 24C. In the case of the I channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the j-th channel -A _j . In the case of the Q channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the s-th channel -A _s .

FIG. 24E is a diagram showing a final transmission signal determined by the algorithm of FIG. 24A in the case of FIG. 24C. For the I channel, since the amplitude of the channel l is smaller than θA _j is the orthogonal wireless resource unit _{A I = + A j (A} I + = + A j, A I - = 0) to have a value of.

In FIG. 24E, channels c, j, and s are turned off (A _c = 0, A _j = 0, A _s = 0) and only channel l is transmitted (A _l ≠ 0), but the total amount (A _c + A _j + If A _l + A _s ) is satisfied (A _l ), the amplitude magnitude of each channel does not matter. In the case of the Q channel, there is nothing smaller than θA _s , but the orthogonal radio resource unit has a value of A _Q = + θA _s (A _Q ⁺ = + θA _s , A _Q ⁻ = 0).

25A is a flowchart illustrating a method for determining transmission signal for each orthogonal radio resource unit at a transmitter in a direction of a second communication station from a first communication station according to an embodiment of the present invention.

The method VII is as follows. For S = S ⁰ (1830) is one channel is the orthogonal wireless due to the resources not selected for the unit ^{_{A I = 0 (A I +}} = 0, A I - = 0) the orthogonal by setting a wireless resource unit has the 1 The communication station does not transmit.

이면(1842)

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. In addition, when S = S ⁰ ∪ S ⁺ (1840), since all channels in which the orthogonal radio resource unit is selected are positive,

The back side (1842)

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

이면(1852),

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신하고, 아니면

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다. In this case, S = S ⁰ ∪S ^- a case (1850), because if the channel selected for the orthogonal wireless resource units are all negative,

Back side (1852),

A first communication station transmits the orthogonal radio resource unit having a value of

The first communication station transmits the orthogonal radio resource unit having the value of.

과 음수값을 가지는 진폭 중에서 가장 작은 것

중에서 보다 큰 쪽

을 기준값으로 설정한다(2062). In addition, S ⁺ ≠ {} and S ^- ≠ {} in the case 2560, the smallest amplitude having a positive value in

The smallest of negative and negative amplitudes

Greater than

Is set to a reference value (2062).

이라면,

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2585). If the smaller is the smallest of the positive amplitudes

If

The first communication station transmits the orthogonal radio resource unit having a value of 2525.

이라면,

의 값을 가지는 상기 직교 무선 자원 단위를 제1 통신국이 송신한다(2586).If the smaller is the smallest of the negative amplitudes

If

The first communication station transmits the orthogonal radio resource unit having a value of 2525.

FIG. 25B shows an example of final transmission signal determination by the scheme of FIG. 25A when the multi-dimensional orthogonal resource hopping patterns of two channels collide. Assume that two channels select the same orthogonal radio resource unit in the same data symbol period.

If each data symbol value is + A _i , + A _o (A _i <A _o), the final data symbol value transmitted by the orthogonal radio resource unit is A _i + A _o> + A _max , so A _I = + A _max (2501).

If each data symbol value is -A _i , + A _o (A _i <A _o ), the final data symbol value transmitted by the orthogonal radio resource unit is A _I = -θA _o (A _I ⁺ = 0, A _I ^- = -θA _o) and (2502) a _i> + θA even _{o a I = -θA o (a I} + = 0, a I - = -θA o) is 2503. A _max for suppressing unnecessary interference increases and [theta] for puncture determination are determined by system parameters.

FIG. 25C is a diagram illustrating an example of multi-dimensional orthogonal resource hopping pattern collision of four channels (c, j, l, s) to explain the final transmission signal determination by the method of FIG. 25A.

For I channel, S ⁰ = {a, b, d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {c, l, s}, S ^- a = {j}, if the Q ^{channels, S 0 = {a, b} , d, e, f, g, h, i, k, m, n, o, p, q, r, t}, S ⁺ = {j, l}, and S ⁻ = {c, s}.

FIG. 25D illustrates an orthogonal radio resource unit arranged in order to compare amplitudes of selected channels in the case of FIG. 25C. In the case of the I channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the j-th channel -Aj. In the case of the Q channel, the reference value determined through the process of reference numerals 2062 and 2070 is the size of the s-th channel -A _s .

FIG. 25E is a diagram showing the final transmission signal determined by the algorithm of FIG. 25A in the case of FIG. 25C. For the I channel, the orthogonal wireless resource unit is _{A I = + θA j (A} I + = + θA j, A I - = 0) to have a value of.

In FIG. 25E, channels c, j, and s are turned off (A _c = 0, A _j = 0, A _s = 0) and only channel l is transmitted (A _l = θ A _j ), but the total amount (A _c + A _j When + A _l + A _s ) is satisfied (+ θ A _j ), the amplitude magnitude of each channel does not matter. In the case of the Q channel, there is nothing smaller than θA _s , but the orthogonal radio resource unit has a value of A _Q = + θA _s (A _Q ⁺ = + θA _s , A _Q ⁻ = 0).

FIG. 26 is a diagram illustrating a method for determining a transmission signal for each orthogonal radio resource unit I to V in a transmitter toward a second communication station in a first communication station according to an embodiment of the present invention, where the reception strength of a signal from the first communication station is relatively weak ( It is a diagram showing that the disadvantages of the second communication station located at the cell boundary, etc.) are compensated through soft handoff or softer handoff.

If the second communication station 2670, which communicates using the multidimensional orthogonal resource hopping multiplexing scheme, is in soft handoff, the radio links 2671 and 2672 from the first communication stations A 2610 and B 2620 are shown in Figs. Since the transmission signal control is performed independently, even if the puncturing probability P _p ^A of the radio link 2671 from the first communication station A 2710 is greater than the reference value θ _p , the second communication station 2670 is connected to the first communication station B 2620. The second puncturing probability (P _p ^B ) by the puncturing probability (P _p ^B ) of the radio link 2672 from the second cell located at the cell boundary because the final puncturing probability (P _p = (P _p ^A + P _p ^B )) may be less than the reference value (θ _p ). The communication station can reduce the relative disadvantages.

FIG. 27A illustrates a method for performing orthogonal resource division multiplexing on all of the output bits of a systematic channel encoder 2710 without distinguishing the same information bits from the input bits and the parity bits generated by the channel encoder. FIG. 2 illustrates an embodiment 2740 of the present invention that employs orthogonal resource hopping multiplexing with an embodiment 2730 of the prior art.

FIG. 27B is an embodiment of the present invention of orthogonal resource hopping multiplexing with an embodiment 2832 of the prior art for performing orthogonal resource division multiplexing on all output bits of a turbo encoder 2712 which is a classification channel encoder according to the embodiment of FIG. 27A. A diagram showing 2742 is shown.

In general, system bits that cannot obtain time diversity among output bits of a systematic channel encoder are more susceptible to errors than parity bits that can obtain time diversity relatively. Therefore, if a pure orthogonal resource hopping multiplexing scheme capable of puncturing is used for both the information bit and the additional bit, there is a possibility that the quality of the decoded signal in the classification channel decoder on the receiving side becomes worse.

27C illustrates orthogonal resource division multiplexing (2751) of information bits identical to input bits in output bits of a classification channel encoder according to an embodiment of the present invention, and additional bits generated by the classification channel encoder. parity bit) is a diagram illustrating orthogonal resource hopping multiplexing (2752).

FIG. 27D is a diagram illustrating a time division between an orthogonal resource division multiplexing area 2701 and an orthogonal resource hopping multiplexing area 2762 according to the embodiment of FIG. 27C.

After dividing the set including all orthogonal radio resource units into two subsets A and B, the orthogonal resource division multiplexing method transmits using only the orthogonal radio resource units in set A, and the pure orthogonal resource hopping multiplexing method Transmit using only the orthogonal radio resource unit in B.

27E illustrates orthogonal resource division multiplexing (2734) of information bits identical to input bits in output bits of a turbo encoder according to an embodiment of the present invention, and additional bits generated by a classification channel encoder. bit) is a diagram illustrating orthogonal resource hopping multiplexing (2744).

In addition, the speed matching unit 2716 and 2718 serve to adjust the number of output bits of the channel encoder 2712 due to the limited bandwidth if the number of bits in the channel encoder 2712 is greater or smaller than that required by the modulator.

FIG. 28A is a diagram illustrating a magnitude relationship between a collision probability or a puncturing probability of a multi-dimensional orthogonal resource hopping pattern for each frame according to an embodiment of the present invention and a reference value in FIG. 4C. At this time, the instantaneous activity in the frame of the permitted channel in the frame indicated by the black arrow increases than the average activity, so that the second communication station (MS # 1, MS # 2, MS # 3, MS) performing orthogonal resource hopping multiplexed communication. Since the collision probability (p _c ) or puncturing probability (p _p ) of the multi-dimensional leap pattern of # 4,… is greater than the reference value θ _c or θ _p, respectively, the quality of the channel transmitted in the frame decreases. .

FIG. 28B is a solution for the above situation when one of the above-mentioned situations is intentionally made, so that the collision probability or puncturing probability of the multi-dimensional orthogonal resource hopping pattern in the frame is less than the reference value. Indicates that all or part of the transmission frame is not transmitted. The channel that intentionally does not transmit all or part of the transmission frame is determined by the system designer, and can be determined by the following criteria.

(1) Channels with low quality requirements do not transmit over higher channels.

(2) A channel operated by ARQ (Automatic Repeat reQuest) does not transmit preferentially over a channel that is not.

(3) A channel having a small number of retransmissions does not preferentially transmit a channel among channels operating in the ARQ scheme.

(4) A channel with a high transmit power does not transmit preferentially over a low channel.

(5) A channel having a small number of successive frames transmitted in advance does not transmit preferentially over many channels.

(6) The channel in soft handoff does not transmit later than the channel that is not. This is because it is not easy to simultaneously control all the base stations involved in the soft handoff, which is relatively disadvantageous than when the second communication station located at the cell boundary is located near the first communication station as mentioned above.

The criteria mentioned above may be reversed by the system designer depending on the situation of the system. In some situations, the first communication station may cancel the channel allocation in the order of the least affected channels for the sake of many benefits out of the range of not transmitting a few frames at a moment, and thus the probability of collision of the multi-dimensional leap pattern (p _c ). Alternatively, the puncturing probability p _p may be lower than the reference value θ _c or θ _p , respectively.

29A illustrates an orthogonal radio resource unit for orthogonal resource division multiplexing and a set including an orthogonal radio resource unit for orthogonal resource leap multiplexing for wide multidimensional orthogonal resource hopping multiplexing according to an embodiment of the present invention; A diagram illustrating dividing into a set including a. A channel multiplexed by an orthogonal resource hopping multiplexing scheme uses only orthogonal radio resource units indicated by circles, and a channel multiplexed by an orthogonal resource division multiplexing scheme uses only orthogonal radio resource units indicated by squares.

The orthogonal radio resource unit is represented by multi-dimensional coordinates composed of frequency, time, orthogonal code, and the like. For example, if the frequency component is represented by binary 010, the time component is represented by binary 0101, and the orthogonal code component is represented by binary 11011, then the multidimensional coordinates are represented by binary vectors (010, 0101, 11011) or binary 010010111011. can do.

Channels to the second communication stations MS # a and MS # b, which are serviced by the multi-dimensional orthogonal resource hopping multiplexing scheme, select and transmit orthogonal radio resource units according to the hopping patterns indicated by solid and dashed lines, respectively.

FIG. 29B is a diagram illustrating a relative relationship between a channel to which an orthogonal radio resource unit for fixed multi-dimensional orthogonal resource hopping multiplexing according to an embodiment of the present invention and a channel to which an orthogonal radio resource unit is allocated according to a hopping pattern.

In the upper figure, the channel to the MS # α of the second communication station selects an orthogonal radio resource unit surrounded by a solid line according to the time-varying hopping pattern to transmit data, and the channel to the MS # β of the second communication station is a thick solid line according to the time-varying hopping pattern. Data is transmitted using the orthogonal radio resource unit 2933 enclosed in a fixed manner.

The lower figure shows that when the channel to the second communication station MS # α sees the channel to the second communication station MS # β, the channel to the second communication station MS # β appears to be transmitting data according to a time varying jump pattern. That is, selecting orthogonal radio resource units according to time-varying hopping patterns and selecting orthogonal radio resource units according to time-varying hopping patterns are relative.

29C illustrates a channel request, radio resource allocation and channel termination process over time in an orthogonal resource division multiplexing scheme according to an embodiment of the prior art and a multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention. Conceptual diagram.

Here, the channel request, radio resource allocation, and channel termination process by the orthogonal resource division multiplexing method using a total of six orthogonal radio resource units indicated by squares are shown in reference numeral 2940. If the orthogonal resource division multiplexing channel is requested (or arrived), the radio resource management unit does not accept the available channel if there is no available orthogonal radio resource unit assigned to the requesting channel.

Here, when the channel is terminated and the used orthogonal radio resource unit is returned, the radio resource unit may be allocated to another channel. A channel request, radio resource allocation, and channel termination process by an orthogonal resource hopping multiplexing scheme using a total of seven orthogonal radio resource units indicated by circles are shown in reference numeral 2950.

When the orthogonal resource hopping multiplexed channel of the required negotiation is less than or equal to the number of available orthogonal radio resource units, these channels are fixed as orthogonal radio resource units to prevent collisions of the hopping pattern from occurring. The allocated channel selects an orthogonal radio resource unit according to the hopping pattern and transmits data from the moment when the requested orthogonal orthogonal resource hopping multiplexed channel is larger than the number of available orthogonal radio resource units.

When the channel to which the orthogonal radio resource unit is fixedly allocated, such as the orthogonal resource hopping multiplexing channel, is terminated and the orthogonal radio resource unit is returned, the orthogonal radio resource unit is then allocated to the orthogonal resource hopping multiplexing channel which is first requested. This is a radio resource management method based on the concept of FIG. 29B.

29D is a conceptual diagram illustrating a channel request, radio resource allocation, mode switching, and channel termination process over time in a negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to another embodiment of the present invention.

At this time, the channel request, radio resource allocation, mode switching, and channel termination process of the negotiated orthogonal resource hopping multiplexing method using a total of seven orthogonal radio resource units indicated by circles are shown in reference numerals 2960 and 2970. First Come First Change (FCFC) scheme of reference numeral 2960 corresponds to a hop pattern when the requested orthogonal orthogonal resource hopping multiplexed channel is less than or equal to the number of available orthogonal radio resource units, as shown by reference numeral 2950 of FIG. 29C. In order to avoid collisions inherently, these channels are assigned fixed orthogonal radio resource units as fixedly as orthogonal resource division multiplexing channels, and from the moment the requested negotiated orthogonal resource hopping multiplexing channel is greater than the number of available orthogonal radio resource units. The selected channel transmits data by selecting an orthogonal radio resource unit according to the hopping pattern.

However, when the channel to which the orthogonal radio resource unit is fixedly allocated, such as the orthogonal resource hopping multiplexing channel, ends and returns the orthogonal radio resource unit, unlike the reference numeral 2950 of FIG. 29C, the orthogonal radio resource unit is requested for the first time. It is not assigned to the orthogonal resource hopping multiplexed channel, but is allocated to the first serviced channel among the orthogonal resource hopping multiplexed channels whose service is continued until the return moment, and the orthogonal resource hopping multiplexed channel switches modes to the allocated orthogonalized channel. Data is transmitted using a fixed radio resource unit.

The Last Come First Change (LCFC) scheme of FIG. 2970 corresponds to a hop pattern when the negotiated orthogonal resource hopping multiplexed channel is less than or equal to the number of available orthogonal radio resource units as shown in FIG. 29C. In order to avoid collisions inherently, such channels are allocated orthogonal radio resource units in a fixed manner, such as orthogonal resource division multiplexing channels, and from the moment the requested negotiated orthogonal resource hopping multiplexing channel is larger than the number of available orthogonal radio resource units. The selected channel transmits data by selecting an orthogonal radio resource unit according to the hopping pattern.

However, when the channel to which the orthogonal radio resource unit is fixedly allocated, such as the orthogonal resource hopping multiplexing channel, ends and returns the orthogonal radio resource unit, unlike the reference numeral 2950 of FIG. 29C, the orthogonal radio resource unit is requested for the first time. The orthogonal resource hopping multiplexed channel is not allocated to the orthogonal resource hopping multiplexed channel, but is allocated to the most recently serviced channel among the orthogonal resource hopping multiplexed channels whose service continues until the moment of return. Data is transmitted using fixed resource units.

The priority may be variously determined according to the remaining service time, the amount of the remaining transmission data, the required quality, the transmission power, the rating of the customer, and the like.

In addition, the present invention provides that if the required negotiated orthogonal resource hopping multiplexed channels are less than or equal to the number of available orthogonal radio resource units, such channels are fixed as the orthogonal resource division multiplexing channel so that collision of the hopping pattern does not occur at the source. The orthogonal radio resource unit is allocated and the allocated channel selects the orthogonal radio resource unit according to the hopping pattern and transmits data from the moment when the requested orthogonal resource hopping multiplexed channel becomes larger than the number of available orthogonal radio resource units. .

30A to 30E are orthogonal radio resource management methods that can be applied to the method for allocating radio resources to the required channels of FIGS. 29A to 29D.

30A is a conceptual diagram illustrating a division mode in a negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention. The splitting mode is essentially similar to the conventional orthogonal resource division multiplexing scheme as long as the number of allocated channels is kept less than the number of orthogonal radio resource units.

일 때, 다차원 직교 자원 도약 패턴의 충돌 확률(p_c), 전송 데이터 심볼의 천공 확률(p_p) 및 할당 가능한 채널의 수 M의 관계는 다음과 같이 채널의 평균 채널 활성도가

에 무관함을 알 수 있다.Therefore, since the collision of the multi-dimensional orthogonal resource hopping pattern does not occur naturally, no puncturing of the transmission data symbol occurs. The number of orthogonal radio resource units is N _OR and the average channel activity of the channel is

When the relationship between the collision probability (p _c ) of the multi-dimensional orthogonal resource hopping pattern, the puncturing probability (p _p ) of the transmission data symbol, and the number M of assignable channels is obtained, the average channel activity of the channel is as follows.

It can be seen that irrelevant to.

[Equation 13]

The split mode uses only one bit of information (two values), such as when power transmission symbols are " + 1 " and " -1 ", such as power-efficient BPSK and QPSK (for I and Q channels respectively) modulation. The power efficiency is lower than BPSK and QPSK, but can be easily applied to systems having more than one bit information such as MPSK (M> 4) and MQAM (M> 4), which have good bandwidth efficiency.

Thus, in systems with limited frequency bands the number of orthogonal wireless resource units N _OR a small channel allocation than is if higher the required transmission data rate of each channel, even though the power efficiency is only fall a short time by selecting a bandwidth efficient modulation scheme More data can be sent to.

In addition, since the data rate that a limited frequency band can accommodate is limited, the power efficiency in a modulation scheme having high bandwidth efficiency from the moment when the number of allocated channels (M) is greater than the number of orthogonal radio resource units (N _OR ). By switching to this high modulation method, the processing capacity of the system can be increased.

30B is a conceptual diagram illustrating a hopping mode in a negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention. In the hopping mode, regardless of the number of orthogonal radio resource units allocated to the channel, regardless of the number of orthogonal radio resource units, channels are separated using an independent orthogonal resource hopping pattern. A conflict can occur.

However, if the average activity of the channel is low, the desired bit error rate (BER) or frame error rate (FER) may be achieved despite the fact that the channel coding allows a larger number of channels than the number N _OR of radio resource units. The loss in signal-to-interference ratio required to satisfy the desired quality, such as

일 때, 다차원 직교 자원 도약 패턴의 충돌 확률(p_c), 전송 데이터 심볼의 천공 확률(p_p) 및 할당 가능한 채널의 수(M) 사이의 관계는 다음과 같다(단, s는 I 채널 또는 Q 채널에서의 변조심볼의 수).In addition, the number of orthogonal radio resource units is N _OR and the average channel activity of the channel is

When the relationship between the collision probability (p _c ) of the multi-dimensional orthogonal resource hopping pattern, the puncturing probability (p _p ) of the transmission data symbol and the number of assignable channels (M) is as follows (where s is an I channel or Number of modulation symbols in the Q channel).

[Equation 14]

[Equation 15]

In addition, in the case of modulation of BPSK or QPSK (for each I channel or Q channel), the puncturing probability p _p of the transmission data symbol is s = 2 as follows.

[Equation 16]

In addition, the number of channels (M) acceptable by the hopping mode for statistical multiplexing is given by the collision probability (P _c ^max ) of the maximum allowable multidimensional orthogonal resource hopping pattern and the puncturing probability (P _p ^max ) of the maximum allowable transmission data symbol. Can be obtained as follows.

[Equation 17]

Equation 18

Further, in the case of BPSK or QPSK (for each I channel or Q channel) modulation, the number of acceptable channels M is s = 2 as follows.

[Equation 19]

The hopping mode can be applied to a system having more than one bit information (s &gt; 2) such as MPSK (M &gt; 4), MQAM (M &gt; 4), which has good bandwidth efficiency, but BPSK and QPSK ( For modulation of each of the I channel and the Q channel), it can be seen from Equation 19 that the puncturing probability p _p of the transmission data symbol can be minimized.

30C is a conceptual diagram illustrating a hybrid mode in a negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention. The mixed mode may be a mixed type of the split mode of FIG. 30A and the jump mode of FIG. 30B.

That is, until the number of allocated channels M is less than the number N _OR of the orthogonal radio resource units, the division of FIG. 30A so that there is no collision between the orthogonal resource hopping patterns (there is no perforation of transmission data symbols because there is no collision). The mode of FIG. 30B which separates channels using independent orthogonal resource hopping patterns between channels from the moment when the number of allocated channels M is greater than the number of orthogonal radio resource units N _OR , How to use.

일 때, 다차원 직교 자원 도약 패턴의 충돌 확률(p_c), 전송 데이터 심볼의 천공 확률(p_p) 및 할당 가능한 채널의 수(M) 사이의 관계는 다음과 같다(단, s는 I 채널 또는 Q 채널에서의 변조심볼의 수).Where the number of orthogonal radio resource units is N _OR and the average channel activity of the channel is

When the relationship between the collision probability (p _c ) of the multi-dimensional orthogonal resource hopping pattern, the puncturing probability (p _p ) of the transmission data symbol and the number of assignable channels (M) is as follows (where s is an I channel or Number of modulation symbols in the Q channel).

A. When the number of received channels (M) is less than the number of orthogonal radio resource units (N _OR ) (M ≦ N _OR ),

p _c = 0

p _p = 0

B. When the number of received channels (M) is greater than the number of orthogonal radio resource units (N _OR ) (M &gt; N _OR ),

[Equation 20]

[Equation 21]

In addition, in the case of modulation of BPSK or QPSK (for each I channel or Q channel), the puncturing probability p _p of the transmission data symbol is s = 2 as follows.

[Equation 22]

The number of channels M that can be accommodated by the hopping mode for statistical multiplexing assigns the collision probability (p _c ^max ) of the maximum allowable multidimensional orthogonal resource hopping pattern and the puncturing probability (p _p ^max ) of the maximum allowed transmission data symbol to the above equations, respectively. And numerically interpreted to find out.

It can be seen that the mixed mode has only selected the advantages of the split mode and the jump mode. If the power efficiency is poor but the bandwidth efficiency is used only until the split mode is used, and the number of channels is gradually increased to the jump mode, the modulation method is selected. The mixed mode can obtain better performance by operating by the radio orthogonal resource operating method given in FIGS. 29A to 29D.

30D is a conceptual diagram illustrating a group mode for a single channel in the negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention. The group mode is an improvement of the mixing mode of FIG. 30C. That is, until the number of allocated channels (M) is less than the number of orthogonal radio resource units (N _OR ), the same as the split mode of FIG. 30A and the mixing mode of FIG. 30C.

However, from the moment when the number of allocated channels (M) is greater than the number of orthogonal radio resource units (N _OR ), FIG. 30C using the hopping mode of FIG. 30B for classifying channels using independent orthogonal resource hopping patterns between channels. of by grouping Collect the orthogonal wireless number of resource units N _OR each channel, unlike the mixed mode, within each group, so that no collision of orthogonal resource hopping patterns occurs between channels, the conflict each other only between channels belonging to different groups It's a way to make it happen.

일 때, 다차원 직교 자원 도약 패턴의 충돌 확률(p_c), 전송 데이터 심볼의 천공 확률(p_p) 및 할당 가능한 채널의 수(M) 사이의 관계는 다음과 같다(단, s는 I 채널 또는 Q 채널에서의 변조심볼의 수).Therefore, the orthogonal resource hopping patterns of channels in each group are not independent of each other, and only the hopping patterns between groups are independent of each other. That is, the channel number from 0 to N _OR -1 is the first group (OG # 0), and the channel number from N _OR to 2N _OR -1 is the second group (OG # 1). The number of orthogonal radio resource units is N _OR and the average channel activity of the channel is

When the relationship between the collision probability (p _c ) of the multi-dimensional orthogonal resource hopping pattern, the puncturing probability (p _p ) of the transmission data symbol and the number of assignable channels (M) is as follows (where s is an I channel or Number of modulation symbols in the Q channel).

A. When the number of received channels (M) is less than the number of orthogonal radio resource units (N _OR ) (M ≦ N _OR ),

p _c = 0

p _p = 0

B. When the number of received channels (M) is greater than the number of orthogonal radio resource units (N _OR ) (M> N _OR ).

[Equation 23]

[Equation 24]

In the case of BPSK or QPSK (for each I channel or Q channel) modulation, the puncturing probability p _p of the transmitted data symbol is s = 2, as follows.

[Equation 25]

The number of channels M that can be accommodated by the hopping mode for statistical multiplexing assigns the collision probability (p _c ^max ) of the maximum allowable multidimensional orthogonal resource hopping pattern and the puncturing probability (p _p ^max ) of the maximum allowed transmission data symbol to the above equations, respectively. And numerically interpreted to find out.

The group mode is intended to reduce the collision probability of the orthogonal resource hopping pattern caused by the hopping mode and the puncturing probability of transmission data symbols due to the hopping mode from the moment when the number of channels in the mixed mode of FIG. 30C becomes larger than the number of radio orthogonal resource units. There is this.

FIG. 30E is a conceptual diagram illustrating a group mode for multiple channels in a negotiated multi-dimensional orthogonal resource hopping multiplexing scheme according to an embodiment of the present invention. When the second communication station is assigned one orthogonal channel from the first communication station, it has equivalent performance to that of FIG. 30D.

However, when the second communication station is assigned a plurality of orthogonal channels from the first communication station, since the activities of the plurality of channels are not independent from each other, the first group (OG #) from channel numbers 0 to N _OR -1 as shown in FIG. 30D. Although no collisions occur within the group even for 0), by making a hop, the multi-channel secondary communication stations in different groups distribute the probability of successive collisions, and the collision of the orthogonal resource hopping pattern is uniform across all channels. To be distributed.

As described above, the present invention provides a multi-dimensional orthogonal resource leap between independent channels that can be generated in a statistical orthogonal multiplexing scheme by a multi-dimensional orthogonal resource hopping scheme in which a plurality of communication channels synchronized through a single medium maintain orthogonality between channels. If the pattern collides and the data symbols to be transmitted at the collision time are different, the shortcomings of the simple puncturing method proposed by the present inventors can be improved.

In addition, the present invention can reduce the case of perforation by subdividing the processing method in the collision of the multi-dimensional orthogonal resource hopping pattern which is divided into two methods of transmission and perforation in order to improve the performance of the system adopting the multi-dimensional orthogonal resource hopping multiplexing method.

In addition, the present invention can lower the puncturing probability of a second communication station located at a relatively disadvantageous cell boundary through soft handoff.

In addition, the present invention distinguishes between the systematic bits and the parity bits among the output bits of the systematic channel encoder, so that the information bits are orthogonal resource division multiplexing without risk of loss due to collision. In the case of additional bits, the bit energy required for satisfying quality requirements, such as a required bit error rate (BER), can be lowered by transmitting in an orthogonal resource hopping multiplexing scheme in which there is a risk of loss due to collision.

In addition, when the instantaneous collision rate in a particular frame of the multi-dimensional hop pattern is higher than the reference collision rate, the present invention can improve the performance of the entire system by stopping the frame transmission in the order of the least impact channel.

In addition, the present invention can improve the performance of the entire system by canceling channel allocation in the order of the least impact channel, when the instantaneous collision rate of the multi-dimensional leap pattern is continuously higher than the reference collision rate.

Claims (4)

A digital communication method in which a communication channel to a plurality of synchronized second communication stations is allocated by a first communication station according to a multi-dimensional orthogonal resource hopping method and statistically multiplexed. a) distinguishing the information bits and the additional bits among the output bits of the classification channel encoder; b) transmitting the information bits in an orthogonal resource division multiplexing scheme; And c) transmitting the additional bit in an orthogonal resource hopping multiplexing scheme; Digital communication method comprising a. The method of claim 1, And the classification channel encoder is a turbo encoder. A digital communication system in which a communication channel to a plurality of synchronized second communication stations is allocated by a first communication station according to a multidimensional orthogonal resource hopping method and statistically multiplexed. Discriminating means for discriminating information bits and additional bits among the output bits of the classification channel encoder; And Transmission means for transmitting the information bits extracted from the classification means by the orthogonal resource division multiplexing scheme, and the additional bits by the orthogonal resource hopping multiplexing scheme. Digital communication system comprising a. The method of claim 3, The classification channel encoder is a turbo encoder.

Images