JP3683252B2 - Apparatus and method for encoding transmission frame information bits in divided mode - Google Patents

Description

【００２３】
もし、前記(３、２)シンプレックス符号語を２回反復すると、入力情報ビットと出力される(３、２)シンプレックス符号語間の関係は、下記表２のようである。
【表２】

【００２４】
しかし、前記２回反復した(３、２)シンプレックス符号語は、既存の(１６、４)リードミュラー符号をショートニングすることにより具現することができる。ショートニング方法に対して例を挙げて説明すると、先ず、(１６、４)リードミュラー符号は長さ１６である４個の基底符号語の線形結合である(ここで、４は入力情報ビットの数である)。前記４個の入力情報ビット中、２ビットのみを受信するとは、長さ１６である４個の基底符号語中、２個の基底符号語のみの線形結合を使用し、残りは使用しないということである。また、前記のように基底符号語の使用を制限した後、前記１６個のシンボル中、１０個のシンボルを穿孔すると、前記(１６、４)符号器を(６、２)符号器として動作させることができる。下記表３は前記ショートニング方法を説明する。
【００２５】
【表３】

【００２６】
前記表３を参照すると、先ず、全ての(１６、４)符号語は長さ１６の４個の基底符号語(表３のＡ、Ｂ、Ｃ、Ｄ)の線形結合である。この時、前記(６、２)符号を得るために、前記４個の基底符号語中、上位２個の符号語のみを使用する。すると、前記上位４個の符号語のみ使用され、残り下位１２個の符号語は自動的に使用されないようになる。また前記上位４個の符号語を長さ６の符号語に形成するためには、１６個のシンボル中、１０個のシンボルを穿孔すべきである。前記表３で(＊)に表示された部分を穿孔し、残り６個の符号シンボルを集めると、前記表２で示した２回反復された(３、２)シンプレックス符号語を得ることができる。従って、下記では(３２、１０)リードミュラー符号(Sub-code of the Second order Reed Muller code)をショートニングして、情報量の比が１：９である場合に使用される(３、１)最適符号と(２７、９)最適符号を形成する符号器の構造と、情報量の比が２：８である場合に使用される(６、２)最適符号と(２４、８)最適符号を形成する符号器の構造と、情報量の比が３：７である場合に使用される(９、３)最適符号と(２１、７)最適符号を形成する符号器の構造と、情報量の比が４：６である場合に使用される(１２、４)最適符号と(１８、６)最適符号を形成する符号器の構造と、情報量の比が５：５である場合に使用される(１５、５)最適符号と(１５、５)最適符号を形成する符号器の構造に対して説明する。
【００２７】
下記の実施形態はハードスプリット方法で、それぞれ５ビットに構成される情報量を論理(Logical)スプリットモードのように、１０ビットを１：９、２：８、３：７、４：６、５：５、６：４、７：３、８：２、または９：１に分けて情報を示した後、それぞれに対して符号化を適用できるようにする装置及び方法を示す。
【００２８】
第１実施形態
図４は本発明の実施形態による送信器の構造を示す。図４を参照すると、前記情報量の比に応じて分けられたＤＳＣＨ用ＴＦＣＩビットとＤＣＨ用ＴＦＣＩビットが第１符号器４００と第２符号器４０５にそれぞれ入力される。ここで、前記ＤＳＣＨ用ＴＦＣＩビットはＴＦＣＩフィールド１、または第１ＴＦＣＩとし、ＤＣＨ用ＴＦＣＩビットはＴＦＣＩフィールド２、または第２ＴＦＣＩビットとする。前記ＤＳＣＨ用ＴＦＣＩビットは第１ＴＦＣＩビット発生器４５０で発生され、ＤＣＨ用ＴＦＣＩビットは第２ＴＦＣＩビット発生器４５５で発生される。前記第１及び第２ＴＦＣＩビットは情報量の比に応じて、上述したように相異なる比率を有する。また前記情報量の比に応じた符号語の長さ設定値である符号長さ情報を示す長さ制御信号が第１符号器４００と第２符号器４０５に入力される。前記符号長さ情報は符号長さ情報発生器４６０で発生され、この時、前記符号長さ情報は前記第１ＴＦＣＩビット及び第２ＴＦＣＩビットの長さによって可変される値を有する。
【００２９】
前記情報量の比が６：４である場合、前記符号器４００は前記６ビットのＤＳＣＨ用ＴＦＣＩビットを受信すると同時に、６ビットを受信して１８シンボルの符号語を出力する(１８、６)符号器として動作するようにする長さ制御信号に応答して、１８シンボルの符号化シンボルを出力し、符号器４０５は前記４ビットのＤＣＨ用ＴＦＣＩビットを受信すると同時に、４ビットを受信して１２シンボルの符号語を出力する(１２、４)符号器として動作するようにする長さ制御信号に応答して、１２シンボルの符号化シンボルを出力するようになる。また、情報量の比が７：３である場合、前記符号器４００は前記７ビットのＤＳＣＨ用ＴＦＣＩビットを受信すると同時に、７ビットを受信して２１シンボルの符号語を出力する(２１、７)符号器として動作するようにする長さ制御信号に応答して、２１シンボルの符号化シンボルを出力し、前記符号器４０５は前記３ビットのＤＣＨ用ＴＦＣＩビットを受信すると同時に、３ビットを受信して９シンボルの符号語を出力する(９、３)符号器として動作するようにする長さ制御信号に応答して、９シンボルの符号化シンボルを出力するようになる。また、情報量の比が８：２である場合、前記符号器４００は前記８ビットのＤＳＣＨ用ＴＦＣＩビットを受信すると同時に、８ビットを受信して２４シンボルの符号語を出力する(２４、８)符号器として動作するようにする長さ制御信号に応答して、２４シンボルの符号化シンボルを出力し、前記符号器４０５は前記２ビットのＤＣＨ用ＴＦＣＩビットを受信すると同時に、２ビットを受信して６シンボルの符号語を出力する(６、２)符号器として動作するようにする長さ制御信号に応答して、６シンボルの符号化シンボルを出力するようになる。
【００３０】
また、情報量の比が９：１である場合、前記符号器４００は前記９ビットのＤＳＣＨ用ＴＦＣＩビットを受信すると同時に、９ビットを受信して２７シンボルの符号語を出力する(２７、９)符号器として動作するようにする長さ制御信号に応答して、２７シンボルの符号化シンボルを出力し、前記符号器４０５は前記１ビットのＤＣＨ用ＴＦＣＩビットを受信すると同時に、１ビットを受信して３シンボルの符号語を出力する(３、１)符号器として動作するようにする長さ制御信号に応答して、３シンボルの符号化シンボルを出力するようになる。
図５は前記符号器４００及び符号器４０５の構造を示す。前記符号器の動作をそれぞれの情報量の比に応じて説明する。
【００３１】
1 ．情報量の比が１：９である場合
情報量の比が１：９である場合、符号器４００は(３、１)符号器として動作し、符号器４０５は(２７、９)符号器として動作する。従って、符号器４００と符号器４０５の動作をそれぞれ説明すると、次のようである。
先ず、前記符号器４００の動作を説明する。
【００３２】
１ビットの入力ビットが符号器４００に入力されると、前記入力ビットはａ０にし、残りａ１、ａ２、ａ３、ａ４、ａ５、ａ６、ａ７、ａ８、ａ９はすべて０にする。すると、前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００は基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力すると、前記乗算器５１０はシンボル単位に前記符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力する。また、前記ウォルシュ符号生成器５００はその以外の基底符号語Ｗ２、Ｗ４、Ｗ８、Ｗ１６を生成してそれぞれ乗算器５１２、５１４、５１６、５１８に出力し、all １符号生成器５０２は全部１である基底符号語を生成して乗算器５２０に出力し、マスク生成器５０４は基底符号語Ｍ１、Ｍ２、Ｍ４、Ｍ８を生成してそれぞれ乗算器５２２、５２４、５２６、５２８に出力する。しかし、前記乗算器５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８それぞれに入力された前記入力ビットａ１、ａ２、ａ３、ａ４、ａ５、ａ６、ａ７、ａ８、ａ９がすべて０であるので、前記乗算器５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８は０(信号なし)を出力して、排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８の出力値を排他的加算した値が、前記乗算器５１０の出力値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力し、前記穿孔器５６０は前記制御器５５０で出力された長さ制御信号によって前記入力された０番目から３１番目までの総３２個の符号シンボル中、１、３、５、６、７、８、９、１０、１１、１２、１３、１４、１５、１６、１７、１８、１９、２０、２１、２２、２３、２４、２５、２６、２７、２８、２９、３０、３１番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、２９シンボルを穿孔した後、３個の穿孔しない符号化シンボルを出力する。
【００３３】
次に、符号器４０５の動作を説明する。
９ビットの入力ビットが符号器４０５に入力されると、前記入力ビットはそれぞれａ０、ａ１、ａ２、ａ３、ａ４、ａ５、ａ６、ａ７、ａ８にし、残りａ９は０にする。前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００は基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力し、基底符号語Ｗ４＝０００１１１１００００１１１１０００１１１１００００１１１１００を生成して乗算器５１４に出力し、基底符号語Ｗ８＝０００００００１１１１１１１１０００００００１１１１１１１１００を生成して乗算器５１６に出力し、基底符号語Ｗ１６＝０００００００００００００００１１１１１１１１１１１１１１１０１を生成して乗算器５１８に出力する。すると、前記乗算器５１０はシンボル単位に前記基底符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、前記乗算器５１２はシンボル単位に前記基底符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力し、前記乗算器５１４はシンボル単位に前記基底符号語Ｗ４と入力ビットａ２を乗算して排他的加算器５４０に出力し、前記乗算器５１６はシンボル単位に前記基底符号語Ｗ８と入力ビットａ３を乗算して排他的加算器５４０に出力し、前記乗算器５１８はシンボル単位に前記基底符号語Ｗ１６と入力ビットａ４を乗算して排他的加算器５４０に出力する。また、all １符号生成器５０２は全部１である長さ３２の基底符号語を生成して乗算器５２０に出力すると、前記乗算器５２０はシンボル単位に前記全部１である基底符号語と入力ビットａ５を乗算して排他的加算器５４０に出力する。また、マスク生成器５０４は基底符号語Ｍ１＝０１０１ ００００ １１００ ０１１１ １１００ ０００１ １１０１ １１０１を生成して乗算器５２２に出力し、基底符号語Ｍ２＝００００ ００１１ １００１ １０１１ １０１１ ０１１１ ０００１ １１００を生成して乗算器５２４に出力し、基底符号語Ｍ４＝０００１ ０１０１ １１１１ ００１０ ０１１０ １１００ １０１０ １１００を生成して乗算器５２６に出力する。すると、前記乗算器５２２はシンボル単位に前記基底符号語Ｍ１と入力ビットａ６を乗算して排他的加算器５４０に出力し、前記乗算器５２４はシンボル単位に前記基底符号語Ｍ２と入力ビットａ７を乗算して排他的加算器５４０に出力し、前記乗算器５２６はシンボル単位に前記基底符号語Ｍ４と入力ビットａ８を乗算して排他的加算器５４０に出力する。また、前記マスク生成器５０４は基底符号語Ｍ８を生成して乗算器５２８に出力する。しかし、前記乗算器５２８に入力された前記入力ビットａ９が０であるので、前記乗算器５２８は０(信号なし)を出力して、排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８からの出力値をすべて排他的加算した値は、前記乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６からの出力値を排他的加算した値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力し、前記穿孔器５６０は前記制御器５５０で出力された制御信号によって前記入力された０番目から３１番目までの総３２個の符号シンボル中、０、２、８、１９、２０番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２個の符号シンボル中、５シンボルを穿孔した後、２７個の穿孔しない符号化シンボルを出力する。
【００３４】
２．情報量の比が２：８である場合
情報量の比が２：８である場合、符号器４００は(６、２)符号器として動作し、符号器４０５は(２４、８)符号器として動作する。従って、符号器４００と符号器４０５の動作をそれぞれ説明すると、次のようである。
先ず、符号器４００の動作を説明する。
【００３５】
２ビットの入力ビットが符号器４００に入力されると、前記入力ビットはａ０、ａ１にし、残りａ２、ａ３、ａ４、ａ５、ａ６、ａ７、ａ８、ａ９は０にする。前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００は基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力すると、前記乗算器５１０はシンボル単位に前記符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力すると、前記乗算器５１２はシンボル単位に前記符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力する。また、前記ウォルシュ符号生成器５００は、その以外の基底符号語Ｗ４、Ｗ８、Ｗ１６を生成してそれぞれ乗算器５１４、５１６、５１８に出力し、all １符号生成器５０２は全部１である基底符号語を生成して乗算器５２０に出力し、マスク生成器５０４は前記基底符号語Ｍ１、Ｍ２、Ｍ４、Ｍ８を生成してそれぞれ乗算器５２２、５２４、５２６、５２８に出力する。しかし、前記乗算器５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８に入力された前記入力ビットａ２、ａ３、ａ４、ａ５、ａ６、ａ７、ａ８、ａ９が０であるので、前記乗算器５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８は０を出力して、排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８の出力値を排他的加算した値は、前記乗算器５１０と乗算器５１２の出力値を排他的加算した値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、前記制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力する。前記穿孔器５６０は前記制御器５５０で出力された制御信号によって前記入力された０番目から３１番目までの総３２個の符号シンボル中、３、７、８、９、１０、１１、１２、１３、１４、１５、１６、１７、１８、１９、２０、２１、２２、２３、２４、２５、２６、２７、２８、２９、３０、３１番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、２６シンボルを穿孔した後、６個の穿孔しない符号化シンボル、０、１、２、４、５、６番目符号化シンボルを出力する。
【００３６】
次に、符号器４０５の動作を説明する。
８ビットの入力ビットが符号器４０５に入力されると、前記入力ビットはそれぞれａ０、ａ１、ａ２、ａ３、ａ４、ａ５、ａ６、ａ７にし、残りａ８、ａ９は０にする。すると、前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００は基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力し、基底符号語Ｗ４＝０００１１１１００００１１１１０００１１１１００００１１１１００を生成して乗算器５１４に出力し、基底符号語Ｗ８＝０００００００１１１１１１１１０００００００１１１１１１１１００を生成して乗算器５１６に出力し、基底符号語Ｗ１６＝０００００００００００００００１１１１１１１１１１１１１１１０１を生成して乗算器５１８に出力する。すると、前記乗算器５１０はシンボル単位に前記基底符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、前記乗算器５１２はシンボル単位に前記基底符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力し、前記乗算器５１４はシンボル単位に前記基底符号語Ｗ４と入力ビットａ２を乗算して排他的加算器５４０に出力し、前記乗算器５１６はシンボル単位に前記基底符号語Ｗ８と入力ビットａ３を乗算して排他的加算器５４０に出力し、前記乗算器５１８はシンボル単位に前記基底符号語Ｗ１６と入力ビットａ４を乗算して排他的加算器５４０に出力する。また、all １符号生成器５０２は全部１である長さ３２の基底符号語を生成して乗算器５２０に出力する。すると、前記乗算器５２０はシンボル単位に全部１である前記基底符号語と入力ビットａ５を乗算して排他的加算器５４０に出力する。また、マスク生成器５０４は基底符号語Ｍ１＝０１０１ ００００ １１００ ０１１１ １１００ ０００１ １１０１ １１０１を生成して乗算器５２２に出力し、基底符号語Ｍ２＝００００ ００１１ １００１ １０１１ １０１１ ０１１１ ０００１ １１００を生成して乗算器５２４に出力する。前記乗算器５２２はシンボル単位に前記基底符号語Ｍ１と入力ビットａ６を乗算して排他的加算器５４０に出力し、前記乗算器５２４はシンボル単位に前記基底符号語Ｍ２と入力ビットａ７を乗算して排他的加算器５４０に出力する。また、前記マスク生成器５０４は前記基底符号語Ｍ４、Ｍ８を生成してそれぞれ乗算器５２６及び５２８に出力する。しかし、前記乗算器５２６、５２８にそれぞれ入力された前記入力ビットａ８、ａ９が０であるので、前記乗算器５２６、５２８は０(信号なし)を出力して、前記排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８からの出力値をすべて排他的加算して値と、前記乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４からの出力値を排他的加算した値が同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、前記制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力する。前記穿孔器５６０は前記制御器５５０で出力された制御信号に応じて前記入力された０番目から３１番目までの総３２個の符号シンボル中、１、７、１３、１５、２０、２５、３０、３１番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、８シンボルを穿孔した後、２４個の穿孔しない符号化シンボルを出力する。
【００３７】
３．情報量の比が３：７である場合
情報量の比が３：７である場合、符号器４００は(９、３)符号器として動作し、符号器４０５は(２１、７)符号器として動作する。従って、符号器４００及び符号器４０５の動作をそれぞれ説明すると、次のようである。
先ず、符号器４００の動作を説明する。
【００３８】
３ビットの入力ビットが符号器４００に入力されると、前記入力ビットはａ０、ａ１、ａ２にし、残りａ３、ａ４、ａ５、ａ６、ａ７、ａ８、ａ９は０にする。前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００は基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力し、基底符号語Ｗ４＝０００１１１１００００１１１１０００１１１１００００１１１１００を生成して乗算器５１４に出力すると、前記乗算器５１０はシンボル単位に前記符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、前記乗算器５１２はシンボル単位に前記符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力し、前記乗算器５１４はシンボル単位に前記符号語Ｗ４と入力ビットａ２を乗算して排他的加算器５４０に出力する。また、前記ウォルシュ符号生成器５００はその以外の基底符号語Ｗ８、Ｗ１６を生成してそれぞれ乗算器５１６、５１８に出力し、all １符号生成器５０２は全部１である基底符号語を生成して乗算器５２０に出力し、マスク生成器５０４は前記基底符号語Ｍ１、Ｍ２、Ｍ４、Ｍ８を生成してそれぞれ乗算器５２２、５２４、５２６、５２８に出力する。しかし、前記乗算器５１６、５１８、５２０、５２２、５２４、５２６、５２８に入力された前記入力ビットａ３、ａ４、ａ５、ａ６、ａ７、ａ８、ａ９が０であるので、前記乗算器５１６、５１８、５２０、５２２、５２４、５２６、５２８は０(信号なし)を出力して、前記排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８からの出力値をすべて排他的加算した値は、前記乗算器５１０、５１２、及び５１４からの出力値を排他的加算した値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、前記制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力する。すると、前記穿孔器５６０は前記制御器５５０から出力された制御信号に応じて前記入力された０番目から３１番目までの総３２個の符号シンボル中、７、８、１１、１２、１３、１４、１５、１６、１７、１８、１９、２０、２１、２２、２３、２４、２５、２６、２７、２８、２９、３０、３１番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、２３シンボルを穿孔した後、９個の穿孔しない符号化シンボルを出力する。
【００３９】
次に、符号器４０５の動作を説明する。
７ビットの入力ビットが符号器４０５に入力されると、前記入力ビットはそれぞれａ０、ａ１、ａ２、ａ３、ａ４、ａ５、ａ６にし、残りａ７、ａ８、ａ９は０にする。すると、前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００は基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力し、基底符号語Ｗ４＝０００１１１１００００１１１１０００１１１１００００１１１１００を生成して乗算器５１４に出力し、基底符号語Ｗ８＝０００００００１１１１１１１１０００００００１１１１１１１１００を生成して乗算器５１６に出力し、基底符号語Ｗ１６＝０００００００００００００００１１１１１１１１１１１１１１１０１を生成して乗算器５１８に出力する。すると、前記乗算器５１０はシンボル単位に前記基底符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、前記乗算器５１２はシンボル単位に前記基底符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力し、前記乗算器５１４はシンボル単位に前記基底符号語Ｗ４と入力ビットａ２を乗算して排他的加算器５４０に出力し、前記乗算器５１６はシンボル単位に前記基底符号語Ｗ８と入力ビットａ３を乗算して排他的加算器５４０に出力し、前記乗算器５１８はシンボル単位に前記基底符号語Ｗ１６と入力ビットａ４を乗算して排他的加算器５４０に出力する。また、all １符号生成器５０２は全部１である長さ３２の基底符号語を生成して乗算器５２０に出力する。すると、前記乗算器５２０はシンボル単位に全部１である前記基底符号語と入力ビットａ５を乗算して排他的加算器５４０に出力する。また、マスク生成器５４０は基底符号語Ｍ１＝０１０１ ００００ １１００ ０１１１ １１００ ０００１ １１０１ １１０１を生成して乗算器５２２に出力する。前記乗算器５２２はシンボル単位に前記基底符号語Ｍ１と入力ビットａ６を乗算して排他的加算器５４０に出力する。さらに前記マスク生成器５０４は前記基底符号語Ｍ２、Ｍ４、Ｍ８を生成してそれぞれ乗算器５２４、５２６、５２８に出力する。しかし、前記乗算器５２４、５２６、５２８にそれぞれ入力された前記入力ビットａ７、ａ８、ａ９が０であるので、前記乗算器５２４、５２６、５２８は０(信号なし)を出力して、前記排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８からの出力値をすべて排他的加算した値が、前記乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２からの出力値を排他的加算した値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、前記制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力する。前記穿孔器５６０は前記制御器５５０で出力された制御信号に応じて前記入力された０番目から３１番目までの総３２個の符号シンボル中、０、１、２、３、４、５、７、１２、１８、２１、２４番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、１１個のシンボルを穿孔した後、２１個の穿孔しない符号化シンボルを出力する。
【００４０】
４．情報量の比が４：６である場合
情報量の比が４：６である場合、符号器４００は(１２、４)符号器として動作し、符号器４０５は(１８、６)符号器として動作する。従って、符号器４００及び符号器４０５の動作をそれぞれ説明すると、次のようである。
先ず、符号器４００の動作を説明する。
【００４１】
４ビットの入力ビットが符号器４００に入力されると、前記入力ビットはａ０、ａ１、ａ２、ａ３にし、残りａ４、ａ５、ａ６、ａ７、ａ８、ａ９は０にする。前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００が基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力し、基底符号語Ｗ４＝０００１１１１００００１１１１０００１１１１００００１１１１００を生成して乗算器５１４に出力し、基底符号語Ｗ８＝０００００００１１１１１１１１０００００００１１１１１１１１００を生成して乗算器５１６に出力すると、前記乗算器５１０はシンボル単位に前記符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、前記乗算器５１２はシンボル単位に前記符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力し、前記乗算器５１４はシンボル単位に前記符号語Ｗ４と入力ビットａ２を乗算して排他的加算器５４０に出力し、前記乗算器５１６はシンボル単位に前記符号語Ｗ８と入力ビットａ３を乗算して排他的加算器５４０に出力する。そして、前記ウォルシュ符号生成器５００はその以外の基底符号語Ｗ１６を生成して乗算器５１８に出力し、前記all １符号生成器５０２は全部１である基底符号語を生成して乗算器５２０に出力し、マスク生成器５０４は前記基底符号語Ｍ１、Ｍ２、Ｍ４、Ｍ８を生成してそれぞれ乗算器５２２、５２４、５２６、５２８に出力する。しかし、前記乗算器５１８、５２０、５２２、５２４、５２６、５２８に入力された前記入力ビットａ４、ａ５、ａ６、ａ７、ａ８、ａ９が０であるので、前記乗算器５１８、５２０、５２２、５２４、５２６、５２８が０を出力して、前記排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８からの出力値をすべて排他的加算した値が、前記乗算器５１０、５１２、５１４、５１６からの出力値を排他的加算した値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、前記制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力する。すると、前記穿孔器５６０は前記制御器５５０から出力された制御信号に応じて前記入力された０番目から３１番目までの総３２個の符号シンボル中、０、１、２、１５、１６、１７、１８、１９、２０、２１、２２、２３、２４、２５、２６、２７、２８、２９、３０、３１番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、２０個のシンボルを穿孔した後、１２個の穿孔しない符号化シンボルを出力する。
【００４２】
次に、符号器４０５の動作を説明する。
６ビットの入力ビットが符号器４０５に入力されると、前記入力ビットはそれぞれａ０、ａ１、ａ２、ａ３、ａ４、ａ５にし、残りａ６、ａ７、ａ８、ａ９は０にする。前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００は基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力し、基底符号語Ｗ４＝０００１１１１００００１１１１０００１１１１００００１１１１００を生成して乗算器５１４に出力し、基底符号語Ｗ８＝０００００００１１１１１１１１０００００００１１１１１１１１００を生成して乗算器５１６に出力し、基底符号語Ｗ１６＝０００００００００００００００１１１１１１１１１１１１１１１０１を生成して乗算器５１８に出力する。すると、前記乗算器５１０はシンボル単位に前記基底符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、前記乗算器５１２はシンボル単位に前記基底符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力し、前記乗算器５１４はシンボル単位に前記基底符号語Ｗ４と入力ビットａ２を乗算して排他的加算器５４０に出力し、前記乗算器５１６はシンボル単位に前記基底符号語Ｗ８と入力ビットａ３を乗算して排他的加算器５４０に出力し、前記乗算器５１８はシンボル単位に前記基底符号語Ｗ１６と入力ビットａ４を乗算して排他的加算器５４０に出力する。また、前記all １符号生成器５０２は全部１である長さ３２の基底符号語を生成して乗算器５２０に出力する。すると、前記乗算器５２０はシンボル単位に前記全部１である基底符号語と入力ビットａ５を乗算して排他的加算器５４０に出力する。また、前記マスク生成器５０４は基底符号語Ｍ１、Ｍ２、Ｍ４、Ｍ８を生成してそれぞれ乗算器５２２、５２４、５２６、５２８に出力する。しかし、前記乗算器５２２、５２４、５２６、５２８にそれぞれ入力された前記入力ビットａ６、ａ７、ａ８、ａ９が０であるので、前記乗算器５２２、５２４、５２６、５２８は０(信号なし)を出力して、前記排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８からの出力値をすべて排他的加算した値が、前記乗算器５１０、５１２、５１４、５１６、５１８、５２０からの出力値を排他的加算した値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、前記制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力する。前記穿孔器５６０は前記制御器５５０から出力された制御信号に応じて前記入力された０番目から３１番目までの総３２個の符号シンボル中、０、７、９、１１、１６、１９、２４、２５、２６、２７、２８、２９、３０、３１番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、１４シンボルを穿孔した後、１８個の穿孔しない符号化シンボルを出力する。
【００４３】
５．情報量の比が５：５である場合
情報量の比が５：５である場合、符号器４００と４０５はすべて(１５、３)符号器として動作する。従って、前記符号器４００及び４０５の動作を説明すると、次のようである。
５ビットの入力ビットが符号器４００に入力されると、前記入力ビットはａ０、ａ１、ａ２、ａ３、ａ４にし、残りａ５、ａ６、ａ７、ａ８、ａ９は０にする。前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００が基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力し、基底符号語Ｗ４＝０００１１１１００００１１１１０００１１１１００００１１１１００を生成して乗算器５１４に出力し、基底符号語Ｗ８＝０００００００１１１１１１１１０００００００１１１１１１１１００を生成して乗算器５１６に出力し、基底符号語Ｗ１６＝０００００００００００００００１１１１１１１１１１１１１１１０１を生成して乗算器５１８に出力する。すると、前記乗算器５１０はシンボル単位に前記符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、前記乗算器５１２はシンボル単位に前記符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力し、前記乗算器５１４はシンボル単位に前記符号語Ｗ４と入力ビットａ２を乗算して排他的加算器５４０に出力し、前記乗算器５１６はシンボル単位に前記符号語Ｗ８と入力ビットａ３を乗算して排他的加算器５４０に出力し、前記乗算器５１８はシンボル単位に前記符号語Ｗ１６と入力ビットａ４を乗算して排他的加算器５４０に出力する。そして前記all １符号生成器５０２は全部１である基底符号語を生成して乗算器５２０に出力し、マスク生成器５０４は前記基底符号語Ｍ１、Ｍ２、Ｍ４、Ｍ８を生成してそれぞれ乗算器５２２、５２４、５２６、５２８に出力する。しかし、前記乗算器５２０、５２２、５２４、５２６、５２８に入力された前記入力ビットａ５、ａ６、ａ７、ａ８、ａ９が０であるので、前記乗算器５２０、５２２、５２４、５２６、５２８は０(信号なし)を出力して、前記排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８からの出力値をすべて排他的加算した値が、前記乗算器５１０、５１２、５１４、５１６、及び５１８からの出力値を排他的加算した値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、前記制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力する。前記穿孔器５６０は前記制御器５５０から出力された制御信号に応じて前記入力された０番目から３１番目までの総３２個の符号シンボル中、０、１、２、３、４、５、６、７、８、９、１０、１１、１２、１３、１４、３０、３１番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、１７個のシンボルを穿孔した後、１５個の穿孔しない符号化シンボルを出力する。
【００４４】
前記第１実施形態による(２１、７)符号器は、７ビットの入力ビットａ０、ａ１、ａ２、ａ３、ａ４、ａ５、ａ６を順次的に受信するのが自然であるが、前記方法によると、前記線形ブロック符号の最小距離が７になり、最適符号の最小距離である８にならない。従って、前記(２１、７)符号器において、入力ビットに対して若干の調整をすると、最小距離が８である最適符号に形成することができる。従って、下記では第２実施形態による最適の(２１、７)符号を生成する方法を説明する。下記第２実施形態では(２１、７)符号器と復号器の動作のみが変わるだけで、その以外のハードウェアの動作は前記第１実施形態と同一であるので、(２１、７)符号器と復号器の動作のみを説明する。
【００４５】
第２実施形態
前記第２実施形態による図４の符号器４０５が(２１、７)符号で動作する時の動作を、図５を参照して説明する。
７ビットの入力ビットが符号器４０５に入力されると、前記入力ビットはそれぞれａ０、ａ１、ａ２、ａ３、ａ４、ａ６、ａ７にし、残りａ５、ａ８、ａ９は０にする。前記入力ビットａ０は乗算器５１０に、入力ビットａ１は乗算器５１２に、入力ビットａ２は乗算器５１４に、前記入力ビットａ３は乗算器５１６に、入力ビットａ４は乗算器５１８に、入力ビットａ５は乗算器５２０に、入力ビットａ６は乗算器５２２に、入力ビットａ７は乗算器５２４に、入力ビットａ８は乗算器５２６に、入力ビットａ９は乗算器５２８に入力される。これと同時に、ウォルシュ符号生成器５００は基底符号語Ｗ１＝１０１０１０１０１０１０１０１１０１０１０１０１０１０１０１００を生成して乗算器５１０に出力し、基底符号語Ｗ２＝０１１００１１００１１００１１０１１００１１００１１００１１００を生成して乗算器５１２に出力し、基底符号語Ｗ４＝０００１１１１００００１１１１０００１１１１００００１１１１００を生成して乗算器５１４に出力し、基底符号語Ｗ８＝０００００００１１１１１１１１０００００００１１１１１１１１００を生成して乗算器５１６に出力し、基底符号語Ｗ１６＝０００００００００００００００１１１１１１１１１１１１１１１０１を生成して乗算器５１８に出力する。すると、前記乗算器５１０はシンボル単位に前記基底符号語Ｗ１と入力ビットａ０を乗算して排他的加算器５４０に出力し、前記乗算器５１２はシンボル単位に前記基底符号語Ｗ２と入力ビットａ１を乗算して排他的加算器５４０に出力し、前記乗算器５１４はシンボル単位に前記基底符号語Ｗ４と入力ビットａ２を乗算して排他的加算器５４０に出力し、前記乗算器５１６はシンボル単位に前記基底符号語Ｗ８と入力ビットａ３を乗算して排他的加算器５４０に出力し、前記乗算器５１８はシンボル単位に前記基底符号語Ｗ１６と入力ビットａ４を乗算して排他的加算器５４０に出力する。
【００４６】
また、マスク生成器５４０が基底符号語Ｍ１＝０１０１ ００００ １１０００１１１ １１００ ０００１ １１０１ １１０１を生成して乗算器５２２に出力し、基底符号語Ｍ２＝００００ ００１１ １００１ １０１１ １０１１ ０１１１ ０００１ １１００を生成して乗算器５２４に出力すると、前記乗算器５２２はシンボル単位に前記基底符号語Ｍ１と入力ビットａ６を乗算して排他的加算器５４０に出力し、前記乗算器５２４はシンボル単位に前記基底符号語Ｍ２と入力ビットａ７を乗算して排他的加算器５４０に出力する。さらに、all １符号生成器５０２は全部１である長さ３２の基底符号語を生成して乗算器５２０に出力し、マスク生成器５０４は前記基底符号語Ｍ４、Ｍ８を生成してそれぞれ乗算器５２６、５２８に出力する。しかし、前記乗算器５２０、５２６、５２８にそれぞれ入力された前記入力ビットａ５、ａ８、ａ９が０であるので、前記乗算器５２０、５２６、５２８は０(信号なし)を出力して、前記排他的加算器５４０の出力に影響を与えない。即ち、前記排他的加算器５４０が乗算器５１０、５１２、５１４、５１６、５１８、５２０、５２２、５２４、５２６、５２８からの出力値をすべて排他的加算した値が、前記乗算器５１０、５１２、５１４、５１６、５１８、５２２、５２４からの出力値を排他的加算した値と同一である。前記排他的加算器５４０から出力された３２個のシンボルは穿孔器５６０に入力される。これと同時に、前記制御器５５０は符号長さ情報を受信し、符号長さに該当する穿孔位置を示す制御信号を穿孔器５６０に出力する。前記穿孔器５６０は、前記制御器５５０から出力された制御信号に応じて前記入力された０番目から３１番目までの総３２個の符号シンボル中、０、２、６、７、９、１０、１２、１４、１５、２９、３０番目符号シンボルを穿孔する。言い換えれば、前記穿孔器５６０は３２符号シンボル中、１１シンボルを穿孔した後、２１個の穿孔しない符号化シンボルを出力する。
【００４７】
前記第２実施形態による前記図６の復号器６０５が(２１、７)符号に動作される時の動作を、図７を参照して説明する。
図７を参照すると、受信シンボルｒ(ｔ)は０挿入器７００に入力され、これと同時に、符号長さ情報が制御器７７０に入力される。前記制御器７７０は前記受信シンボルの符号長さによる穿孔位置(０、２、６、７、９、１０、１２、１４、１５、２９、３０)を貯蔵し、前記貯蔵された穿孔位置情報を０挿入器７００に出力する。例えば、符号率が(２１、７)であると、前記制御器７７０は１１個の穿孔位置に対する情報を前記０挿入器７００に出力する。すると、前記０挿入器７００は前記穿孔位置制御情報に従って穿孔位置に０を挿入して長さ３２であるシンボル列を出力する。前記シンボル列は逆アダマール変換器７２０と乗算器７０１乃至７１５にそれぞれ入力される。前記乗算器７０１乃至７１５に入力された信号は、マスク生成器７１０で前記基底符号語Ｍ１、Ｍ２、Ｍ４、Ｍ８から生成されたマスク符号語Ｍ１乃至Ｍ１５と乗算された後に出力される。前記乗算器７０１乃至７１５から出力されたシンボルはスイッチ７５２乃至７６５にそれぞれ出力される。(２１、７)符号器の場合は、２個の基底符号語(Ｍ１、Ｍ２)のみを使用するので、３個のスイッチ７５２、７５３、７５４のみを連結する。すると、前記４個の逆アダマール変換器７２０、７２１、７２２、７２３は入力された３２個のシンボルを逆アダマール変換(Inverse Fast Hadamard Transform、以下“ＩＦＨＴ”)する。前記ＩＦＨＴは長さ３２のウォルシュ符号と前記受信された３２個のシンボル間の相関値を獲得する機能である。各逆アダマール変換器７２０、７２１、７２２、７２３は前記一番大きな相関値に対応する前記ウォルシュインデックスと前記受信されたシンボルと共に前記一番大きな相関値を出力する。前記相関度比較器７４０は前記逆アダマール変換器７２０、７２１、７２２、７２３から出力された相関値を比較し、前記一番大きな相関値に対応したウォルシュインデックスを出力する。これは前記一番大きな相関値に対応した前記マスク符号語インデックス(２ビット)と前記ウォルシュインデックス(５ビット)から検出されたＴＦＣＩビットにより獲得される。前記実施形態において、前記符号器は、初めの５ビットは順次的に受信し、一つの０ビットを挿入した後、残り２ビットを受信するので、前記検出されたＴＦＣＩビットは前記マスク符号語インデックスと前記ウォルシュインデックスの結合である。
【００４８】
今まで、情報量の比がそれぞれ９：１、８：２、７：３、または６：４である場合の符号器４００と４０５の動作を説明した。
上述した送信器で符号化動作後、符号器４００と４０５から出力される符号化シンボルは、マルチプレクサ４１０により時間的にマルチプレクシングされ、３０シンボルのマルチプレクシングされた信号が出力される。
【００４９】
次に、マルチプレクサ４１０が符号化されたＤＳＣＨとＤＣＨをマルチプレクシングする方法に対して説明する。前記マルチプレクサ４１０は前記符号器４００と４０５で出力される符号化シンボルを可能な限り均一に分布されるようにマルチプレクシングして３０ビットを配列する。
下記の説明で、ＤＣＨのためのＴＦＣＩビットとＤＳＣＨのためのＴＦＣＩビットがそれぞれｍビットとｎビットに構成されると仮定する。この時、ｍとｎが有することができる値は(ｍ、ｎ)＝１：９、２：８、３：７、４：６、５：５、６：４、７：３、８：２、または９：１である。
【００５０】
先ず、ｍ値がｎ値より大きな場合を説明する。ｎ値がｍ値より大きな場合にもｎ値とｍ値を置き換えて下記方法を利用すると、ＤＣＨとＤＳＣＨのためのＴＦＣＩビットを配列することができる。
上述した符号化方法によると、ＤＣＨとＤＳＣＨのためのＴＦＣＩビットがそれぞれｍビットとｎビットに構成された場合、符号化後に生成されたビット数は、それぞれｍ＊３とｎ＊３である。従って、生成された符号化シンボルを伝送するための位置を選定するために、先ずＤＰＣＣＨを通じて伝送する３０ビットを１０ビットずつ分けた後、それぞれの１０ビットにＤＣＨのためのｍ＊３ビットを３等分したｍビットと、ＤＳＣＨのためのｎ＊３ビットを３等分したｎビットを配列する。
【００５１】
次に、与えられた１０ビットを利用してＤＣＨのためのｍビットとＤＳＣＨのためのｎビットを配列する方法を説明する。
Ｌは１０ビット中のＬ番目ビットを示す。
【数１】

