US20110109486A1 - Pseudo-orthogonal code generator - Google Patents

Pseudo-orthogonal code generator Download PDF

Info

Publication number
US20110109486A1
US20110109486A1 US12/646,993 US64699309A US2011109486A1 US 20110109486 A1 US20110109486 A1 US 20110109486A1 US 64699309 A US64699309 A US 64699309A US 2011109486 A1 US2011109486 A1 US 2011109486A1
Authority
US
United States
Prior art keywords
pseudo
orthogonal code
bit
code generator
combined circuit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
US12/646,993
Other versions
US7944374B1 (en
Inventor
Yongseong KIM
Kyeunghak Seo
Jinwoong Cho
Hyunseok Lee
Taigil Kwon
Yongseok Lim
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.)
Korea Electronics Technology Institute
Original Assignee
Korea Electronics Technology Institute
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 Korea Electronics Technology Institute filed Critical Korea Electronics Technology Institute
Assigned to KOREA ELECTRONICS TECHNOLOGY INSTITUTE reassignment KOREA ELECTRONICS TECHNOLOGY INSTITUTE ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CHO, JINWOONG, KIM, YONGSEONG, KWON, TAIGIL, LEE, HYUNSEOK, LIM, YONGSEOK, SEO, KYEUNGHAK
Publication of US20110109486A1 publication Critical patent/US20110109486A1/en
Application granted granted Critical
Publication of US7944374B1 publication Critical patent/US7944374B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation

Definitions

  • This following description relates to a pseudo-orthogonal code generator, and more particularly, to a pseudo-orthogonal code generator that minimizes the complexity of a pseudo-orthogonal code generator and improves the operating speed in a radio transmitting system using pseudo-orthogonal codes.
  • a conventional orthogonal code generator requires 16 code bits for transmission of total 4 bits.
  • the efficiency of the transmission channel is deteriorated due to an extremely low spectral efficiency of no more than 0.25( 4/16).
  • Korean Patent No. 0761669 issued on Sep. 19, 2007, describes a pseudo-orthogonal code generator having better spectral efficiency than a conventional orthogonal code generator.
  • Equation 1 the contents of the pseudo-orthogonal code memory, for example, the relationship between the input address and the output code, may be expressed by Equation 1.
  • the spectral efficiency becomes 0.5625( 9/16) by converting a 9-bit size transmission information data into a pseudo-orthogonal code in accordance with Walsh-Hadamard code table as shown in Table 1.
  • the spectral efficiency is enhanced by 225% in comparison to the conventional orthogonal code generator.
  • the pseudo-orthogonal code generator of Korean Patent No. 0761669 requires four multiplexers and three adders in addition to a 9-bit serial-to-parallel converter, a 512 ⁇ 16-bit ROM, and a 1-bit parallel-to-serial converter.
  • the configuration is very complicated and the overall size becomes larger due to the much enlarged gate area when the pseudo-orthogonal code generator is fabricated as an application specific integrated circuit (ASIC).
  • ASIC application specific integrated circuit
  • a pseudo-orthogonal code generator comprising a serial-to-parallel converter which converts a serial transmission data into a 9-bit parallel data, a 4-bit counter which repeatedly counts from 0 to 15, and a combined circuit unit which sequentially generates 16-bit pseudo-orthogonal codes using the 9-bit parallel data and the 4-bit counter values, wherein the combined circuit unit is comprised of
  • C(I) is a pseudo-orthogonal code of the 9-bit parallel data for 0 ⁇ I ⁇ 15
  • b 0 ⁇ b 8 are said parallel data
  • i 0 ⁇ i 3 are the 4-bit counter values binarized from the I which corresponds to an index for 16-bit pseudo-orthogonal code.
  • the pseudo orthogonal code generator may further comprise a 2 ⁇ 1 multiplexer which converts a logic value outputted from the combined circuit unit into a real value.
  • a pseudo-orthogonal code generator comprising a serial-to-parallel converter which converts a serial transmission data into a 9-bit parallel data, a 4-bit counter which repeatedly counts from 0 to 15, and a combined circuit unit which sequentially generates 16-bit pseudo-orthogonal codes using the 9-bit parallel data and the 4-bit counter values, wherein the combined circuit unit is comprised of
  • C(I) is a pseudo-orthogonal code of the 9-bit parallel data for 0 ⁇ I ⁇ 15
  • b 0 ⁇ b 8 are the parallel data
  • i 0 ⁇ i 3 are 4-bit counter values binarized from the I which corresponds to an index for 16-bit pseudo-orthogonal code.
  • the pseudo orthogonal code generator may further comprise a 2 ⁇ 1 multiplexer which converts the values of the logic output from said combined circuit unit into a real value.
  • FIG. 1 is a diagram illustrating a conventional pseudo orthogonal code generator.
  • FIG. 2 is a diagram illustrating an example of a pseudo orthogonal code generator.
  • FIG. 3 is a diagram illustrating another example of a pseudo orthogonal code generator.
  • FIG. 4 is an example of a timing diagram of the pseudo orthogonal code generators in FIG. 2 and FIG. 3 .
  • FIG. 2 illustrates an example of a pseudo-orthogonal code generator.
  • the example pseudo-orthogonal code includes a serial-to-parallel converter 10 , a combined circuit unit 100 , and a 4-bit counter 200 .
  • the serial-to-parallel converter 10 converts transmitting data that is serially inputted in single bits into a 9-bit parallel data.
  • the 4-bit counter 200 repeatedly counts from 0 to 15.
  • the combined circuit unit 100 sequentially generates 16-bit pseudo-orthogonal codes using the 9-bit parallel data from the output of the serial-to-parallel converter 10 and count values (i 0 ⁇ i 3 ) of the 4-bit counter 200 .
  • the internal configuration of the combined circuit unit 100 may be expressed by Equation 2.
  • C(I) is a pseudo-orthogonal code of the 9-bit parallel data for 0 ⁇ I ⁇ 15
  • b 0 ⁇ b 8 are the parallel data.
  • i 0 ⁇ i 3 are the 4-bit counter values binarized from 1 that corresponds to an index for 16-bit pseudo-orthogonal code.
  • the example combined circuit unit 100 shown in FIG. 2 includes five combined circuits 110 , 120 , 130 , 140 , and 150 .
  • the first combined circuit 110 performs a logic operation as described in the first line of Equation 2 and outputs an interim result value (cb 0 ).
  • the second combined circuit 120 performs a logic operation as described in the second line of Equation 2 and outputs an interim result value (cb 1 ).
  • the third combined circuit 130 performs a logic operation as described in the third line of Equation 2 and outputs an interim result value (cb 2 ).
  • the fourth combined circuit 140 performs a logic operation as described in the fourth line of Equation 2 and outputs an interim result value (cb 3 ).
  • the fifth combined circuit 150 performs a logic operation as described in the fifth line of Equation 2 using the interim result values (cb 0 ⁇ cb 3 ) of the first through fourth line which are the outputs of the first, second, third and fourth combined circuits ( 110 - 140 ), and sequentially outputs the final logic values to form a 16-bit pseudo orthogonal code for each bit.
  • the pseudo-orthogonal code generator may comprise a 2 ⁇ 1 multiplexer.
  • the 2 ⁇ 1 multiplexer 160 may be implemented outside of the combined circuit unit 100 .
  • FIG. 3 is a diagram illustrating another example of a pseudo-orthogonal code generator.
  • the pseudo-orthogonal code generator of FIG. 3 has the same configuration as the pseudo-orthogonal code generator of FIG. 2 . Thus a description is omitted.
  • the fifth combined circuit 150 ′ of the combined circuit unit 100 ′ is configured differently than the fifth combined circuit 150 of the combined circuit unit 100 shown in FIG. 2 .
  • the internal configuration of the combined circuit unit 100 may be expressed by Equation 3.
  • a pseudo orthogonal code may be generated easily and quickly through logic operations of the 9-bit transmission data and 4-bit counter value using the combined circuit units 100 , 100 ′.
  • FIG. 4 is an example of a timing diagram of a pseudo orthogonal code generator in FIG. 2 and FIG. 3 .
  • a serially inputted transmission data is converted into a parallel data and divided by bit interval (9-bit) using a serial-to-parallel converter 10 , and a 4-bit counter 200 that repeatedly counts from 0 to 15 in sequential manner in this bit interval.
  • the transmission input data values (b 0 ⁇ b 8 ) and 4-bit counter values (i 0 ⁇ i 3 ) are fixed in one chip area.
  • the result values of the combined circuit units 100 and 100 ′ that perform logic operations using these values, are also fixed. And if the logic operations are repeatedly performed every one chip period, a 16-bit pseudo orthogonal code for each serially inputted 9-bit transmission (information) data may be serially outputted.
  • the resulting pseudo-orthogonal code may be modulated using a Quadrature phase-shift keying (QPSK).
  • QPSK Quadrature phase-shift keying
  • the serially outputted pseudo-orthogonal codes are symbolized by 2-bit parallel processing
  • a QPSK modulation can be performed
  • the pseudo-orthogonal codes are symbolized by 3-bit parallel processing
  • an 8PSK modulation is possible
  • the pseudo-orthogonal codes are symbolized by 4-bit parallel processing
  • a 16QAM modulation is possible
  • the pseudo-orthogonal codes are symbolized by 5-bit parallel processing
  • 32QAM modulation is possible
  • 6-bit parallel processing a 64QAM modulation is possible
  • a pseudo orthogonal code generator of this invention is not limited to the above described exemplary embodiments, and could be implemented through various modifications within the scope where the technical spirit of this invention permits.

