| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 201 | 상이한 천공 패턴을 이용한 데이터 패킷 반복 송/수신 장치및 그 방법 | KR1020080093769 | 2008-09-24 | KR1020090064290A | 2009-06-18 | 김판수; 이인기; 장대익; 이호진; 김남식; 송봉섭; 박현철 |
| An apparatus and a method for transmitting and receiving data packets repeatedly are provided to prevent signal attenuation and a fading phenomenon in a high speed mobile environment by additionally transmitting a parity bit with different punching pattern repeatedly and channel-encoding and transmitting the same information bit stream repeatedly. A dual data generator(200) redundantly produces the same information stream every information bit stream to be transmitted. A dual channel encoder(202) divides redundantly produced information bit streams into a plurality of information bits. The dual channel encoder generates the coded data packet including a plurality of parity bits according to different punching patterns for divided information bit. A dual interleaver(204) interleaves the coded data packets generated in the dual channel encoder. A transmitter(205) successively transmits the generated coded data packets. | ||||||
| 202 | 저밀도 패리티 검사 부호에 대한 레이어링된 합곱 복호방법 | KR1020070041746 | 2007-04-30 | KR1020080096889A | 2008-11-04 | 이승준; 권동승; 하정석; 권진희 |
| A layered sum-product decoding method increases a conversion speed of the decoder by propagating the updated information of the variable node quickly. A plurality of inspection nodes and a plurality of variable nodes are defined from the parity check matrix corresponding to the parity check code word. A layer of the plurality of check nodes is determined by using a step recovery order of the punched variable node corresponding to the punched bit of the plurality of variable nodes(S320). The plurality of check nodes are divided into the plurality of sub sets so that the check nodes with the same layer belong to the same sub set(S330). A parity check code word is decoded by using the plurality of sub sets. The step recovery order of the punched variable node represents the repetition frequency required for recovering the punched variable node through the plurality of the check nodes. | ||||||
| 203 | 복수의 레이어들을 이용하여 ＬＤＰＣ 복호화를 수행하는방법 | KR1020070025504 | 2007-03-15 | KR1020080084178A | 2008-09-19 | 조기형; 허준; 신유철; 최성훈 |
| A method for performing a low density parity check code decoding using a plurality of layers is provided to have faster convergence speed by transferring more information based on a layered decoding process adapted to a low density parity check code using a punctured scheme through a less repeated decoding process than a sequentially layered decoding. A method for performing a low density parity check code decoding using a plurality of layers includes the steps of: receiving a signal corresponding to a low density parity check code word having at least one punctured parity bit from a transmission terminal; determining a sequence for a plurality of layers based on the number of punctured received signal of at least one parity bit corresponding to each of the layers; decoding the low density parity check code word using the layers sequentially based on the sequence. The parity bit is corresponding to a non-zero element of each of the layers. | ||||||
| 204 | 정보 부호화 장치, 정보 복호 장치, 정보 부호화 방법 및정보 복호 방법 | KR1020060111888 | 2006-11-13 | KR1020080001581A | 2008-01-03 | 사카키에이지 |
| An apparatus and a method for encoding information, and an apparatus and a method for decoding the information are provided to reduce a circuit size without recording all puncturing patterns by locating the puncturing position within a continuous range. An apparatus for encoding information includes a coding unit(155), a codeword data deleting unit(156), a puncturing start position recording unit(176), and a puncturing end position recording unit(177). The coding unit generates a codeword by encoding an information bit column using a predetermined check matrix. The codeword data deleting unit deletes data of a predetermined range of the generated codeword data. If the predetermined check column is divided into a partial matrix of the same number with a row weight value of the check matrix in a column direction, a row weight of each partial matrix is one. The puncturing start position recording unit records a puncturing start position. The puncturing end position recording unit records a puncturing end position. The codeword data deletion unit deletes data of a range from the puncturing start position to the puncturing end position of the generated codeword. | ||||||
| 205 | 저밀도 패러티 검사 부호의 효율적인 천공 방법 | KR1020050000851 | 2005-01-05 | KR1020060080448A | 2006-07-10 | 권종형; 황찬수; 황금찬; 박효열; 강재원 |
| 본 발명의 LDPC 부호 천공 방법에서는, 원하는 모부호(mother code)와 천공비트 수(P)를 정하고, 검사노드들과 상기 검사노드들에 연결되는 비트노드들로 구성되는 이분 그래프(bipartite graph)상에서 각 검사노드에 연결된 천공된 비트노드들을 계수하는 검사노드 별 천공계수기들의 값(PC)을 0으로 초기화하고, 전체 검사노드들의 천공 계수기의 상한인 라운드의 값(R)을 1로 초기화하고, 상기 검사노드들의 천공계수기 값들이 균일해 지도록 하는 패턴으로 상기 천공비트 수(P) 만큼 비트노드들을 천공한다. 본 발명의 천공 방법에서는 검사노드 관점에서의 균일한 천공 패턴으로 천공하기 때문에, 신뢰도 확산(Belief Propagation) 알고리즘으로 복호하게 될 경우 전체 부호화 블록 내의 정보들이 한쪽에 치우치지 않고 골고루 퍼지게 되고, 조기 반복 복호 종료가 되어 우수한 성능을 얻을 수 있다. 저밀도 패러티 검사 (LDPC), 검사노드(check node), 비트노드 (bit node), 천공(puncture) | ||||||
| 206 | 부호비트 펑처링/디펑처링 방법 | KR1020020088270 | 2002-12-31 | KR1020040061961A | 2004-07-07 | 김만제 |
| PURPOSE: A code bit puncturing/de-puncturing method is provided to simplify logic for puncturing of a sending end and de-puncturing of a receiving end in a communication system supporting a flexible data rate. CONSTITUTION: A temporary value(L) is set and then determined whether it is greater than 2N(S11). If the temporary value(L) is greater, a new temporary value is obtained by subtracting 2N from the temporary value(L) and 'i' is increased(i+1)(S12). Since 'k' is sequentially increased, a different new temporary value is generated by adding 'L' to the new temporary value at every loop(S14). | ||||||
| 207 | 부호비트 펑처링 방법 및 장치 | KR1020020084430 | 2002-12-26 | KR1020040057662A | 2004-07-02 | 박종원 |
| PURPOSE: A method and an apparatus for puncturing code bits are provided to simplify a puncturing process of the code bits and a structure of hardware by improving a puncturing method and a puncturing apparatus. CONSTITUTION: The second temporary value of a code bit is decided by assigning the first temporary value to the inputted code bit and comparing the first temporary value with the total input bit number(S10-S14). A puncturing process is performed when the second temporary value of the code bit is smaller than the puncturing coefficient or the third temporary number by adding the puncturing coefficient to the second temporary value of the code bit(S15-S18). The third temporary number is decided as new temporary value and the above processes are repeatedly performed as much as the total input bit number. | ||||||
| 208 | 병렬 펑쳐링 알고리즘의 파라미터 최적화 방법 | KR1019990035023 | 1999-08-23 | KR1020010018890A | 2001-03-15 | 윤영우; 홍성권; 권성락; 김기준 |
| PURPOSE: A method of optimizing parameters of a parallel puncturing algorithm is provided to satisfy uniformed puncturing matching rates of up-link channel codes and optimize channel symbol rates in the puncturing algorithm for rate matching in a W-CDMA wireless communication system. CONSTITUTION: In matching data rates including three bit columns(x,y,z), a method of optimizing parameters of a parallel puncturing algorithm does not conduct puncturing of the first bit column(x) but conducts puncturing sequentially of the second and third bit columns(y,z) using parameters co-ordinating the positions of code bits. Similarly when code bits are divided into columns of systematic bit, first parity and second parity, the parameters co-ordinating the positions of code bits conduct puncturing only of the first and second parity columns, leaving the systematic bit column without puncturing. | ||||||
| 209 | 디지털 통신을 위한 길쌈 부호화 천공 장치및 방법 | KR1019980036975 | 1998-09-08 | KR1020000019060A | 2000-04-06 | 심명섭 |
| PURPOSE: A convolutional coding perforator for digital communication and methode thereof is provided to improve a timing for an input of information bit and an output of symbol by using a FIFO memory. CONSTITUTION: The convolutional coding perforator for digital communication and methode thereof comprises: a FIFO memory(210) for outputting a received information bit from a data source if a read signal is activated; a convolutional coder(220) for performing a convolutional coding for the information bit to a symbol if a coding signal is activated; a symbol selector(230) for exchanging each bit of the symbol to each other if an exchange signal is activated; a latch(240) for outputting the exchanged symbol to a punched convolutional coding output signal; and a controller(250) for generating a useful signal to represent the read signal, the coding signal, the exchange signal, the renewed signal, and the punched convolutional coding output signal. | ||||||
QQ群二维码
意见反馈
意见反馈