JPS6041832A - Arq system - Google Patents

Arq system

Info

Publication number
JPS6041832A
JPS6041832A JP58150025A JP15002583A JPS6041832A JP S6041832 A JPS6041832 A JP S6041832A JP 58150025 A JP58150025 A JP 58150025A JP 15002583 A JP15002583 A JP 15002583A JP S6041832 A JPS6041832 A JP S6041832A
Authority
JP
Japan
Prior art keywords
data
likelihood
likelihood function
retransmission request
maximum likelihood
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.)
Pending
Application number
JP58150025A
Other languages
Japanese (ja)
Inventor
Takuo Iwamori
岩森 拓雄
Toshiyuki Fujiwara
藤原 寿之
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.)
Japan Radio Co Ltd
Technical Research and Development Institute of Japan Defence Agency
Nihon Musen KK
Original Assignee
Japan Radio Co Ltd
Technical Research and Development Institute of Japan Defence Agency
Nihon Musen KK
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 Japan Radio Co Ltd, Technical Research and Development Institute of Japan Defence Agency, Nihon Musen KK filed Critical Japan Radio Co Ltd
Priority to JP58150025A priority Critical patent/JPS6041832A/en
Publication of JPS6041832A publication Critical patent/JPS6041832A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607Details of the supervisory signal
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0054Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Artificial Intelligence (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

PURPOSE:To attain retransmission request in block unit or bit unit by applying decoding of data by means of the maximum likelihood method at the data reception side and utilizing a likelihood function or a likelihood function difference calculated in the decoding as the decision of the retransmission request. CONSTITUTION:A signal transmitted from a data transmitter 4 is received by a receiver 6 and given to a maximum likelihood decoder 7 of the next stage at the reception side. The maximum likelihood decoder 7 operates the likelihood function based on a prescribed formula, compares the level and outputs the largest likelihood function among the likelihood functions and a data corresponding thereto to a deciding device 8. The device 8 compares the likelihood function outputted from the maximum likelihood decoder 7 with a predetermined deciding level. When the inputted likelihood function is larger than the deciding level in this case, the inputted data is stored in a prescribe address of a data buffer 9, and when the inputted data is smaller than the deciding level, the address of the inputted data is transmitted to the data transmission side via a transmitter 10 as a retransmission request signal.

Description

【発明の詳細な説明】 本発明は、データ送信側jにおいて入力データを誤り検
出符号で符号化して送信し、データ受信側においてデー
タの誤りを検出し、その検出された誤りの箇所のデータ
をデータ送信側に再送要求し、再送信されたデータによ
って誤りデータを自動的に訂正するA RQ (’au
tomaticrequest )方式に関するもので
ある。
DETAILED DESCRIPTION OF THE INVENTION According to the present invention, input data is encoded with an error detection code on the data transmitting side and then transmitted, data errors are detected on the data receiving side, and the data at the location of the detected error is A RQ ('au
This relates to the tomaticrequest) method.

従来のこの種の方式は、入力データをブロック符号等の
誤り検出符号で符号化し、データ受信側で誤りを検出し
、誤りの検出されたブロック単位の再送をデータ送信側
に要求するものであるから、誤り検出符号の検出能力を
越えた誤りに対しては再送要求が不可能であり、かつ再
送要求はブロック単位であってビット単位の再送要求が
困難である等の問題点を有していた。
This type of conventional method encodes input data with an error detection code such as a block code, detects errors on the data receiving side, and requests the data transmitting side to retransmit the block in which the error was detected. Therefore, there are problems such as it is impossible to request retransmission for errors that exceed the detection ability of the error detection code, and retransmission requests are made in block units, making it difficult to request retransmission in bit units. Ta.

本発明は上述したような事情から、データ受信側で最尤
復号法によるデータの最尤復号を行い、その復号の際に
算出される尤度関数又は尤度関数差により再送要求の判
定を行い、もって前記従来方式の有する諸問題を解消せ
しめたARQ方式を提供することな目的とするものであ
る。
In view of the above-mentioned circumstances, the present invention performs maximum likelihood decoding of data using a maximum likelihood decoding method on the data receiving side, and determines a retransmission request based on the likelihood function or likelihood function difference calculated during the decoding. Therefore, it is an object of the present invention to provide an ARQ method that solves the problems of the conventional method.

本発明において採用する最尤復号法は、所謂誤り訂正方
式の一棟であって、その基本的原理について説明するに
、先ずデータ送信側で入力データをたたみこみ符号等で
符号化し、これをデータ受信側に送信する。データ受信
側では次式で表わされる尤度関数LFを算出する。
The maximum likelihood decoding method adopted in the present invention is a type of so-called error correction method.To explain its basic principle, first, input data is encoded using a convolutional code etc. on the data transmitting side, and this is used for data reception. Send to the side. On the data receiving side, a likelihood function LF expressed by the following equation is calculated.

LF=P(1’1A)=7(yl l a: ) (1
)ここに、Yは受信データ系列ベクトルでY−(Jl 
+3’21・・、Vi・)+Aはデータ送信側に設けた
符号化器によって決する1番目に出力される入力データ
系列ベクトルでA== (a:、αユ、・・・α)・・
・)である。
LF=P(1'1A)=7(yl l a: ) (1
) Here, Y is the received data sequence vector Y-(Jl
+3'21..., Vi...)+A is the first output input data sequence vector determined by the encoder provided on the data transmitting side, and A== (a:, αyu,...α)...
・).