【数２】

【００５２】
前記式１及び式２で、
【数３】

はｘより小さいか、同じである整数中、一番大きな値を示し、
【数４】

はｘより大きいか、同じである整数の中、一番小さな値を示す。
前記式２でＦ(−１)は０に定義する。即ち、Ｆ(-１)＝０である。前記数式を利用してＤＣＨのためのｍビットとＤＳＣＨのためのｎビットを配列する方法を説明すると、次の式３のようである。１０個のＬ値中、ｎ個のＬ値にはＤＳＣＨのためのビットが順に配列される。
【００５３】
【数５】

前記式３でｌ(１≦ｌ≦ｎ)はＤＳＣＨのためのｎ個のビット中、ｌ番目ビットを示す。従って前記式３は、ＤＳＣＨのための１０個のビット中、ｌ番目位置に該当する値を求める式である。
１０個のＬ値中、前記式３に与えられた値以外のＬ値には、ＤＣＨのためのｍ個のビットを配列する。即ち、下記式４のように表示することができる。
【００５４】
【数６】

前記式４でｌ値は１≦ｌ≦ｎの範囲を有する。
表４はｍ：ｎが９：１、８：２、７：３、６：４、５：５のそれぞれの場合に対するＦ(ｋ)及びＧ(ｋ)を示す。
【００５５】
【表４】