Abstract

A pseudo-orthogonal code generator is provided. The pseudo-orthogonal code generator simplifies overall configuration and provides a more efficient operating speed by implementing a pseudo-orthogonal code generator using combined circuits instead of using a read only memory (ROM) circuit. The pseudo-orthogonal code generator reduces its overall size by reducing gate area.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • This application claims the benefit under 35 U.S.C. §119(a) of a Korean Patent Application No. 10-2009-0107639 filed Nov. 9, 2009 in the Korean Intellectual Property Office, the entire disclosure of which is incorporated herein by reference for all purposes.
    • BACKGROUND
  • 1. Field
  • This following description relates to a pseudo-orthogonal code generator, and more particularly, to a pseudo-orthogonal code generator that minimizes the complexity of a pseudo-orthogonal code generator and improves the operating speed in a radio transmitting system using pseudo-orthogonal codes.
  • 2. Description of the Related Art
  • Table 1 is a Walsh-Hardamard code table that is used in a conventional orthogonal coding method. For example, in a conventional orthogonal code generator receiving four binary signal inputs, the total number of orthogonal codes that a bit row can have from these inputs are 16(=24). In this example, the length of each orthogonal code is always 16 bits as shown in Table 1, and each column of the orthogonal codes are orthogonal to each other.
  • TABLE 1
    WALSH-HARDAMARD CODE TABLE
    Walsh Walsh code
    No. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
    2 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
    3 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0
    4 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1
    5 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0
    6 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 0
    7 0 1 1 0 1 0 0 1 0 1 1 0 1 0 0 1
    8 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1
    9 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0
    10 0 0 1 1 0 0 1 1 1 1 0 0 1 1 0 0
    11 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 1
    12 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0
    13 0 1 0 1 1 0 1 0 1 0 1 0 0 1 0 1
    14 0 0 1 1 1 1 0 0 1 1 0 0 0 0 1 1
    15 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0
  • As described above, a conventional orthogonal code generator requires 16 code bits for transmission of total 4 bits. Thus, the efficiency of the transmission channel is deteriorated due to an extremely low spectral efficiency of no more than 0.25( 4/16).
  • Korean Patent No. 0761669, issued on Sep. 19, 2007, describes a pseudo-orthogonal code generator having better spectral efficiency than a conventional orthogonal code generator.
  • In the pseudo-orthogonal code generator described in Korean Patent No. 0761669, the contents of the pseudo-orthogonal code memory, for example, the relationship between the input address and the output code, may be expressed by Equation 1.
  • C ( i ) = 0.5 × { ( - 1 ) b 2 ⊕ ( i 1 Λ b 1 ) ⊕ ( i 0 Λ b 0 ) + ( - 1 ) b 5 ⊕ i 2 ⊕ ( i 1 Λ b 4 ) ⊕ ( i 0 Λ b 3 ) + ( - 1 ) b 8 ⊕ i 3 ⊕ ( i 1 Λ b 1 ) ⊕ ( i 0 Λ b 6 ) + ( - 1 ) b 2 ⊕ b 5 ⊕ b 8 _ ⊕ i 3 ⊕ i 2 ⊕ ( i 1 Λ ( b 1 ⊕ b 4 ⊕ b 7 ) ) ⊕ ( i 0 Λ ( b 0 ⊕ b 3 ⊕ b 6 ) ) Equation 1
  • Using the pseudo-orthogonal code generator of Korean Patent No. 0761669, the spectral efficiency becomes 0.5625( 9/16) by converting a 9-bit size transmission information data into a pseudo-orthogonal code in accordance with Walsh-Hadamard code table as shown in Table 1. Thus, the spectral efficiency is enhanced by 225% in comparison to the conventional orthogonal code generator.
  • However, the pseudo-orthogonal code generator of Korean Patent No. 0761669 requires four multiplexers and three adders in addition to a 9-bit serial-to-parallel converter, a 512×16-bit ROM, and a 1-bit parallel-to-serial converter. Thus, the configuration is very complicated and the overall size becomes larger due to the much enlarged gate area when the pseudo-orthogonal code generator is fabricated as an application specific integrated circuit (ASIC). In addition to the above problem, there is a disadvantage of a slower operating speed because it uses a ROM.
    • SUMMARY
  • In one general aspect, provided is a pseudo-orthogonal code generator comprising a serial-to-parallel converter which converts a serial transmission data into a 9-bit parallel data, a 4-bit counter which repeatedly counts from 0 to 15, and a combined circuit unit which sequentially generates 16-bit pseudo-orthogonal codes using the 9-bit parallel data and the 4-bit counter values, wherein the combined circuit unit is comprised of
  • cb 0 ( I ) = b 0 ⊕ ( i 1 Λ b 1 ) ⊕ ( i 0 Λ b 2 ) cb 1 ( I ) = b 3 ⊕ i 2 ⊕ ( i 1 Λ b 4 ) ⊕ ( i 0 Λ b 5 ) cb 2 ( I ) = b 6 ⊕ i 3 ⊕ ( i 1 Λ b 7 ) ⊕ ( i 0 Λ b 8 ) cb 3 ( I ) = b 0 ⊕ b 3 ⊕ b 6 _ ⊕ i 3 ⊕ i 2 ⊕ ( i 1 Λ ( b 1 ⊕ b 4 ⊕ b 7 ) ) ⊕ ( i 0 Λ ( b 2 ⊕ b 5 ⊕ b 8 ) ) C ( I ) = ( - 1 ) { [ cb 0 ( I ) _ cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) _ | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) cb 1 ( I ) | cb 2 ( I ) _ | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) _ ] } , 0 ≤ I ≤ 15
  • and, wherein C(I) is a pseudo-orthogonal code of the 9-bit parallel data for 0≦I≦15, b0˜b8 are said parallel data, and i0˜i3 are the 4-bit counter values binarized from the I which corresponds to an index for 16-bit pseudo-orthogonal code.
  • The pseudo orthogonal code generator may further comprise a 2×1 multiplexer which converts a logic value outputted from the combined circuit unit into a real value.
  • In another aspect, provided is a pseudo-orthogonal code generator comprising a serial-to-parallel converter which converts a serial transmission data into a 9-bit parallel data, a 4-bit counter which repeatedly counts from 0 to 15, and a combined circuit unit which sequentially generates 16-bit pseudo-orthogonal codes using the 9-bit parallel data and the 4-bit counter values, wherein the combined circuit unit is comprised of
  • cb 0 ( I ) = b 0 ⊕ ( i 1 Λ b 1 ) ⊕ ( i 0 Λ b 2 ) cb 1 ( I ) = b 3 ⊕ i 2 ⊕ ( i 1 Λ b 4 ) ⊕ ( i 0 Λ b 5 ) cb 2 ( I ) = b 6 ⊕ i 3 ⊕ ( i 1 Λ b 7 ) ⊕ ( i 0 Λ b 8 ) cb 3 ( I ) = b 0 ⊕ b 3 ⊕ b 6 _ ⊕ i 3 ⊕ i 2 ⊕ ( i 1 Λ ( b 1 ⊕ b 4 ⊕ b 7 ) ) ⊕ ( i 0 Λ ( b 2 ⊕ b 5 ⊕ b 8 ) ) C ( I ) = ( - 1 ) { [ cb 0 ( I ) _ cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) _ | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) cb 1 ( I ) | cb 2 ( I ) _ | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) _ ] } , 0 ≤ I ≤ 15
  • and, wherein C(I) is a pseudo-orthogonal code of the 9-bit parallel data for 0≦I≦15, b0˜b8 are the parallel data, and i0˜i3 are 4-bit counter values binarized from the I which corresponds to an index for 16-bit pseudo-orthogonal code.
  • The pseudo orthogonal code generator may further comprise a 2×1 multiplexer which converts the values of the logic output from said combined circuit unit into a real value.
  • Other features and aspects will be apparent from the following detailed description, the drawings, and the claims.
    • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a diagram illustrating a conventional pseudo orthogonal code generator.
  • FIG. 2 is a diagram illustrating an example of a pseudo orthogonal code generator.
  • FIG. 3 is a diagram illustrating another example of a pseudo orthogonal code generator.
  • FIG. 4 is an example of a timing diagram of the pseudo orthogonal code generators in FIG. 2 and FIG. 3.
    •
  • Throughout the drawings and the detailed description, unless otherwise described, the same drawing reference numerals will be understood to refer to the same elements, features, and structures. The relative size and depiction of these elements may be exaggerated for clarity, illustration, and convenience.
    • DETAILED DESCRIPTION
  • The following detailed description is provided to assist the reader in gaining a comprehensive understanding of the methods, apparatuses, and/or systems described herein. Accordingly, various changes, modifications, and equivalents of the methods, apparatuses, and/or systems described herein will be suggested to those of ordinary skill in the art. Also, descriptions of well-known functions and constructions may be omitted for increased clarity and conciseness.
  • FIG. 2 illustrates an example of a pseudo-orthogonal code generator. Referring to FIG. 2, the example pseudo-orthogonal code includes a serial-to-parallel converter 10, a combined circuit unit 100, and a 4-bit counter 200.
  • The serial-to-parallel converter 10 converts transmitting data that is serially inputted in single bits into a 9-bit parallel data. The 4-bit counter 200 repeatedly counts from 0 to 15. The combined circuit unit 100 sequentially generates 16-bit pseudo-orthogonal codes using the 9-bit parallel data from the output of the serial-to-parallel converter 10 and count values (i0˜i3) of the 4-bit counter 200. The internal configuration of the combined circuit unit 100 may be expressed by Equation 2.
  • cb 0 ( I ) = b 0 ⊕ ( i 1 Λ b 1 ) ⊕ ( i 0 Λ b 2 ) cb 1 ( I ) = b 3 ⊕ i 2 ⊕ ( i 1 Λ b 4 ) ⊕ ( i 0 Λ b 5 ) cb 2 ( I ) = b 6 ⊕ i 3 ⊕ ( i 1 Λ b 7 ) ⊕ ( i 0 Λ b 8 ) cb 3 ( I ) = b 0 ⊕ b 3 ⊕ b 6 _ ⊕ i 3 ⊕ i 2 ⊕ ( i 1 Λ ( b 1 ⊕ b 4 ⊕ b 7 ) ) ⊕ ( i 0 Λ ( b 2 ⊕ b 5 ⊕ b 8 ) ) C ( I ) = ( - 1 ) { [ cb 0 ( I ) _ cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) _ | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) cb 1 ( I ) | cb 2 ( I ) _ | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) _ ] } , 0 ≤ I ≤ 15 Equation 2
  • Referring to Equation 2, C(I) is a pseudo-orthogonal code of the 9-bit parallel data for 0≦I≦15, and b0˜b8 are the parallel data. i0˜i3 are the 4-bit counter values binarized from 1 that corresponds to an index for 16-bit pseudo-orthogonal code.
  • The example combined circuit unit 100 shown in FIG. 2 includes five combined circuits 110, 120, 130, 140, and 150. The first combined circuit 110 performs a logic operation as described in the first line of Equation 2 and outputs an interim result value (cb0). The second combined circuit 120 performs a logic operation as described in the second line of Equation 2 and outputs an interim result value (cb1).
  • The third combined circuit 130 performs a logic operation as described in the third line of Equation 2 and outputs an interim result value (cb2). The fourth combined circuit 140 performs a logic operation as described in the fourth line of Equation 2 and outputs an interim result value (cb3).
  • The fifth combined circuit 150 performs a logic operation as described in the fifth line of Equation 2 using the interim result values (cb0˜cb3) of the first through fourth line which are the outputs of the first, second, third and fourth combined circuits (110-140), and sequentially outputs the final logic values to form a 16-bit pseudo orthogonal code for each bit.
  • In some embodiments, the pseudo-orthogonal code generator may comprise a 2×1 multiplexer. The 2×1 multiplexer 160 converts logic value 02 or 12, which is an output from the 5th combined circuit 150, into a real value of 1 or −1, for example, 1=(−1)0 and −1=(−1)1. In some embodiments, the 2×1 multiplexer 160 may be implemented outside of the combined circuit unit 100.
  • FIG. 3 is a diagram illustrating another example of a pseudo-orthogonal code generator. The pseudo-orthogonal code generator of FIG. 3 has the same configuration as the pseudo-orthogonal code generator of FIG. 2. Thus a description is omitted. In the pseudo-orthogonal code generator of FIG. 3 the fifth combined circuit 150′ of the combined circuit unit 100′ is configured differently than the fifth combined circuit 150 of the combined circuit unit 100 shown in FIG. 2. The internal configuration of the combined circuit unit 100 may be expressed by Equation 3.
  • cb 0 ( I ) = b 0 ⊕ ( i 1 Λ b 1 ) ⊕ ( i 0 Λ b 2 ) cb 1 ( I ) = b 3 ⊕ i 2 ⊕ ( i 1 Λ b 4 ) ⊕ ( i 0 Λ b 5 ) cb 2 ( I ) = b 6 ⊕ i 3 ⊕ ( i 1 Λ b 7 ) ⊕ ( i 0 Λ b 8 ) cb 3 ( I ) = b 0 ⊕ b 3 ⊕ b 6 _ ⊕ i 3 ⊕ i 2 ⊕ ( i 1 Λ ( b 1 ⊕ b 4 ⊕ b 7 ) ) ⊕ ( i 0 Λ ( b 2 ⊕ b 5 ⊕ b 8 ) ) C ( I ) = ( - 1 ) { [ cb 0 ( I ) _ cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) _ | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) cb 1 ( I ) | cb 2 ( I ) _ | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) _ ] } , 0 ≤ I ≤ 15 Equation 2
  • As described above, a pseudo orthogonal code may be generated easily and quickly through logic operations of the 9-bit transmission data and 4-bit counter value using the combined circuit units 100, 100′.
  • FIG. 4 is an example of a timing diagram of a pseudo orthogonal code generator in FIG. 2 and FIG. 3. Referring to FIGS. 2-4, a serially inputted transmission data is converted into a parallel data and divided by bit interval (9-bit) using a serial-to-parallel converter 10, and a 4-bit counter 200 that repeatedly counts from 0 to 15 in sequential manner in this bit interval.
  • As a result, the transmission input data values (b0˜b8) and 4-bit counter values (i0˜i3) are fixed in one chip area. The result values of the combined circuit units 100 and 100′ that perform logic operations using these values, are also fixed. And if the logic operations are repeatedly performed every one chip period, a 16-bit pseudo orthogonal code for each serially inputted 9-bit transmission (information) data may be serially outputted.
  • The resulting pseudo-orthogonal code may be modulated using a Quadrature phase-shift keying (QPSK). For example, if the serially outputted pseudo-orthogonal codes are symbolized by 2-bit parallel processing, a QPSK modulation can be performed, if the pseudo-orthogonal codes are symbolized by 3-bit parallel processing, an 8PSK modulation is possible, if the pseudo-orthogonal codes are symbolized by 4-bit parallel processing, a 16QAM modulation is possible, if the pseudo-orthogonal codes are symbolized by 5-bit parallel processing, a 32QAM modulation is possible, and if the pseudo-orthogonal codes are symbolized by 6-bit parallel processing, a 64QAM modulation is possible
  • A pseudo orthogonal code generator of this invention is not limited to the above described exemplary embodiments, and could be implemented through various modifications within the scope where the technical spirit of this invention permits.
  • A number of exemplary embodiments have been described above. Nevertheless, it will be understood that various modifications may be made. For example, suitable results may be achieved if the described techniques are performed in a different order and/or if components in a described system, architecture, device, or circuit are combined in a different manner and/or replaced or supplemented by other components or their equivalents. Accordingly, other implementations are within the scope of the following claims.