つまり、データ送信側に設けた符号化器によって決まる
すべての受信データ系列に対して前記(11式の尤度関
数を計算し、算出された尤度関数LF及びそれに対応す
る受信データ系列のすべてをデータ受信側で記憶してお
く。しかして。
In other words, the likelihood function of Equation 11 is calculated for all received data sequences determined by the encoder provided on the data transmitting side, and the calculated likelihood function LF and all of the corresponding received data sequences are calculated. Store it on the data receiving side.

ある長さの計算後記憶されている尤度関数LFの中で最
も大なる尤度関数LFK対応する受信データ系列を順次
復調データとして出力するものである。即ち最尤復号法
とは、データ受信側で送信データ系列に最も近いと思わ
れるデータ系列を選び出す手法であっソ、シかもその場
合に算出される尤度関数LFは、受信データ系列Yに誤
りがあれば小さくなること前記tII式により明らかで
ある。このことからまた尤度関数は受信データに対する
復号品質を表わす関数であることが判る。斯かる尤度関
数の性質を応用すれば、誤り検出符号の検出能力に制限
されることなくあらゆる誤りに対する再送要求が可能と
なり、ブロック単位のみならずビット単位の再送要求も
可能となる。本発明は斯かる尤度関数の性質を応用して
再送要求の判定な行う点に特徴を有するものである。
After calculation of a certain length, the received data sequence corresponding to the largest likelihood function LFK among the stored likelihood functions LF is sequentially output as demodulated data. In other words, the maximum likelihood decoding method is a method in which the data receiving side selects the data sequence that is considered to be closest to the transmitted data sequence. It is clear from the above tII formula that the value becomes smaller if . From this, it can be seen that the likelihood function is a function representing the decoding quality of received data. By applying the properties of such a likelihood function, it becomes possible to request retransmission for all kinds of errors without being limited by the detection ability of the error detection code, and it becomes possible to request retransmission not only in units of blocks but also in units of bits. The present invention is characterized in that retransmission requests are determined by applying the properties of the likelihood function.

以下本発明の一実施例を図面を参照しながら詳細に説明
する。
An embodiment of the present invention will be described in detail below with reference to the drawings.

データ送信側の入力データを−1データバツフア1vC
格納し、ここにおいてデータ全部にアドレスを付加し、
しかる後格納されたデータを順次アドレス順に再送要求
判定器2を通して符号化器3へ供給する。しかしてこの
符号化器3でたたみこみ符号等により符号化されて送信
機4へ送られ送信される。かだやデータ受信側で機 は、前記送信機4がら送信された信号を受信者6で受信
し1次段の最尤復号器7へ供給する。
-1 data buffer 1vC input data on data sending side
Store and add an address to all data here,
Thereafter, the stored data is sequentially supplied to the encoder 3 through the retransmission request determiner 2 in address order. The encoder 3 then encodes the signal using a convolutional code or the like, and sends it to the transmitter 4 for transmission. On the data receiving side, a receiver 6 receives the signal transmitted from the transmitter 4 and supplies it to a maximum likelihood decoder 7 at the first stage.

この最尤復号器7で前記FII式により尤度関数LF7
を演算した後、大小比較を行い尤度関数のうちの最も大
なる尤度関数及びそれに対応するデータを判定器8へ出
力する。この判定器8では最尤復号器7から出力さIし
た尤度関数と、予め決められた判定レベルとを比較する
。この場合判定レベルよりも入力された尤度関数の方が
大きければ、入力され/こデータはデータバッファ9の
所定のアドレスへ格納し2判定レベルよりも小さければ
、入力されたデータのアドレスを再送要求信号として送
信機1oを介してデータ送受信され、再送要求判定器2
で送られてきたアドレスに格納されているデータバッフ
ァ1のデータを読み出し、符号化器3へ出力する。再送
要求がなければ、データバッファ1より順次人力データ
を再送要求判定器2を介して符号化器3へ出力し、以下
同様の動作を入力データがデータバッファ1よりすべて
出力されるまで繰返すものである。
This maximum likelihood decoder 7 uses the FII formula to obtain a likelihood function LF7.
After calculating, a magnitude comparison is performed and the largest likelihood function among the likelihood functions and the data corresponding thereto are output to the determiner 8. This determiner 8 compares the likelihood function output from the maximum likelihood decoder 7 with a predetermined determination level. In this case, if the input likelihood function is larger than the judgment level, the input data is stored in a predetermined address of the data buffer 9, and if it is smaller than the judgment level 2, the address of the input data is retransmitted. Data is transmitted and received as a request signal via the transmitter 1o, and the retransmission request determiner 2
The data stored in the data buffer 1 at the address sent is read out and output to the encoder 3. If there is no retransmission request, the manual data is sequentially output from the data buffer 1 to the encoder 3 via the retransmission request determiner 2, and the same operation is repeated until all input data is output from the data buffer 1. be.

尚、最尤復号器7で演算される尤度関数LFは復調され
たビット毎に算出されるため、ビット単位の再送要求が
できる。またブロック単位の再送要求を行う場合は、ブ
ロックに含まれる尤度関数の平均値を計算し、それによ
り判定を行えば宜しい。更にまた前記け1式で算出され
る尤度関数列のうち、1査犬なる尤度関数と2番目に犬
なる尤度関数との差は、誤りが多ければ多いほど小さく
なるという性質かあるため、この尤度関数差を最尤復号
器7から判定器8へ出力すれば、斯かる尤度関数差によ
り再送要求の判定を行うことができる。
Note that since the likelihood function LF calculated by the maximum likelihood decoder 7 is calculated for each demodulated bit, a retransmission request can be made bit by bit. Furthermore, when making a retransmission request in units of blocks, it is preferable to calculate the average value of the likelihood functions included in the block and make a determination based on the average value of the likelihood functions included in the block. Furthermore, in the likelihood function sequence calculated by the equation 1 above, the difference between the likelihood function that is the first dog and the likelihood function that is the second dog has the property that the more errors there are, the smaller it becomes. Therefore, if this likelihood function difference is output from the maximum likelihood decoder 7 to the determiner 8, a retransmission request can be determined based on the likelihood function difference.

以上詳述したように2本発明は、データ受信側において
最尤復号法によるデータの復号を行い、その復号の際に
算出される先度関数又は先度関数差を再送要求の判定に
利用するものであるから、誤り検出能力に制限されるこ
となくブロック単位又はビット単位毎の再送要求ができ
、。
As detailed above, the present invention decodes data using the maximum likelihood decoding method on the data receiving side, and uses the prior function or the prior function difference calculated during decoding to determine a retransmission request. Therefore, retransmission requests can be made on a block-by-block or bit-by-bit basis without being limited by error detection capability.

誤り制御の範囲拡大及び復号品質の向上に多大な効果を
発揮するものである。
This is highly effective in expanding the range of error control and improving decoding quality.

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

図面は本発明に係るARQ方式の一実施例を示すブロッ
ク図である。 ]、9・・データバッファ、 2・・・再送要求判定特
許出願人 防衛庁技術研究本部長 特許出願人 日本無線株式会社 (〒−31tイ盲イリ・」) (〒r−′3 づeイ言 イ貝り)
The drawing is a block diagram showing an embodiment of the ARQ system according to the present invention. ], 9...Data buffer, 2...Retransmission request determination patent applicant Director of Technology Research Headquarters, Defense Agency Patent applicant Japan Radio Co., Ltd. (word)