【００５６】
図９はｍ：ｎ＝６：４である場合に、ＤＣＨのためのＴＦＣＩビットとＤＳＣＨのためのＴＦＣＩビットをＤＰＣＣＨ３０ビットに対応させる関係を説明する図である。前記表４のように、ｍ：ｎ＝６：４である場合、ＤＳＣＨの位置はＬ値が２、４、７、９である場合に対応する。
すると、前記マルチプレクシングされた信号は、さらにマルチプレクサ４２０に印加され、図８のように電力制御ビット(ＴＰＣ)、パイロットビットのような信号と時間的にマルチプレクシングされ出力される。拡散器４３０は前記マルチプレクシングされたシンボルを拡散符号生成器４３５から入力された拡散符号とチャネル区分のためシンボル単位にチャネル拡散してチップ単位に出力する。スクランブラー４４０は前記チャネル拡散された信号をスクランブリング符号発生器４４５から入力されたスクランブリング符号にスクランブリングして出力する。
【００５７】
図６は本発明の実施形態による受信器の構造を示す。図６を参照すると、先ず、受信信号がデスクランブラー６４０に入力される。これと同時にスクランブリング符号発生器６４５からスクランブリング符号が入力され、前記入力された受信信号を前記入力されたスクランブリング符号にデスクランブリングして出力する。前記デスクランブリングされたシンボルが逆拡散器６３０に入力されると、これと同時に、拡散符号生成器６３５から拡散符号が入力され、逆拡散されシンボル単位に出力される。すると、前記逆拡散された受信信号はデマルチプレクサ６２０により電力制御ビット(ＴＰＣ)、パイロットビット、フィードバック信号のようなその他の信号とＴＦＣＩビットにデマルチプレクシングされる。前記デマルチプレクシングされたＴＦＣＩシンボルは、さらにデマルチプレクサ６１０に入力される。これと同時に、前記ＤＳＣＨ用ＴＦＣＩビットとＤＣＨ用ＴＦＣＩビットの情報量比率に応じた符号長さ制御情報にデマルチプレクサ６１０に入力され、前記比率によってＤＳＣＨ用ＴＦＣＩ符号シンボルとＤＣＨ用ＴＦＣＩ符号シンボルに分離され、それぞれの復号器６００と復号器６０５に入力される。前記復号器６００と復号器６０５は、前記ＤＳＣＨ用ＴＦＣＩビットとＤＣＨ用ＴＦＣＩビットの情報量比率に応じた符号長さ制御情報に基づいて、それぞれに該当する符号による復号過程を遂行した後、それぞれＤＳＣＨ用ＴＦＣＩビットとＤＣＨ用ＴＦＣＩビットを出力する。
【００５８】
図７は前記復号器６００及び復号器６０５の構造を示す。図７を参照すると、前記受信シンボルｒ(ｔ)は０挿入器７００に入力され、これと同時に、符号長さ情報が制御器７７０に入力される。前記制御器７７０は前記受信シンボルの符号長さによる穿孔位置情報を貯蔵し、前記貯蔵された穿孔位置情報を０挿入器７００に出力する。例えば、前記制御器７７０は符号率が(３、１)であると、２９個の穿孔位置に対する情報を、符号率が(６、２)であると、２６個の穿孔位置に対する情報を、符号率が(９、３)であると、２３個の穿孔位置に対する情報を、符号率が(１２、４)であると、２０個の穿孔位置に対する情報を、符号率が(１８、６)であると、１４個の穿孔位置に対する情報を、符号率が(２１、７)であると、１１個の穿孔位置に対する情報を、符号率が(２４、８)であると、８個の穿孔位置に対する情報を、符号率が(２７、９)であると、５個の穿孔位置に対する情報を前記０挿入器７００に出力する。それぞれの場合に対して、前記穿孔位置は前記符号器の説明と同一である。前記０挿入器７００は前記穿孔位置制御情報に従って穿孔位置に０を挿入して長さ３２シンボル列を出力する。前記シンボル列は逆アダマール変換器７２０と乗算器７０１乃至７１５にそれぞれ入力される。前記乗算器７０１乃至７１５に入力された信号はマスク生成器７１０で前記基底符号語Ｍ１、Ｍ２、Ｍ４、Ｍ８から生成されたマスク関数Ｍ１乃至Ｍ１５と乗算された後、出力される。前記乗算器７０１乃至７１５から出力されたシンボルはスイッチ７５１乃至７６５にそれぞれ出力される。これと同時に、前記制御器７７０は前記受信された符号長さ情報に基づいたマスク関数の使用／不使用を示す制御情報をスイッチ７５１乃至７６５にそれぞれ出力する。(３、１)、(６、２)、(９、３)、(１２、４)、(１８、６)符号器はマスク関数を使用しないので、前記スイッチ７５２、７５４、７６５は前記制御情報に応じて全部連結を切る。(２１、７)符号器の場合は、一つの基底符号語のみを使用するので、スイッチ７５２のみが連結され、前記符号率に基づいて使用されるマスク関数の数に応じて制御される。すると、前記逆アダマール変換器７２０、７２４及び７２６のそれぞれは、受信された３２個のシンボルを逆アダマール変換して、前記最高相関値を有するウォルシュ符号のインデックスと前記最高相関値それぞれを出力する。前記逆アダマール変換は長さ３２のウォルシュ符号と前記受信された３２シンボル間の相関値を獲得する機能である。すると、前記相関度比較器７４０は前記逆アダマール変換器から提供される相関値を比較する。これは前記一番大きな相関値に対応した前記符号語インデックス(２ビット)と前記ウォルシュインデックス(５ビット)から検出されたＴＦＣＩビットにより獲得される。前記復号されたＴＦＣＩビットは前記符号語インデックスと前記ウォルシュインデックスの結合である。
【００５９】
今まで、前記ハードスプリット配列の構成及び動作を説明した。以下では本発明の目的を達成するための方法を図１０、１１、１２、１３を参照して説明する。
図１０は前記論理スプリット方法のための基地局間(ノードＢとＲＮＣ間)の信号メッセージ及びデータ伝送を示す図であり、図１１は本発明の実施形態によるＳＲＮＣの動作を示す図であり、図１２は本発明の実施形態によるＤＲＮＣの動作を示す図であり、図１３は図８に示したＤＲＮＣからＳＲＮＣに伝送される情報を含む制御フレーム(Control Frame)の構造を示す図である。
【００６０】
先ず、図１０を参照すると、前記ＳＲＮＣ１０のＲＬＣ１１は伝送するＤＳＣＨデータがある場合、図３の４０１段階でＳＲＮＣ１０のＭＡＣ-Ｄ１３に前記ＤＳＣＨデータを伝送する。前記ＤＳＣＨデータを受信したＳＲＮＣ１０のＭＡＣ-Ｄ１３は、４０２段階でＤＲＮＣ２０のＭＡＣ-Ｃ／ＳＨ２１に前記受信されたＤＳＣＨデータを伝送する。この時、前記ＤＳＣＨデータはＬｕｒ上のフレームプロトコル(Frame protocol)を利用して伝送される。前記ＤＳＣＨのデータを受信したＤＲＮＣ２０のＭＡＣ-Ｃ／ＳＨ２１は、４０３段階で前記ＤＳＣＨデータの伝送時間を決定し、前記決定された伝送時間情報とＤＳＣＨデータに対するＴＦＣＩをＳＲＮＣ１０のＭＡＣ-Ｄ１３に伝送する。前記４０３段階でＳＲＮＣ１０のＭＡＣ-Ｄ１３に伝送時間情報とＤＳＣＨデータに対するＴＦＣＩを伝送した後、前記ＤＲＮＣ２０のＭＡＣ-Ｃ／ＳＨ２１は、４０４段階でノードＢのＬ１ ３０にＤＳＣＨデータを伝送する。この時、前記ＤＳＣＨデータは４０３段階で予め決定された(scheduled)伝送時間に伝送される。ＤＲＮＣ２０のＭＡＣ-Ｃ／ＳＨ２１から前記伝送時間情報及びＤＳＣＨデータに対するＴＦＣＩを受信したＳＲＮＣ１０のＭＡＣ-Ｄ１３は、４０５段階で前記伝送時間以前にノードＢのＬ１ ３０に前記ＴＦＣＩと伝送時間情報を共に伝送する。この時、前記データは制御フレーム(control frame)を利用して伝送される。さらに、前記ＳＲＮＣ１０のＭＡＣ-Ｄ１３は、４０６段階でＤＣＨデータとＤＣＨのためのＴＦＣＩを決定して前記ノードＢのＬ１ ３０に伝送する。前記４０４段階で伝送されるＤＳＣＨデータと４０５段階で伝送されるＴＦＣＩは、前記４０３段階で決定された伝送時間と関係を有する。即ち、４０５段階で伝送されるＴＦＣＩは、４０４段階で前記ＤＳＣＨデータがＰＤＳＣＨを通じて伝送される直前フレームにＤＰＣＣＨを通じてＵＥに伝送される。前記４０４、４０５及び４０６段階で、前記データ及びＴＦＣＩはフレームプロトコル(Frame protocol)を利用して伝送される。特に、４０６段階で、前記ＴＦＣＩは制御フレーム(control frame)を通じて伝送される。前記４０４、４０５及び４０６段階で伝送されたデータ及びＴＦＣＩを受信したノードＢのＬ１ ３０は、４０７段階で前記ＤＳＣＨデータをＰＤＳＣＨを通じてＵＥのＬ１ ４１に伝送する。また、前記ノードＢのＬ１ ３０は、ＵＥのＬ１ ４０にＤＰＣＨを利用してＴＦＣＩを伝送する。この時、前記ノードＢのＬ１ ３０は、前記４０５段階及び４０６段階で受信したそれぞれのＴＦＣＩ、またはＴＦＩを利用して一つのＴＦＣＩを生成してＤＰＣＣＨを利用して伝送する。
【００６１】
図１１は本発明の実施形態によるＳＲＮＣの動作を示す図である。図１１を参照すると、先ず、ＳＲＮＣは４１１段階で伝送するＤＳＣＨデータを準備する。前記伝送するＤＳＣＨデータが準備されると、ＳＲＮＣは４１２段階に進行してＲＬＣとＭＡＣ-Ｄを通じてＤＲＮＣにＤＳＣＨデータを伝送する。前記ＳＲＮＣは前記４１２段階でＤＳＣＨデータをＤＲＮＣに伝送した後、前記ＤＳＣＨデータに対するスケジューリング情報、即ち、伝送時間情報及びＴＦＣＩを４１３段階で受信する。この時、前記スケジューリング情報は制御フレーム(Control Frame)を利用して受信されることができる。
前記図１３でＣＦＮ(Connection Frame Number)は伝送されるフレームの番号を示し、これはＤＳＣＨデータが伝送される時間に対する情報である。また、前記図１３のＴＦＣＩフィールド２は伝送されるＤＳＣＨデータに対するＴＦＣＩ情報を示す。
【００６２】
さらに図１１を参照すると、前記ＳＲＮＣは４１４段階でノードＢに該当ＤＳＣＨに対する伝送時間情報とＴＦＣＩ情報を入れた制御フレーム(Control Frame)を伝送する。前記制御フレームは該当伝送時間前にノードＢに到着すべきである。４１５段階で前記ＳＲＮＣはＤＣＨデータをＤＣＨに対するＴＦＣＩと共にノードに伝送する。
【００６３】
図１２は本発明の実施形態によるＤＲＮＣの動作を示す図である。図１２を参照すると、ＤＲＮＣは５０１段階で、前記図１１の４１３段階で前記ＳＲＮＣが伝送したＤＳＣＨデータを受信する。前記ＤＳＣＨデータが受信されると、ＤＲＮＣは５０２段階で複数のＲＮＣから受信されたＤＳＣＨデータのスケジューリングを遂行する。即ち、ＤＲＮＣは複数のＲＮＣから受信したＤＳＣＨとＤＲＮＣ自体で生成されたＤＳＣＨを伝送する時間を決定し、また伝送中に使用するチャネルを考慮して、ＴＦＩ、またはＴＦＣＩを決定する。前記５０２段階で伝送時間及びＴＦＩ、またはＴＦＣＩが決定されると、ＤＲＮＣは５０３段階で前記決定された伝送時間情報とＴＦＣＩ情報を制御フレームを利用してＳＲＮＣに伝送する。この時、伝送される制御フレームの構造は前記図８に示されている。前記決定された時間情報とＴＦＣＩ情報を伝送した後、ＤＲＮＣは５０４段階に進行してＤＳＣＨデータに対して決定された時間にＤＳＣＨデータをノードＢに伝送する。
【００６４】
【発明の効果】
上述したように本発明の実施形態では、一つの符号器／復号器構造を利用して多様な種類のＴＦＣＩビットを符号化／復号化することができる。また相異なる符号化方法を使用して符号化された複数のＴＦＣＩシンボルを伝送する時、前記ＴＦＣＩシンボルが均一に分布され伝送されるように多重化することができる。ここで、ＴＦＣＩ符号化は、１０ビットである場合、ＤＳＣＨ及びＤＣＨのデータ伝送量によって、１：９、２：８、３：７、４：６、５：５、６：４、７：３、８：２、または９：１中のいずれか一つを選択して遂行されることができる。また本発明の実施形態によると、論理スプリット方法の場合、ＳＲＮＣとＤＲＮＣが分離されていると、スケジューリング情報をＤＲＮＣのＭＡＣ-Ｃ／ＳＨからＳＮＲＣのＭＡＣ-Ｄに伝送することができる。またＤＳＣＨに対するＴＦＣＩを送信する相異なる方法であるハードスプリット方法と論理スプリット方法を区別して使用できるように信号メッセージを伝送することもできる。
【図面の簡単な説明】
【図１】 一般的な非同期移動通信システムでハードスプリット方法による(１５、５)符号器を備える送信器の構造を示す図である。
【図２】 一般的な非同期移動通信システムでハードスプリット方法のための基地局及び基地局制御器間の信号メッセージ及びデータ伝送を示す図である。
【図３】 一般的な非同期移動通信システムで論理スプリット方法のための基地局及び基地局制御器間の信号メッセージ及びデータ伝送を示す図である。
【図４】 本発明の一実施形態によるＤＳＣＨ用ＴＦＣＩビットとＤＣＨ用ＴＦＣＩビットを相異なる符号化方法に符号化する送信器の構造を示す図である。
【図５】 図４の符号器を示す図である。
【図６】 本発明の一実施形態による符号化されたシンボルを復号化する受信器の構造を示す図である。
【図７】 図６の復号器を示す図である。
【図８】 下向ＤＣＨの信号伝送フォマットを示す図である。
【図９】 相異なる符号化方法に符号化された符号化シンボルをマルチプレクシングする方法を示す図である。
【図１０】 ＳＲＮＣとＤＲＮＣが同一ではない場合、前記論理スプリット方法のための基地局及び基地局制御器間の信号メッセージ及びデータ伝送を示す図である。
【図１１】 本発明の一実施形態によるＳＲＮＣの動作を示す図である。
【図１２】 本発明の一実施形態によるＤＲＮＣの動作を示す図である。
【図１３】 前記図８のＤＲＮＣからＳＲＮＣに伝送される情報を含めている制御フレームの構造を示す図である。
【符号の説明】
４０５…第１符号器
４０５…第２符号器
４３０…拡散器
４３５…拡散符号生成器
４４０，６４０…スクランブラー
４４５，６４５…スクランブリング符号発生器
４５０…第１ＴＦＣＩビット発生器
４５５…第２ＴＦＣＩビット発生器
４６０…情報発生器
５００…ウォルシュ符号生成器
５１０，５１２，５１４，５１６，５１８，５２０，５２２，５２４，５２６，５２８…乗算器
５４０…排他的加算器
５５０，７７０…制御器
５６０…穿孔器
６００，６０５…復号器
６１０，６２０…デマルチプレクサ
６３０…逆拡散器
６３５…拡散符号生成器
７００…０挿入器
７０１〜７１５…乗算器
７２０〜７３５…逆アダマール変換器
７４０…相関度比較器
７５１〜７６５…スイッチ[0001]
BACKGROUND OF THE INVENTION
The present invention relates to an asynchronous mobile communication system, and more particularly, encoding / decoding of transmission frame information (Transport Format Combination Indicator, hereinafter "TFCI") bits when transmitting downlink shared channel data in hard split mode. The present invention relates to an apparatus and method.
[0002]
[Prior art]
The downward shared channel (Downlink Shared Channel, hereinafter referred to as “DSCH”) is a shared channel used by a plurality of users by dividing time. The DSCH can be set together with a dedicated channel (hereinafter referred to as “DCH”) for each user. The DCH includes a dedicated physical control channel (hereinafter referred to as “DPCCH”) and a dedicated physical data channel (hereinafter referred to as “DPDCH”). In particular, the DPCCH is used for the DSCH. Therefore, the DPCCH is used as a physical control channel for the corresponding DCH and DSCH. The DPCCH includes information on transmission frame information (Transport Format Combination Indicator, hereinafter “TFCI”), which is one of the control signals. The TFCI is information indicating a transmission format of data transmitted through a physical channel. Therefore, the TFCI information includes information for all DCH and DSCH.
[0003]
The TFCI information is configured with 10 bits, and the 10-bit TFCI information is encoded with 30 bits. The encoded 30 bits are transmitted through the DPCCH.
The method of transmitting the TFCI for DCH and the TFCI for DSCH at the same time through the DPCCH is roughly divided into two methods. The first is a hard split method, and the second is a logical split method.
[0004]
The TFCI for the DCH is the TFCI field 1 or the first TFCI, and the TFCI for the DSCH is the TFCI field 2 or the second TFCI.
In the case of the hard split method, each of the TFCI field 1 and the TFCI field 2 is indicated by 5 bits, and each information is encoded into (15, 5) punctured bi-orthogonal code. The Thereafter, the 15-bit TFCI field 1 and the TFCI field 2 are multiplexed with the 30-bit TFCI field 1 and the TFCI field 2 and then transmitted through the physical channel.
[0005]
  In the case of the logical split method, the TFCI field 1 and the TFCI field 2 are combined into one TFCI (3210) The punctured Reed Muller code (or sub-code second order Reed Muller Code) is encoded and transmitted. In the logical split method, the information bits of the TFCI field 1 and the TFCI field 2 are divided into a fixed ratio. That is, 10 bits of information in the TFCI field 1 and TFCI field 2 are 1: 9, 2: 8, 3: 7, 4: 6, 5: 5, 6: 4, 7: 3, 8: 2, or 9 : 1 The TFCI field 1 and the TFCI field 2 are 10 bits divided into a certain ratio into one block coding, that is, (3210) It encodes into the pierced Reed-Muller code (sub-code second order Reed Muller Code), and transmits.
