JPH0373623A - Multiplex reception maximum likelihood decoding circuit - Google Patents

Multiplex reception maximum likelihood decoding circuit

Info

Publication number
JPH0373623A
JPH0373623A JP1209954A JP20995489A JPH0373623A JP H0373623 A JPH0373623 A JP H0373623A JP 1209954 A JP1209954 A JP 1209954A JP 20995489 A JP20995489 A JP 20995489A JP H0373623 A JPH0373623 A JP H0373623A
Authority
JP
Japan
Prior art keywords
likelihood
circuit
path
maximum likelihood
signal
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.)
Granted
Application number
JP1209954A
Other languages
Japanese (ja)
Other versions
JP2945686B2 (en
Inventor
Takeji Kori
武治 郡
Takeshi Hattori
武 服部
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.)
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone Corp
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 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

Landscapes

  • Error Detection And Correction (AREA)
  • Radio Transmission System (AREA)

Abstract

PURPOSE:To attain maximum likelihood decoding to plural reception signals simultaneously with a simple circuit and to obtain the same effect as that of an ideal synthesis diversity by using one maximum likelihood decoding circuit to decode a demodulation signal demodulated by plural reception demodulation devices. CONSTITUTION:A signal 3 sent to a decoding circuit 106 is received and demodulated by 2 reception demodulation devices 115, 117 and latched by a demodulation signal likelihood holding circuit 108. Then a survival path is selected in ACS circuits 107 in existing by a status number depending on the combination of information bits included in a restriction length in the coding. In the case of deciding a maximum likelihood path in the ACS circuit, it is different from the decision of a conventional maximum likelihood decoding circuit, the likelihood of two demodulation signals by two reception demodulators is added respectively to the likelihood of paths to be selected (in this embodiment, 2 paths) and in total 4 new likelihood paths are calculated. Then the 4 new likelihood paths are compared by a likelihood comparison circuit 111 and a path offering the maximum likelihood is selected and the selected maximum likelihood is given to the likelihood of the path. The succeeding processing is similar to that of a conventional maximum likelihood decoding circuit.

Description

【発明の詳細な説明】 [産業上の利用分野] 本発明は誤り訂正符号化された信号をダイバーシチ受信
する伝送系において、複数の受信信号を一つの復号回路
に入力し、同時に復号する多重受信最尤復号回路に関す
るものである。
[Detailed Description of the Invention] [Industrial Application Field] The present invention is a transmission system that receives error-correction coded signals in a diversity manner. This relates to a maximum likelihood decoding circuit.

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

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

本回路の動作は次のようになる。送信データ101は畳
み込み符号化回路102により符号化され、送信機2に
より送信される。伝送された信号3は受信復調機104
により受信復調される。
The operation of this circuit is as follows. Transmission data 101 is encoded by convolutional encoding circuit 102 and transmitted by transmitter 2 . The transmitted signal 3 is sent to the receiver demodulator 104
It is received and demodulated by

復調された信号は信号レベルが伝送路における雑音によ
り“1”、“Ooの中間値をとり、信号レベルを量子化
したソフト検出信号として復号回路に供給される。ここ
で、信号レベルは復調信号のあいまい度を示す尤度とな
る。この尤度情報を持つ復調信号は一度復調信号尤度保
持回路108 E保持される。次に符号化における拘束
長内に含まれる情報ビットの組み合せにより決定される
状態数(例の場合、 2 (3−1)の状態)だけ存在
するAC8回路107内において生き残りパスが選択さ
れる。AC8回路における最尤パス決定は、選択される
べきパス(例の場合:2つのパス)の持つ尤度に復調信
号の尤度がそれぞれ加算され、合計2つの新尤度値が計
算される。次にこれらの2つの新尤度値を尤度比較回路
111により比較し、最も高い尤度を与えるパスが選択
され、そのパスの持つ尤度としてこの選択された高い尤
度値が与えられる。新たな尤度は各状態ごとにパスのも
つ尤度を保持する回路109に保持される。次にこの選
択されたパスの情報は各パスの過去の履歴が記録されて
いるパスメモリ113に伝えられる。
The signal level of the demodulated signal takes an intermediate value between "1" and "Oo" due to noise in the transmission path, and is supplied to the decoding circuit as a soft detection signal obtained by quantizing the signal level.Here, the signal level is the demodulated signal. The demodulated signal with this likelihood information is once held in the demodulated signal likelihood holding circuit 108E.Next, it is determined by the combination of information bits included within the constraint length in encoding. A surviving path is selected within the AC8 circuit 107 that exists in the number of states (2 (3-1) states in the case of the example).The maximum likelihood path determination in the AC8 circuit : The likelihood of the demodulated signal is added to the likelihood of the two paths) to calculate a total of two new likelihood values.Next, these two new likelihood values are compared by the likelihood comparison circuit 111. Then, the path that gives the highest likelihood is selected, and the selected high likelihood value is given as the likelihood of that path.The new likelihood is determined by a circuit that maintains the likelihood of the path for each state. The selected path information is then transmitted to the path memory 113 in which the past history of each path is recorded.

