Network for permutation or de-permutation utilized by channel coding algorithm
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H03M-013/27
H03M-013/45
출원번호
UP-0414433
(2006-04-28)
등록번호
US-7856579
(2011-02-14)
발명자
/ 주소
Zheng, Yan-Xiu
출원인 / 주소
Industrial Technology Research Institute
대리인 / 주소
Alston & Bird LLP
인용정보
피인용 횟수 :
2인용 특허 :
20
초록▼
A network for channel coding permutation and de-permutation comprises: a first side and a second side, each of which has at least one terminal. The network further comprises: two or more columns of nodes located between the first and second sides. A first column of the columns interfaces the first s
A network for channel coding permutation and de-permutation comprises: a first side and a second side, each of which has at least one terminal. The network further comprises: two or more columns of nodes located between the first and second sides. A first column of the columns interfaces the first side, and a second column of the columns interfaces the second side. Each of the columns comprises at least one node. Each node of the columns is connected to a first number of nodes of each of adjacent columns next to the columns. The first number is identical for all the nodes in the network. The nodes which are selected as switches are concurrently controlled to perform switching operations. A method of operating said network comprises the following steps: determining a direction that a data flow flowing from the first side to the second side; determining control elements of control signals; associating each of the control elements to one of the switching operations of the nodes which are selected as switches; providing a control sequence composed of the control signals; providing a data flow to be manipulated; reading at least one control element of the control signals; performing a switching operation of the switching operations for the nodes depending on the at least one control element of the control signals which is read; and transmitting at least one part of the data flow through paths established by the switching operations of the nodes.
대표청구항▼
What is claimed is: 1. A network for channel coding permutation and de-permutation, which comprises a first side and a second side, wherein each of the first side and second side has at least one terminal, the terminals of the first side are a posteriori probability (APP) decoders and the terminals
What is claimed is: 1. A network for channel coding permutation and de-permutation, which comprises a first side and a second side, wherein each of the first side and second side has at least one terminal, the terminals of the first side are a posteriori probability (APP) decoders and the terminals of the second side are memory buffers, said network comprising: two or more columns of nodes located between the first and second sides, wherein a first column of said columns interfaces the first side, and a second column of said columns interfaces the second side; wherein each of said columns comprises at least one node; wherein each node of said columns is connected to a first number of nodes in each of adjacent columns next to said columns, and said first number is identical for all the nodes in the network; and wherein the nodes which are selected as switches are concurrently controlled to perform switching operations. 2. The network as claimed in claim 1, wherein each of said columns comprises a second number of nodes and the second number is identical for each of said columns. 3. The network as claimed in claim 1, wherein the terminals of the first side and second side have an exclusive node in the first column and second column respectively, and each of the terminals is connected to each of the exclusive nodes. 4. The network as claimed in claim 1, wherein the nodes which are selected as switches are nodes of the first column, if a predetermined direction of data flow through the network is from the first side to the second side. 5. The network as claimed in claim 1, said network comprising form of an OMEGA network. 6. The network as claimed in claim 1, said network comprising form of a Benes network. 7. The network as claimed in claim 1, said network comprising form of a fat tree network. 8. The network as claimed in claim 1, said network comprising form of a network used in Winograd Fourier Transform. 9. The network as claimed in claim 1, wherein a terminal of the terminals of the first side is combined with another terminal of the first side, and a terminal of the terminals of the second side is combined with another terminal of the second side. 10. The network as claimed in claim 9, wherein the connections between the nodes and the terminals are combined to form a single connection, if said connections overlap and are identical. 11. The network as claimed in claim 1, wherein a node of the nodes in a column of said columns is combined with another node in the same column. 12. The network as claimed in claim 11, wherein the connections between the nodes are combined to form a single connection, if said connections overlap and are identical. 13. The network as claimed in claim 1, wherein each terminal of the first side serves to be connected to a terminal of another network claimed in claim 1 at the second side. 14. The network as claimed in claim 13, wherein the terminal of the first side and the terminal of said another network at the second side are combined together, and serve as a node after the combination. 15. The network as claimed in claim 14, wherein the node after the combination also serves as a buffer. 16. The network as claimed in claim 1, wherein each terminal of the second side serves to be connected to a terminal of another network claimed in claim 1 at the first side. 17. The network as claimed in claim 16, wherein the terminal of the first side and the terminal of said another network at the second side are combined together, and serve as a node after the combination. 18. The network as claimed in claim 17, wherein the node after the combination also serves as a buffer. 19. A network for channel coding permutation and de-permutation, which comprises a first and a second side, wherein each fo the first side and second side has at least one terminal, the terminals of the first side are intra-block permuters and the terminals of the second side are memory buffers, said network comprising: two or more columns of nodes located between the first and second sides, wherein a first column of said columns interfaces the first side, and a second column of said columns interfaces the second side; wherein each of said columns comprises at least one node; wherein each node of said columns is connected to a first number of nodes in each of adjacent columns next to said columns, and said first number is identical for all the nodes in the network; and wherein the nodes which are selected as switches are concurrently controlled to perform switching operations. 20. The network of claim 19, wherein each of the terminals of the first side and second side has an exclusive node in the respective first column and second column, and each of the terminals is connected to one of the exclusive nodes. 21. The network as claimed in claim 19, wherein a first terminal of one of the first side and second side is combined with a second terminal of the same side. 22. The network as claimed in claim 19, wherein a first node in one of the two or more columns is combined with a second node in the same column. 23. The network as claimed in claim 19, wherein each terminal of the first side is combined with each terminal of the second side of another network claimed in claim 14. 24. The network as claimed in claim 23, wherein the combination of the terminal of the first side with the terminal of the second side servers as a node. 25. The network as claimed in claim 24, wherein the combination of the terminal of the first side with the terminal of the second side servers as a buffer. 26. A method of operating a network for channel coding permutation and de-permutation, the network comprising: a first side and a second side, wherein each of the first side and second side has at least one terminal, and two or more columns of nodes are located between the first and second sides, wherein a first column of said columns interfaces the first side, and a second column of said columns interfaces the second side; wherein each of said columns comprises at least one node; wherein each node of said columns is connected to a first number of nodes of each of adjacent columns next to said columns, and said first number is identical for all nodes in the network; and wherein the nodes which are selected as switches are concurrently controlled to perform identical switching operations; the method comprising: determining a direction in which a data flow is effected from the first side to the second side through the network; determining control elements of control signals, and the quantity of the control elements corresponding to said first number; associating each of the control elements with one of the switching operations of the nodes which are selected as switches; providing a control sequence composed of the control signals arranged in a row; providing a data flow to be manipulated; reading at least one of the control signals for all the nodes; performing a switching operation of the switching operations for the nodes according to the control element of the control signals which is read; and transmitting at least one part of the data flow from the first side to the second side through paths established by the switching operations of the nodes. 27. The method as claimed in claim 26, wherein each of the control elements is represented by a binary number. 28. The method as claimed in claim 26, wherein the control elements are numbers within a limited numerical range or set. 29. The method as claimed in claim 26, wherein the quantity of the control elements equals to said first number. 30. The method as claimed in claim 26, wherein the performing a switching operation of the switching operations for the nodes according to the control element of the control signals which is read lasts for a duration substantially long enough in order to transmit at least one data element in each of the input sequences. 31. The method as claimed in claim 26, wherein the data flow is formed by a plurality of input sequences, and each of the input sequences is formed by at least one data element. 32. The method as claimed in claim 31, wherein the number of the input sequences is identical to the number of the terminals of the first side. 33. The method as claimed in claim 31, wherein the size of the data elements is counted in bit or symbol. 34. The method as claimed in claim 26, wherein the performing a switching operation of the switching operations for the nodes according to the control element of the control signals which is read is repeated by reading another control signal of the control sequences in the reading at least one of the control signals for all the nodes after the duration, and then another data element in each of the input sequences is transmitted according to the transmitting at least one part of the data flow from the first side to the second side through paths established by the switching operations of the nodes. 35. The method as claimed in claim 34, wherein said another control signal is chosen according to a predetermined order. 36. The method as claimed in claim 34, wherein said another data element is chosen according to a predetermined order. 37. The method as claimed in claim 34, wherein each of the input sequences is assigned to and transmitted through an exclusive terminal of the first side in the transmitting at least one part of the data flow from the first side to the second side through paths established by the switching operations of the nodes. 38. The method as claimed in claim 34, wherein the number of the data elements of each of the input sequences and the number of the control signals of the control sequence are identical. 39. The method as claimed in claim 34, wherein at least one of the control signals is read more than once in the reading at least one of the control signals for all the nodes, and used by more than once in the performing a switching operation of the switching operations for the nodes according to the control element of the control signals which is read. 40. The method as claimed in claim 34, wherein at least one of the control signals is not read in any of the reading at least one of the control signals for all the nodes. 41. The method as claimed in claim 26, wherein the data flow manipulated by said method can be de-permuted to be the data flow of the providing a data flow to be manipulated by repeating said method again by providing a second control sequence comprising contents identical to said control sequence. 42. The method as claimed in claim 41, wherein the data flow is permuted in an encoder and permuted/de-permuted in a decoder. 43. The method as claimed in claim 41, wherein the control sequence is made different between two or more encoder-decoder pairs. 44. The method as claimed in claim 43, wherein the control sequence is encrypted when delivered from the encoder to the decoder. 45. The method as claimed in claim 44, wherein the control sequence is applied in LDPC. 46. The method as claimed in claim 44, wherein the control sequence is applied in a turbo code.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (20)
Syed Aon Mujtaba, Area-efficient convolutional decoder.
Lee Sue-Kyoung (Cambridge MA) Chin Danny (Mercer NJ), Routing technique for a hierarchical interprocessor-communication network between massively-parallel processors.
Hladik Stephen Michael ; Check William Alan ; Glinsman Brian James ; Fleming ; III Robert Fleming, Satellite communications system utilizing parallel concatenated coding.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.