Search

KR-102961127-B1 - Method For Data Transmission and Method For Data Recovery

KR102961127B1KR 102961127 B1KR102961127 B1KR 102961127B1KR-102961127-B1

Abstract

A method for transmitting data in a clock-embedded manner according to an embodiment of the present invention comprises: a step of dividing data into a plurality of data packets having a number of bits a; a step of determining a transition code among the data packets, the transition code including information of a first transition-promoting data packet and a second transition-promoting data packet having the same upper bit ([a-1:1]); a step of converting the plurality of data packets into transition-guaranteed data packets using the transition code; and a step of transmitting the transition code and the transition-guaranteed data packets.

Inventors

  • 김흰돌
  • 김종수
  • 박채희
  • 이지예
  • 정영석

Assignees

  • 삼성디스플레이 주식회사

Dates

Publication Date
20260507
Application Date
20210924

Claims (16)

  1. In a method of transmitting data using a clock-embedded method, The method of transmitting the above data is, A step of dividing the above data into a plurality of data packets having a bit count of a; A step of determining a transition code among the above data packets, comprising information on a first transition-promoting data packet and a second transition-promoting data packet in which the upper bit ([a-1:1]) is identical; A step of converting the above plurality of data packets into transition-guaranteed data packets using the above transition code; and A data transmission method comprising the step of transmitting the above transition code and the above transition guarantee data packets.
  2. In Article 1, A data transmission method in which, when the number of bits is a, the data values that the data can represent are 2 a .
  3. In Article 1, The step of determining the above transition code is, A data transmission method further comprising the step of grouping the data packets to include 2 a-1 -1 data packets per transition code.
  4. In Paragraph 3, A data transmission method in which the first transition-promoting data packet and the second transition-promoting data packet are not included in the group of data packets.
  5. In Article 1, The above transition code is a data transmission method in which the least significant bit ([0]) is set as the complement of any one of the bits included in the most significant bit ([a-1:1]).
  6. In Article 1, The step of converting into the above-mentioned transition-guaranteed data packets is, A data transmission method wherein, among the plurality of data packets, there exists a data packet that does not include a transition, and if all bits of the data packet that does not include a transition are 0, it is converted into the first transition-promoting data packet, and if all bits of the data packet without a transition are 1, it is converted into the second transition-promoting data packet.
  7. In Article 6, A data transmission method in which a data packet in which all bits are 0 corresponds to data representing a black gradation, and a data packet in which all bits are 1 corresponds to data representing a white gradation.
  8. In Article 6, A data transmission method in which the least significant bit ([0]) of the first transition-promoting data packet is 0 and the least significant bit ([0]) of the second transition-promoting data packet is 1.
  9. In Article 6, The step of converting into the above-mentioned transition-guaranteed data packets is, A data transmission method that converts a data packet containing a transition among the plurality of data packets into a transition-guaranteed data packet having the same value.
  10. In a method for recovering data transmitted using a clock-embedded method, The method for restoring transition-guaranteed data into data packets is, A step of receiving a transition code and the transition guarantee data packets; and The method includes the step of restoring the transition-guaranteed data packets to the data packets using the transition code; The above plurality of data packets have a bit count of a, and The above transition code is a data recovery method comprising a first transition-promoting data packet and a second transition-promoting data packet among the data packets, wherein the upper bit ([a-1:1]) is identical.
  11. In Article 10, The above transition code is a data recovery method in which the least significant bit ([0]) is set as the complement of any one of the bits included in the most significant bit ([a-1:1]).
  12. In Article 10, The step of restoring with the above data packets is, By comparing the above transition guarantee data with the above transition code, If the upper bit ([a-1:1]) of the transition guarantee data is the same as the upper bit ([a-1:1]) of the transition code and the lowest bit ([0]) of the transition guarantee data is 0, convert it into a data packet in which all bits are 0, and A data recovery method for converting into a data packet in which all bits are 1 when the upper bit ([a-1:1]) of the transition guarantee data is the same as the upper bit ([a-1:1]) of the transition code and the lowest bit ([0]) of the transition guarantee data is 1.
  13. In Article 12, A data recovery method in which a data packet in which all bits are 0 corresponds to data representing a black gradation, and a data packet in which all bits are 1 corresponds to data representing a white gradation.
  14. In Article 12, The step of restoring with the above data packets is, A data recovery method that converts the upper bit ([a-1:1]) of the transition guarantee data into a data packet having the same value as the transition guarantee data when the upper bit ([a-1:1]) of the transition code is not the same as the upper bit ([a-1:1]) of the transition guarantee data.
  15. In Article 10, When the number of bits is a, the data values that the data can represent are 2 a personal data recovery method.
  16. In Article 15, The step of receiving the above transition code and the above transition guarantee data is, A data recovery method for receiving the above transition codes and the above transition guarantee data in groups, wherein each group includes 2 a-1 -1 of the above transition guarantee data per transition code.