Claims (1)

【特許請求の範囲】 データ送信側で入力データを符号化し、データ受信側で
データの誤りを検出し、その誤りのら、たデータの再送
をデータ送信側に要求し。 再送要求されたデータを再びデータ受信側へ送信してデ
ータの誤りを訂正する方式において。 データ受信側で最尤復号法によるデータの最尤復号を行
い、その復号の際に算出される尤度関数又は尤度関数差
により前記再送要求の判定を行うことを特徴とするAR
Q方式。
[Claims] The data transmitting side encodes input data, the data receiving side detects errors in the data, and in response to the errors, requests the data transmitting side to retransmit the data. In a method in which data that has been requested for retransmission is sent again to the data receiving side to correct data errors. AR characterized in that the data receiving side performs maximum likelihood decoding of data using a maximum likelihood decoding method, and the retransmission request is determined based on a likelihood function or a likelihood function difference calculated during the decoding.
Q method.
JP58150025A 1983-08-17 1983-08-17 Arq system Pending JPS6041832A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP58150025A JPS6041832A (en) 1983-08-17 1983-08-17 Arq system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58150025A JPS6041832A (en) 1983-08-17 1983-08-17 Arq system

Publications (1)

Publication Number Publication Date
JPS6041832A true JPS6041832A (en) 1985-03-05