パスメモリではこのパス選択により、選択されなかった
パスのメモリ値を消し、選択されたパスのメモリ値はそ
のままにし、最新時間の位置にパス選択によるパスの履
歴が記録される。最終的な復号信号はパスメモリの一番
過去のメモリ値が出力され、復号が終了する。
In the path memory, as a result of this path selection, the memory values of the unselected paths are erased, the memory values of the selected paths are left as they are, and the path history resulting from the path selection is recorded at the latest time position. The last memory value of the path memory is output as the final decoded signal, and the decoding ends.

このような、−膜内な最尤復号回路では1受信機による
復調信号を最尤復号することにより、複数の復調信号を
同時に最尤復号することのできない欠点があった。
Such an intra-film maximum likelihood decoding circuit has a drawback that it cannot perform maximum likelihood decoding of a plurality of demodulated signals at the same time by maximum likelihood decoding of a demodulated signal by one receiver.

〔発明が解決しようとする課題〕[Problem 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 that are performed when performing maximum likelihood decoding, and without adding almost any additional circuit to the conventional maximum likelihood decoding circuit. To provide a multiplex reception maximum likelihood decoding circuit which can simultaneously perform maximum likelihood decoding of a plurality of received signals with a simple circuit and, as a result, can obtain the same effect as ideal combining diversity.

[課題を解決するための手段と作用] 本発明は上記目的を達成するために、符号化された伝送
信号をa台の複数受信機により受信復調し、復調された
aの複数受信復調信号を用いて最尤復号する最尤復号回
路において、符号化信号を復号時における最尤判定がm
のパスから1つの生き残りパスを選択するように構成し
、復号回路の動作として、a台の受信機により復調され
たaの復調信号を復号回路内にあって最尤判定のための
尤度演算を実行するA CS (Add Compar
e 5elect)回路に取り込み、次に拘束長にと伝
送能率n / mにより決定される状態数(2”−1)
+″)だけある各AC5回路においてmのパスから1つ
の生き残りパスを選択するため、mのパスの持つ尤度に
aの復調信号の尤度を加算し、合計量Xnの新尤度値を
求め比較し、求めた新尤度値の内もっとも尤度の高い値
をもつパスを生き残りパスとして選択し、選択されたパ
スに対応する尤度の値を生き残りパスの尤度値として記
憶し、復号信号として、各パスの履歴が記録されている
パスメモリから選択されたパスの持つ一番過去の情報を
各引きだすことにより復号することを特徴とするもので
、複数の受信復調機により復調した復調信号を1つの最
尤復号回路で復号することにより、合成ダイバーシチと
同等の利得が得られる。このことにより、回路の信頼性
はアナログ回路を用いることなく、全てデジタル回路で
実現できることから向上する。
[Means and operations for solving the problem] In order to achieve the above object, the present invention receives and demodulates an encoded transmission signal by a plurality of receivers, and receives and demodulates the demodulated a plurality of received demodulated signals. In a maximum likelihood decoding circuit that performs maximum likelihood decoding using
The decoding circuit is configured to select one surviving path from among the paths, and as an operation of the decoding circuit, a demodulated signal demodulated by a receivers is processed in the decoding circuit to perform a likelihood calculation for maximum likelihood determination. A CS (Add Compar
e 5elect) into the circuit, then the number of states determined by the constraint length and the transmission efficiency n/m (2”-1)
In order to select one surviving path from m paths in each AC5 circuit with +''), add the likelihood of the demodulated signal of a to the likelihood of m paths, and calculate the new likelihood value of the total amount Xn. The path with the highest likelihood value among the new likelihood values obtained is selected as the surviving path, and the likelihood value corresponding to the selected path is stored as the likelihood value of the surviving path. It is characterized by decoding by extracting the past information of each path selected from a path memory in which the history of each path is recorded as a decoded signal, and demodulated by multiple receiving demodulators. By decoding the demodulated signal with one maximum likelihood decoding circuit, a gain equivalent to that of composite diversity can be obtained.This improves the reliability of the circuit because it can be realized entirely with digital circuits without using analog circuits. .

