About: Syncword is a research topic. Over the lifetime, 136 publications have been published within this topic receiving 1843 citations. The topic is also known as: Preamble.
TL;DR: In this paper, a re-multiplexing operation occurs where, based on the existence of certain conditions in a Transport Packet (e.g., stuffing bytes exist), the information necessary to replace stuffing bytes with private data yet still comply with established standards is accomplished.
Abstract: An apparatus and method, applicable to variable bit rate video and constant bit rate video, is disclosed for replacing "stuffing bytes" with private data. The invention takes advantage of the otherwise wasted resources dedicated to "stuffing" in a data stream in order to insert private data. This is accomplished by inserting useful private data in a Transport Stream instead of the stuffing bits. That is, effectively, a re-multiplexing operation occurs where, based on the existence of certain conditions in a Transport Packet (e.g., stuffing bytes exist), the information necessary to replace stuffing bytes with private data yet still comply with established standards is accomplished. This data generally is referred to as privatestuff data in order to distinguish it from typical private data which may otherwise be encoded into a Transport Stream. The stuffing bytes removed from the Transport Packet may come from an adaptation field in the Transport Header or directly from the Transport Payload or both.
TL;DR: In this paper, an MPEG data frame and a transmitting and receiving system using the MPEG dataframe for enhancing receiving performance of receiver which moves or is stationary are discussed, where null packets are input to the 8 VSB transmitter, 2-level training sync signals are used as training data for an equalizer at the receiver.
Abstract: Disclosed is an MPEG data frame and a transmitting and receiving system using the MPEG data frame for enhancing receiving performance of receiver which moves or is stationary The digital TV broadcasting data frame according to the preferred embodiment of the present invention comprises a data frame which includes at least one data field which has 313 data segments The first data segment of the data field is a data field sync signal which includes a training data sequence used for synchronization at the receiver, and the other 312 data segments each include a 188-byte transport packet and 20-byte error correction data Therefore, when null packets are input to the 8 VSB transmitter, 2-level training sync signals are used as training data for an equalizer at the receiver so as to increase receiving performance of a receiver that moves or is stationary
TL;DR: In this paper, a method of carrying frame based data, eg Ethernet data, over a synchronous digital hierarchy network in order to provide local area network type functionality over a wide area network coverage is disclosed.
Abstract: There is disclosed a method of carrying frame based data, eg Ethernet data, over a synchronous digital hierarchy network in order to provide local area network type functionality over a wide area network coverage. Specific embodiments disclose methods of mapping Ethernet data frames into SDH virtual containers, and distinguishing start and end boundaries of the Ethernet data frames within the virtual container payloads, by a selection of encoding methods including a segmentation, pointer methods, bit stuffing methods and byte stuffing methods. Data frames are encoded with a code which designates a boundary of each frame, and the encoded frames are input into a synchronous data channel.
TL;DR: In this article, the primary sync code is acquired at the starting point of a frame and the frame is equal to one period of a spreading code, and the secondary sync codes are assigned to base station groups, one to a group.
Abstract: A synchronization (sync) code communication device for an CDMA communication system. A base station sync code transmission device comprises a primary sync code transmitter and a secondary sync code transmitter. The primary sync code transmitter is for generating and then transmitting a primary sync code at a first location in a transmission frame. The primary sync code is for acquiring synchronization at a starting point of a frame and the frame is equal to one period of a spreading code. The secondary sync code transmitter is for generating and then transmitting a secondary sync code at a second location in a frame. The secondary sync codes are assigned to base station groups, one to a group. A mobile station sync code receiving device comprises a primary sync code acquisition decider and a base station group decider.; The primary sync code acquisition decider is for acquiring a primary sync code received at a first location in a frame, and then acquiring synchronization at a starting point of a frame. The base station group decider is enabled upon acquisition of the primary sync code, receives a secondary sync code transmitted at a second location in the frame, and then determines the base station group to which the transmitting base station belongs.
TL;DR: In this paper, the probability of frame destruction was reduced while suppressing the redundancy of the transmission data by encoding the unique word and header information in the frame n and decoding the header information n in the next frame n+1.
Abstract: The probability of frame destruction is lowered while suppressing the redundancy of the transmission data. On the transmitting side, a predetermined unique word is contained in a frame n for storing the n-th data, and header information n, frame length information and header information n-1 of the frame n-1 one frame before the frame n are subjected to error-correcting coding, contained in the frame n, and transmitted. On the receiving side, the header of the frame n is received. When the frame length information is transmitted without error, the timing of frame synchronization is specified by the frame length information, while when the frame length information is transmitted with error, the timing is specified by detecting the unique word and header information in the next frame n+1. When the header of the frame n is not successfully decoded, the information data of the frame n is decoded by using the header information n inserted into a predetermined position of the frame n+1.