[0006]
FIG. 1 is a diagram illustrating a transmitter structure according to the hard splitting method. Referring to FIG. 1, when a TFCI field 1 for a 5-bit DCH is input to a (15, 5) double orthogonal encoder 100, the encoder 100 uses a TFCI field for the 5-bit DCH. 1 is encoded, and 15 encoded symbols are output to the multiplexer 110. At the same time, when the TFCI field 2 for the 5-bit DSCH is input to the (15, 5) double orthogonal encoder 105, the encoder 105 encodes the TFCI field 2 for the 5-bit DSCH to 15 The encoded symbol of the symbol is output to multiplexer 110. The multiplexer 110 temporally multiplexes the 15 encoded symbols output from the encoder 100 and the 15 encoded symbols output from the encoder 105, and arranges and outputs 30 symbols. . The multiplexer 120 multiplexes other signals input at the same time as the output of the multiplexer 110 in time, and then outputs the multiplexed signal to the spreader 130. The spreader 130 spreads the output signal of the multiplexer 120 on the spread code input from the spread code generator 135 and outputs the spread signal. The scrambler 140 scrambles the spread signal to the scrambling code input from the scrambling code generator 145 and outputs it.
[0007]
Figure 2 shows the existing 3GPP (3^rd It is a figure which shows the signal message and data transmission between a base station and a base station controller (between Node B and RNC) for the said hard split method defined by Generation Partnership Project). Referring to FIG. 2, when the DSCH data to be transmitted is generated, the RLC (Radio Link Control) 11 of the SRNC (Serving RNC) 10 performs a MAC-D (Medium Access Control-Dedicated Control) 13 of the SRNC 10 in step 101. To transmit the DSCH data. At this time, the transmitted primitive is MAC-D-Data-REQ. In step 102, the MAC-D 13 of the SRNC 10 transmits the DSCH data received from the RLC 11 to the MAC-C (MAC-Common Channel) 21 of the CRNC 20. At this time, the transmitted primitive is MAC-C / SH-Data-REQ. In step 103, the MAC-C 21 of the CRNC (Control RNC) 20 determines a transmission time for the DSCH data received from the MAC-D 13 of the SRNC 10 in step 102, and then determines the DSCH data and the corresponding TFI (Transport). Format Indicator) is transmitted to L1 (Layer 1) 30 of Node B (hereinafter, the term “Node B” means a base station). At this time, the transmitted primitive is MPHY-Data-REQ. In step 104, the MAC-D 13 of the SRNC 10 transmits the DCH transmission data and the corresponding TFI to the L1 30 of the node B. At this time, the transmitted primitive is MPHY-Data-REQ. The data transmitted in steps 103 and 104 are transmitted independently of each other, and the L1 30 of the Node B generates a TFCI divided into a TFCI for DCH and a TFCI for DSCH. In steps 103 and 104, data and TFI are transmitted using a data frame protocol.
[0008]
The L1 30 of the Node B that has received the data and the TFI in the steps 103 and 104 is transferred to the physical DSCH in the L1 41 of the UE (User Equipment: hereinafter, the term “UE” means a mobile terminal) 40 in the step 105. DSCH data is transmitted through (hereinafter, PDSCH). In step 106, the L1 30 of the Node B transmits TFCI to the L1 41 of the UE 40 using DPCH. The Node B L1 30 transmits the TFCI generated by using the TFI received in steps 103 and 104 using the DCH and DSCH fields, respectively.
[0009]
FIG. 3 is a diagram illustrating signaling and data transmission between base stations for the logical split method. Referring to FIG. 3, when DSCH data to be transmitted is generated, the RLC 301 of the RNC 300 transmits the DSCH data to the MAC-D 303 of the RNC 300 in step 201. At this time, the transmitted primitive is MAC-D-Data-REQ. The MAC-D 303 that has received the DSCH data from the RLC 301 transmits the DSCH data to a MAC-C / SH (MAC-Common / Shared channel) 305 in step 202. At this time, the transmitted primitive is MAC-C / SH-Data-REQ. The MAC-C / SH 305 that has received the DSCH data determines a transmission time of the DSCH data and then transmits TFCI corresponding to the DSCH data to the MAC-D 303 in step 203. The MAC-C / SH 305 transmits the TFCI to the MAC-D 303 in step 203, and then transmits the DSCH data to the L1 307 of the node B in step 204. The DSCH data is transmitted at a time scheduled in step 203. The MAC-D 303 having received the TFCI for the DSCH data transmitted from the MAC-C / SH 305 in step 203 determines a TFI (TFI1) for the DSCH in step 205 and transmits it to the L1 307 of the node B. The MAC-D 303 can transmit TFCI instead of the TFI. At this time, the transmitted primitive is MPHY-Data-REQ.
[0010]
After transmitting the TFI (TFI1) for the DSCH, the MAC-D 303 determines the TFI (TFI2) for the DCH in step 206, and transmits the DCH data together with the TFI2 to the L1 307 of the node B. The MAC-D 303 can transmit TFCI instead of the TFI. At this time, the transmitted primitive is MPHY-Data-REQ. The DSCH data transmitted in step 204 and the TFI transmitted in step 205 have a relationship with the time determined in step 203. That is, the TFI transmitted in step 205 is transmitted to the UE 310 through the DPCCH in a frame immediately before the DSCH data is transmitted through the PDSCH in step 204. In steps 204, 205 and 206, the data and TFI are transmitted using a frame protocol. In particular, in step 206, the TFCI is transmitted through a control frame. In step 207, the L1 307 of the Node B transmits DSCH data to the L1 311 of the UE 310 through the PDSCH. In step 208, the L1 307 of the Node B generates TFCI using the TFI received in steps 205 and 206, and transmits the generated TFCI to the L1 311 of the UE 310 through the DPCH. Specifically, the L1 307 of the Node B generates a TFCI using the TFCI or TFI received in the steps 205 and 206, and transmits the TFCI using the DPCCH.
[0011]
To summarize the logical split method, the MAC-C / SH 305 transmits DSCH scheduling information and TFCI information of the corresponding DSCH to the MAC-D 303 in step 203. This is because the MAC-D 303 should transmit the DSCH scheduling information and the TFCI information to the L1 307 of the Node B at the same time in order to encode the TFCI for the DSCH and the TFCI for the DCH into the same encoding method. Because. Accordingly, when the MAC-D 303 has data to be transmitted, there is a delay until the scheduling information and the TFCI information are received from the MAC-C 305 after the data is transmitted to the MAC-C 305. When MAC-C305 and MAC-D303 are separated on lur, that is, when MAC-C305 is in DRNC (Drift RNC) and MAC-D303 is in SRNC, the scheduling information and TFCI information are exchanged on lur. As a result, a large delay occurs.
[0012]
According to the above description, compared with the logical split method, the hard split method does not require information transmission to the MAC-D after scheduling in the MAC-C, so that the delay can be reduced. This is possible because, in the case of the hard split method, the DCH TFCI and the DSCH TFCI can be independently encoded at the Node B. Also, when MAC-C and MAC-D are separated on lur, that is, when MAC-C is in DRNC and MAC-D is in SRNC, scheduling information is not exchanged on lur, thus preventing an increase in delay. There are advantages that can be made. According to the above description, the information amount (bits) of the TFCI for the DCH and DSCH is fixedly divided by 5 bits each, and each of the 32 pieces of information for the maximum DCH and 32 pieces for the DSCH. Information can be shown. Accordingly, the hard split mode cannot be used when more than 32 pieces of information for DSCH or DCH is required.
[0013]
[Problems to be solved by the invention]
Accordingly, an object of the present invention is to provide an apparatus and method capable of performing multiple codings using a single encoder structure in a mobile communication system.
It is another object of the present invention to provide an apparatus and method for multiplexing and transmitting symbols coded using different coding methods.
[0014]
Still another object of the present invention is that in the case of the hard split mode, the information amount constituted by 5 bits is set to 10 bits as 1: 9, 2: 8, 3: 7, 4: 6 as in the logic split mode. Provided is an apparatus and a method for enabling coding to be applied to each after indicating information in 5: 5, 6: 4, 7: 3, 8: 2, 9: 1, etc. There is to do.
[0015]
[Means for Solving the Problems]
In order to achieve the above object, the present invention provides an apparatus for encoding and transmitting TFCI bits respectively corresponding to a ratio of information amounts of a first channel and a second channel in a code division multiple access mobile communication system. A first TFCI bit indicating a transmission format combination of the first channel for generating one encoded symbol is encoded, and the encoded first symbol is punctured by a predetermined first puncturing position. An encoder and a second TFCI bit indicating a transmission format combination of the second channel for generating a second encoded symbol, and the encoded second with a predetermined second puncturing position; A second encoder for puncturing symbols; and output symbols of the first encoder and the second encoder are multiplexed, and the symbols are transmitted to the second channel. A multiplexer for transmitting Flip, characterized in that it consists.
[0016]
  Further, the present invention for achieving such an object includes a mobile terminal and a first channel for the mobile terminal.And the second channelThroughInformation bitConfigured to transmit control data for the first channel.3A base station transmitting first and second TFCI bits encoded through a channel, and a code division multiple access mobile communication system comprising:ofIn the TFCI transmission method, transmission of the first channel for generation of a coded first symbolFormal unionA first TFCI bit indicating the transmission of the second channel for the generation of the encoded second symbolFormal unionEncoding the second TFCI bit indicating the encoded first symbol and the encoded first symbol according to the first and second puncturing positions of the encoded first TFCI bit and the encoded second TFCI bit. Puncturing the encoded second symbol, multiplexing the encoded first TFCI bit and the encoded second TFCI bit, and3And transmitting the multiplexed coded TFCI bits through a channel.
  Preferably, the first channel is a downward shared channel, and the second channel is a dedicated channel.
[0017]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the following invention, for the purpose of clarifying only the gist of the present invention, a detailed description of related known functions or configurations will be omitted.
In the case of the hard split method, the total number of information bits for DSCH and DCH is 10 bits, and the 10 information bits are 1: 9, 2: 8, 3: 7, 4: 6, 5: 5. , 6: 4, 7: 3, 8: 2, or 9: 1, and coding is applied to each.
[0018]
First, 30 TFCI code symbols are transmitted at a code rate of 1/3 in one frame in the physical layer. When the TFCI information bits are divided into constant ratios as described above, it is preferable to maintain the code rate by dividing the number of code symbols into the same ratio as the constant ratio. For example, if 10 input bits are divided into a ratio of 1: 9, 30 output symbols are divided into a rate of 1/3 and a ratio of 3:27, and 10 input bits are divided into 2: 8. 30 output symbols are divided into a 6:24 ratio, and when 10 input bits are divided into 3: 7, 30 output symbols are divided into a 9:21 ratio. If the input bits are divided 4: 6, the 30 output symbols are divided into a ratio of 12:18.
[0019]
Therefore, when the ratio of the amount of information is 1: 9, 1 bit is received and 3 code symbols are output (3, 1), and 9 bits are received and 27 code symbols are output. When (27, 9) encoder is required and the ratio of the amount of information is 2: 8, (6, 2) encoder that receives 2 bits and outputs 6 code symbols, and 8 bits Is required to output 24 code symbols (24, 8), and if the information amount ratio is 3: 7, 3 bits are received and 9 code symbols are output. (9, 3) Encoder and (21, 7) encoder that receives 7 bits and outputs 21 code symbols are required, and if the information amount ratio is 4: 6, 4 bits are used. (12, 4) encoder that receives and outputs 12 code symbols, and receives 18 code symbols by receiving 6 bits Forces (18,6) is required encoder. Therefore, since the 10 types of encoders have excellent performance and low hardware complexity, the 10 types of encoders are required to operate in the same structure.
[0020]
Usually, a measure indicating the performance of a linear error correcting code has a Hamming distance distribution of codewords of the error correcting code. This means the number of non-zero symbols in the code word. For example, if “0111” is a predetermined code word, the number of 1 included in the code word, that is, the Hamming distance is 3. At this time, the minimum value (d_min: Minimum distance). As the minimum distance is larger, the linear error correction code has better error correction performance. This is the reference “The Theory of Error-Correcting Codes” -F. J. Macwilliams, N. J. A. Details are disclosed in Sloane, North-Holland.
[0021]
Also, due to low hardware complexity, the largest length code, ie, (32, 10) code, is shortened to operate the different length encoders with the same structure. It is desirable to do. In order to use the shortening method, it is necessary to puncture a code symbol. In the puncturing of the (32, 10) code, the minimum distance of the code varies depending on the puncturing position. Therefore, it is desirable to determine a drilling position so that the drilled code has an optimal minimum distance.
[0022]
For example, as the (6, 2) code among the plurality of codes, the optimum code is most preferably used by repeating the (3, 2) simplex code twice. At this time, the relationship between the (3, 2) simplex input information bits and the output (3, 2) simplex codeword is as shown in Table 1 below.
[Table 1]