Family

ID=15487846

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58150025A Pending JPS6041832A (en) 1983-08-17 1983-08-17 Arq system

Country Status (1)

Country Link
JP (1) JPS6041832A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0388517A (en) * 1989-08-18 1991-04-12 American Teleph & Telegr Co <Att> Extensive vitelvi decoding algorithm
JP2007525043A (en) * 2003-02-19 2007-08-30 クゥアルコム・フラリオン・テクノロジーズ、インコーポレイテッド Method and apparatus for effective automatic repeat request
US8099099B2 (en) 2003-02-19 2012-01-17 Qualcomm Incorporated Methods and apparatus related to assignment in a wireless communications system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5013044A (en) * 1973-05-08 1975-02-10

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5013044A (en) * 1973-05-08 1975-02-10

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0388517A (en) * 1989-08-18 1991-04-12 American Teleph & Telegr Co <Att> Extensive vitelvi decoding algorithm
JP2007525043A (en) * 2003-02-19 2007-08-30 クゥアルコム・フラリオン・テクノロジーズ、インコーポレイテッド Method and apparatus for effective automatic repeat request
US7813322B2 (en) 2003-02-19 2010-10-12 Qualcomm Incorporated Efficient automatic repeat request methods and apparatus
US8099099B2 (en) 2003-02-19 2012-01-17 Qualcomm Incorporated Methods and apparatus related to assignment in a wireless communications system

Similar Documents

Publication Publication Date Title
US6163873A (en) Data communication method and system
JPH05110539A (en) Digital transmission system
US7530001B2 (en) Wireless communications system reducing unnecessary retransmission by means of a correlation value of received data with preamble and a method therefor
US6357031B1 (en) Serial data transmission apparatus and method with a data checking feature
EP1260046A2 (en) A communication system having bad frame indicator means for resynchronization purposes
EP0551646A2 (en) Concatenated block and convolution encoder-decoder
JPH04362819A (en) Broadcast communication equipment
JPS60169275A (en) Two-dimension compressor
JP3161506B2 (en) Hierarchical encoding device, hierarchical decoding device, and hierarchical encoding / decoding device
JP2001268019A (en) Digital mobile communication system
JP2010512087A (en) Data processing in signal transmission
JPS6328146A (en) Data resending transmission system
JPH01164140A (en) Burst retransmitting type error correcting system
JPH11122228A (en) Data communication method/device
US6637001B1 (en) Apparatus and method for image/voice transmission
JPH0371739A (en) Adaptive error controller
JP2001007785A (en) Communication device and communication method
US20260121791A1 (en) Combining Adaptive Data Compression with Forward Error Correction to Attain Optimal Data Rates Under Varying Channel Conditions
CN113438054B (en) Data transmission method and device
JPH09214916A (en) Data communication retransmission device
JPH07193514A (en) Transmission line code selecting data transmission system
JPS58164376A (en) Image data retransmission method
US7669093B2 (en) Information radio transmission system
JP3583804B2 (en) Image transmission device
JPH11317947A (en) Image communication method, image communication system, and recording medium storing image communication program