[実施例] 第1図は本発明の実施例であって、伝送能率1/2、拘
束長3の畳み込み符号化を行い、2受信局による受信を
行った場合について説明する。
[Embodiment] FIG. 1 shows an embodiment of the present invention, and a case will be described in which convolutional encoding with a transmission efficiency of 1/2 and a constraint length of 3 is performed, and reception is performed by two receiving stations.

101は送信データ、102は畳み込み符号化回路、1
03は符号化信号、2は送信機、3は伝送信号、115
は第−受信復調機、116は第−受信復調機の復調信号
、117は第二受信復調機、118は第二受信復調機の
復調信号、106は最尤復号回路、107はAC3回路
、108は復調信号尤度保持回路、109はパスのもつ
尤度を保持する回路、110は尤度演算回路、111は
尤度比較回路、112は新たな尤度保持回路、113は
パスメモリ、114は復号信号である。
101 is transmission data, 102 is a convolutional encoding circuit, 1
03 is a coded signal, 2 is a transmitter, 3 is a transmission signal, 115
116 is the demodulated signal of the second receiving demodulator, 117 is the second receiving demodulator, 118 is the demodulated signal of the second receiving demodulator, 106 is the maximum likelihood decoding circuit, 107 is the AC3 circuit, 108 109 is a demodulated signal likelihood holding circuit, 109 is a circuit that holds 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 a path memory, and 114 is a This is the decoded signal.

この回路の動作は次のようになる。送信データ101は
畳み込み符号化回路102により符号化され、送信機2
により送信される。伝送された信号3は2つの受信復調
機115.117により受信復調される。復調された信
号は一度復調信号尤度保持回路108に保持される。次
に符号化における拘束長内に含まれる情報ビットの組み
合せにより決定される状態数(例の場合、2+3−1+
の状態)だけ存在するACS回路107内において生き
残りパスが選択される。AC8回路における最尤パス決
定は、従来の最尤復号回路と異なり、選択されるべきパ
ス(例の場合:2つのパス)の持つ尤度に2つの受信復
調機による2つの復調信号の尤度がそれぞれ加算され、
合計4つの新尤度値が計算される。次にこれら4つの新
尤度値を尤度比較回路111により比較し、最も高い尤
度を与えるパスが選択され、そのパスの持つ尤度として
この選択された高い尤度値が与えられる。以下は従来の
最尤復号回路と同様に新たな尤度は各状態ごとにパスの
もつ尤度を保持する回路109に保持される。次にこの
選択されたパスの情報は各パスの過去の履歴が記録され
ているパスメモリ113に伝えられる。パスメモリでは
このパス選択により、選択されなかったパスのメモリ値
を消し、選択されたパスのメモリ値はそのままにし、最
新時間の位置にパス選択によるパスの履歴が記録される
。最終的な復号信号はパスメモリの一番過去のメモリ値
が出力され、復号が終了する。
The operation of this circuit is as follows. Transmission data 101 is encoded by a convolutional encoding circuit 102 and sent to the transmitter 2.
Sent by. The transmitted signal 3 is received and demodulated by two receiving 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 within the constraint length in encoding (in the case of the example, 2+3-1+
A surviving path is selected in the ACS circuit 107 that exists only in the state of . Maximum likelihood path determination in the AC8 circuit differs from conventional maximum likelihood decoding circuits in that the likelihood of the path to be selected (in the example: two paths) is determined by the likelihood of the two demodulated signals by the two receiving demodulators. are added respectively,
A total of four new likelihood values are calculated. Next, these four new likelihood values are compared by the likelihood comparison circuit 111, the path giving the highest likelihood is selected, and the selected high likelihood value is given as the likelihood of that path. In the following, the new likelihood is held in a circuit 109 that holds the likelihood of a path for each state, similar to the conventional maximum likelihood decoding circuit. Next, information on the selected path is transmitted to the path memory 113 in which the past history of each path is recorded. In the path memory, as a result of this path selection, the memory values of the unselected paths are erased, the memory values of the selected paths are left as they are, and the path history resulting from the path selection is recorded at the latest time position. The last memory value of the path memory is output as the final decoded signal, and the decoding ends.

ここで、受信復調信号の尤度は受信信号のS/Nを示す
もので、受信信号レベル、信号位相の位相誤差など信号
の不確定性を表す情報により表される。
Here, the likelihood of the received demodulated signal indicates the S/N of the received signal, and is expressed by information representing the uncertainty of the signal, such as the received signal level and the phase error of the signal phase.

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

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

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

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

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

Claims (1)

【特許請求の範囲】 符号化された伝送信号をa台の複数受信機により受信復
調し、復調されたaの複数受信復調信号を用いて最尤復
号する最尤復号回路において、符号化信号を復号時にお
ける最尤判定がmのパスから1つの生き残りパスを選択
するように構成し、復号回路の動作として、a台の受信
機により復調されたaの復調信号を復号回路内にあって
最尤判定のための尤度演算を実行するACS(AddC
ompareSelect)回路に取り込み、次に拘束
長kと伝送能率n/mにより決定される状態数 (2^(^K^−^1^)^a)だけある各ACS回路
においてmのパスから1つの生き残りパスを選択するた
め、mのパスの持つ尤度にaの復調信号の尤度を加算し
、合計m×nの新尤度値を求め比較し、求めた新尤度値
の内もっとも尤度の高い値をもつパスを生き残りパスと
して選択し、選択されたパスに対応する尤度の値を生き
残りパスの尤度値として記憶し、復号信号として、各パ
スの履歴が記録されているパスメモリから選択されたパ
スの持つ一番過去の情報を各引きだすことにより復号す
ることを特徴とする多重受信最尤復号回路。
[Claims] In a maximum likelihood decoding circuit that receives and demodulates an encoded transmission signal by a plurality of receivers and performs maximum likelihood decoding using the demodulated a plurality of reception demodulated signals, the encoded signal is The configuration is such that the maximum likelihood judgment at the time of decoding selects one surviving path from m paths, and the operation of the decoding circuit is to select the demodulated signal a demodulated by the a receivers from the maximum likelihood judgment in the decoding circuit. ACS (AddC) that performs likelihood calculation for likelihood determination
ompareSelect) circuit, and then one out of m paths in each ACS circuit with the number of states (2^(^K^-^1^)^a) determined by the constraint length k and transmission efficiency n/m. In order to select a surviving path, the likelihood of the demodulated signal of a is added to the likelihood of the path of m, a total of m×n new likelihood values are obtained and compared, and the most likely of the new likelihood values obtained is A path with a high degree value is selected as a surviving path, the likelihood value corresponding to the selected path is stored as the likelihood value of the surviving path, and the history of each path is recorded as a decoded signal. A multiple reception maximum likelihood decoding circuit characterized in that decoding is performed by extracting the most recent information of a selected path from memory.
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 true JPH0373623A (en) 1991-03-28
JP2945686B2 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)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001035549A1 (en) * 1999-11-10 2001-05-17 Mitsubishi Denki Kabushiki Kaisha Adaptive array communication system and receiver

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001035549A1 (en) * 1999-11-10 2001-05-17 Mitsubishi Denki Kabushiki Kaisha Adaptive array communication system and receiver
US6473472B2 (en) 1999-11-10 2002-10-29 Mitsubishi Denki Kabushiki Kaisha Adaptive array communication system and receiver