[0023]
If the (3, 2) simplex codeword is repeated twice, the relationship between the input information bits and the output (3, 2) simplex codeword is as shown in Table 2 below.
[Table 2]

[0024]
However, the (3, 2) simplex codeword repeated twice can be implemented by shortening the existing (16, 4) Reed-Muller code. An example of the shortening method will be described. First, the (16, 4) Reed-Muller code is a linear combination of four base codewords having a length of 16 (where 4 is the number of input information bits). Is). Receiving only 2 bits among the 4 input information bits means using only a linear combination of 2 base codewords among 4 base codewords having a length of 16 and not using the rest. It is. In addition, after restricting the use of base codewords as described above, if 10 symbols are punched out of the 16 symbols, the (16, 4) encoder is operated as a (6, 2) encoder. be able to. Table 3 below illustrates the shortening method.
[0025]
[Table 3]

[0026]
Referring to Table 3, first, all (16, 4) codewords are linear combinations of four base codewords of length 16 (A, B, C, D in Table 3). At this time, in order to obtain the (6, 2) code, only the upper two codewords are used among the four base codewords. Then, only the upper 4 codewords are used, and the remaining lower 12 codewords are not automatically used. Further, in order to form the upper 4 codewords into a codeword of length 6, 10 symbols out of 16 symbols should be punched. By drilling the portion indicated by (*) in Table 3 and collecting the remaining 6 code symbols, the (3, 2) simplex codeword repeated twice shown in Table 2 can be obtained. . Therefore, in the following, (32, 10) Sub-code of the second order Reed Muller code is shortened and used when the information ratio is 1: 9 (3, 1) The structure of the encoder that forms the code and the (27,9) optimum code, and the (6,2) optimum code and the (24,8) optimum code that are used when the information amount ratio is 2: 8 The structure of the encoder to be used, and the ratio of the information amount to the (9, 3) optimum code and the (21, 7) optimum code used when the information amount ratio is 3: 7 Is used when the ratio is 4: 5, and the (12,4) optimal code and the (18,6) optimal code structure and the information ratio are 5: 5. The structure of the encoder that forms the (15, 5) optimal code and the (15, 5) optimal code will be described.
[0027]
The following embodiment is a hard split method, and the amount of information configured in 5 bits is set to 10 bits as 1: 9, 2: 8, 3: 7, 4: 6, 5 as in the logical split mode. An apparatus and a method for enabling encoding to be applied to each of the information after dividing the information into 5: 6, 6: 4, 7: 3, 8: 2, or 9: 1.
[0028]
First embodiment
FIG. 4 shows a structure of a transmitter according to an embodiment of the present invention. Referring to FIG. 4, the DSCH TFCI bits and the DCH TFCI bits divided according to the information amount ratio are input to the first encoder 400 and the second encoder 405, respectively. Here, the TFCI bit for DSCH is TFCI field 1 or the first TFCI, and the TFCI bit for DCH is TFCI field 2 or the second TFCI bit. The DSCH TFCI bits are generated by a first TFCI bit generator 450, and the DCH TFCI bits are generated by a second TFCI bit generator 455. The first and second TFCI bits have different ratios as described above according to the information amount ratio. Also, a length control signal indicating code length information, which is a codeword length setting value corresponding to the information amount ratio, is input to the first encoder 400 and the second encoder 405. The code length information is generated by a code length information generator 460, wherein the code length information has a value that is variable according to the lengths of the first TFCI bits and the second TFCI bits.
[0029]
When the information amount ratio is 6: 4, the encoder 400 receives the 6-bit DSCH TFCI bits and simultaneously receives 6 bits and outputs an 18-symbol codeword (18, 6). In response to a length control signal for operating as an encoder, 18 encoded symbols are output. The encoder 405 receives the 4 bits of the TFCI bit for DCH and simultaneously receives 4 bits. In response to a length control signal that operates as an encoder (12, 4) that outputs a codeword of 12 symbols, 12 encoded symbols are output. When the information amount ratio is 7: 3, the encoder 400 receives the 7-bit SCHCI bits for DSCH and simultaneously receives 7 bits and outputs a 21-symbol codeword (21, 7). ) In response to a length control signal for operating as an encoder, 21 encoded symbols are output, and the encoder 405 receives the 3 bits of the DCH TFCI bit and simultaneously receives 3 bits. In response to a length control signal that operates as an encoder (9, 3) that outputs a 9-symbol codeword, 9 encoded symbols are output. When the information amount ratio is 8: 2, the encoder 400 receives the 8-bit DSCH TFCI bits, and simultaneously receives the 8 bits and outputs a 24-symbol codeword (24, 8). ) In response to a length control signal for operating as an encoder, outputs 24 encoded symbols, and the encoder 405 receives the 2 bits of the TFCI bits for DCH and simultaneously receives 2 bits. In response to a length control signal that operates as an encoder (6, 2) that outputs a 6-symbol codeword, 6 encoded symbols are output.
[0030]
If the information amount ratio is 9: 1, the encoder 400 receives the 9 DSCH TFCI bits and simultaneously receives 9 bits and outputs a 27-symbol codeword (27, 9). ) In response to a length control signal for operating as an encoder, outputs 27 encoded symbols, and the encoder 405 receives the 1-bit DCH TFCI bit and simultaneously receives 1 bit. In response to a length control signal that operates as an encoder (3, 1) that outputs a code word of 3 symbols, an encoded symbol of 3 symbols is output.
FIG. 5 shows the structure of the encoder 400 and the encoder 405. The operation of the encoder will be described according to the ratio of the information amount.
[0031]
1 . When the information ratio is 1: 9
When the information amount ratio is 1: 9, the encoder 400 operates as a (3, 1) encoder, and the encoder 405 operates as a (27, 9) encoder. Accordingly, the operations of the encoder 400 and the encoder 405 will be described as follows.
First, the operation of the encoder 400 will be described.
[0032]
When one input bit is input to the encoder 400, the input bit is set to a0, and the remaining a1, a2, a3, a4, a5, a6, a7, a8, and a9 are all set to 0. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit is input. a5 is input to the multiplier 520, the input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, when the Walsh code generator 500 generates the base codeword W1 = 101010101010101110101010101010100 and outputs it to the multiplier 510, the multiplier 510 performs the exclusive addition by multiplying the codeword W1 and the input bit a0 in units of symbols. Output to the device 540. The Walsh code generator 500 generates the other base codewords W2, W4, W8, and W16 and outputs them to the multipliers 512, 514, 516, and 518, respectively. The all 1 code generator 502 is 1 in all. A base codeword is generated and output to the multiplier 520, and the mask generator 504 generates base codewords M1, M2, M4, and M8, and outputs them to the multipliers 522, 524, 526, and 528, respectively. However, all of the input bits a1, a2, a3, a4, a5, a6, a7, a8, a9 inputted to the multipliers 512, 514, 516, 518, 520, 522, 524, 526, 528 are all 0. Therefore, the multipliers 512, 514, 516, 518, 520, 522, 524, 526, and 528 output 0 (no signal) and do not affect the output of the exclusive adder 540. That is, the value obtained by exclusive addition of the output values of the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528 by the exclusive adder 540 is the same as the output value of the multiplier 510. It is. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating a punching position corresponding to the code length to the puncher 560, and the puncher 560 outputs the length output by the controller 550. 1, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 out of a total of 32 code symbols from 0 to 31 input by the control signal , 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, and 31st code symbols are punctured. In other words, the puncturer 560 punctures 29 symbols out of 32 code symbols, and then outputs 3 non-punctured encoded symbols.
[0033]
Next, the operation of the encoder 405 will be described.
When 9 input bits are input to the encoder 405, the input bits are set to a0, a1, a2, a3, a4, a5, a6, a7, a8, and the remaining a9 is set to 0. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit a5 is input The input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, the Walsh code generator 500 generates a base codeword W1 = 10101010101011011010101010100100 and outputs it to the multiplier 510, generates a base codeword W2 = 0110011001100110110001100110001100, outputs it to the multiplier 512, and outputs the base codeword W4 = 000111110000111100011110000111100. Is generated and output to the multiplier 514, a base codeword W8 = 0000000111111110000000111111100 is generated and output to the multiplier 516, and a base codeword W16 = 00000000000000011111111111111101 is generated and output to the multiplier 518. Then, the multiplier 510 multiplies the base codeword W1 and the input bit a0 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 512 outputs the base codeword W2 and the input bit a1 in symbol units. Multiply and output to the exclusive adder 540, the multiplier 514 multiplies the base codeword W4 and the input bit a2 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 516 performs symbol units. The base codeword W8 and the input bit a3 are multiplied and output to the exclusive adder 540, and the multiplier 518 multiplies the base codeword W16 and the input bit a4 in units of symbols and outputs the result to the exclusive adder 540. To do. Also, when the all 1 code generator 502 generates a base codeword of length 32 that is all 1 and outputs the base codeword to the multiplier 520, the multiplier 520 outputs the base codeword that is all 1 and the input bit for each symbol. Multiply a5 and output to exclusive adder 540. The mask generator 504 generates a base codeword M1 = 0101 0000 1100 0111 1100 0001 1101 1101 and outputs it to the multiplier 522, and generates a base codeword M2 = 0000 0011 1001 1011 1011 1011 0111 0001 1100. The base codeword M4 = 0001 0101 1111 0010 0110 1100 1010 1100 is generated and output to the multiplier 526. Then, the multiplier 522 multiplies the base codeword M1 and the input bit a6 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 524 outputs the base codeword M2 and the input bit a7 in symbol units. Multiplication is performed and output to the exclusive adder 540, and the multiplier 526 multiplies the base codeword M 4 and the input bit a 8 in units of symbols and outputs the result to the exclusive adder 540. The mask generator 504 generates a base codeword M8 and outputs it to the multiplier 528. However, since the input bit a9 input to the multiplier 528 is 0, the multiplier 528 outputs 0 (no signal) and does not affect the output of the exclusive adder 540. That is, the exclusive adder 540 exclusive-adds all the output values from the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528 to obtain the multipliers 510, 512, 514, 516, 518, 520, 522, 524, and 526 are the same as the value obtained by exclusive addition of the output values. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information, and outputs a control signal indicating a punching position corresponding to the code length to the puncher 560, and the puncher 560 controls the control output from the controller 550. The 0th, 2nd, 8th, 19th, and 20th code symbols are punctured among the 32 code symbols from 0th to 31st inputted according to the signal. In other words, the puncturer 560 punctures 5 symbols out of 32 code symbols, and then outputs 27 non-punctured encoded symbols.
[0034]
2. When the ratio of information is 2: 8
When the information amount ratio is 2: 8, the encoder 400 operates as a (6, 2) encoder, and the encoder 405 operates as a (24, 8) encoder. Accordingly, the operations of the encoder 400 and the encoder 405 will be described as follows.
First, the operation of the encoder 400 will be described.
[0035]
When two input bits are input to the encoder 400, the input bits are set to a0 and a1, and the remaining a2, a3, a4, a5, a6, a7, a8, and a9 are set to zero. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit a5 is input The input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, when the Walsh code generator 500 generates the base codeword W1 = 101010101010101110101010101010100 and outputs it to the multiplier 510, the multiplier 510 performs the exclusive addition by multiplying the codeword W1 and the input bit a0 in units of symbols. When the base codeword W2 = 01100110001100110110001100110001100 is generated and output to the multiplier 512, the multiplier 512 multiplies the codeword W2 and the input bit a1 in units of symbols and outputs to the exclusive adder 540. To do. The Walsh code generator 500 generates other base codewords W4, W8, and W16 and outputs them to the multipliers 514, 516, and 518, respectively. The all 1 code generator 502 is a base code that is all 1s. Words are generated and output to the multiplier 520, and the mask generator 504 generates the base codewords M1, M2, M4, and M8 and outputs them to the multipliers 522, 524, 526, and 528, respectively. However, since the input bits a2, a3, a4, a5, a6, a7, a8, a9 input to the multipliers 514, 516, 518, 520, 522, 524, 526, 528 are 0, the multiplication is performed. The units 514, 516, 518, 520, 522, 524, 526, 528 output 0 and do not affect the output of the exclusive adder 540. That is, the value obtained by exclusive addition of the output values of the multipliers 510, 512, 514, 516, 518, 522, 524, 526, and 528 by the exclusive adder 540 is obtained by the multiplier 510 and the multiplier 512. It is the same as the value obtained by exclusive addition of the output value. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating the punching position corresponding to the code length to the puncher 560. The punch 560 includes 3, 7, 8, 9, 10, 11, 12, 13 among the 32 code symbols from 0th to 31st inputted by the control signal outputted from the controller 550. , 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, and 31st code symbols are punctured. In other words, the puncturer 560 punctures 26 symbols out of 32 code symbols, and then outputs 6 non-punctured encoded symbols, 0, 1, 2, 4, 5, and 6th encoded symbols.
[0036]
Next, the operation of the encoder 405 will be described.
When 8 input bits are input to the encoder 405, the input bits are set to a0, a1, a2, a3, a4, a5, a6, a7, and the remaining a8, a9 are set to 0. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit is input. a5 is input to the multiplier 520, the input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, the Walsh code generator 500 generates a base codeword W1 = 10101010101011011010101010100100 and outputs it to the multiplier 510, generates a base codeword W2 = 0110011001100110110001100110001100, outputs it to the multiplier 512, and outputs the base codeword W4 = 000111110000111100011110000111100. Is generated and output to the multiplier 514, a base codeword W8 = 0000000111111110000000111111100 is generated and output to the multiplier 516, and a base codeword W16 = 00000000000000011111111111111101 is generated and output to the multiplier 518. Then, the multiplier 510 multiplies the base codeword W1 and the input bit a0 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 512 outputs the base codeword W2 and the input bit a1 in symbol units. Multiply and output to the exclusive adder 540, the multiplier 514 multiplies the base codeword W4 and the input bit a2 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 516 performs symbol units. The base codeword W8 and the input bit a3 are multiplied and output to the exclusive adder 540, and the multiplier 518 multiplies the base codeword W16 and the input bit a4 in units of symbols and outputs the result to the exclusive adder 540. To do. Also, the all 1 code generator 502 generates a base codeword of length 32 that is all 1 and outputs it to the multiplier 520. Then, the multiplier 520 multiplies the base codeword, which is all 1 in symbol units, and the input bit a5 and outputs the result to the exclusive adder 540. The mask generator 504 generates a base codeword M1 = 0101 0000 1100 0111 1100 0001 1101 1101 and outputs it to the multiplier 522, and generates a base codeword M2 = 0000 0011 1001 1011 1011 1011 0111 0001 1100. Output to 524. The multiplier 522 multiplies the base codeword M1 and the input bit a6 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 524 multiplies the base codeword M2 and the input bit a7 in symbol units. To the exclusive adder 540. The mask generator 504 generates the base codewords M4 and M8 and outputs them to the multipliers 526 and 528, respectively. However, since the input bits a8 and a9 input to the multipliers 526 and 528 are 0, the multipliers 526 and 528 output 0 (no signal), and the output of the exclusive adder 540 Does not affect. That is, the exclusive adder 540 exclusively adds all the output values from the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528, and the multipliers 510, 512. 514, 516, 518, 520, 522, and 524, the values obtained by exclusive addition of the output values are the same. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating the punching position corresponding to the code length to the puncher 560. The punch 560 includes 1, 7, 13, 15, 20, 25, 30 among a total of 32 code symbols from 0th to 31st inputted according to the control signal outputted from the controller 550. , The 31st code symbol is punctured. In other words, the puncturer 560 punctures 8 symbols out of 32 code symbols, and then outputs 24 non-punctured encoded symbols.
[0037]
3. When the information ratio is 3: 7
When the information amount ratio is 3: 7, the encoder 400 operates as a (9, 3) encoder, and the encoder 405 operates as a (21, 7) encoder. Accordingly, the operations of the encoder 400 and the encoder 405 will be described as follows.
First, the operation of the encoder 400 will be described.
[0038]
When three input bits are input to the encoder 400, the input bits are set to a0, a1, and a2, and the remaining a3, a4, a5, a6, a7, a8, and a9 are set to zero. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit a5 is input The input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, the Walsh code generator 500 generates a base codeword W1 = 10101010101011011010101010100100 and outputs it to the multiplier 510, generates a base codeword W2 = 0110011001100110110001100110001100, outputs it to the multiplier 512, and outputs the base codeword W4 = 000111110000111100011110000111100. Is output to the multiplier 514, the multiplier 510 multiplies the code word W1 and the input bit a0 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 512 outputs the code in symbol units. The word W2 and the input bit a1 are multiplied and output to the exclusive adder 540, and the multiplier 514 multiplies the code word W4 and the input bit a2 in units of symbols to obtain the exclusive adder. And outputs it to the 40. The Walsh code generator 500 generates the other base codewords W8 and W16 and outputs them to the multipliers 516 and 518, respectively. The all 1 code generator 502 generates base codewords that are all ones. The mask generator 504 generates the base codewords M1, M2, M4, and M8 and outputs them to the multipliers 522, 524, 526, and 528, respectively. However, since the input bits a3, a4, a5, a6, a7, a8, a9 input to the multipliers 516, 518, 520, 522, 524, 526, 528 are 0, the multipliers 516, 518 520, 522, 524, 526, and 528 output 0 (no signal) and do not affect the output of the exclusive adder 540. That is, the exclusive adder 540 exclusive-adds all the output values from the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528 to obtain the multipliers 510, 512, And the output value from 514 is the same as the value obtained by exclusive addition. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating the punching position corresponding to the code length to the puncher 560. Then, the punch 560 includes 7, 8, 11, 12, 13, 14 out of a total of 32 code symbols from 0th to 31st inputted according to the control signal outputted from the controller 550. , 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, and 31st code symbols are punctured. In other words, the puncturer 560 punctures 23 symbols out of 32 code symbols and then outputs 9 non-punctured encoded symbols.
[0039]
Next, the operation of the encoder 405 will be described.
When seven input bits are input to the encoder 405, the input bits are set to a0, a1, a2, a3, a4, a5, and a6, respectively, and the remaining a7, a8, and a9 are set to zero. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit is input. a5 is input to the multiplier 520, the input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, the Walsh code generator 500 generates a base codeword W1 = 10101010101011011010101010100100 and outputs it to the multiplier 510, generates a base codeword W2 = 0110011001100110110001100110001100, outputs it to the multiplier 512, and outputs the base codeword W4 = 000111110000111100011110000111100. Is generated and output to the multiplier 514, a base codeword W8 = 0000000111111110000000111111100 is generated and output to the multiplier 516, and a base codeword W16 = 00000000000000011111111111111101 is generated and output to the multiplier 518. Then, the multiplier 510 multiplies the base codeword W1 and the input bit a0 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 512 outputs the base codeword W2 and the input bit a1 in symbol units. Multiply and output to the exclusive adder 540, the multiplier 514 multiplies the base codeword W4 and the input bit a2 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 516 performs symbol units. The base codeword W8 and the input bit a3 are multiplied and output to the exclusive adder 540, and the multiplier 518 multiplies the base codeword W16 and the input bit a4 in units of symbols and outputs the result to the exclusive adder 540. To do. Also, the all 1 code generator 502 generates a base codeword of length 32 that is all 1 and outputs it to the multiplier 520. Then, the multiplier 520 multiplies the base codeword, which is all 1 in symbol units, and the input bit a5 and outputs the result to the exclusive adder 540. Also, the mask generator 540 generates the base codeword M1 = 0101 0000 1100 0111 1100 0001 1101 1101 and outputs it to the multiplier 522. The multiplier 522 multiplies the base codeword M1 and the input bit a6 in symbol units and outputs the result to the exclusive adder 540. Further, the mask generator 504 generates the base codewords M2, M4, and M8 and outputs them to the multipliers 524, 526, and 528, respectively. However, since the input bits a7, a8, and a9 input to the multipliers 524, 526, and 528 are 0, the multipliers 524, 526, and 528 output 0 (no signal) and the exclusive The output of the dynamic adder 540 is not affected. That is, the exclusive adder 540 exclusive-adds all the output values from the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528, and the multipliers 510, 512, The output values from 514, 516, 518, 520, and 522 are the same as the value obtained by exclusive addition. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating the punching position corresponding to the code length to the puncher 560. The punch 560 includes 0, 1, 2, 3, 4, 5, 7 out of a total of 32 code symbols from 0th to 31st inputted according to the control signal outputted from the controller 550. , 12, 18, 21, and 24th code symbols are punctured. In other words, the puncturer 560 punctures 11 symbols out of 32 code symbols, and then outputs 21 non-punctured encoded symbols.
[0040]
4). When the information ratio is 4: 6
When the information amount ratio is 4: 6, the encoder 400 operates as a (12, 4) encoder, and the encoder 405 operates as a (18, 6) encoder. Accordingly, the operations of the encoder 400 and the encoder 405 will be described as follows.
First, the operation of the encoder 400 will be described.
[0041]
When four input bits are input to the encoder 400, the input bits are set to a0, a1, a2, and a3, and the remaining a4, a5, a6, a7, a8, and a9 are set to zero. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit a5 is input The input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, the Walsh code generator 500 generates a base codeword W1 = 10101010101011011010101010100100 and outputs it to the multiplier 510, generates a base codeword W2 = 0110011001100110110001100110001100 and outputs it to the multiplier 512, and the base codeword W4 = 000111110000111100011110000111100. Is generated and output to the multiplier 514, and the base codeword W8 = 0000000111111110000000111111111100 is generated and output to the multiplier 516, the multiplier 510 multiplies the codeword W1 and the input bit a0 in units of symbols to obtain an exclusive. The data is output to the adder 540, and the multiplier 512 multiplies the code word W2 and the input bit a1 by a symbol unit. The multiplier 514 multiplies the code word W4 and the input bit a2 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 516 outputs the code word W8 in symbol units. And the input bit a3 are multiplied and output to the exclusive adder 540. The Walsh code generator 500 generates the other base codeword W16 and outputs the base codeword W16 to the multiplier 518, and the all 1 code generator 502 generates a base codeword of all 1s to the multiplier 520. The mask generator 504 generates the base codewords M1, M2, M4, and M8 and outputs them to the multipliers 522, 524, 526, and 528, respectively. However, since the input bits a4, a5, a6, a7, a8, a9 inputted to the multipliers 518, 520, 522, 524, 526, 528 are 0, the multipliers 518, 520, 522, 524 are. 526 and 528 output 0 and do not affect the output of the exclusive adder 540. That is, the exclusive adder 540 exclusive-adds all the output values from the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528, and the multipliers 510, 512, It is the same as the value obtained by exclusive addition of the output values from 514 and 516. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating the punching position corresponding to the code length to the puncher 560. Then, the punch 560 corresponds to 0, 1, 2, 15, 16, 17 among a total of 32 code symbols from 0th to 31st inputted according to the control signal outputted from the controller 550. , 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, and 31st code symbols are punctured. In other words, the puncturer 560 punctures 20 symbols out of 32 code symbols and then outputs 12 non-punctured encoded symbols.
[0042]
Next, the operation of the encoder 405 will be described.
When 6 input bits are input to the encoder 405, the input bits are set to a0, a1, a2, a3, a4, and a5, respectively, and the remaining a6, a7, a8, and a9 are set to 0. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit a5 is input The input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, the Walsh code generator 500 generates a base codeword W1 = 10101010101011011010101010100100 and outputs it to the multiplier 510, generates a base codeword W2 = 0110011001100110110001100110001100, outputs it to the multiplier 512, and outputs the base codeword W4 = 000111110000111100011110000111100. Is generated and output to the multiplier 514, a base codeword W8 = 0000000111111110000000111111100 is generated and output to the multiplier 516, and a base codeword W16 = 00000000000000011111111111111101 is generated and output to the multiplier 518. Then, the multiplier 510 multiplies the base codeword W1 and the input bit a0 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 512 outputs the base codeword W2 and the input bit a1 in symbol units. Multiply and output to the exclusive adder 540, the multiplier 514 multiplies the base codeword W4 and the input bit a2 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 516 performs symbol units. The base codeword W8 and the input bit a3 are multiplied and output to the exclusive adder 540, and the multiplier 518 multiplies the base codeword W16 and the input bit a4 in units of symbols and outputs the result to the exclusive adder 540. To do. The all 1 code generator 502 generates a base codeword of length 32 that is all 1 and outputs the base codeword to the multiplier 520. Then, the multiplier 520 multiplies the base codeword which is all 1s by the symbol unit and the input bit a5 and outputs the result to the exclusive adder 540. The mask generator 504 generates base codewords M1, M2, M4, and M8 and outputs them to the multipliers 522, 524, 526, and 528, respectively. However, since the input bits a6, a7, a8, and a9 input to the multipliers 522, 524, 526, and 528 are 0, the multipliers 522, 524, 526, and 528 set 0 (no signal). And does not affect the output of the exclusive adder 540. That is, the exclusive adder 540 exclusive-adds all the output values from the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528, and the multipliers 510, 512, This is the same as the value obtained by exclusive addition of the output values from 514, 516, 518, and 520. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating the punching position corresponding to the code length to the puncher 560. The punch 560 corresponds to 0, 7, 9, 11, 16, 19, 24 out of a total of 32 code symbols from 0th to 31st inputted according to the control signal outputted from the controller 550. , 25, 26, 27, 28, 29, 30, and 31st code symbols are punctured. In other words, the puncturer 560 punctures 14 symbols out of 32 code symbols, and then outputs 18 non-punctured encoded symbols.
[0043]
5. When the information ratio is 5: 5
If the information ratio is 5: 5, encoders 400 and 405 all operate as (15,3) encoders. Accordingly, the operation of the encoders 400 and 405 will be described as follows.
When five input bits are input to the encoder 400, the input bits are set to a0, a1, a2, a3, a4, and the remaining a5, a6, a7, a8, a9 are set to zero. The input bit a0 is in the multiplier 510, the input bit a1 is in the multiplier 512, the input bit a2 is in the multiplier 514, the input bit a3 is in the multiplier 516, the input bit a4 is in the multiplier 518, and the input bit a5 is The input bit a6 is input to the multiplier 522, the input bit a7 is input to the multiplier 524, the input bit a8 is input to the multiplier 526, and the input bit a9 is input to the multiplier 528. At the same time, the Walsh code generator 500 generates a base codeword W1 = 10101010101011011010101010100100 and outputs it to the multiplier 510, generates a base codeword W2 = 0110011001100110110001100110001100 and outputs it to the multiplier 512, and the base codeword W4 = 000111110000111100011110000111100. Is generated and output to the multiplier 514, a base codeword W8 = 0000000111111110000000111111100 is generated and output to the multiplier 516, and a base codeword W16 = 00000000000000011111111111111101 is generated and output to the multiplier 518. Then, the multiplier 510 multiplies the code word W1 and the input bit a0 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 512 multiplies the code word W2 and the input bit a1 in symbol units. Output to the exclusive adder 540, the multiplier 514 multiplies the code word W4 and the input bit a2 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 516 outputs the code word in symbol units. W8 and the input bit a3 are multiplied and output to the exclusive adder 540, and the multiplier 518 multiplies the code word W16 and the input bit a4 on a symbol basis and outputs the result to the exclusive adder 540. The all 1 code generator 502 generates a base codeword that is all 1 and outputs it to the multiplier 520, and the mask generator 504 generates the base codewords M1, M2, M4, and M8, respectively. 522, 524, 526, and 528. However, since the input bits a5, a6, a7, a8, and a9 input to the multipliers 520, 522, 524, 526, and 528 are 0, the multipliers 520, 522, 524, 526, and 528 are 0. (No signal) is output and the output of the exclusive adder 540 is not affected. That is, the exclusive adder 540 exclusively adds all the output values from the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528, and the multipliers 510, 512, It is the same as the value obtained by exclusive addition of the output values from 514, 516, and 518. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating a punching position corresponding to the code length to the puncher 560. The punch 560 includes 0, 1, 2, 3, 4, 5, 6 out of a total of 32 code symbols from 0th to 31st inputted according to the control signal outputted from the controller 550. , 7, 8, 9, 10, 11, 12, 13, 14, 30, and 31st code symbols are punctured. In other words, the puncturer 560 punctures 17 symbols out of 32 code symbols, and then outputs 15 non-punctured encoded symbols.
[0044]
It is natural that the (21, 7) encoder according to the first embodiment sequentially receives 7 input bits a0, a1, a2, a3, a4, a5, a6. The minimum distance of the linear block code is 7, and the minimum distance of the optimal code is not 8. Accordingly, in the (21, 7) encoder, when the input bit is slightly adjusted, an optimum code having a minimum distance of 8 can be formed. Therefore, a method for generating an optimal (21, 7) code according to the second embodiment will be described below. In the following second embodiment, only the operations of the (21, 7) encoder and decoder are changed, and the other hardware operations are the same as those of the first embodiment. Therefore, the (21, 7) encoder Only the operation of the decoder will be described.
[0045]
Second embodiment
The operation when the encoder 405 of FIG. 4 according to the second embodiment operates with the (21, 7) code will be described with reference to FIG.
When 7 input bits are input to the encoder 405, the input bits are set to a0, a1, a2, a3, a4, a6, a7, and the remaining a5, a8, a9 are set to 0. The input bit a0 is input to the multiplier 510, the input bit a1 is input to the multiplier 512, the input bit a2 is input to the multiplier 514, the input bit a3 is input to the multiplier 516, the input bit a4 is input to the multiplier 518, and the input bit a5 is input. Are input to the multiplier 520, the input bit a 6 is input to the multiplier 522, the input bit a 7 is input to the multiplier 524, the input bit a 8 is input to the multiplier 526, and the input bit a 9 is input to the multiplier 528. At the same time, the Walsh code generator 500 generates a base codeword W1 = 10101010101011011010101010100100 and outputs it to the multiplier 510, generates a base codeword W2 = 0110011001100110110001100110001100, outputs it to the multiplier 512, and outputs the base codeword W4 = 000111110000111100011110000111100. Is generated and output to the multiplier 514, a base codeword W8 = 0000000111111110000000111111100 is generated and output to the multiplier 516, and a base codeword W16 = 00000000000000011111111111111101 is generated and output to the multiplier 518. Then, the multiplier 510 multiplies the base codeword W1 and the input bit a0 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 512 outputs the base codeword W2 and the input bit a1 in symbol units. Multiply and output to the exclusive adder 540, the multiplier 514 multiplies the base codeword W4 and the input bit a2 in symbol units and outputs the result to the exclusive adder 540, and the multiplier 516 performs symbol units. The base codeword W8 and the input bit a3 are multiplied and output to the exclusive adder 540, and the multiplier 518 multiplies the base codeword W16 and the input bit a4 in units of symbols and outputs the result to the exclusive adder 540. To do.
[0046]
Also, the mask generator 540 generates the base codeword M1 = 0101 0000 11001111 1100 0001 1101 1101 and outputs it to the multiplier 522, and generates the base codeword M2 = 0000 0011 1001 1011 1011 1011 0111 0001 1100 to the multiplier 524. The multiplier 522 multiplies the base codeword M1 and the input bit a6 by the symbol unit and outputs the result to the exclusive adder 540, and the multiplier 524 outputs the base codeword M2 and the input bit by the symbol unit. Multiply a7 and output to exclusive adder 540. Further, the all 1 code generator 502 generates a base codeword having a length of 32 which is all 1 and outputs it to the multiplier 520, and the mask generator 504 generates the base codewords M4 and M8, respectively. It outputs to 526 and 528. However, since the input bits a5, a8, and a9 input to the multipliers 520, 526, and 528 are 0, the multipliers 520, 526, and 528 output 0 (no signal), and the exclusive The output of the dynamic adder 540 is not affected. That is, the exclusive adder 540 exclusive-adds all the output values from the multipliers 510, 512, 514, 516, 518, 520, 522, 524, 526, and 528, and the multipliers 510, 512, It is the same as the value obtained by exclusive addition of the output values from 514, 516, 518, 522, and 524. The 32 symbols output from the exclusive adder 540 are input to the punch 560. At the same time, the controller 550 receives the code length information and outputs a control signal indicating the punching position corresponding to the code length to the puncher 560. The punch 560 includes 0, 2, 6, 7, 9, 10, out of a total of 32 code symbols from the 0th to the 31st input according to the control signal output from the controller 550. The 12, 14, 15, 29, and 30th code symbols are punctured. In other words, the puncturer 560 punctures 11 symbols out of 32 code symbols, and then outputs 21 non-punctured encoded symbols.
[0047]
The operation when the decoder 605 of FIG. 6 according to the second embodiment is operated to the (21, 7) code will be described with reference to FIG.
Referring to FIG. 7, the received symbol r (t) is input to the 0 inserter 700, and at the same time, the code length information is input to the controller 770. The controller 770 stores the puncturing position (0, 2, 6, 7, 9, 10, 12, 14, 15, 29, 30) according to the code length of the received symbol, and stores the stored puncturing position information. Output to the zero inserter 700. For example, if the code rate is (21, 7), the controller 770 outputs information on 11 drilling positions to the 0 inserter 700. Then, the 0 inserter 700 inserts 0 at the puncture position according to the puncture position control information and outputs a symbol string having a length of 32. The symbol sequences are input to an inverse Hadamard transformer 720 and multipliers 701 to 715, respectively. The signals input to the multipliers 701 to 715 are output after being multiplied by the mask codewords M1 to M15 generated from the base codewords M1, M2, M4, and M8 by the mask generator 710. The symbols output from the multipliers 701 to 715 are output to switches 752 to 765, respectively. In the case of the (21, 7) encoder, since only two base codewords (M1, M2) are used, only three switches 752, 753, 754 are connected. Then, the four inverse Hadamard transformers 720, 721, 722, and 723 perform an inverse Hadamard transform (hereinafter referred to as “IFHT”) on the 32 input symbols. The IFHT is a function for obtaining a correlation value between a length 32 Walsh code and the received 32 symbols. Each inverse Hadamard transformer 720, 721, 722, 723 outputs the largest correlation value together with the Walsh index corresponding to the largest correlation value and the received symbol. The correlation comparator 740 compares the correlation values output from the inverse Hadamard transformers 720, 721, 722, and 723, and outputs a Walsh index corresponding to the largest correlation value. This is obtained from the TFCI bits detected from the mask codeword index (2 bits) and the Walsh index (5 bits) corresponding to the largest correlation value. In the embodiment, the encoder sequentially receives the first 5 bits, inserts one 0 bit, and then receives the remaining 2 bits, so that the detected TFCI bit is the mask codeword index. And the Walsh index.
[0048]
Up to now, the operation of the encoders 400 and 405 has been described when the information amount ratio is 9: 1, 8: 2, 7: 3, or 6: 4, respectively.
After the encoding operation by the transmitter, the encoded symbols output from the encoders 400 and 405 are multiplexed in time by the multiplexer 410, and a 30-symbol multiplexed signal is output.
[0049]
Next, a method of multiplexing the DSCH and DCH encoded by the multiplexer 410 will be described. The multiplexer 410 multiplexes the encoded symbols output from the encoders 400 and 405 so as to be distributed as uniformly as possible, and arranges 30 bits.
In the following description, it is assumed that the TFCI bits for DCH and TFCI bits for DSCH are configured into m bits and n bits, respectively. At this time, the values that m and n can have are (m, n) = 1: 9, 2: 8, 3: 7, 4: 6, 5: 5, 6: 4, 7: 3, 8: 2. Or 9: 1.
[0050]
First, a case where the m value is larger than the n value will be described. Even when the n value is larger than the m value, the TFCI bits for the DCH and DSCH can be arranged by replacing the n value and the m value and using the following method.
According to the encoding method described above, when the TFCI bits for DCH and DSCH are configured to m bits and n bits, respectively, the numbers of bits generated after encoding are m * 3 and n * 3, respectively. Accordingly, in order to select a position for transmitting the generated encoded symbol, first, 30 bits transmitted through the DPCCH are divided into 10 bits, and then m * 3 bits for DCH are set to 3 bits for each 10 bits. Arrange m bits equally divided and n bits obtained by equally dividing n * 3 bits for DSCH into three.
[0051]
Next, a method of arranging m bits for DCH and n bits for DSCH using the given 10 bits will be described.
L indicates the Lth bit in 10 bits.
[Expression 1]