Description

Method for Data Transmission and Method for Data Recovery The present invention relates to a data transmission method and a data recovery method. With the advancement of information technology, the importance of display devices, which serve as a medium connecting users and information, is being highlighted. In response to this, the use of display devices such as Liquid Crystal Displays (LCDs) and Organic Light Emitting Displays (OLEDs) is increasing. In clock-embedded transceivers without a separate clock line, data transitions (or shifts), such as from 0 to 1 or from 1 to 0, are required to recover clock data. To this end, when transmitting data, a method is used in which the transmitter divides the data into a preset number of bits to form multiple data packets, encodes each data packet using a conversion code and a logical operation (e.g., XOR), and the receiver decodes the encoded data packets using the conversion code. FIGS. 1 and FIGS. 2 are drawings for explaining a transceiver according to one embodiment. FIGS. 3 and FIGS. 4 are drawings for explaining the operation of the transmitter shown in FIGS. 1 and FIGS. 2. FIG. 5 is a diagram illustrating the operation of a receiver according to one embodiment. FIG. 6 is a diagram illustrating the configuration of a receiver according to one embodiment. FIG. 7 is a diagram illustrating a method for converting data packets into transition-guaranteed data packets such that each of the data packets has at least one transition by an encoder illustrated in FIG. 3. FIG. 8 is a diagram illustrating a method for restoring a transition-guaranteed data packet to the original data packet by the decoder shown in FIG. 5. FIG. 9 is a table for explaining a method for determining a first transition-promoting data packet and a second transition-promoting data packet when the bit depth of the data packet is a. FIG. 10 is a diagram illustrating a method for converting data packets into transition-guaranteed data packets and restoring transition-guaranteed data packets back into data packets. Hereinafter, various embodiments of the present invention will be described in detail with reference to the attached drawings so that those skilled in the art can easily implement the present invention. The present invention may be embodied in various different forms and is not limited to the embodiments described herein. To clearly explain the present invention, parts unrelated to the explanation have been omitted, and the same reference numerals are assigned to identical or similar components throughout the specification. Accordingly, the reference numerals described above may also be used in other drawings. Furthermore, the size and thickness of each component shown in the drawings are depicted arbitrarily for convenience of explanation, and thus the present invention is not necessarily limited to what is illustrated. Thickness may be exaggerated in the drawings to clearly represent various layers and regions. Furthermore, the expression "identical" in the explanation may mean "substantially identical." In other words, it may be an identicality to the extent that a person with ordinary knowledge would accept it as identical. Other expressions may also be those in which "substantially" has been omitted. FIGS. 1 and FIGS. 2 are drawings for explaining a transceiver according to one embodiment. Referring to FIGS. 1 and FIGS. 2, a transceiver (TSCV) according to one embodiment may include a transmitter (TXD) and a receiver (RXD). The transmitter (TXD) may include a transmission controller (TXC), a first data transmission unit (TX1), and an encoder (ENC). The receiver (RXD) may include a reception controller (RXC), a first data reception unit (RX1), a decoder (DEC), and a delay unit (DLY). The first data transmission unit (TX1) can be connected to the first data reception unit (RX1) through the first line (dp1) and the second line (dn1). The first data transmission unit (TX1) and the first data reception unit (RX1) can be referred to as the first data channel. The first data transmission unit (TX1) and the first data reception unit (RX1) may correspond to the physical layer and data link layer of the OSI 7-layer model, the network interface of the TCP/IP protocol, or the physical layer of the MIPI (Mobile Industry Processor Interface) protocol. The physical layer of the MIPI protocol can be configured according to various predetermined specifications, such as D-PHY, C-PHY, and M-PHY. Below, the case where the first data transmission unit (TX1) and the first data reception unit (RX1) are configured according to the D-PHY specification of the physical layer of the MIPI protocol will be described as an example. The Transmit Controller (TXC) and Receive Controller (RXC) may correspond to the network layer and transport layer of the OSI 7-layer model, the internet and transport of the TCP/IP protocol, or the protocol layer of the MIPI protocol. The protocol layer of the MIPI protocol can be conf