Concatenated encoding and decoding for multilayer communication protocol
Abstract
"CONCATENATED CODING AND DECODING FOR MULTIPLE LAYER COMMUNICATION PROTOCOL". It is a method and system for using an external decoder in a Broadcast Services Communication System. The information to be transmitted is sent to a systematic part of a series of transmission buffers and encoded by an external decoder coupled in communication with the transmission buffer. The resulting redundant bits are sent to a parity portion of each transmission buffer. The content of the transmission buffers is multiplexed and encoded by an internal decoder in order to improve protection by adding redundancy. The receiving station retrieves the information transmitted by a reverse process. Since the decoding complexity depends on the size of a systematic part of the transmission buffer, a weighted compromise between the size of the systematic part and the number of transmission buffers leads to a reduction in the decoding complexity.
Term
Term ended
Projected expiry passed 8 October 2022, 4 years ago.
- Priority
- Filed
- Projected expiry
- Today
54 claims: 6 independent, 48 dependent
- 1REIVINDICAÇÕES 1. Método de codificação para reduzir a complexidade de decodificação, o método sendo caracterizado por compreender as etapas de:5 codificar bits sistemáticos em cada um de uma pluralidade de armazenadores com um primeiro código;multiplexar o conteúdo da pluralidade de armazenadores;e codificar o conteúdo multiplexado com um segundo 10 código, de modo a se fornecer um conjunto de quadros.
- 2Método, de acordo com a reivindicação 1, caracterizado pelo fato de que a codificação de bits sistemáticos em cada um de uma pluralidade de armazenadores com um primeiro código compreende:15 codificar bits sistemáticos em cada um da pluralidade de armazenadores com um código de bloco.
- 3Método, de acordo com a reivindicação 1, caracterizado pelo fato de que a codificação de bits sistemáticos em cada um de uma pluralidade de armazenadores 20 com um código de bloco compreende:codificar bits sistemáticos em cada um da pluralidade de armazenadores com um código de Reed-Solomon.
- 4Método, de acordo com a reivindicação 1, caracterizado pelo fato de que a multiplexação de conteúdo 25 da pluralidade de armazenadores compreende:fornecer um bloco de bits sucessivamente a partir de cada um da pluralidade de armazenadores.
- 5Método, de acordo com a reivindicação 4, caracterizado pelo fato de que o fornecimento de um bloco 30 de bits sucessivamente a partir de cada um da pluralidade de armazenadores compreende:2/11 fornecer um bloco de bits compreendendo uma linha de cada um da pluralidade de armazenadores.
- 6Método, de acordo com a reivindicação 1, caracterizado pelo fato de que a codificação do conteúdo multiplexado com um segundo código de modo a se obter um conjunto de quadros compreende as etapas de:identificar um bloco de bits a ser codificado;e codificar o bloco de bits com um segundo código.
- 7Método, de acordo com a reivindicação 6, caracterizado pelo fato de que a identificação de um bloco de bits a ser codificado compreende:identificar um bloco de bits recebido de um armazenador.
- 8Método para reduzir a complexidade de decodificação, caracterizado por compreender as etapas de:decodificar quadros recebidos por um segundo decodificador;demultiplexar quadros corretamente decodificados para uma pluralidade de armazenadores;e processar o conteúdo de cada um da pluralidade de armazenadores.
- 9Método, de acordo com a reivindicação 8, caracterizado pelo fato de que a demultiplexação de quadros corretamente decodificados para uma pluralidade de armazenadores compreende as etapas de:identificar um bloco de bits pertencente a um armazenador;e fornecer o bloco de bits ao armazenador.
- 10Método, de acordo com a reivindicação 9, caracterizado pelo fato de que a identificação de um bloco de bits pertencente a um armazenador compreende:3/11 identificar um bloco de bits que compreende um quadro decodificado pelo segundo decodificador.
- 11Método, de acordo com a reivindicação 8, caracterizado pelo fato de que o processamento do conteúdo de cada um da pluralidade de armazenadores compreende:fornecer a parte sistemática de cada um da pluralidade de armazenadores a camadas mais elevadas.
- 12Método, de acordo com a reivindicação 8, caracterizado por compreender adicionalmente:fornecer a indicação de um apagamento a um decodificador acoplado em comunicação ao armazenador que recebería o quadro corretamente decodificado se o quadro deixasse de ser decodificado corretamente.
- 13Método, de acordo com a reivindicação 12, caracterizado pelo fato de que o processamento do conteúdo de cada um da pluralidade de armazenadores compreende as etapas de:decodificar a parte sistemática do armazenador por um decodificador quando a parte sistemática for recuperável;e fornecer a parte sistemática de cada um da pluralidade de armazenadores a camadas mais elevadas.
- 14Método para reduzir a complexidade de decodificação, caracterizado por compreender as etapas de:codificar bits sistemáticos em cada um de uma pluralidade de armazenadores de transmissão com um primeiro código;multiplexar o conteúdo da pluralidade de armazenadores;codificar o conteúdo multiplexado com um segundo código, de modo a se fornecer um conjunto de quadros;transmitir o conjunto de quadros;4/11 decodificar os quadros recebidos por um segundo decodificador;demultiplexar os quadros corretamente decodificados para uma pluralidade de armazenadores de recepção;e processar o conteúdo de cada armazenador recebido.
- 15Método, de acordo com a reivindicação 14, caracterizado pêlo fato de que a codificação de bits sistemáticos em cada um de uma pluralidade de armazenadores de transmissão com um primeiro código compreende:codificar bits sistemáticos em cada um de uma pluralidade de armazenadores com um código de bloco.
- 16Método, de acordo com a reivindicação 15, caracterizado pelo fato de que a codificação de bits sistemáticos em cada um de uma pluralidade de armazenadores com um código de bloco compreende:codificar bits sistemáticos em cada um de uma pluralidade de armazenadores com um código de Reed-Solomon.
- 17Método, de acordo com a reivindicação 14, caracterizado pelo fato de que a multiplexação do conteúdo da pluralidade de primeiros armazenadores compreende:fornecer um bloco de bits sucessivamente a partir de cada armazenador.
- 18Método, de acordo com a reivindicação 17, caracterizado pelo fato de que o fornecimento de um bloco de bits sucessivamente a partir de cada armazenador compreende:fornecer um bloco de bits que compreende uma linha do armazenador de transmissão.
- 19Método, de acordo com a reivindicação 14, caracterizado pelo fato de que a codificação do conteúdo 5/11 multiplexado com um segundo código de modo a se fornecer um conjunto de quadros compreende as etapas de:identificar um bloco de bits a ser codificado;e codificar o bloco de bits com um segundo código.
- 20Método, de acordo com a reivindicação 19, caracterizado pelo fato de que a identificação de um bloco de bits a ser codificado compreende:identificar o bloco de bits como um bloco de bits recebido de um armazenador.
- 21Método, de acordo com a reivindicação 14, caracterizado pelo fato de que a demultiplexação de quadros corretamente decodificados para uma pluralidade de quadros de recepção compreende as etapas de:identificar um bloco de bits pertencente a um armazenador;e fornecer o bloco de bits ao armazenador.
- 22Método, de acordo com a reivindicação 21, caracterizado pelo fato de que a identificação de um bloco de bits pertencente a um armazenador compreende:identificar um bloco de bits como um bloco de bits compreendendo um quadro decodificado pelo segundo decodificador.
- 23Método, de acordo com a reivindicação 14, caracterizado pelo fato de que o processamento do conteúdo de cada armazenador de recepção compreende:fornecer a parte sistemática de cada armazenador a camadas mais elevadas.
- 24Método, de acordo com a reivindicação 14, caracterizado por compreender adicionalmente:fornecer indicação de um apagamento a um primeiro decodificador acoplado em comunicação ao armazenador de 6/11 recepção que receberia o quadro corretamente decodificado se o quadro deixasse de ser decodificado corretamente.
- 25Método, de acordo com a reivindicação 24, caracterizado pelo fato de que o processamento do conteúdo de cada armazenador compreende as etapas de:decodificar a parte sistemática do armazenador por um primeiro decodificador quando a parte sistemática for recuperável;e fornecer a parte sistemática de cada armazenador a camadas mais elevadas.
- 26Equipamento para reduzir a complexidade de decodificação, caracterizado por compreender:uma pluralidade de armazenadores;uma pluralidade de codif icadores, cada um da pluralidade de codificadores sendo acoplado em comunicação a um da pluralidade de armazenadores;um multiplexador acoplado em comunicação à pluralidade de armazenadores;e um codificador interno acoplado em comunicação ao multiplexador.
- 27Equipamento, de acordo com a reivindicação 26, caracterizado pelo fato de que cada um da pluralidade de armazenadores é configurado para:armazenar bits sistemáticos e bits de paridade.
- 28Equipamento, de acordo com a reivindicação 26, caracterizado pelo fato de que cada um da pluralidade de codificadores é configurado para:codificar bits sistemáticos de modo a fornecer bits de paridade.
- 29Equipamento, de acordo com a reivindicação 28, caracterizado pelo fato de que cada um da pluralidade de codificadores é configurado para:7/11 codificar os bits sistemáticos com um código de bloco.
- 30Equipamento, de acordo com a reivindicação 26, caracterizado pelo fato de que cada um da pluralidade de codificadores é configurado para:codificar os bits sistemáticos com um código de Reed-Solomon.
- 31Equipamento, de acordo com a reivindicação 26, caracterizado pelo fato de que o multiplexador é configurado para:fornecer um bloco de bits sucessivamente de cada um da pluralidade de armazenadores ao codificador interno.
- 32Equipamento, de acordo com a reivindicação 31, caracterizado pelo fato de que o bloco de bits compreende uma linha do armazenador.
- 33Equipamento, de acordo com a reivindicação 26, caracterizado pelo fato de que o codificador interno é configurado para:identificar um bloco de bits a ser codificado;e codificar o bloco de bits com um código interno.
- 34Equipamento, de acordo com a reivindicação 33, caracterizado pelo fato de que o bloco de bits a ser codificado compreende:um bloco de bits recebido do multiplexador.
- 35Equipamento para reduzir a complexidade de decodificação, caracterizado por compreender:um primeiro decodificador;um demultiplexador acoplado em comunicação ao primeiro decodificador;uma pluralidade de armazenadores acoplados em comunicação ao demultiplexador;e 8/11 uma pluralidade de decodif icadores, cada um da pluralidade de decodificadores sendo acoplado em comunicação a um da pluralidade de armazenadores.
- 36Método, de acordo com a reivindicação 35, caracterizado pelo fato de que o primeiro decodificador é configurado para:decodificar um quadro recebido;fornecer um quadro corretamente decodificado;e fornecer a indicação de um apagamento se o quadro recebido deixar de ser decodificado corretamente.
- 37Equipamento, de acordo com a reivindicação 35, caracterizado pelo fato de que o demultiplexador é configurado para:identificar um bloco de bits pertencente a um armazenador;e fornecer o bloco de bits ao armazenador.
- 38Equipamento, de acordo com a reivindicação 37, caracterizado pelo fato de que o bloco de bits pertencente a um armazenador compreende:um bloco de bits que compreende um quadro decodificado pelo primeiro decodificador.
- 39Método, de acordo com a reivindicação 35, caracterizado pelo fato de que cada um da pluralidade de decodificadores é configurado para:decodificar a parte sistemática do armazenador por um decodificador externo quando a parte sistemática for recuperável.
- 40Equipamento, de acordo com a reivindicação 35, caracterizado pelo fato de que cada um da pluralidade de armazenadores é configurado para:fornecer a parte sistemática a camadas mais elevadas. 9/11
- 41Equipamento para reduzir a complexidade de decodificação, caracterizado por compreender:uma pluralidade de armazenadores de transmissão;uma pluralidade de codificadores, cada um da pluralidade de codificadores sendo acoplado em comunicação a um da pluralidade de armazenadores de transmissão;um multiplexador acoplado em comunicação à pluralidade de armazenadores de transmissão;um codificador interno acoplado em comunicação ao multiplexador;um primeiro decodificador;um demultiplexador acoplado em comunicação ao primeiro decodificador;uma pluralidade de armazenadores de recepção acoplado em comunicação ao demultiplexador;e uma pluralidade de decodificadores, cada um da pluralidade de decodificadores sendo acoplado em comunicação a um da pluralidade de armazenadores de recepção.
- 42Equipamento, de acordo com a reivindicação 41, caracterizado pelo fato de que cada um da pluralidade de armazenadores de transmissão é configurado para:armazenar bits sistemáticos e bits de paridade.
- 43Equipamento, de acordo com a reivindicação 41, caracterizado pelo fato de que cada um da pluralidade de codificadores é configurado para:codificar bits sistemáticos para fornecer bits de paridade.
- 44Equipamento, de acordo com a reivindicação 43, caracterizado pelo fato de que cada um da pluralidade de codificadores é configurado para:10/11 codificar os bits sistemáticos com um código de bloco.
- 45Equipamento, de acordo com a reivindicação 41, caracterizado pelo fato de que cada um da pluralidade de codificadores é configurado para:codificar os bits sistemáticos com um código de Reed-Solomon.
- 46Equipamento, de acordo com a reivindicação 41, caracterizado pelo fato de que o multiplexador é configurado para:fornecer um bloco de bits sucessivamente a partir de cada um da pluralidade de armazenadores de transmissão ao codificador interno.
- 47Equipamento, de acordo com a reivindicação 46, caracterizado pelo fato de que o bloco de bits compreende uma linha do armazenador.
- 48Equipamento, de acordo com a reivindicação 41, caracterizado pelo fato de que o codificador interno é configurado para:identificar um bloco de bits a ser codificado;e codificar o bloco de bits com um código interno.
- 49Equipamento, de acordo com a reivindicação 48, caracterizado pelo fato de que o bloco de bits a ser codificado compreende:um bloco de bits recebido do multiplexador.
- 50Método, de acordo com a reivindicação 41, caracterizado pelo fato de que o primeiro decodificador é configurado para:decodificar um quadro recebido;fornecer um quadro corretamente decodificado;e fornecer indicação de um apagamento se o quadro recebido deixar de ser decodificado corretamente. 11/11
- 51Equipamento, de acordo com a reivindicação 41, caracterizado pelo fato de que o demultiplexador é configurado para:identificar um bloco de bits pertencente a um armazenador;e fornecer o bloco de bits ao armazenador.
- 52Equipamento, de acordo com a reivindicação 51, caracterizado pelo fato de que o bloco de bits pertencente a um armazenador compreende:um bloco de bits compreendendo um quadro decodificado pelo primeiro decodificador.
- 53Método, de acordo com a reivindicação 41, caracterizado pelo fato de que cada um da pluralidade de decodificadores é configurado para:decodificar a parte sistemática do armazenador por um decodificador externo quando a parte sistemática for recuperável.
- 54Equipamento, de acordo com a reivindicação 41, caracterizado pelo fato de que cada um da pluralidade de armazenadores é configurado para:fornecer a parte sistemática do armazenador a camadas mais elevadas. 1/3 DIAGRAMA EM BLOCOS DO CÓDIGO EXTERNO DE REED-SOLOMON 2/3 ΓΊ
Independent claims54
89 paragraphs in 5 sections, as filed
(54) Title: CONCATENED CODING AND DECODING FOR MULTIPLE LAYER COMMUNICATION PROTOCOL (30) Unionist Priority: 10/12/2001 us 09 / 976,591 (71) Depositor (s): Qualcomm Incorporated (US) (72) Inventor (s) ): Tao Chen, Paul E. Bender, Parag A. Agashe, Ramin Rezaiifar, Rajesh K. Pankaj, Yongbin Wei (74) Attorney: Montaury Pimenta, Machado & Lioce S / C Ltda (86) International Order: pct US02 / 32052 of 10/8/2002 (87) International Publication: wo 03/034598 of 04/24 / 2003 (57) Abstract: CONCATENED CODING AND DECODING FOR MULTIPLE LAYER COMMUNICATION PROTOCOL. It is a method and system for using an external decoder in a Broadcast Services Communication System. The information to be transmitted is sent to a systematic part of a series of transmission buffers and encoded by an external decoder coupled in communication to the transmission buffer. The resulting redundant bits are sent to a parity portion of each transmission buffer. The content of the transmission buffers is multiplexed and encoded by an internal decoder in order to improve protection by adding redundancy. The receiving station retrieves the information transmitted by a reverse process. Since the decoding complexity depends on the size of a systematic part of the transmission buffer, a weighted compromise between the size of the systematic part and the number of transmission buffers leads to a reduction in the decoding complexity.
<img file="BR0213215A_D0001.tif" />
<img file="BR0213215A_D0002.tif" />
CONCATINATED CODING AND DECODING FOR MULTIPLE LAYER COMMUNICATION PROTOCOL
FUNDAMENTALS
Field
The present invention relates to communication systems. More specifically, the present invention relates to a system and method for reducing the complexity of decoding in a communication system.
Foundations
Communication systems have been developed to allow the transmission of information signals from a source station to a physically distinct destination station. When transmitting the information signal from the originating station through a communication channel, the information signal is first converted into a form suitable for effective transmission through the communication channel. Conversion, or modulation, of the information signal involves varying a parameter of a carrier wave according to the information signal so that the spectrum of the resulting modulated carrier is confined within the bandwidth of the communication channel. At the destination station, the original information signal is reproduced from the modulated carrier wave received through the communication channel. Such reproduction is generally obtained using the inverse of the modulation process employed by the originating station.
Modulation also facilitates multiple access, that is, the simultaneous transmission and / or reception, of various signals through a common communication channel. Multiple access communication systems often include a plurality of subscriber units requiring intermittent service of relatively long duration.
2/22 short, and no continuous access to the common communication channel. Various multiple access techniques are known in the art, such as time division multiple access (TDMA), frequency division multiple access (FDMA) and amplitude modulation (AM) access. Another type of multiple access technique is a system with spectral spreading of multiple access by code division (CDMÁ) that conforms to the Compatibility Standard Mobile Station-Base Station TIA / EIA / IS-95 for Cellular System with Spectral Banding Scattering Wide and Dual Mode, hereinafter referred to as the IS-95 standard. The use of CDMA techniques in a multiple access communication system is shown in U.S. Patent No. 4 901 307, entitled SPREAD SPECTRUM MULTIPLE-ACCESS COMMUNICATION SYSTEM USING SATELLITE OR TERRESTRIAL REPEATERS, and in U.S. Patent No. 5 103 459, entitled SYSTEM AND METHOD FOR GENERATING WAVEFORMS IN A CDMA CELLULAR TELEPHONE SYSTEM, both assigned to the assignee of the present invention .
A multiple access communication system can be wireless or wired and can carry voice and / or data. An example of a communication system that carries both voice and data is a system according to the IS-95 standard, which specifies the transmission of voice and data through the communication channel. A method for transmitting data in fixed size code channel frames is described in detail in U.S. Patent No. 5 504 773, entitled METHOD AND APPARATUS FOR THE FORMATTING OF DATA FOR TRANSMISSION, assigned to the assignee of the present invention. According to the IS-95 standard, the data or voice is partitioned into code channel frames that are 20 milliseconds wide with data rates as high as 14.4 Kbps. Additional examples of a
3/22 communication that carries both voice and data comprises communication systems that conform to the 3- Generation Partnership Project (SGPP), embodied in a set of documents that includes Documents Nos. 3G TS 25.211, 3G TS 25.212, 3G TS 25.213 and 3G TS 25.214 (W-CDMA standard), or the TR-45.5 Physical Layer Standard for Systems with spectral spreading cdma2000 (IS2000 standard).
An example of an exclusive data communication system is a high data rate (HDR) communication system that conforms to the Industrial TIA / EIA / IS-856 standard, hereinafter referred to as the IS-856 standard. This HDR system is based on a communication system presented in copending application Serial No. 08/963 386, entitled METHOD AND APPARATUS FOR HIGH RATE PACKET DATA TRANSMISSION, filed on November 3, 1997 and assigned to the assignee of the present invention. The HDR communication system defines a set of data rates, ranging from 38.4 Kbps to 2.4 Mbps, rates at which an access point (AP) can send data to a subscriber station (access terminal, AT ). Since the AP is analogous to a base station, the terminology for cells and sectors is the same for voice systems.
In a multiple access communication system, communications between users are carried out through one or more base stations. A first user at a subscriber station communicates with a second user at a second subscriber station by transmitting data on a reverse link to a base station. The base station receives the data and can route the data to another base station. The data is transmitted over a direct link from the same base station, or from the other base station, to the second subscriber station. The direct link refers to the transmission of a
4/22 base station to a subscriber station, and the reverse link refers to the transmission from a subscriber station to a base station. Similarly, communication can be carried out between a first user at a subscriber station and a second user at a land line station. A base station receives user data over a reverse link and routes the data to the second user over a public switched telephone network (PSTN). In many communication systems, such as IS-95, W-CDMA and IS-2000, different frequencies are allocated for the direct link and the reverse link.
The wireless communication system described above is an example of a point-to-point communication service. In contrast, broadcast services provide point-to-point communication service. The basic model of a broadcast system consists of a broadcast network of users served by one or more central stations, which transmit information with a certain content, such as news, films, sporting events and the like, to users. Each subscriber station of the broadcast network user monitors a common broadcast direct link signal. Since the central station fixedly determines the content, users generally do not communicate back. Common usage examples
<td colspan="2">of systems</td><td>of communication</td><td>in</td><td>services</td><td>in</td><td>broadcast</td><td>are</td>
<td>broadcast</td><td>in</td><td>TV, broadcast</td><td>in</td><td>radio and</td><td colspan="2">similar.</td><td>Such</td>
<td>systems</td><td>in</td><td>Communication</td><td>are</td><td colspan="2">usually</td><td>systems</td><td>in</td>
highly specialized communication systems built for specific purposes. With the recent advances in wireless cellular telephone systems, there has been interest in using the existing infrastructure of cellular telephone systems from point to point, mainly for broadcast services. (According
5/22 used here, the term cellular systems encompasses communication systems that use both cellular and PCS frequencies).
The information signal to be exchanged between the terminals in a communication system is often organized in a plurality of packages. For the purposes of this description, a packet is a group of bytes, which includes data (payload) and control elements, arranged in a specific format. The control elements comprise, for example, a preamble and a quality criterion. The quality criterion comprises, for example, a cyclic redundancy check (CRC), parity bit (s) and other types of criteria known to those skilled in the art. The packages are then formatted to fit in a frame according to a communication channel structure. The frame, appropriately modulated, moving between the source terminal and the destination terminal, is affected by the characteristics of the communication channel, such as the signal to noise ratio, fading, time variation and other such features. Such characteristics affect the modulated signal differently on different communication channels. Consequently, the transmission of a modulated signal through a wireless communication channel requires considerations other than the transmission of a modulated signal through a communication channel of the connected type, such as, for example, a coaxial cable or an optical cable. In addition to selecting the appropriate modulation for a specific communication channel, other methods for protecting the information signal have been devised. Such methods include, for example, encoding, symbol repetition, interleaving and other methods known to those skilled in the art. However, these
6/22 methods increase overhead. Therefore, an engineering compromise must be sought between the security of the information signal transmission and the degree of overhead. Even with the protection discussed above of the information signal, the conditions of the communication channel can deteriorate to such an extent that the destination station will probably not be able to decode (suppress) some of the packets. In systems of exclusive data communication that allow the communication of a feedback from a destination terminal to the originating terminal, a solution is to retransmit the non-decoded packets through an Automatic Retransmission Request (ARQ) made by the destination station to the station of origin. However, under certain conditions, the ARQ may overload the communication system. In addition, as discussed with respect to broadcast communication systems, subscribers do not communicate back to the base station. Consequently, other information protection devices are desirable.
Copending order Serial No. 09/933 912, entitled METHOD AND SYSTEM FOR UTILIZATION OF AN OUTER DECODER IN A BROADCAST SEWRVICES COMMUNICATION SYSTEM, filed on August 20, 2001 and assigned to the assignee of the present invention, discusses in detail the use of an external decoder in a broadcast system. As described in copending order No. Serial 09/933 912, the bitstream of information to be transmitted is first encoded by an external decoder, and the encoded stream is then encoded by an internal encoder. As shown in Figure 1, the stream of information bits to be transmitted, 102, which originates in higher layers, is supplied to a transmission buffer (104). The transmission buffer
7/22 is shown in more detail in figure 2. With reference to figure 2, the bits fill the systematic part 204 (1) of the transmission store 104 (of figure 1) line by line, from left to right. The systematic part 204 (1) comprises lines k, 208, of length L. Again with reference to figure 1, since the systematic part 204 (4) (of figure 2) is full, the external block encoder 106 is activated in order to perform column decoding of the bits in the systematic part 204 (1) (of figure 2) in order to generate additional lines (nk), 210 (of figure 1), of parity bits. This column operation is performed column by column for external binary code, that is, m = 1. For non-binary code, that is, m> 1, each adjacent column m in a row is treated as a symbol of m bits. The m bit symbols along the top k lines are read by the external encoder in order to produce m bit nk symbols that fill the corresponding lower nk lines of these columns.
The external encoder comprises, for example, a systematic Reed-Solomon (RS) encoder. Again with reference to figure 1, the contents of the transmission store 104 are then supplied to a physical layer, 108. In physical layer 108, the individual frames are encoded by an internal encoder which results in encoded frames, internal encoder is notoriously known to the skilled in the art. Systematic lines and storage parity lines can be interlaced during transmission, in order to reduce the likelihood of a large number of systematic lines erased when the total number of internal code deletions exceeds the ability to correct the external code. The frames are also processed according to a modulation scheme not shown),
8/22 selected, such as, for example, cdma2000, WCDMA, UMTS and other modulation schemes known to those skilled in the art. The processed frames are then transmitted through a communication channel, 110.
The transmitted frames are received at the destination station and supplied to a physical layer, 112. At physical layer 112, the individual frames are demodulated and supplied to an internal decoder (not shown). The internal decoder decodes each frame and, if the decoding is successful, outputs a correctly decoded frame; or, if the decoding is unsuccessful, declares a deletion. Decoding success or failure must be determined with high accuracy, achieved, for example, by including an extensive cyclic redundancy check (CRC) (such as, for example, 16 bits) in the frame after external encoding and before encoding internal. The included CRC obtained from the decoded frame is compared with a CRC calculated from the bits of the decoded frame and, if the two CRCs are identical, the decoding is declared successful.
If the internal decoder cannot decode the frame, the decoder declares a deletion and provides an external block decoder, 116, with an indication that the frame is missing. The process continues until there are as many parity frames received correctly and passed to a parity portion, 114 (2), from a receiving store 114 as existing systematic deleted frames. 0 receiver stops receiving any remaining frames, and the external decoder (not shown) is activated in order to recover the systematic deleted frames. The systematic frames recovered are passed to the upper layer.
9/22
It is well known in the art that the computational complexity of decoding / correcting errors increases with the increase in the number of lines in the transmission store 104. Since the computational complexity of decoding / correcting errors affects the hardware complexity in the terminal reception as well as energy consumption, there is a need in the art for a method and a system.
SUMMARY
The modalities presented here meet the needs mentioned above by presenting a method and a system that executes the method by encoding systematic bits in each of a plurality of stores with an external code; by multiplexing the content of the plurality of stores; and by encoding the multiplexed content with an internal code, in order to obtain a set of frames.
In another aspect of the invention, the frameset received is decoded by an internal decoder; correctly decoded frames are demultiplexed to a plurality of stores; and the contents of each store are also processed. If the systematic part of a store has been decoded correctly, processing comprises providing the contents of the systematic part to higher layers. Alternatively, if it is determined that the decoding of the contents of the store by an external decoder retrieves the systematic part, the external decoder is activated and the recovered content, together with the content correctly received from the systematic part, is provided to higher layers.
BRIEF DESCRIPTION OF THE DRAWINGS
10/22
Figure 1 illustrates the physical layer processing of the prior art;
Figure 2 illustrates a transmission store;
Figure 3 illustrates the processing of the physical layer according to an embodiment of the invention.
DETAILED DESCRIPTION
Definitions
The word exemplary is used here to mean serving as an example, case or illustration. Any modality described here as an example should not necessarily be understood as preferred or advantageous in relation to other modalities.
The term point-to-point communication is used here as meaning communication between two subscriber stations via a dedicated communication channel.
The term broadcast communication or point-to-point communication is used here as meaning a communication in which a plurality of subscriber stations are receiving communication from a source.
The term packet is used here to mean a group of bits, which includes data (payload) and control elements, arranged in a specific format. The control elements comprise, for example, a preamble, a quality criterion and others known to those skilled in the art. The quality criterion comprises, for example, a cyclic redundancy check (CRC), a parity bit and others known to those skilled in the art.
The term access network is used here as meaning a gathering of base stations (BS) and one or more controllers of base stations. The access network
11/22 carries data packets between multiple subscriber stations. The access network can also be connected to additional networks outside the access network, such as, for example, an associated intranet or the Internet, and can carry data packets between each access terminal and such external networks.
The term base station is used here as meaning the hardware with which the subscriber stations communicate. Cell refers to the hardware or geographic coverage area, depending on the context in which the term is used. A sector is a partition of a cell. Since a sector has the attributes of a cell, the teachings described in terms of cells are readily extended to sectors.
The term subscriber station is used here as meaning the hardware with which an access network communicates. A subscriber station can be mobile or stationary. A subscriber station can be any data device that communicates over a wireless channel or through a connected channel, such as, for example, using fiber optics or coaxial cables. A subscriber station can also be any of a number of device types that include, but are not limited to, a PC card, compact flash, external or internal modem, or cordless or corded telephone. A subscriber station that is in the process of establishing an active traffic channel connection to a base station is said to be in a connection establishing condition. A subscriber station that has established an active traffic channel connection to a base station is called an active subscriber station, and is said to be in a traffic condition.
12/22
The term physical channel is used here as meaning a communication route through which a signal propagates, described in terms of modulation and coding characteristics.
The term logical channel is used here as meaning a communication route within the protocol layers or the base station or the subscriber station.
The expression channel / communication link is used here as meaning a physical channel or a logical channel according to the context.
The term channel / reverse link is used here to mean a communication channel / link through which the subscriber station sends signals to the base station.
A direct channel / link here means a communication channel / link through which a base station sends signals to a subscriber station;
The expression soft handoff is used here as meaning communication between a subscriber station and two or more sectors, where each sector belongs to a different cell. Reverse link communication is received by both sectors, and direct link communication is simultaneously carried on direct links from two or more sectors.
The term softer handoff is used here as meaning a communication between a subscriber station and two or more sectors, where each sector belongs to the same cell. The reverse link communication is received by both sectors, and the direct link communication is simultaneously carried on one of the direct links of the two or more sectors.
The term erasure is used here to mean failure to recognize a message.
as
13/22
The term dedicated channel is used here as meaning a channel modulated by information specific to an individual subscriber station.
The term common channel is used here as meaning a channel modulated by information shared between all subscriber stations.
The term physical layer is used exclusively here as meaning the part of the communication protocol between a source terminal and a destination terminal that is responsible for transmitting a reception of data. The physical layer corresponds to Layer 1 in the International Standards Organization model for interconnecting Open Systems.
The term upper layer (s) is used here exclusively to mean the part of the communication protocol between a source terminal and a destination terminal that is above a physical layer. The upper layers correspond to Layers 2 to 7 in the International Standards Organization model for interconnecting Open Systems.
description
According to an embodiment of the present invention, as shown in figure 3, the stream of information bits to be transmitted 302, which originates in the upper layers, is demultiplexed and supplied to the transmission stores 304 (i). The bits fill the systematic part 306 (1) of the transmission store 304 (1) line by line, from left to right. The systematic part 306 (1) comprises k lines of length L. In one embodiment, the L extension of the storage coincides with the extension of a radioframe without the overhead (such as, for example, a CRC to assist the internal decoder and the end bits for the internal encoder). Once
14/22 that the systematic part 306 (1) of the transmission store 304 (1) is full, the procedure is repeated for the remaining transmission stores, 304 (2) 304 (p). Once the systematic parts 306 (i) of the transmission stores 304 (i) are full, the external block encoders 310 (i) are activated to perform column encoding of the bits in the systematic part 306 (i) in order to if (nk) additional lines of 308 (i) parity bits are generated. This column operation is performed column by column for external binary code, that is, m = 1. For non-binary code, that is, m> 1, each adjacent column in a row is treated as a symbol of m bits. The m bit symbols along the top k lines are read by the external encoder to produce m nk symbols that fill the corresponding lower nk lines of these columns.
In another embodiment, the L extension of the store is equal to the number of bits of the radio frame without the overhead divided by m, the size of the external encoder code. In this embodiment, the first m lines of the transmission stores 304 (i) are sent on the first radio frame, the second m lines of bits are sent on the second radio frame, until the entire entire store is transmitted. Once the systematic part 306 (1) of the transmission store 304 (1) is full, the procedure is repeated for the remaining transmission stores, 304 (i) - 304 (p). Since the systematic parts 306 (i) of the transmission stores 304 (i) are full, the external block encoders 310 (i) are activated in order to carry out column encoding of the bits in the systematic part 304 (i), in order to generate additional m (nk) lines of parity bits 308 (i). This column operation is performed column by
15/22 column for binary external code, that is, m = 1. For non-binary code, that is, m> 1, each m rows of a column form a symbol of m bits. The k symbols for the top km lines in the column are read by the external encoder in order to produce (nk) m bit symbols that fill the corresponding lower m (nk) lines of this column.
In one embodiment, external encoders 310 (i) comprise a systematic Reed-Solomon (RS) encoder. The content of transmission stores 304 (i) is then supplied to a multiplexer, 312. Multiplexer 312 passes through transmission stores 304 (1) - 304 (p), selecting a successive transmission store 304 (i) after a block of bits, containing a predetermined number of bits, has been sent from a previous storage 304 (i-1). In one embodiment, the predetermined number of bits in a block equals L. This strategy is designed to evenly distribute the data damage caused by the disturbance of a physical channel, 316, among the 304 (i) storage. However, those skilled in the art understand that other multiplexing strategies are equally applicable and can be used without abandoning the spirit or scope of the invention. The multiplexed blocks of bits are supplied to a physical layer, 314, of the originating terminal. At physical layer 314, additional overhead bits (such as a CRC check) are added to each bit block, and the resulting structure is encoded by an internal encoder (not shown), which results in encoded frames . The structure of the external and internal encoders and the multiplexer can be, for example, the structure of the figure
3. The frames are also processed according to a selected modulation scheme. In one mode, the
16/22 systematic decoder processing is performed according to the IS-2000 standard. The processed frames are then transmitted through a communication channel, 316.
The transmitted frames are received at the destination station (not shown) and delivered to a physical layer, 318, at the destination station. At physical layer 318, the individual frames are demodulated and fed to an internal decoder (not shown). In one embodiment, the internal decoder decodes each frame and, if the decoding is successful, outputs a correctly decoded frame; or, if the decoding is unsuccessful, declares a deletion. 0 decoding success or failure must be determined with high accuracy. In one embodiment, accuracy is achieved by including an extensive cyclic redundancy check (CRC) (16 bits, for example) in the frame after external coding and before internal coding, as discussed above. However, those who know the technique recognize that other mechanisms for indicating the quality of the picture can be used. The included CRC obtained from the decoded frame is compared with a CRC calculated from the bits of the decoded frame and, if the two CRCs are identical, the decoding is declared successful. The further processing in the physical layer proceeds according to the result of the internal decoder decision.
The correctly decoded frames are supplied to a demultiplexer, 320, which distributes the decoded frames correctly among the receiving stores 322 (i), using a method opposite to the method used in multiplexing. If all k frames are correctly decoded by the intern to a receiving store
322 (i) specific, the systematic frameworks of the
17/22 systematic 324 (i) of the receiving store 322 (i) are supplied to the higher layers.
If the internal decoder cannot decode the frame, the decoder declares a deletion and provides the demultiplexer 324 with an indication that the frame is missing. The demultiplexer 324 provides the information to the external block decoder 328 (i), coupled in communication to the received 322 (i) storage to which the frame belonged. 0 The process continues until there are sufficient systematic frames and correctly received parity frames accumulated in the systematic part 324 (i) and parity part 326 (i) of the receiving store 322 (i), or until the receiving store 322 (i ) is full. The external decoder (not shown) is then activated to recover the deleted systematic frames. The systematic tables recovered are supplied to the highest layers.
If the total number of frames received correctly in the receiving store 322 (i) is less than k, according to one modality the external decoder is not activated, since there is no guarantee that the decoding would be successful. The correctly received frames, together with the identification of the missing bits, are supplied to the highest layers. In another embodiment, the receiver uses decoded bits from the internal decoder (which are unreliable, as indicated by failed CRC checks) to retrieve bits for the systematic bits. According to one embodiment, the receiver decodes the untrusted bits from the internal decoder and finds the most likely code word. In another modality, the receiver uses the measurement of the signal quality of the deleted frames in the store in order to choose received frames
18/22 sufficiently erroneous with the highest signal-to-noise ratio to form a sub-store with lines k. The receiver then performs the bit reversal (changing a bit value from 0 to a bit value 1 and vice versa in the column at once) and checks whether the bit reversion resulted in a code word. In one embodiment, bit reversal is first performed on the least reliable bits and continues with bits in the order of increasing bit reliability. The reliability of a bit can be determined according to internal decoding criteria, such as, for example, a signal to noise ratio and interference during the frame, such as the Yamamoto criterion, the error rate of recoded symbols, the criterion recoded energy and other criteria known to those skilled in the art, or combinations of criteria. If a codeword has not been found, the bit reversion continues through all remaining columns for all untrusted lines. If the code word has not been found, the bit reversal continues with the increase in the number of bits reversed (that is, changing 2 bits at once, then 3 bits, up to the maximum number of bits), until or a code word is found or all combinations are exhausted. In another modality, CRCs from untrusted lines are used to verify the total success of decoding in this situation. The tables are provided to the highest layers only if the CRCs of all the lines correspond to each other; otherwise, only bits of reliable lines are supplied to the highest layers.
In order to improve decoding reliability, in another modality, demodulation and internal decoding are performed for more than k frames
19/22 correctly received in a store. According to yet another modality, demodulation and internal decoding are performed for all frames in the store. In both modes, external decoding is performed on the k (or km) lines with the highest quality. The quality can be determined according to internal decoding criteria, such as, for example, the signal to noise ratio and interference during the frame, such as the Yamamoto criterion, the error rate of recoded symbols, the recoded energy criterion and other criteria known to those skilled in the art, or combinations of criteria. The use of quality criteria for quality estimation is presented in detail in U.S. Patent No. 5 751 725, entitled METHOD AND APPARATUS FOR DETERMINING THE RATE OF RECEIVED DATA IN A VARIABLE RATE COMMUNICATIONS SYSTEM, and U.S. Patent No. 5 774 496, entitled METHOD AND APPARATUS FOR DETERMINING DATA RATE OF
TRANSMITTED VARIABLE RATE DATA IN A COMMUNICATIONS RECEIVER, both assigned to the assignee of the present invention.
Those skilled in the art will understand that the number of transmit storage 304 and, consequently, receive storage 322, is a compromise between overhead and the degree of potential data loss. A small value of k, which results in more transmit / receive stores, causes more processing overhead. On the other hand, a large value of k, which results in fewer transmit / receive storage, causes the size of the transmission storage to increase, which leads to the disposal of a large block of data if the contents of the transmission storage do not. can be recovered due to more than (nk) line deletions. a
20/22 large transmission storage size increases the memory requirement at the destination terminal.
Those who know the technique would understand that information and signals can be represented using various technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols and chips that can be referred to throughout the description above can be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles or any combination their.
Those who know the technique would also understand that the various blocks, modules, logic circuits and algorithmic steps described in relation to the modalities described here can be implemented as electronic hardware, computer software or combinations of both. In order to clearly illustrate this interchangeability of hardware and software, several components, blocks, modules, circuits and illustrative steps have been described above generically in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the specific application and design restrictions imposed on the system as a whole. Those skilled in the art can implement the described functionality in varying ways for each specific application, but such implementation decisions should not be interpreted as causing an abandonment of the scope of the present invention.
The various blocks, modules and illustrative logic circuits described in relation to the modalities presented here can be implemented or executed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), an arrangement of field programmable ports (FPGA) or other programmable logic device,
21/22 discrete or transistor logic, discrete hardware components or any combination of them designed to perform the functions described here. A general purpose processor can be a microprocessor, but, alternatively, the processor can be any processor, controller, microcontroller or conventional state machine
One per implemented as computing, as, processor can also be a combination of example devices, a combination of DSP and microprocessor, a plurality of microprocessors, one or more microprocessors together with a DSP core, or any other configuration as such.
The steps of a method or algorithm described in connection with the modalities presented here can be embodied directly in hardware, in a software module executed by a processor, or a combination of the two. A software module can reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from, and write information to, the storage medium. Alternatively, the storage medium can be integrated with the processor. The processor and storage medium can reside in an ASIC. The ASIC can reside on a user terminal. Alternatively, the processor and the storage medium can reside as discrete components in a user terminal.
The foregoing description of the modalities covered is presented to allow anyone skilled in the art to create or make use of the present invention. Various
Modifications to these modalities will become readily apparent to those skilled in the art, and the generic principles defined here can be applied to other modalities without abandoning the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the modalities shown here, but it should receive the broadest scope compatible with the principles and unpublished aspects exposed here.
A portion of the exhibit in this 10 patent document contains material that is subject to copyright protection. The copyright owner has no objection to facsimile reproduction by any person of the patent document or patent disclosure, as it appears in the patent or trademark file of the Trademark and Patent Office, but reserves all rights. copyright, whichever they are.
Contents5
33 members in 12 offices
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 97659101 | United States of America | A | |
| 0232052 | United States of America | W |
Members33
| Document | Office | Kind | |
|---|---|---|---|
| US2003072384A1 | United States of America | A1 | |
| WO03034598A2 | World Intellectual Property Organization (WIPO) | A2 | |
| AU2002342013A1 | Australia | A1 | |
| WO03034598A3 | World Intellectual Property Organization (WIPO) | A3 | |
| TW569544B | Taiwan Province of China | B | |
| KR20040041687A | Republic of Korea | A | |
| EP1435134A2 | European Patent Office (EPO) | A2 | |
| CN1602588A | China | A | |
| JP2005532701A | Japan | A | |
| BR0213215AThis record | Brazil | A | |
| KR100892891B1 | Republic of Korea | B1 | |
| JP4274942B2 | Japan | B2 | |
| US7649829B2 | United States of America | B2 | |
| US2010107041A1 | United States of America | A1 | |
| EP1435134B1 | European Patent Office (EPO) | B1 | |
| AT470994T | Austria | T | |
| ATE470994T1 | Austria | T1 | |
| DE60236677D1 | Germany | D1 | |
| CN101848064A | China | A | |
| EP2239856A2 | European Patent Office (EPO) | A2 | |
| CN101867448A | China | A | |
| EP2242181A2 | European Patent Office (EPO) | A2 | |
| US2010272124A1 | United States of America | A1 | |
| EP2242181A3 | European Patent Office (EPO) | A3 | |
| EP2239856A3 | European Patent Office (EPO) | A3 | |
| CN1602588B | China | B | |
| CN101867448B | China | B | |
| EP2242181B1 | European Patent Office (EPO) | B1 | |
| EP2239856B1 | European Patent Office (EPO) | B1 | |
| ES2402472T3 | Spain | T3 | |
| CN101848064B | China | B | |
| US8713400B2 | United States of America | B2 | |
| US8730999B2 | United States of America | B2 |
2 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Patent lapsed as no evidence of payment of the annual fee has been furnished to inpi [chapter 8.11 patent gazette]LapsedREFERENTE AO DESPACHO 8.6 PUBLICADO NA RPI 2274 DE 05/08/2014.B08K | B08K | |
| Application dismissed because of non-payment of annual fees [chapter 8.6 patent gazette]REFERENTE A 12A ANUIDADE.B08F | B08F |
Numbers
- Application
- 213215
Titles2
- Portuguese
- codificação e decodificação concatenada para protocolo de comunicação de múltiplas camadas
- English
- concatenated encoding and decoding for multi-layer communication protocol
Classification
- CPC, 8
- H04L1/0057
- H04L27/26
- H03M13/2909
- H03M13/293
- H03M13/2936
- H04L1/0041
- H04L1/0045
- H04L1/0066
- IPC, 4
- H03M13 29
- H03M13 15
- H04J3 00
- H04L1 00