[Expression 2]

[0052]
In Formula 1 and Formula 2,
[Equation 3]

Indicates the largest value among integers less than or equal to x,
[Expression 4]

Indicates the smallest value among integers greater than or equal to x.
In Equation 2, F (−1) is defined as 0. That is, F (−1) = 0. A method of arranging m bits for DCH and n bits for DSCH using the above equation will be described as Equation 3 below. Among the 10 L values, bits for DSCH are sequentially arranged in n L values.
[0053]
[Equation 5]

In Equation 3, l (1 ≦ l ≦ n) represents the l-th bit among n bits for DSCH. Accordingly, Equation 3 is an equation for obtaining a value corresponding to the l-th position among the 10 bits for DSCH.
Among the 10 L values, m bits for DCH are arranged in L values other than the values given in Equation 3 above. That is, it can be displayed as shown in Equation 4 below.
[0054]
[Formula 6]

In Equation 4, the l value has a range of 1 ≦ l ≦ n.
Table 4 shows F (k) and G (k) for the cases where m: n is 9: 1, 8: 2, 7: 3, 6: 4, and 5: 5.
[0055]
[Table 4]

[0056]
FIG. 9 is a diagram illustrating a relationship in which TFCI bits for DCH and TFCI bits for DSCH correspond to DPCCH 30 bits when m: n = 6: 4. As shown in Table 4, when m: n = 6: 4, the position of the DSCH corresponds to the case where the L values are 2, 4, 7, and 9.
Then, the multiplexed signal is further applied to the multiplexer 420, and is multiplexed with a signal such as a power control bit (TPC) and a pilot bit as shown in FIG. The spreader 430 performs channel spreading on the multiplexed symbols in units of symbols for the spread code and channel division input from the spread code generator 435, and outputs the result in units of chips. The scrambler 440 scrambles the channel spread signal into the scrambling code input from the scrambling code generator 445 and outputs the scrambled code.
[0057]
FIG. 6 shows the structure of a receiver according to an embodiment of the present invention. Referring to FIG. 6, first, the received signal is input to the descrambler 640. At the same time, a scrambling code generator 645 receives a scrambling code, descrambles the inputted received signal into the inputted scrambling code, and outputs it. When the descrambled symbol is input to the despreader 630, a spread code is input from the spread code generator 635, and is despread and output in symbol units. Then, the despread received signal is demultiplexed by the demultiplexer 620 into other signals such as power control bits (TPC), pilot bits, feedback signals, and TFCI bits. The demultiplexed TFCI symbol is further input to a demultiplexer 610. At the same time, the code length control information corresponding to the information amount ratio between the DSCH TFCI bits and the DCH TFCI bits is input to the demultiplexer 610, and is separated into the DSCH TFCI code symbol and the DCH TFCI code symbol according to the ratio. And input to the respective decoders 600 and 605. The decoder 600 and the decoder 605 perform a decoding process with codes corresponding to each based on code length control information according to an information amount ratio between the DSCH TFCI bits and the DCH TFCI bits, respectively. A DSCH TFCI bit and a DCH TFCI bit are output.
[0058]
FIG. 7 shows the structure of the decoder 600 and the decoder 605. Referring to FIG. 7, the received symbol r (t) is input to the 0 inserter 700, and at the same time, the code length information is input to the controller 770. The controller 770 stores the puncture position information according to the code length of the received symbol, and outputs the stored puncture position information to the zero inserter 700. For example, if the code rate is (3, 1), the controller 770 may provide information on 29 puncture positions, and if the code rate is (6, 2), information on 26 puncture positions may be encoded. If the rate is (9, 3), the information for 23 puncture positions, and if the code rate is (12, 4), the information for 20 puncture positions is the code rate (18, 6). If there is information about 14 drilling positions, if the code rate is (21, 7), information about 11 drilling positions, if the code rate is (24, 8), 8 drilling positions. If the code rate is (27, 9), information on five drilling positions is output to the zero inserter 700. For each case, the drilling position is the same as described for the encoder. The 0 inserter 700 inserts 0 at the drilling position according to the drilling position control information and outputs a 32 symbol string in length. The symbol sequences are input to an inverse Hadamard transformer 720 and multipliers 701 to 715, respectively. Signals input to the multipliers 701 to 715 are output by the mask generator 710 after being multiplied by the mask functions M1 to M15 generated from the base codewords M1, M2, M4, and M8. The symbols output from the multipliers 701 to 715 are output to the switches 751 to 765, respectively. At the same time, the controller 770 outputs control information indicating use / non-use of the mask function based on the received code length information to the switches 751 to 765, respectively. Since the (3, 1), (6, 2), (9, 3), (12, 4), (18, 6) encoder does not use a mask function, the switches 752, 754, 765 Disconnect all connections according to In the case of the (21, 7) encoder, since only one base codeword is used, only the switch 752 is connected and controlled according to the number of mask functions used based on the code rate. Then, each of the inverse Hadamard transformers 720, 724, and 726 performs inverse Hadamard transform on the 32 received symbols, and outputs the Walsh code index having the highest correlation value and the highest correlation value, respectively. The inverse Hadamard transform is a function for obtaining a correlation value between a length 32 Walsh code and the received 32 symbols. Then, the correlation comparator 740 compares the correlation values provided from the inverse Hadamard transformer. This is obtained from the TFCI bits detected from the codeword index (2 bits) and the Walsh index (5 bits) corresponding to the largest correlation value. The decoded TFCI bit is a combination of the codeword index and the Walsh index.
[0059]
Up to now, the configuration and operation of the hard split arrangement have been described. In the following, a method for achieving the object of the present invention will be described with reference to FIGS.
FIG. 10 is a diagram illustrating signal messages and data transmission between base stations (between Node B and RNC) for the logical split method, and FIG. 11 is a diagram illustrating operations of the SRNC according to an embodiment of the present invention. FIG. 12 is a diagram illustrating an operation of a DRNC according to an embodiment of the present invention, and FIG. 13 is a diagram illustrating a structure of a control frame including information transmitted from the DRNC to the SRNC illustrated in FIG.
[0060]
First, referring to FIG. 10, when there is DSCH data to be transmitted, the RLC 11 of the SRNC 10 transmits the DSCH data to the MAC-D 13 of the SRNC 10 in step 401 of FIG. The MAC-D 13 of the SRNC 10 that has received the DSCH data transmits the received DSCH data to the MAC-C / SH 21 of the DRNC 20 in step 402. At this time, the DSCH data is transmitted using a frame protocol on Lur. The MAC-C / SH 21 of the DRNC 20 that has received the DSCH data determines the transmission time of the DSCH data in step 403, and transmits the determined transmission time information and the TFCI for the DSCH data to the MAC-D 13 of the SRNC 10. . After transmitting the transmission time information and the TFCI for the DSCH data to the MAC-D 13 of the SRNC 10 in step 403, the MAC-C / SH 21 of the DRNC 20 transmits the DSCH data to the L1 30 of the node B in step 404. At this time, the DSCH data is transmitted at a transmission time predetermined in step 403. The SRNC 10 MAC-D 13 that has received the transmission time information and the TFCI for the DSCH data from the MAC-C / SH 21 of the DRNC 20 transmits both the TFCI and the transmission time information to the L1 30 of the node B before the transmission time in step 405. To do. At this time, the data is transmitted using a control frame. Further, the MAC-D 13 of the SRNC 10 determines the DCH data and the TFCI for the DCH in step 406 and transmits them to the L1 30 of the Node B. The DSCH data transmitted in step 404 and the TFCI transmitted in step 405 have a relationship with the transmission time determined in step 403. That is, the TFCI transmitted in step 405 is transmitted to the UE through the DPCCH in a frame immediately before the DSCH data is transmitted through the PDSCH in step 404. In steps 404, 405, and 406, the data and the TFCI are transmitted using a frame protocol. In particular, in step 406, the TFCI is transmitted through a control frame. The Node B L1 30 having received the data and TFCI transmitted in Steps 404, 405, and 406 transmits the DSCH data to the UE L1 41 through the PDSCH in Step 407. Also, the L1 30 of the Node B transmits TFCI to the L1 40 of the UE using DPCH. At this time, the L1 30 of the Node B generates one TFCI using the TFCI or TFI received in the steps 405 and 406 and transmits the TFCI using the DPCCH.
[0061]
FIG. 11 is a diagram illustrating the operation of the SRNC according to the embodiment of the present invention. Referring to FIG. 11, first, the SRNC prepares DSCH data to be transmitted in step 411. When the DSCH data to be transmitted is prepared, the SRNC proceeds to step 412 and transmits the DSCH data to the DRNC through RLC and MAC-D. After transmitting the DSCH data to the DRNC in step 412, the SRNC receives scheduling information for the DSCH data, that is, transmission time information and TFCI in step 413. At this time, the scheduling information may be received using a control frame.
In FIG. 13, CFN (Connection Frame Number) indicates the number of a frame to be transmitted, which is information with respect to the time at which DSCH data is transmitted. Further, the TFCI field 2 in FIG. 13 indicates TFCI information for transmitted DSCH data.
[0062]
Referring to FIG. 11, the SRNC transmits a control frame including transmission time information and TFCI information for the corresponding DSCH to the Node B in step 414. The control frame should arrive at Node B before the corresponding transmission time. In step 415, the SRNC transmits the DCH data to the node together with the TFCI for the DCH.
[0063]
FIG. 12 is a diagram illustrating an operation of a DRNC according to an embodiment of the present invention. Referring to FIG. 12, the DRNC receives the DSCH data transmitted by the SRNC in step 501 of FIG. When the DSCH data is received, the DRNC performs scheduling of DSCH data received from a plurality of RNCs in step 502. That is, the DRNC determines the time for transmitting the DSCH received from a plurality of RNCs and the DSCH generated by the DRNC itself, and determines the TFI or TFCI in consideration of the channel used during transmission. When the transmission time and TFI or TFCI are determined in step 502, the DRNC transmits the determined transmission time information and TFCI information to the SRNC using a control frame in step 503. At this time, the structure of the transmitted control frame is shown in FIG. After transmitting the determined time information and TFCI information, the DRNC proceeds to step 504 and transmits the DSCH data to the Node B at the time determined for the DSCH data.
[0064]
【The invention's effect】
As described above, in the embodiments of the present invention, various types of TFCI bits can be encoded / decoded using a single encoder / decoder structure. In addition, when transmitting a plurality of TFCI symbols encoded using different encoding methods, the TFCI symbols can be multiplexed so as to be uniformly distributed and transmitted. Here, when TFCI encoding is 10 bits, 1: 9, 2: 8, 3: 7, 4: 6, 5: 5, 6: 4, 7: 3 depending on the data transmission amount of DSCH and DCH. , 8: 2, or 9: 1. According to the embodiment of the present invention, in the case of the logical split method, if the SRNC and the DRNC are separated, the scheduling information can be transmitted from the MAC-C / SH of the DRNC to the MAC-D of the SNRC. It is also possible to transmit a signaling message so that the hard split method and the logical split method, which are different methods for transmitting TFCI for DSCH, can be used separately.
[Brief description of the drawings]
FIG. 1 is a diagram illustrating a structure of a transmitter including a (15, 5) encoder according to a hard split method in a general asynchronous mobile communication system.
FIG. 2 is a diagram illustrating signal messages and data transmission between a base station and a base station controller for a hard split method in a general asynchronous mobile communication system.
FIG. 3 is a diagram illustrating signal messages and data transmission between a base station and a base station controller for a logical split method in a general asynchronous mobile communication system.
FIG. 4 is a diagram illustrating a structure of a transmitter that encodes a DSCH TFCI bit and a DCH TFCI bit according to an embodiment of the present invention into different encoding methods;
FIG. 5 is a diagram showing the encoder of FIG. 4;
FIG. 6 shows a structure of a receiver for decoding encoded symbols according to an embodiment of the present invention.
7 shows the decoder of FIG. 6. FIG.
FIG. 8 is a diagram illustrating a signal transmission format of a downward DCH.
FIG. 9 is a diagram illustrating a method of multiplexing encoded symbols encoded by different encoding methods.
FIG. 10 is a diagram illustrating signal messages and data transmission between a base station and a base station controller for the logical split method when SRNC and DRNC are not the same.
FIG. 11 is a diagram illustrating an operation of an SRNC according to an embodiment of the present invention.
FIG. 12 is a diagram illustrating an operation of a DRNC according to an embodiment of the present invention.
13 is a diagram illustrating a structure of a control frame including information transmitted from the DRNC to the SRNC of FIG.
[Explanation of symbols]
405: First encoder
405: Second encoder
430 ... Diffuser
435 ... Spreading code generator
440, 640 ... Scrambler
445, 645 ... Scrambling code generator
450 ... First TFCI bit generator
455 ... Second TFCI bit generator
460 ... Information generator
500 ... Walsh code generator
510,512,514,516,518,520,522,524,526,528 ... multiplier
540 ... Exclusive adder
550, 770 ... Controller
560 ... perforator
600, 605 ... Decoder
610, 620 ... Demultiplexer
630 ... despreader
635... Spread code generator
700 ... 0 inserter
701-715 ... multiplier
720-735 ... inverse Hadamard transformer
740 ... Correlation level comparator
751-765 ... Switch