Claims (4)

1. A pseudo orthogonal code generator comprising:
a serial-to-parallel converter which converts a serial transmission data into a 9-bit parallel data;
a 4-bit counter which repeatedly counts from 0 to 15; and
a combined circuit unit which sequentially generates 16-bit pseudo orthogonal codes using the 9-bit parallel data and the 4-bit counter values, wherein the combined circuit unit is comprised of
cb 0 ( I ) = b 0 ⊕ ( i 1 Λ b 1 ) ⊕ ( i 0 Λ b 2 ) cb 1 ( I ) = b 3 ⊕ i 2 ⊕ ( i 1 Λ b 4 ) ⊕ ( i 0 Λ b 5 ) cb 2 ( I ) = b 6 ⊕ i 3 ⊕ ( i 1 Λ b 7 ) ⊕ ( i 0 Λ b 8 ) cb 3 ( I ) = b 0 ⊕ b 3 ⊕ b 6 _ ⊕ i 3 ⊕ i 2 ⊕ ( i 1 Λ ( b 1 ⊕ b 4 ⊕ b 7 ) ) ⊕ ( i 0 Λ ( b 2 ⊕ b 5 ⊕ b 8 ) ) C ( I ) = ( - 1 ) { [ cb 0 ( I ) _ cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) _ | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) cb 1 ( I ) | cb 2 ( I ) _ | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) _ ] } , 0 ≤ I ≤ 15
and, wherein C(I) is a pseudo-orthogonal code of the 9-bit parallel data for 0≦I≦15, b0˜b8 are the parallel data, and i0˜i3 are the 4-bit counter values binarized from the I which corresponds to an index for 16-bit pseudo-orthogonal code.
2. The pseudo orthogonal code generator of claim 1, further comprising a 2×1 multiplexer which converts a logic value outputted from the combined circuit unit into a real value.
3. A pseudo orthogonal code generator comprising:
a serial-to-parallel converter which converts a serial transmission data into a 9-bit parallel data;
a 4-bit counter which repeatedly counts from 0 to 15; and
a combined circuit unit which sequentially generates 16-bit pseudo orthogonal codes using the 9-bit parallel data and the 4-bit counter values, wherein the combined circuit unit is comprised of
cb 0 ( I ) = b 0 ⊕ ( i 1 Λ b 1 ) ⊕ ( i 0 Λ b 2 ) cb 1 ( I ) = b 3 ⊕ i 2 ⊕ ( i 1 Λ b 4 ) ⊕ ( i 0 Λ b 5 ) cb 2 ( I ) = b 6 ⊕ i 3 ⊕ ( i 1 Λ b 7 ) ⊕ ( i 0 Λ b 8 ) cb 3 ( I ) = b 0 ⊕ b 3 ⊕ b 6 _ ⊕ i 3 ⊕ i 2 ⊕ ( i 1 Λ ( b 1 ⊕ b 4 ⊕ b 7 ) ) ⊕ ( i 0 Λ ( b 2 ⊕ b 5 ⊕ b 8 ) ) C ( I ) = ( - 1 ) { [ cb 0 ( I ) _ cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) _ | cb 2 ( I ) | cb 3 ( I ) ] Λ [ cb 0 ( I ) cb 1 ( I ) | cb 2 ( I ) _ | cb 3 ( I ) ] Λ [ cb 0 ( I ) | cb 1 ( I ) | cb 2 ( I ) | cb 3 ( I ) _ ] } , 0 ≤ I ≤ 15
and, wherein C(I) is a pseudo-orthogonal code of the 9-bit parallel data for 0≦I≦15, b0˜b8 are the parallel data, and i0˜i3 are the 4-bit counter values binarized from the I which corresponds to an index for 16-bit pseudo-orthogonal code.
4. The pseudo orthogonal code generator of claim 3, further comprising a 2×1 multiplexer which converts a logic value outputted from the combined circuit unit into a real value.
US12/646,993 2009-11-09 2009-12-24 Pseudo-orthogonal code generator Active US7944374B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR10-2009-0107639 2009-11-09
KR1020090107639A KR101038095B1 (en) 2009-11-09 2009-11-09 Pseudo-Orthogonal Code Generator With Lowest Complexity

