JP2945686B2 - Multiple reception maximum likelihood decoding circuit - Google Patents

Multiple reception maximum likelihood decoding circuit

Info

Publication number
JP2945686B2
JP2945686B2 JP1209954A JP20995489A JP2945686B2 JP 2945686 B2 JP2945686 B2 JP 2945686B2 JP 1209954 A JP1209954 A JP 1209954A JP 20995489 A JP20995489 A JP 20995489A JP 2945686 B2 JP2945686 B2 JP 2945686B2
Authority
JP
Japan
Prior art keywords
likelihood
circuit
path
signal
demodulated
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
JP1209954A
Other languages
Japanese (ja)
Other versions
JPH0373623A (en
Inventor
武治 郡
武 服部
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NTT Docomo Inc
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone Corp
NTT Mobile Communications Networks Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nippon Telegraph and Telephone Corp, NTT Mobile Communications Networks Inc filed Critical Nippon Telegraph and Telephone Corp
Priority to JP1209954A priority Critical patent/JP2945686B2/en
Publication of JPH0373623A publication Critical patent/JPH0373623A/en
Application granted granted Critical
Publication of JP2945686B2 publication Critical patent/JP2945686B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Description

【発明の詳細な説明】 [産業上の利用分野] 本発明は誤り訂正符号化された信号をダイバーシチ受
信する伝送系において、複数の受信信号を一つの復号回
路に入力し、同時に復号する多重受信最尤復号方法に関
するものである。
DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention relates to a transmission system that diversity-receives an error-correction-coded signal, in which a plurality of received signals are input to a single decoding circuit and multiplexed reception is performed simultaneously. It relates to the maximum likelihood decoding method.

[従来の技術] 従来複数の受信復調信号を用いて最尤復号する回路は
提案されていなかったので、複数の受信復調信号から情
報を検出することにおいて類似した方法であるレベル合
成ダイバーシチを考える。この種の回路は第3図のよう
に構成され、1は送信情報、2は送信機、3は伝送信
号、4は受信機、5は受信信号、6はS/N推定回路、7
は受信信号レベル調整回路、8はレベル調整された信
号、9はレベル合成回路、10は復調回路、11は受信情報
である。この種の回路の動作は次のようになる。送信回
路2より送信された伝送信号3は複数の受信機4により
受信され、それぞれ受信信号のS/Nが推定される。次に
受信信号レベル調整回路7により、各受信信号のレベル
をS/N比例させ調整する、レベル調整された信号8はレ
ベル合成回路9によりレベル合成が行われ、受信信号S/
Nが改善される。このような動作を行う回路の問題点と
して、理想的なレベル合成ダイバーシチを行うために、
各受信信号レベルをS1,S2,…,Saとし、S/NをP1,P2,…,P
aとした時、理想的にS/Nが改善されるレベル合成はS1
P1+P2・P2+…+Sa・Paとして各受信信号レベルをその
S/Nに比例した割合に調整合成する必要があった。この
ため、各受信信号毎にS/Nに推定しなければならず、S/N
の推定回路を付加しなければならない欠点があった。さ
らに、レベル合成回路はアナログ合成が用いられ、回路
の無調整化が難しく、信頼性に問題があった。
[Prior Art] Conventionally, a circuit for performing maximum likelihood decoding using a plurality of received demodulated signals has not been proposed, so consider level combining diversity, which is a similar method in detecting information from a plurality of received demodulated signals. This type of circuit is configured as shown in FIG. 3, where 1 is transmission information, 2 is a transmitter, 3 is a transmission signal, 4 is a receiver, 5 is a reception signal, 6 is an S / N estimation circuit, 7
Is a reception signal level adjustment circuit, 8 is a level-adjusted signal, 9 is a level synthesis circuit, 10 is a demodulation circuit, and 11 is reception information. The operation of this type of circuit is as follows. The transmission signal 3 transmitted from the transmission circuit 2 is received by the plurality of receivers 4, and the S / N of the received signal is estimated. Next, the received signal level adjusting circuit 7 adjusts the level of each received signal so as to be in S / N proportion. The level adjusted signal 8 is subjected to level synthesis by the level synthesizing circuit 9, and the received signal S / N is adjusted.
N is improved. As a problem of the circuit performing such an operation, in order to perform ideal level combining diversity,
The received signal levels are S 1 , S 2 ,..., S a , and the S / N is P 1 , P 2 ,.
When a is set, the level synthesis that ideally improves the S / N is S 1
Each received signal level As P 1 + P 2 · P 2 + ... + S a · P a
It was necessary to adjust and synthesize the ratio in proportion to the S / N. For this reason, it is necessary to estimate the S / N for each received signal, and the S / N
However, there is a drawback in that an estimation circuit must be added. Furthermore, analog synthesis is used for the level synthesis circuit, and it is difficult to adjust the circuit without adjustment, and there is a problem in reliability.

また、従来の一般的な最尤復号回路の構成を伝送能率
1/2、拘束長3の畳み込み符号化信号の復号回路を例と
して第4図に示す。101は送信データ、102は畳み込み符
号化回路、103は符号化信号、2は送信機、3は伝送信
号、104は受信復調機、105は受信復調機の復調信号、10
6は最尤復号回路、107はACS回路、108は復調信号尤度保
持回路、109はパスのもつ尤度を保持する回路、110は尤
度演算回路、111は尤度比較回路、112は新たな尤度保持
回路、113はパスメモリ、114は復号信号である。なお、
復号回路内の結線は1つのACS回路に注目し、1つのACS
回路に関する結線のみを図示している。
In addition, the configuration of the conventional general maximum likelihood decoding circuit is
FIG. 4 shows an example of a decoding circuit for a convolutional coded signal having a constraint length of 1/2 and a constraint length of 3. 101 is transmission data, 102 is a convolutional coding circuit, 103 is a coded signal, 2 is a transmitter, 3 is a transmission signal, 104 is a reception demodulator, 105 is a demodulation signal of the reception demodulator, 10
6 is a maximum likelihood decoding circuit, 107 is an ACS circuit, 108 is a demodulated signal likelihood holding circuit, 109 is a circuit holding the likelihood of a path, 110 is a likelihood calculation circuit, 111 is a likelihood comparison circuit, and 112 is a new Is a likelihood holding circuit, 113 is a path memory, and 114 is a decoded signal. In addition,
The connection in the decoding circuit focuses on one ACS circuit and one ACS circuit.
Only connections related to the circuit are shown.

本回路の動作は次のようになる。送信データ101は畳
み込み符号化回路102により符号化され、送信機2によ
り送信される。伝送された信号3は受信復調機104によ
り受信復調される。復調された信号は信号レベルが伝送
路における雑音により“1",“0"の中間値をとり、信号
レベルを量子化したソフト検出信号として復合回路に供
給される。ここで、信号レベルは復調信号のあいまい度
を示す尤度となる。この尤度情報を持つ復調信号は一度
復調信号尤度保持回路108に保持される。次に符号化に
おける拘束長内に含まれる情報ビットの組み合せにより
決定される状態数(例の場合:2(3-1)の状態)だけ存在
するACS回路107内において生き残りパスが選択される。
ACS回路における最尤パス決定は、選択されるべきパス
(例の場合:2つのパス)の持つ尤度に復調信号の尤度が
それぞれ加算され、合計2つの新尤度値が計算される。
次にこれらの2つの新尤度値を尤度比較回路111により
比較し、最も高い尤度を与えるパスが選択され、そのパ
スの持つ尤度としてこの選択された高い尤度値が与えら
れる。新たな尤度は各状態ごとにパスのもつ尤度を保持
する回路109に保持される。次にこの選択されたパスの
情報は各パスの過去の履歴が記録されているパスメモリ
113に伝えられる。パスメモリではこのパス選択によ
り、選択されなかったパスのメモリ値を消し、選択され
たパスのメモリ値はそのままにし、最新時間の位置にパ
ス選択によるパスの履歴が記録される。最終的な復号信
号はパスメモリの一番過去のメモリ値が出力され、復号
が終了する。
The operation of this circuit is as follows. The transmission data 101 is encoded by the convolution encoding circuit 102 and transmitted by the transmitter 2. The transmitted signal 3 is received and demodulated by the reception demodulator 104. The demodulated signal takes an intermediate value between "1" and "0" due to noise in the transmission line, and is supplied to the decoding circuit as a soft detection signal obtained by quantizing the signal level. Here, the signal level is a likelihood indicating the ambiguity of the demodulated signal. The demodulated signal having this likelihood information is once held in the demodulated signal likelihood holding circuit 108. Next, a surviving path is selected in the ACS circuit 107 in which there are only the number of states (in the example: 2 (3-1) states) determined by the combination of information bits included in the constraint length in encoding.
In the determination of the maximum likelihood path in the ACS circuit, the likelihood of the demodulated signal is added to the likelihood of a path to be selected (in the example, two paths), and a total of two new likelihood values are calculated.
Next, these two new likelihood values are compared by the likelihood comparison circuit 111, and the path giving the highest likelihood is selected, and the selected high likelihood value is given as the likelihood of the path. The new likelihood is held in the circuit 109 for holding the likelihood of the path for each state. Next, the information of the selected path is stored in the path memory where the past history of each path is recorded.
It is conveyed to 113. In the path memory, by this path selection, the memory value of the path not selected is erased, the memory value of the selected path is kept as it is, and the history of the path by the path selection is recorded at the latest time position. As the final decoded signal, the oldest memory value of the path memory is output, and the decoding ends.

このような、一般的な最尤復号回路では1受信機によ
る復調信号を最尤復号することにより、複数の復調信号
を同時に最尤復号することのできない欠点があった。
Such a general maximum likelihood decoding circuit has a drawback that a plurality of demodulated signals cannot be simultaneously subjected to the maximum likelihood decoding by performing the maximum likelihood decoding of the demodulated signal by one receiver.

[発明が解決しようとする課題] 本発明はこれらの欠点を除去するため、最尤復号をす
る場合に行われる最尤パスの選択と尤度計算過程を有効
利用し、従来の最尤復号回路に付加回路をほとんど加え
ることなく、簡易な回路で複数受信信号を同時に最尤復
号できようにし、結果として理想的な合成ダイバーシチ
と同じ効果を得ることができるようにした多重受信最尤
復号方法を提供することを目的とする。
[Problems to be Solved by the Invention] In order to eliminate these drawbacks, the present invention makes effective use of the maximum likelihood path selection and likelihood calculation process performed in the case of maximum likelihood decoding. Multiplex reception maximum likelihood decoding method that enables maximum likelihood decoding of a plurality of received signals simultaneously with a simple circuit without adding any additional circuits to the result, thereby achieving the same effect as ideal combining diversity. The purpose is to provide.

[課題を解決するための手段と作用] 本発明は上記目的を達成するために、伝送能率n/m、
拘束長kの畳み込み符号化された伝送信号をa台の複数
受信機により受信復調し、復調されたaの複数受信復調
信号を用いて最尤復号する多重受信最尤復号方法におい
て、拘束長kと伝送能率n/mにより決定される状態数(2
(k-1)n)だけある最尤判定のための尤度演算を実行する
ACS(Add Compare Select)回路の各ACS回路に、a台の
受信機により復調されたaの復調信号を取り込み、各AC
S回路においてmのパスから1つの生き残りパスを選択
するため、mのパスを持つ尤度にaの復調信号の尤度を
加算し、合計m×aの新尤度値を求め比較し、求めた新
尤度値の内もっとも尤度の高い値をもつパスを生き残り
パスとして選択し、選択されたパスに対応する尤度の値
を生き残りパスの尤度値として記憶し、復号信号とし
て、各パスの履歴が記録されているパスメモリから選択
されたパスの持つ一番過去の情報を引きだすことにより
復号することを特徴とするもので、複数の受信復調機に
より復調した復調信号を1つの最尤復号回路で復号する
ことにより、合成ダイバーシチと同等の利得が得られ
る。このことにより、回路の信頼性はアナログ回路を用
いることなく、全てデジタル回路で実現できることから
向上する。
[Means and Actions for Solving the Problems] In order to achieve the above object, the present invention provides a transmission efficiency n / m,
In a multiplex reception maximum likelihood decoding method for receiving and demodulating a convolutionally encoded transmission signal having a constraint length k by a plurality of receivers and performing maximum likelihood decoding using the demodulated a plurality of received demodulated signals, a constraint length k And the number of states determined by the transmission efficiency n / m (2
Perform likelihood calculation for (k-1) n ) maximum likelihood determination
The demodulated signal of a demodulated by a receivers is taken into each ACS circuit of an ACS (Add Compare Select) circuit,
In order to select one surviving path from m paths in the S circuit, the likelihood of the demodulated signal of a is added to the likelihood having m paths, and a total likelihood value of m × a is calculated and compared. The path having the highest likelihood value among the new likelihood values is selected as the surviving path, the likelihood value corresponding to the selected path is stored as the surviving path likelihood value, and each decoded signal is It decodes by extracting the oldest information of the selected path from the path memory where the path history is recorded, and decodes the demodulated signal demodulated by a plurality of receiving demodulators into one By decoding with a likelihood decoding circuit, a gain equivalent to that of combining diversity can be obtained. As a result, the reliability of the circuit is improved since it can be realized entirely by a digital circuit without using an analog circuit.

[実施例] 第1図は本発明の実施例であって、伝送能率1/2、拘
束長3の畳み込み符号化を行い、2受信局による受信を
行った場合について説明する。101は送信データ、102は
畳み込み符号化回路、103は符号化信号、2は送信機、
3は伝送信号、115は第一受信復調機、116は第一受信復
調機の復調信号、117は第二受信復調機、118は第二受信
副長期の復調信号、106は最尤復号回路、107はACS回
路、108は復調信号尤度保持回路、109はパスのもつ尤度
を保持する回路、110は尤度演算回路、111は尤度比較回
路、112は新たな尤度保持回路、113はパスメモリ、114
は復号信号である。この回路の動作は次のようになる。
送信データ101は畳み込み符号化回路102により符号化さ
れ、送信機2により送信される。伝送された信号3は2
つの受信復調機115,117により受信復調される。復調さ
れた信号は一度復調信号尤度保持回路108に保持され
る。次に符号化における拘束長内に含まれる情報ビット
の組み合せにより決定される状態数(例の場合:2(3-1)
の状態)だけ存在するACS回路107内において生き残りパ
スが選択される。ACS回路における最尤パス決定は、従
来の最尤復号回路と異なり、選択されるべきパス(例の
場合:2つのパス)の持つ尤度に2つの受信復調機による
2つの復調信号の尤度がそれぞれ加算され、合計4つの
新尤度値が計算される。次にこれら4つの新尤度値を尤
度比較回路111により比較し、最も高い尤度を与えるパ
スが選択され、そのパスの持つ尤度としてこの選択され
た高い尤度値が与えられる。以下は従来の最尤復号回路
と同様に新たな尤度は各状態ごとにパスのもつ尤度を保
持する回路109に保持される。次にこの選択されたパス
の情報は各パスの過去の履歴が記録されているパスメモ
リ113に伝えられる。パスメモリではこのパス選択によ
り、選択されなかったパスのメモリ値を消し、選択され
たパスのメモリ値はそのままにし、最新時間の位置にパ
ス選択によるパスの履歴が記録される。最終的な復号信
号はパスメモリの一番過去のメモリ値が出力され、復号
が終了する ここで、受信復調信号の尤度は受信信号のS/Nを示す
もので、受信信号レベル、信号位相の位置誤差など信号
の不確定性を表す情報により表される。
[Embodiment] Fig. 1 shows an embodiment of the present invention, in which convolutional coding with a transmission efficiency of 1/2 and a constraint length of 3 is performed, and reception is performed by two receiving stations. 101 is transmission data, 102 is a convolutional coding circuit, 103 is a coded signal, 2 is a transmitter,
3 is a transmission signal, 115 is a first reception demodulator, 116 is a demodulation signal of the first reception demodulator, 117 is a second reception demodulator, 118 is a second reception sub-long-term demodulation signal, 106 is a maximum likelihood decoding circuit, 107 is an ACS circuit, 108 is a demodulation signal likelihood holding circuit, 109 is a circuit for holding the likelihood of a path, 110 is a likelihood calculation circuit, 111 is a likelihood comparison circuit, 112 is a new likelihood holding circuit, 113 Is the path memory, 114
Is a decoded signal. The operation of this circuit is as follows.
The transmission data 101 is encoded by the convolution encoding circuit 102 and transmitted by the transmitter 2. The transmitted signal 3 is 2
Reception and demodulation are performed by two reception demodulators 115 and 117. The demodulated signal is once held in the demodulated signal likelihood holding circuit 108. Next, the number of states determined by the combination of information bits included in the constraint length in encoding (in the example: 2 (3-1)
), The surviving path is selected in the ACS circuit 107 which exists only in the state (1). The maximum likelihood path determination in the ACS circuit differs from the conventional maximum likelihood decoding circuit in that the likelihood of a path to be selected (in the example: two paths) is the likelihood of two demodulated signals by two receiving demodulators. Are added, and a total of four new likelihood values are calculated. Next, these four new likelihood values are compared by the likelihood comparison circuit 111, a path giving the highest likelihood is selected, and the selected high likelihood value is given as the likelihood of the path. Hereinafter, like the conventional maximum likelihood decoding circuit, the new likelihood is held in the circuit 109 for holding the likelihood of the path for each state. Next, the information of the selected path is transmitted to the path memory 113 in which the past history of each path is recorded. In the path memory, by this path selection, the memory value of the path not selected is erased, the memory value of the selected path is kept as it is, and the history of the path by the path selection is recorded at the latest time position. As the final decoded signal, the oldest memory value of the path memory is output and decoding is completed. Here, the likelihood of the received demodulated signal indicates the S / N of the received signal, and the received signal level and signal phase Is represented by information representing the uncertainty of the signal such as the position error of the signal.

第2図は本実施例における特性を表したものである。
復号信号の誤り率が10-3になる時における2復調信号の
Eb/Noの関係を示している(PSK絶対同期検波を用いた場
合)。比較のため、品質のよい回線を選択し受信復調す
る選択ダイバーシチを用いた場合を同時に示す。第2図
からわかるように、2復調信号のS/Nが等しい時、2dBの
改善効果があり、理想的な合成ダイバーシチにおいて得
られる改善効果3dBに匹敵する改善効果の得られること
がわかる。
FIG. 2 shows characteristics in this embodiment.
When the error rate of the decoded signal is 10 -3 ,
Shows the relationship between E b / N o (when using a PSK absolute coherent detection). For comparison, a case where selection diversity for selecting a high-quality line and receiving and demodulating is used is also shown. As can be seen from FIG. 2, when the S / N of the two demodulated signals is equal, an improvement effect of 2 dB is obtained, and an improvement effect equivalent to the improvement effect of 3 dB obtained in ideal combining diversity can be obtained.

本発明は伝送能率n/m、拘束長kの畳み込み符号化さ
れた信号をa局で受信する場合についても、同様な方法
で実現できる。2(k-1)n状態毎にACS回路を設け、一つの
ACS回路内ではaの復調信号とmのパスからの尤度を計
算し、もっとも高い尤度を持つパスを求めることによ
り、最尤復号が可能になる。
The present invention can be realized in a similar manner when a convolutionally coded signal having a transmission efficiency of n / m and a constraint length of k is received at the station a. 2 An ACS circuit is provided for each (k-1) n state, and one
In the ACS circuit, the likelihood from the demodulated signal a and the path m is calculated, and the path having the highest likelihood is obtained, so that the maximum likelihood decoding becomes possible.

[発明の効果] 以上説明したように、複数の受信復調機により復調し
た復調信号を1つの最尤復号回路で復号することによ
り、合成ダイバーシチと同等の利得が得られる。このこ
とにより、回線の信頼性はアナログ回路を用いることな
く、全てデジタル回路で実現できることから向上する。
また、回路規模は最尤復号回路の1/2以上を占めるパス
メモリの構成が従来の最尤復号回路と全く同じであり、
本発明を実現するために拡張する部分は非常に少なく、
従来の最尤復号回路とほとんど同じ構成で実現できる。
[Effects of the Invention] As described above, by decoding a demodulated signal demodulated by a plurality of receiving demodulators with one maximum likelihood decoding circuit, a gain equivalent to that of combining diversity can be obtained. As a result, the reliability of the line is improved because the circuit can be entirely realized by a digital circuit without using an analog circuit.
Further, the circuit scale is exactly the same as the conventional maximum likelihood decoding circuit, and the configuration of the path memory occupying more than half of the maximum likelihood decoding circuit is
There are very few extensions to implement the invention,
It can be realized with almost the same configuration as the conventional maximum likelihood decoding circuit.

【図面の簡単な説明】[Brief description of the drawings]

第1図は本発明の一実施例を示す構成説明図、第2図は
第1図の実施例の改善特性を示す特性図、第3図は従来
のレベル合成ダイバーシチを示す構成説明図、第4図は
従来の最尤復号回路を示す構成説明図である。 2……送信機、102……畳み込み符号化回路、115……第
一受信復調機、117……第二受信復調機、106……最尤復
号回路、107……ACS回路、108……復調信号尤度保持回
路、109……パスのもつ尤度保持回路、110……尤度演算
回路、111……尤度比較回路、112……新たな尤度保持回
路、113……パスメモリ。
FIG. 1 is an explanatory diagram showing a configuration of an embodiment of the present invention, FIG. 2 is a characteristic diagram showing improved characteristics of the embodiment of FIG. 1, FIG. 3 is an explanatory diagram of a configuration showing a conventional level combining diversity, FIG. FIG. 4 is an explanatory diagram showing a configuration of a conventional maximum likelihood decoding circuit. 2 Transmitter 102 Convolutional coding circuit 115 First reception demodulator 117 Second reception demodulator 106 Maximum likelihood decoding circuit 107 ACS circuit 108 Demodulation Signal likelihood holding circuit, 109: Likelihood holding circuit with path, 110: Likelihood calculating circuit, 111: Likelihood comparing circuit, 112: New likelihood holding circuit, 113: Path memory.

───────────────────────────────────────────────────── フロントページの続き 審査官 鈴木 匡明 (56)参考文献 特開 平2−149023(JP,A) 特開 平1−311642(JP,A) 特開 昭60−41831(JP,A) (58)調査した分野(Int.Cl.6,DB名) H03M 13/00 - 13/22 H04B 7/00 H04B 7/02 - 7/12 H04L 1/02 - 1/06 ──────────────────────────────────────────────────続 き Continuation of the front page Examiner Masaaki Suzuki (56) References JP-A-2-149023 (JP, A) JP-A-1-311642 (JP, A) JP-A-60-41831 (JP, A) (58) Field surveyed (Int.Cl. 6 , DB name) H03M 13/00-13/22 H04B 7/00 H04B 7/02-7/12 H04L 1/02-1/06

Claims (1)

(57)【特許請求の範囲】(57) [Claims] 【請求項1】伝送能率n/m、拘束長kの畳み込み符号化
された伝送信号をa台の複数受信機により受信復調し、
復調されたaの複数受信復調信号を用いて最尤復号する
多重受信最尤復号方法において、拘束長kと伝送能率n/
mにより決定される状態数(2(k-1)n)だけある最尤判定
のための尤度演算を実行するACS(Add Compare Selec
t)回路の各ACS回路に、a台の受信機により復調された
aの復調信号を取り込み、各ACS回路においてmのパス
から1つの生き残りパスを選択するため、mのパスを持
つ尤度にaの復調信号の尤度を加算し、合計m×aの新
尤度値を求め比較し、求めた新尤度値の内もっとも尤度
の高い値をもつパスを生き残りパスとして選択し、選択
されたパスに対応する尤度の値を生き残りパスの尤度値
として記憶し、復号信号として、各パスの履歴が記録さ
れているパスメモリから選択されたパスの持つ一番過去
の情報を引きだすことにより復号することを特徴とする
多重受信最尤復号方法。
1. A convolutionally encoded transmission signal having a transmission efficiency of n / m and a constraint length of k is received and demodulated by a plurality of receivers.
In a multiplex reception maximum likelihood decoding method for performing maximum likelihood decoding using a plurality of demodulated demodulated signals of a, a constraint length k and a transmission efficiency n /
ACS (Add Compare Selec) that executes the likelihood calculation for the maximum likelihood determination for the number of states (2 (k-1) n ) determined by m
t) A demodulated signal of a demodulated by a receivers is taken into each ACS circuit of the circuit, and one surviving path is selected from m paths in each ACS circuit. The likelihood of the demodulated signal of a is added, a total m × a new likelihood value is obtained and compared, and a path having the highest likelihood value among the obtained new likelihood values is selected as a surviving path, and selected. The likelihood value corresponding to the selected path is stored as the likelihood value of the surviving path, and as the decoded signal, the oldest information of the selected path is extracted from the path memory in which the history of each path is recorded. Multiplex reception maximum likelihood decoding method, characterized in that decoding is performed by the following method.
JP1209954A 1989-08-14 1989-08-14 Multiple reception maximum likelihood decoding circuit Expired - Lifetime JP2945686B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP1209954A JP2945686B2 (en) 1989-08-14 1989-08-14 Multiple reception maximum likelihood decoding circuit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP1209954A JP2945686B2 (en) 1989-08-14 1989-08-14 Multiple reception maximum likelihood decoding circuit