Claims (37)

A mobile terminal, wherein via the first channel and a second channel to the mobile terminal transmits information bits, the first to third channel set for transmitting control data for the first channel and the second channel In a TFCI bit transmission apparatus in a code division multiple access mobile communication system including a channel and a base station that encodes and transmits TFCI bits respectively corresponding to information bits of the second channel,
A first TFCI bit generator for generating a first TFCI bit according to the information amount of the first channel;
A second TFCI bit generator for generating a second TFCI bit according to the information amount of the second channel;
Said first 1TFCI bit and the 2TFCI bit encoded using a Reed-Muller code, the a number of the 2TFCI bits number and the encoding of the 1TFCI bits the encoded with the number of the first 1TFCI bit first apparatus characterized by comprising a variable is Ru sign-device according to the ratio between the number of 2TFCI bits. Wherein the first channel is a downstream shared channel, the second channel Ri dedicated physical data channel der Apparatus according the third channel to claim 1, wherein the dedicated physical control channel der Rukoto. The first puncturing position of the Reed Muller code is 1 , 3 , 5 , 6 , 7 , 8 , 9, 10 , 11, 12, 13 in 32 encoded first symbols from 0 to 31st. , 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols or bits 0 to 31 , The number of the first TFCI bits is 1, and the number of the second TFCI bits is 9, the second puncturing position of the Reed Muller code is from 0 to 31st. It is a base sequence in 32 bits of 0, 2, 8 , 19 and 20th coded symbols in 32 coded second symbols or 0 to 31st bits. Contract Apparatus according to claim 1. The first perforation position of the Reed Muller code is 3 , 7, 8 , 9, 10, 11 , 12, 13 , 14, 15, 16 in the 32 encoded first symbols from 0 to 31st. 17, 18, 19, 20, 21 , 22, 23 , 24, 25, 26, 27, 28, 29, 30, and 31 th encoded symbol or 0 to 31 th bit in total 32 bits When the number of the first TFCI bits is 2 and the number of the second TFCI bits is 8, the second puncturing position of the Reed-Muller code is a total of 32 encodings from 0 to 31. Dearuko 1,7,13,15,20,25,30 and 31-th basis sequence of the entire 32-bit in bit coded symbols or the 0, to 31 th second of symbols The apparatus of claim 1, wherein the. The first puncturing position of the Reed Muller code is 7, 8 , 11, 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 among 32 encoded first symbols from 0 to 31st. , 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence in 32 bits in total from 0 to 31st bits , When the number of the first TFCI bits is 3 and the number of the second TFCI bits is 7, the second puncturing position of the Reed Muller code is a total of 32 encoded second symbols from 0 to 31st. 0 , 1 , 2 , 3 , 4, 5 , 7, 12, 18 , 21 and 24th encoded symbol , or a base sequence in 32 bits from 0 to 31st bit. You Apparatus according to claim 1. The first puncturing position of the Reed Muller code is 0, 1, 2 , 15 , 16 , 17 , 18 , 19, 20 , 21 , 22, among the 32 encoded first symbols from 0 to 31st. , 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence of 32 bits in total from 0 to 31st bits , wherein the number of the first TFCI bits is 4, and when the number of the first 2TFCI bits are 6, during the second symbol second puncturing positions of the Reed-Muller code, which is the entire 32 coded from 0 to 31 th 0,7,9 , Dearuko base sequence of the entire 32-bit in bit 11,16,19,24,25,26,27,28,29,30 and 31 th coded symbols or the 0, to 31 th The apparatus of claim 1, wherein the. A mobile terminal, wherein via the first channel and a second channel to the mobile terminal transmits information bits, the first to third channel set for transmitting control data for the first channel and the second channel In an apparatus for encoding TFCI bits in a code division multiple access mobile communication system including a channel and a base station that encodes and transmits TFCI bits respectively corresponding to information bits of the second channel,
A TFCI bit generator for generating the TFCI bits that are varied according to the information amount ratio;
A code length information generator for generating code length information for setting a length of a code word according to a ratio of the information amount;
A Walsh code generator for generating first to fifth basis Walsh codewords,
all a sequence generator that generates one sequence;
Mask generators for generating first to fourth base masks, respectively;
First to tenth multipliers for multiplying the TFCI bits by the first to fifth base Walsh codewords, all 1 sequences, and first to fourth base masks, respectively.
An adder for adding the outputs of the first to tenth multipliers;
An apparatus comprising: a punch for punching a code word output from the adder according to the code length information. Wherein the first channel is a downstream shared channel, the second channel Ri dedicated physical data channel der Apparatus according to claim 7 wherein the third channel, wherein the dedicated physical control channel der Rukoto. In an apparatus for encoding and transmitting a corresponding TFCI bit according to a ratio of information amounts of a first channel and a second channel in a code division multiple access mobile communication system,
A first encoder that turn into codes first 1TFCI bit indicating TFCI of the first channel using the Reed-Muller code,
A second encoder that turn into codes first 2TFCI bit indicating TFCI of the second channel using a Reed-Muller code,
The set of TFCI bits the encoded multiplexed output of the second encoder to the first encoder for transmitting control data for the first channel and the second channel An apparatus comprising: a multiplexer for transmitting through three channels. Wherein the 1TFCI bit is TFCI bits for the DSCH, the apparatus of claim 9 wherein the 2TFCI bit which is a TFCI bits for D PD CH. The first puncturing position of the Reed Muller code is 1 , 3 , 5 , 6 , 7 , 8 , 9, 10 , 11, 12, 13 in 32 encoded first symbols from 0 to 31st. , 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols or bits 0 to 31 , The number of the first TFCI bits is 1, and the number of the second TFCI bits is 9, the second puncturing position of the Reed Muller code is from 0 to 31 It is a base sequence in 32 bits of 0, 2, 8 , 19 and 20th encoded symbols in 32 encoded second symbols or 0 to 31st bits in total. Do The apparatus according to Motomeko 9. The first perforation position of the Reed Muller code is 3 , 7, 8 , 9, 10, 11 , 12, 13 , 14, 15, 16 in the 32 encoded first symbols from 0 to 31st. 17, 18, 19, 20, 21 , 22, 23 , 24, 25, 26, 27, 28, 29, 30, and 31 th encoded symbol or 0 to 31 th bit in total 32 bits When the number of the first TFCI bits is 2 and the number of the second TFCI bits is 8, the second puncturing position of the Reed-Muller code is a total of 32 encodings from 0 to 31. Dearuko 1,7,13,15,20,25,30 and 31-th basis sequence of the entire 32-bit in bit coded symbols or the 0, to 31 th second of symbols The apparatus of claim 9, wherein. The first puncturing position of the Reed Muller code is 7, 8 , 11, 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 among 32 encoded first symbols from 0 to 31st. , 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence in 32 bits in total from 0 to 31st bits , When the number of the first TFCI bits is 3 and the number of the second TFCI bits is 7, the second puncturing position of the Reed Muller code is a total of 32 encoded second symbols from 0 to 31st. 0 , 1 , 2 , 3 , 4, 5 , 7, 12, 18 , 21 and 24th encoded symbol , or a base sequence in 32 bits from 0 to 31st bit. You The apparatus of claim 9. The first puncturing position of the Reed Muller code is 0, 1, 2 , 15 , 16 , 17 , 18 , 19, 20 , 21 , 22, among the 32 encoded first symbols from 0 to 31st. , 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence of 32 bits in total from 0 to 31st bits , wherein the number of the first TFCI bits is 4, and when the number of the first 2TFCI bits are 6, during the second symbol second puncturing positions of the Reed-Muller code, which is the entire 32 coded from 0 to 31 th 0,7,9 , Dearuko base sequence of the entire 32-bit in bit 11,16,19,24,25,26,27,28,29,30 and 31 th coded symbols or the 0, to 31 th The apparatus of claim 9, wherein. Transmitting information bits to the mobile terminal through the first channel and the second channel, and the TFCI bits for the first channel and the TFCI bits for the second channel to corresponding first and second TFCI symbols, respectively. A code division multiple access mobile communication comprising: a base station that encodes and transmits the first and second TFCI symbols through a third channel configured to transmit control data for the first and second channels In the TFCI receiver in the system,
A demultiplexer for demultiplexing the received TFCI symbols in the first TFCI symbol and the second TFCI symbol;
First and second TFCIs in which 0 is inserted into the first TFCI symbol and the second TFCI symbol respectively corresponding to the first and second puncturing positions set in advance, and the 0 is inserted using inverse fast Hadamard transform Ri Tona a decoder for decoding the symbols, the number and the number of the 2TFCI bit of the 1TFCI bits and wherein the Rukoto is varied by the ratio of information bits to the second channel of the first channel. Wherein the first channel is a downstream shared channel, the second channel Ri dedicated physical data channel der apparatus of claim 15 wherein the third channel, wherein the dedicated physical control channel der Rukoto. The first puncturing position of the Reed Muller code is 1 , 3 , 5 , 6 , 7 , 8 , 9, 10 , 11, 12, 13 in 32 encoded first symbols from 0 to 31st. , 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols or bits 0 to 31 , The number of the first TFCI bits is 1, and the number of the second TFCI bits is 9, the second puncturing position of the Reed Muller code is from 0 to 31st. It is a base sequence in 32 bits of 0, 2, 8 , 19 and 20th coded symbols in 32 coded second symbols or 0 to 31st bits. Contract Apparatus according to claim 15. The first perforation position of the Reed Muller code is 3 , 7, 8 , 9, 10, 11 , 12, 13 , 14, 15, 16 in the 32 encoded first symbols from 0 to 31st. 17, 18, 19, 20, 21 , 22, 23 , 24, 25, 26, 27, 28, 29, 30, and 31 th encoded symbol or 0 to 31 th bit in total 32 bits When the number of the first TFCI bits is 2 and the number of the second TFCI bits is 8, the second puncturing position of the Reed-Muller code is a total of 32 encodings from 0 to 31. Dearuko 1,7,13,15,20,25,30 and 31-th basis sequence of the entire 32-bit in bit coded symbols or the 0, to 31 th second of symbols The apparatus of claim 15, wherein. The first puncturing position of the Reed Muller code is 7, 8 , 11, 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 among 32 encoded first symbols from 0 to 31st. , 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence in 32 bits in total from 0 to 31st bits , When the number of the first TFCI bits is 3 and the number of the second TFCI bits is 7, the second puncturing position of the Reed Muller code is a total of 32 encoded second symbols from 0 to 31st. 0 , 1 , 2 , 3 , 4, 5 , 7, 12, 18 , 21 and 24th encoded symbol , or a base sequence in 32 bits from 0 to 31st bit. You Apparatus according to claim 15. The first puncturing position of the Reed Muller code is 0, 1, 2 , 15 , 16 , 17 , 18 , 19, 20 , 21 , 22, among the 32 encoded first symbols from 0 to 31st. , 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence of 32 bits in total from 0 to 31st bits , wherein the number of the first TFCI bits is 4, and when the number of the first 2TFCI bits are 6, during the second symbol second puncturing positions of the Reed-Muller code, which is the entire 32 coded from 0 to 31 th 0,7,9 , Dearuko base sequence of the entire 32-bit in bit 11,16,19,24,25,26,27,28,29,30 and 31 th coded symbols or the 0, to 31 th The apparatus of claim 15, wherein. A mobile terminal, the information bits through the first and second channels transmitted to the mobile terminal, is encoded through a third channel set for transmitting control data for the first channel and the second channel In a TFCI transmission method in a code division multiple access mobile communication system, comprising: a base station transmitting first and second TFCI bits;
The shown and the 1TFCI bits indicating the TFCI of the first channel for generating the first encoded symbols, the TFCI of the second channel for the generation of the second symbols encoded Encoding 2TFCI bits using a Reed-Muller code ;
Multiplexing the encoded first TFCI bits and the encoded second TFCI bits;
The third Ri Tona and transmitting the multiplexed coded TFCI bits through the channel, the number and the number of the 2TFCI bit of the 1TFCI bit varied by the ratio of information bits to the second channel of the first channel It is wherein the Rukoto. Wherein the first channel is a downstream shared channel, the second channel Ri dedicated physical data channel der, the third channel The method of claim 21, wherein the dedicated physical control channel der Rukoto. The first puncturing position of the Reed Muller code is 1 , 3 , 5 , 6 , 7 , 8 , 9 , 1 , 11, 12, 13 among 32 encoded first symbols from 0 to 31st. , 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols or bits 0 to 31 , The number of the first TFCI bits is 1, and the number of the second TFCI bits is 9, the second puncturing position of the Reed Muller code is from 0 to 31 It is a base sequence in 32 bits of 0, 2, 8 , 19 and 20th encoded symbols in 32 encoded second symbols or 0 to 31st bits in total. Contract The method according to claim 21. The first perforation position of the Reed Muller code is 3 , 7, 8 , 9, 10, 11 , 12, 13 , 14, 15, 16 in the 32 encoded first symbols from 0 to 31st. 17, 18, 19, 20, 21 , 22, 23 , 24, 25, 26, 27, 28, 29, 30, and 31 th encoded symbol or 0 to 31 th bit in total 32 bits When the number of the first TFCI bits is 2 and the number of the second TFCI bits is 8, the second puncturing position of the Reed-Muller code is a total of 32 encodings from 0 to 31. Dearuko 1,7,13,15,20,25,30 and 31-th basis sequence of the entire 32-bit in bit coded symbols or the 0, to 31 th second of symbols The method of claim 21, wherein the. The first puncturing position of the Reed Muller code is 7, 8 , 11, 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 among 32 encoded first symbols from 0 to 31st. , 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence in 32 bits in total from 0 to 31st bits , When the number of the first TFCI bits is 3 and the number of the second TFCI bits is 7, the second puncturing position of the Reed Muller code is a total of 32 encoded second symbols from 0 to 31st. 0 , 1 , 2 , 3 , 4, 5 , 7, 12, 18 , 21 and 24th encoded symbol , or a base sequence in 32 bits from 0 to 31st bit. You The method of claim 21. The first puncturing position of the Reed Muller code is 0, 1, 2 , 15 , 16 , 17 , 18 , 19, 20 , 21 , 22, among the 32 encoded first symbols from 0 to 31st. , 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence of 32 bits in total from 0 to 31st bits , wherein the number of the first TFCI bits is 4 and the number of the second TFCI bits is 6, the second puncturing position of the Reed Muller code is 0, 7 , 9 , 11 in the second 32 encoded symbols from 0 to 31st. the method of claim 21, which is a 16,19,24,25,26,27,28,29,30 and 31 th coded symbols. A mobile terminal, the information bits through the first and second channels transmitted to the mobile terminal, is encoded through a third channel set for transmitting control data for the first channel and the second channel In a TFCI reception method in a code division multiple access mobile communication system, including a base station transmitting first and second TFCI bits,
Receiving and demultiplexing the encoded TFCI bits in the encoded first TFCI bits and the encoded second TFCI bits;
Inserting 0s into the encoded first TFCI bits and the encoded second TFCI bits at each of predetermined first and second puncturing positions;
A step of decoding the first and second 2TFCI bit the 0 is inserted, Ri Tona,
The number and the number of the 2TFCI bit of the 1TFCI bits wherein the Rukoto is varied by the ratio of information bits to the second channel of the first channel. Wherein the first channel is a downstream shared channel, the second channel Ri dedicated physical data channel der, the third channel The method of claim 27, wherein the dedicated physical control channel der Rukoto. The first puncturing position of the Reed Muller code is 1 , 3 , 5 , 6 , 7 , 8 , 9, 10 , 11, 12, 13 in 32 encoded first symbols from 0 to 31st. , 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols or bits 0 to 31 , The number of the first TFCI bits is 1, and the number of the second TFCI bits is 9, the second puncturing position of the Reed Muller code is from 0 to 31 It is a base sequence in 32 bits of 0, 2, 8 , 19 and 20th encoded symbols in 32 encoded second symbols or 0 to 31st bits in total. Do The method according to Motomeko 27. The first perforation position of the Reed Muller code is 3 , 7, 8 , 9, 10, 11 , 12, 13 , 14, 15, 16 in the 32 encoded first symbols from 0 to 31st. 17, 18, 19, 20, 21 , 22, 23 , 24, 25, 26, 27, 28, 29, 30, and 31 th encoded symbol or 0 to 31 th bit in total 32 bits When the number of the first TFCI bits is 2 and the number of the second TFCI bits is 8, the second puncturing position of the Reed-Muller code is a total of 32 encodings from 0 to 31. Dearuko 1,7,13,15,20,25,30 and 31-th basis sequence of the entire 32-bit in bit coded symbols or the 0, to 31 th second of symbols The method of claim 27, wherein. The first puncturing position of the Reed Muller code is 7, 8 , 11, 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 among 32 encoded first symbols from 0 to 31st. , 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence in 32 bits in total from 0 to 31st bits , When the number of the first TFCI bits is 3 and the number of the second TFCI bits is 7, the second puncturing position of the Reed Muller code is a total of 32 encoded second symbols from 0 to 31st. 0 , 1 , 2 , 3 , 4, 5 , 7, 12, 18 , 21 and 24th encoded symbol , or a base sequence in 32 bits from 0 to 31st bit. You The method of claim 27. The first puncturing position of the Reed Muller code is 0, 1, 2 , 15 , 16 , 17 , 18 , 19, 20 , 21 , 22, among the 32 encoded first symbols from 0 to 31st. , 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence of 32 bits in total from 0 to 31st bits , wherein the number of the first TFCI bits is 4, and when the number of the first 2TFCI bits are 6, during the second symbol second puncturing positions of the Reed-Muller code, which is the entire 32 coded from 0 to 31 th 0,7,9 , Dearuko base sequence of the entire 32-bit in bit 11,16,19,24,25,26,27,28,29,30 and 31 th coded symbols or the 0, to 31 th The method of claim 27, wherein. In a method of encoding and transmitting a corresponding TFCI bit according to a ratio of information bits of a first channel to a second channel of a code division multiple access mobile communication system,
Generating m-th first TFCI bits according to the data amount of the first channel and n-th second TFCI bits according to the data amount of the second channel;
Encoding the first TFCI bits into a third channel configured to transmit control data for the first channel and the second channel to generate an encoded first TFCI symbol;
Encoding the second TFCI bits into a third channel configured to transmit control data for the first channel and the second channel to generate a coded second TFCI symbol;
And multiplexing the TFCI symbols generated in the first code and the second code so that the TFCI symbols are uniformly distributed. The first puncturing position of the Reed Muller code is 1 , 3 , 5 , 6 , 7 , 8 , 9, 10 , 11, 12, 13 in 32 encoded first symbols from 0 to 31st. , 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols or bits 0 to 31 , The number of the first TFCI bits is 1, and the number of the second TFCI bits is 9, the second puncturing position of the Reed Muller code is from 0 to 31 It is a base sequence in 32 bits of 0, 2, 8 , 19 and 20th encoded symbols in 32 encoded second symbols or 0 to 31st bits in total. Do The method according to Motomeko 33. The first perforation position of the Reed Muller code is 3 , 7, 8 , 9, 10, 11 , 12, 13 , 14, 15, 16 in the 32 encoded first symbols from 0 to 31st. 17, 18, 19, 20, 21 , 22, 23 , 24, 25, 26, 27, 28, 29, 30, and 31 th encoded symbol or 0 to 31 th bit in total 32 bits When the number of the first TFCI bits is 2 and the number of the second TFCI bits is 8, the second puncturing position of the Reed-Muller code is a total of 32 encodings from 0 to 31. Dearuko 1,7,13,15,20,25,30 and 31-th basis sequence of the entire 32-bit in bit coded symbols or the 0, to 31 th second of symbols The method of claim 33, wherein. The first puncturing position of the Reed Muller code is 7, 8 , 11, 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 among 32 encoded first symbols from 0 to 31st. , 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence in 32 bits in total from 0 to 31st bits , When the number of the first TFCI bits is 3 and the number of the second TFCI bits is 7, the second puncturing position of the Reed Muller code is a total of 32 encoded second symbols from 0 to 31st. 0 , 1 , 2 , 3 , 4, 5 , 7, 12, 18 , 21 and 24th encoded symbol , or a base sequence in 32 bits from 0 to 31st bit. You The method of claim 33. The first puncturing position of the Reed Muller code is 0, 1, 2 , 15 , 16 , 17 , 18 , 19, 20 , 21 , 22, among the 32 encoded first symbols from 0 to 31st. , 23, 24, 25, 26, 27, 28, 29, 30 and 31st encoded symbols , or a base sequence of 32 bits in total from 0 to 31st bits , wherein the number of the first TFCI bits is 4, and when the number of the first 2TFCI bits are 6, during the second symbol second puncturing positions of the Reed-Muller code, which is the entire 32 coded from 0 to 31 th 0,7,9 , Dearuko base sequence of the entire 32-bit in bit 11,16,19,24,25,26,27,28,29,30 and 31 th coded symbols or the 0, to 31 th The method of claim 33, wherein.

Images