Publications (2)

Publication Number Publication Date
US20110109486A1 true US20110109486A1 (en) 2011-05-12
US7944374B1 US7944374B1 (en) 2011-05-17

Family

ID=43959438

Family Applications (1)

Application Number Title Priority Date Filing Date
US12/646,993 Active US7944374B1 (en) 2009-11-09 2009-12-24 Pseudo-orthogonal code generator

Country Status (4)

Country Link
US (1) US7944374B1 (en)
JP (1) JP4931991B2 (en)
KR (1) KR101038095B1 (en)
CN (1) CN102055437B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130070580A1 (en) * 2010-04-02 2013-03-21 Fujitsu Limited Apparatus and method for orthogonal cover code (occ) generation, and apparatus and method for occ mapping
TWI475835B (en) * 2012-09-28 2015-03-01 Raydium Semiconductor Corp Orthogonal code matrix generation method and orthogonal code matrix generation circuit
US10110420B1 (en) * 2016-08-29 2018-10-23 Amazon Technologies, Inc. Orthogonal encoding of diagnostic information in a computer network

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100912543B1 (en) * 2007-06-26 2009-08-18 한국전자통신연구원 Apparatus and Method for Modulation and Demodulation using Frequency Selective Baseband
US8050355B2 (en) * 2008-06-11 2011-11-01 Korea Electronics Technology Institute Transmitter and receiver using pseudo-orthogonal code

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5193094A (en) * 1990-03-07 1993-03-09 Qualcomm Incorporated Method and apparatus for generating super-orthogonal convolutional codes and the decoding thereof
US6167552A (en) * 1997-10-02 2000-12-26 Harris Corporation Apparatus for convolutional self-doubly orthogonal encoding and decoding
US6496474B1 (en) * 1998-03-19 2002-12-17 Fujitsu Limited Spread encoding device and method
US7031369B2 (en) * 2001-01-30 2006-04-18 Matsushita Electric Industrial Co., Ltd. Orthogonal code generating circuit

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4126584B2 (en) * 2001-08-10 2008-07-30 横河電機株式会社 Code generator
JP2003152683A (en) * 2001-11-13 2003-05-23 Matsushita Electric Ind Co Ltd Orthogonal code generating circuit
KR100587788B1 (en) 2004-09-22 2006-06-09 전자부품연구원 Method of optimaly and sub-optimally demodulating constant-amplitude multi-code biorthogonal modulation signals, and device therefor
KR100615629B1 (en) * 2004-12-22 2006-08-25 전자부품연구원 Method and device for optimally and sub-optimally demodulating constant-amplitude multi-code biorthogonal modulation signals using block orthogonal extended transorthogonal codes
KR100761669B1 (en) 2007-04-18 2007-10-01 전자부품연구원 Pseudo-orthogonal code and pseudo-orthogonal transmitter and receiver

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5193094A (en) * 1990-03-07 1993-03-09 Qualcomm Incorporated Method and apparatus for generating super-orthogonal convolutional codes and the decoding thereof
US6167552A (en) * 1997-10-02 2000-12-26 Harris Corporation Apparatus for convolutional self-doubly orthogonal encoding and decoding
US6496474B1 (en) * 1998-03-19 2002-12-17 Fujitsu Limited Spread encoding device and method
US7031369B2 (en) * 2001-01-30 2006-04-18 Matsushita Electric Industrial Co., Ltd. Orthogonal code generating circuit

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130070580A1 (en) * 2010-04-02 2013-03-21 Fujitsu Limited Apparatus and method for orthogonal cover code (occ) generation, and apparatus and method for occ mapping
US9001639B2 (en) * 2010-04-02 2015-04-07 Fujitsu Limited Apparatus and method for orthogonal cover code (OCC) generation, and apparatus and method for OCC mapping
TWI475835B (en) * 2012-09-28 2015-03-01 Raydium Semiconductor Corp Orthogonal code matrix generation method and orthogonal code matrix generation circuit
US10110420B1 (en) * 2016-08-29 2018-10-23 Amazon Technologies, Inc. Orthogonal encoding of diagnostic information in a computer network