Also Published As

Publication number Publication date
JP2945686B2 (en) 1999-09-06

Similar Documents

Publication Publication Date Title
US5621764A (en) Soft decision signal outputting receiver
US5638408A (en) Variable transmission bit rate discrimination method and apparatus
US5907586A (en) Method and device for signal decision, receiver and channel condition estimating method for a coding communication system
US5465267A (en) Error-correcting tandem encoding system
US5436918A (en) Convolutional encoding/decoding apparatus with fixed bit insertion
JP3261109B2 (en) Addition / comparison / selection circuit, maximum likelihood sequence detector, and method of executing addition / comparison / selection function
US5235621A (en) Receiver systems
JP3238448B2 (en) Signal transmission equipment
JP2000515341A (en) Communication signal detection method and means with unequal error protection
JPH09503114A (en) Diversity π / 4-DQPSK demodulation
US6999472B2 (en) Apparatus, and associated method, for space-time encoding, and decoding, data at a selected code rate
JP2001501055A (en) Interference mitigation by joint detection of co-channel signals
JPH05260104A (en) Transmission equipment
US5987631A (en) Apparatus for measuring bit error ratio using a viterbi decoder
US6952443B1 (en) Method and apparatus for determining rate of data transmitted at variable rates
US4110735A (en) Error detection and correction
US7260162B2 (en) Method and apparatus for selecting an equalization algorithm depending on the used coding algorithm or on the channel quality
US5850403A (en) Process of selectively protecting information bits against transmission errors
US6542559B1 (en) Decoding method and apparatus
US6408037B1 (en) High-speed data decoding scheme for digital communication systems
JPH0373623A (en) Multiplex reception maximum likelihood decoding circuit
AU758071B2 (en) Detection of code vectors in single frequency, multiple transmitter networks
JP2000315957A (en) Decoder
US6084925A (en) Method and apparatus for discriminating synchronous or asynchronous states of Viterbi decoded data
US8045651B2 (en) Method and system for redundancy-based decoding in 8-PSK GSM systems

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