Publications (2)

Publication Number Publication Date
JPH0373623A JPH0373623A (en) 1991-03-28
JP2945686B2 true JP2945686B2 (en) 1999-09-06

Family

ID=16581418

Family Applications (1)

Application Number Title Priority Date Filing Date
JP1209954A Expired - Lifetime JP2945686B2 (en) 1989-08-14 1989-08-14 Multiple reception maximum likelihood decoding circuit

Country Status (1)

Country Link
JP (1) JP2945686B2 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20010101457A (en) 1999-11-10 2001-11-14 다니구찌 이찌로오, 기타오카 다카시 Adaptive array communication system and receiver

Also Published As

Publication number Publication date
JPH0373623A (en) 1991-03-28

Similar Documents

Publication Publication Date Title
US5638408A (en) Variable transmission bit rate discrimination method and apparatus
US5465267A (en) Error-correcting tandem encoding system
US5452322A (en) Receiver for digital signals transmitted in the coded differential modulation mode
US5235621A (en) Receiver systems
JPH09503114A (en) Diversity π / 4-DQPSK demodulation
JP2001518250A (en) Communication system and method using code rate partitioning with non-orthogonal modulation
JP2001501055A (en) Interference mitigation by joint detection of co-channel signals
JPH06508015A (en) Method and apparatus for estimating signal weighting parameters in a diversity receiver
JP2002185437A (en) Receiving apparatus
US6295311B1 (en) Method and apparatus for compensating for phase differences in received signals
US5124979A (en) Digital data transmission device for a composite transmission signal comprising a main data and a subdata signal
US4110735A (en) Error detection and correction
US5173926A (en) Convolutionally-encoded quadrature frequency-modulation system
JP3645721B2 (en) Demodulator
US5850403A (en) Process of selectively protecting information bits against transmission errors
JP2945686B2 (en) Multiple reception maximum likelihood decoding circuit
NO305629B1 (en) Data transfer ° ring means
JP4543479B2 (en) Communication system and method
US6408037B1 (en) High-speed data decoding scheme for digital communication systems
JPS6337540B2 (en)
JP2774827B2 (en) Base station reception method
JP2765037B2 (en) Antenna diversity receiver
JP3052025B2 (en) Diversity wireless transmission and reception system
Clark et al. Two recent applications of error-correction coding to communications systems design
JPH0993295A (en) Coding modulator

Legal Events

Date Code Title Description
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090625

Year of fee payment: 10

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090625

Year of fee payment: 10

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100625

Year of fee payment: 11

EXPY Cancellation because of completion of term
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100625

Year of fee payment: 11