Also Published As

Publication number Publication date
KR101038095B1 (en) 2011-06-01
KR20110051000A (en) 2011-05-17
CN102055437B (en) 2014-02-26
JP2011101334A (en) 2011-05-19
JP4931991B2 (en) 2012-05-16
US7944374B1 (en) 2011-05-17
CN102055437A (en) 2011-05-11

Similar Documents

Publication Publication Date Title
US6304196B1 (en) Disparity and transition density control system and method
US7944374B1 (en) Pseudo-orthogonal code generator
US6636553B1 (en) Pseudorandom noise generator for WCDMA
US10763896B2 (en) Construction method for (n,n(n-1),n-1) permutation group code based on coset partition and codebook generator thereof
US6212219B1 (en) Spread spectrum communication system
US7065700B2 (en) Encoding apparatus and method in CDMA communication system
CN113632397A (en) Short block length distribution matching algorithm
KR20040085545A (en) Apparatus for decoding error correction doe in communication system and method thereof
KR100392620B1 (en) Walsh code generator, signal transmitting device and signal receiving device
EP3413523A1 (en) Distribution matcher and method of operating a distribution matcher
KR19990025179A (en) Method and apparatus for coding and frequency diversity in mobile communication system
EP3676961B1 (en) Polar encoder, communication unit, integrated circuit and method therefor
US6275558B1 (en) Circuit and method for arbitrarily shifting M-sequence
RO121304B1 (en) Method and system for encoding message signals to be transmitted within a communication system
ITTO20000871A1 (en) PROCEDURE AND DEVICE FOR THE GENERATION OF CODES, FOR EXAMPLE CODES FOR CDMA APPLICATIONS.
US7324581B2 (en) Apparatus for mapping and spreading data symbols in mobile communication system
US6751252B1 (en) Quasi-orthogonal code mask generating device in mobile communication system
US6115424A (en) Coding method of dividing information block serving as conversion unit into a plurality of sub-blocks to perform coding for each sub-block, and coding apparatus
US7184496B2 (en) Complementary code decoding by reduced sized circuits
KR100307705B1 (en) Layered orthogonal code generation apparatus and method
KR101085039B1 (en) OVSF Code Generator having low power consumption and method thereof
KR101459044B1 (en) Apparatus and Method for Efficiently Generating OVSF Code using 2-Stage Scheme in Wireless Communication System
US7173900B1 (en) Method and apparatus for chip generation of a chip sequence
JP3914626B2 (en) PN code generation circuit
JPH11259276A (en) Gold system generating circuit

Legal Events

Date Code Title Description
AS Assignment

Owner name: KOREA ELECTRONICS TECHNOLOGY INSTITUTE, KOREA, REP

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KIM, YONGSEONG;SEO, KYEUNGHAK;CHO, JINWOONG;AND OTHERS;REEL/FRAME:023701/0400

Effective date: 20091221

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

FEPP Fee payment procedure

Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: M2552); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: M2553); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

Year of fee payment: 12