Sign up to receive free email alerts when patent applications with chosen keywords are publishedSIGN UP

Abstract:

A digital receiving system, and a method of processing data are
disclosed. The digital receiving system includes a receiving unit, a
known sequence detector, and a channel equalizer. The receiving unit
receives a broadcast signal including mobile service data and main
service data. The known sequence detector detects known data linearly
inserted in a data group. The channel equalizer performs
channel-equalizing on the received mobile service data using the detected
known data.

Claims:

1. A method of processing broadcast data in a broadcast transmitter, the
method comprising: randomizing broadcast service data; first encoding the
randomized broadcast service data to add parity data; second encoding the
first-encoded broadcast service data at a code rate of D/E, wherein
D<E; first interleaving the second-encoded broadcast service data;
encoding signaling data for signaling the broadcast service data;
modulating the first-interleaved broadcast service data and the encoded
signaling data; and transmitting the modulated data, wherein the
signaling data include information for indicating the code rate.

2. The method of claim 1, further comprising: second interleaving the
first-interleaved broadcast service data.

3. The method of claim 1, further comprising: randomizing the signaling
data.

4. The method of claim 1, wherein the broadcast service data are
transmitted through one or more delivery units included in a frame.

5. The method of claim 4, wherein the code rate is independently applied
to each of the one or more delivery units.

6. The method of claim 4, wherein the signaling data further include a
number of delivery units contained in the frame.

7. A broadcast transmitter for processing broadcast data, the broadcast
transmitter comprising: a randomizer configured to randomize broadcast
service data; a first encoder configured to first encode the randomized
broadcast service data to add parity data; a second encoder configured to
second encode the first-encoded broadcast service data at a code rate of
D/E, wherein D<E; a first interleaver configured to first interleave
the second-encoded broadcast service data; an encoder configured to
encode signaling data for signaling the broadcast service data; a
modulator configured to modulate the first-interleaved broadcast service
data and the encoded signaling data; and a transmitting unit configured
to transmit the modulated data, wherein the signaling data include
information for indicating the code rate.

8. The broadcast transmitter of claim 7, further comprising: a second
interleaver configured to second interleave the first-interleaved
broadcast service data.

9. The broadcast transmitter of claim 7, wherein the randomizer is
further configured to randomize the signaling data.

10. The broadcast transmitter of claim 7, wherein the broadcast service
data are transmitted through one or more delivery units included in a
frame.

11. The broadcast transmitter of claim 10, wherein the code rate is
independently applied to each of the one or more delivery units.

12. The broadcast transmitter of claim 10, wherein the signaling data
further include a number of delivery units contained in the frame.

Description:

[0001] This application claims the benefit of the Korean Patent
Application No. 10-2008-0064608, filed on Jul. 3, 2008, which is hereby
incorporated by reference as if fully set forth herein. Also, this
application also claims the benefit of U.S. Provisional Application No.
60/947,984, filed on Jul. 4, 2007, which is hereby incorporated by
reference.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] The present invention relates to a digital broadcasting system and
method of processing data.

[0004] 2. Discussion of the Related Art

[0005] The Vestigial Sideband (VSB) transmission mode, which is adopted as
the standard for digital broadcasting in North America and the Republic
of Korea, is a system using a single carrier method. Therefore, the
receiving performance of the digital broadcast receiving system may be
deteriorated in a poor channel environment. Particularly, since
resistance to changes in channels and noise is more highly required when
using portable and/or mobile broadcast receivers, the receiving
performance may be even more deteriorated when transmitting mobile
service data by the VSB transmission mode.

SUMMARY OF THE INVENTION

[0006] Accordingly, the present invention is directed to a digital
broadcasting system and a method of processing data that substantially
obviate one or more problems due to limitations and disadvantages of the
related art.

[0007] An object of the present invention is to provide a digital
broadcasting system and a method of processing data that are highly
resistant to channel changes and noise.

[0008] Another object of the present invention is to provide a digital
broadcasting system and a method of processing data that can enhance the
receiving performance of a receiving system (or receiver) by having a
transmitting system (or transmitter) perform additional encoding on
mobile service data, and by having the receiving system (or receiver)
perform decoding on the additionally encoded mobile service data as an
inverse process of the transmitting system.

[0009] A further object of the present invention is to provide a digital
broadcasting system and a method of processing data that can also enhance
the receiving performance of a digital broadcast receiving system by
inserting known data already known in accordance with a pre-agreement
between the receiving system and the transmitting system in a
predetermined area within a data area.

[0010] Additional advantages, objects, and features of the invention will
be set forth in part in the description which follows and in part will
become apparent to those having ordinary skill in the art upon
examination of the following or may be learned from practice of the
invention. The objectives and other advantages of the invention may be
realized and attained by the structure particularly pointed out in the
written description and claims hereof as well as the appended drawings.

[0011] To achieve these objects and other advantages and in accordance
with the purpose of the invention, as embodied and broadly described
herein, a digital broadcast transmitting system includes a service
multiplexer and a transmitter. The service multiplexer multiplexes mobile
service data and main service data at pre-determined data rates and,
then, transmits the multiplexed service data to the transmitter. The
transmitter performs additional encoding on the mobile service data
transmitted from the service multiplexer and, also, groups a plurality of
mobile service data packets having encoding performed thereon so as to
configure a data group.

[0012] Herein, the transmitter may multiplex a mobile service data packet
including the mobile service data and a main service data packet
including the main service data in packet units and may transmit the
multiplexed data packets to a digital broadcast receiving system. Herein,
the transmitter may multiplex the data group and the main service data
packet in a burst structure, wherein the burst section may be divided in
a burst-on section including the data group, and a burst-off section that
does not include the data group. The data group may be divided into a
plurality of regions based upon a degree of interference of the main
service data. A long known data sequence may be periodically inserted in
the region having no interference with the main service data.

[0013] In another aspect of the present invention, a digital broadcast
receiving system may use the known data sequence for demodulating and
channel equalizing processes. When receiving only the mobile service
data, the digital broadcast receiving system turns power on only during
the burst-on section so as to process the mobile service data.

[0014] In another aspect of the present invention, a digital receiving
system includes a receiving unit, a known sequence detector, and a
channel equalizer. The receiving unit receives a broadcast signal
including mobile service data and main service data. The mobile service
data configures a data group. The data group is divided into a plurality
of regions. The known data sequences are linearly inserted in some
regions among the plurality of regions within the data group, and
initialization data are inserted at a beginning portion of each known
data sequence, the initialization data being used for initializing a
memory included in a trellis encoder of a broadcast transmitting system.
The known sequence detector detects known data linearly inserted in the
data group. The channel equalizer performs channel-equalizing on the
received mobile service data using the detected known data. N number of
known data sequences are inserted in some regions among the plurality of
regions within the data group. A transmission parameter is inserted
between a first known data sequence and a second known data sequence,
among the N number of known data sequences.

[0015] The broadcast receiving system further includes a transmission
parameter detector detecting the transmission parameter, and a block
decoder symbol-decoding the mobile service data in block units, based
upon the detected transmission parameter.

[0016] The broadcast receiving system further includes a power controller
controlling power based upon the detected transmission parameter, thereby
receiving a data group including requested mobile service data.

[0017] The data group configures a RS frame, and the RS frame includes at
least one data packet corresponding to the mobile service data, an RS
parity generated based upon the at least one data packet, and a CRC
checksum generated based upon the at least one data packet and the RS
parity.

[0018] The broadcast receiving system further includes a RS frame decoder
performing CRC-decoding and RS-decoding on the mobile service data in RS
frame units, thereby correcting errors occurred in the mobile service
data within the corresponding RS frame.

[0019] The broadcast receiving system further includes a derandomaizer
derandomizing the RS-decoded mobile service data.

[0020] In another aspect of the present invention, a method for processing
data of a receiving system includes receiving a broadcast signal
including mobile service data and main service data, wherein the mobile
service data configures a data group, wherein the data group is divided
into a plurality of regions, wherein known data sequences are linearly
inserted in some regions among the plurality of regions within the data
group, and wherein initialization data are inserted at a beginning
portion of each known data sequence, the initialization data being used
for initializing a memory included in a trellis encoder of a broadcast
transmitting system, detecting known data linearly inserted in the data
group, and channel-equalizing on the received mobile service data by
using the detected known data.

[0021] It is to be understood that both the foregoing general description
and the following detailed description of the present invention are
exemplary and explanatory and are intended to provide further explanation
of the invention as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The accompanying drawings, which are included to provide a further
understanding of the invention and are incorporated in and constitute a
part of this application, illustrate embodiment(s) of the invention and
together with the description serve to explain the principle of the
invention. In the drawings:

[0023] FIG. 1 illustrates a block diagram showing a general structure of a
digital broadcasting system according to an embodiment of the present
invention;

[0024] FIG. 2 illustrates a block diagram of a service multiplexer shown
in FIG. 1 of the present invention;

[0025]FIG. 3 illustrates a block diagram of a transmitter shown in FIG. 1
of the present invention;

[0026] FIG. 4 illustrates a block diagram of a pre-processor shown in FIG.
3 of the present invention;

[0027]FIG. 5(a) to FIG. 5(e) illustrate process steps of error correction
encoding and error detection encoding according to an embodiment of the
present invention;

[0028] FIG. 6(a) to FIG. 6(d) illustrate process steps of row permutation
in super frame units according to an embodiment of the present invention;

[0029]FIG. 7A and FIG. 7B respectively illustrate examples of data
structures before and after in a data deinterleaver of a digital
broadcast transmitting system according to the present invention;

[0030] FIG. 8 illustrates a part of data region A of the signal frame
shown in FIG. 7A;

[0031] FIGS. 9(a) to 9(c) illustrate a data structure (arrangement) of
transmission (Tx) parameters included in a mobile service data region as
signaling data;

[0032] FIG. 10 illustrates how the signaling data are inserted in a signal
frame after interleaving in a broadcast transmitting system according to
the present invention;

[0033] FIG. 11 illustrates an example of acquiring mobile service data
included in a particular data group within a burst according to the
present invention;

[0034] FIG. 12 illustrates another example of FIG. 11;

[0035]FIG. 13 illustrates an exemplary process of dividing an RS frame
for configuring a data group according to the present invention;

[0036]FIG. 14(a) and FIG. 14(b) illustrate an exemplary process of
dividing an RS frame for configuring a data group according to the
present invention;

[0037]FIG. 15 illustrates exemplary operations of a packet multiplexer
for transmitting data groups according to an embodiment of the present
invention;

[0038] FIG. 16 illustrates a block diagram showing a structure of a block
processor according to an embodiment of the present invention;

[0039] FIG. 17A to FIG. 17C illustrate block views showing exemplary
operations of the symbol encoder having the coding rate of 1/4 according
to an embodiment of the present invention;

[0040]FIG. 18A illustrates a detailed block view of a 1/2 outer encoder
according to an embodiment of the present invention;

[0041] FIG. 18B illustrates a detailed block view of a 1/4 outer encoder
according to an embodiment of the present invention;

[0087]FIG. 65 illustrates an example of comparing actual on/off times and
burst sections;

[0088] FIG. 66 illustrates a block diagram of a receiving system according
to an embodiment of the present invention;

[0089] FIG. 67 illustrates a bit stream syntax for a VCT according to the
present invention;

[0090] FIG. 68 illustrates a service_type field according to an embodiment
of the present invention;

[0091] FIG. 69 illustrates a service location descriptor according to an
embodiment of the present invention;

[0092] FIG. 70 illustrates examples that may be assigned to the
stream_type field according to the present invention;

[0093] FIG. 71 illustrates a bit stream syntax for an EIT according to the
present invention; and

[0094] FIG. 72 illustrates a block diagram of a receiving system according
to another embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[0095] Reference will now be made in detail to the preferred embodiments
of the present invention, examples of which are illustrated in the
accompanying drawings. Wherever possible, the same reference numbers will
be used throughout the drawings to refer to the same or like parts. In
addition, although the terms used in the present invention are selected
from generally known and used terms, some of the terms mentioned in the
description of the present invention have been selected by the applicant
at his or her discretion, the detailed meanings of which are described in
relevant parts of the description herein. Furthermore, it is required
that the present invention is understood, not simply by the actual terms
used but by the meaning of each term lying within.

[0096] Among the terms used in the description of the present invention,
main service data correspond to data that can be received by a fixed
receiving system and may include audio/video (A/V) data. More
specifically, the main service data may include A/V data of high
definition (HD) or standard definition (SD) levels and may also include
diverse data types required for data broadcasting. Also, the known data
correspond to data pre-known in accordance with a pre-arranged agreement
between the receiving system and the transmitting system. Additionally,
in the present invention, mobile service data may include at least one of
mobile service data, pedestrian service data, and handheld service data,
and are collectively referred to as mobile service data for simplicity.
Herein, the mobile service data not only correspond to
mobile/pedestrian/handheld service data (M/P/H service data) but may also
include any type of service data with mobile or portable characteristics.
Therefore, the mobile service data according to the present invention are
not limited only to the M/P/H service data.

[0097] The above-described mobile service data may correspond to data
having information, such as program execution files, stock information,
and so on, and may also correspond to A/V data. Most particularly, the
mobile service data may correspond to A/V data having lower resolution
and lower data rate as compared to the main service data. For example, if
an A/V codec that is used for a conventional main service corresponds to
a MPEG-2 codec, a MPEG-4 advanced video coding (AVC) or scalable video
coding (SVC) having better image compression efficiency may be used as
the A/V codec for the mobile service. Furthermore, any type of data may
be transmitted as the mobile service data. For example, transport
protocol expert group (TPEG) data for broadcasting real-time
transportation information may be serviced as the main service data.

[0098] Also, a data service using the mobile service data may include
weather forecast services, traffic information services, stock
information services, viewer participation quiz programs, real-time polls
& surveys, interactive education broadcast programs, gaming services,
services providing information on synopsis, character, background music,
and filming sites of soap operas or series, services providing
information on past match scores and player profiles and achievements,
and services providing information on product information and programs
classified by service, medium, time, and theme enabling purchase orders
to be processed. Herein, the present invention is not limited only to the
services mentioned above. In the present invention, the transmitting
system provides backward compatibility in the main service data so as to
be received by the conventional receiving system. Herein, the main
service data and the mobile service data are multiplexed to the same
physical channel and then transmitted.

[0099] The transmitting system according to the present invention performs
additional encoding on the mobile service data and inserts the data
already known by the receiving system and transmitting system (i.e.,
known data), thereby transmitting the processed data. Therefore, when
using the transmitting system according to the present invention, the
receiving system may receive the mobile service data during a mobile
state and may also receive the mobile service data with stability despite
various distortion and noise occurring within the channel.

General Description of a Transmitting System

[0100] FIG. 1 illustrates a block diagram showing a general structure of a
digital broadcast transmitting system according to an embodiment of the
present invention. Herein, the digital broadcast transmitting includes a
service multiplexer 100 and a transmitter 200. Herein, the service
multiplexer 100 is located in the studio of each broadcast station, and
the transmitter 200 is located in a site placed at a predetermined
distance from the studio. The transmitter 200 may be located in a
plurality of different locations. Also, for example, the plurality of
transmitters may share the same frequency. And, in this case, the
plurality of transmitters receives the same signal. Accordingly, in the
receiving system, a channel equalizer may compensate signal distortion,
which is caused by a reflected wave, so as to recover the original
signal. In another example, the plurality of transmitters may have
different frequencies with respect to the same channel.

[0101] A variety of methods may be used for data communication each of the
transmitters, which are located in remote positions, and the service
multiplexer. For example, an interface standard such as a synchronous
serial interface for transport of MPEG-2 data (SMPTE-310M). In the
SMPTE-310M interface standard, a constant data rate is decided as an
output data rate of the service multiplexer. For example, in case of the
8VSB mode, the output data rate is 19.39 Mbps, and, in case of the 16VSB
mode, the output data rate is 38.78 Mbps. Furthermore, in the
conventional 8VSB mode transmitting system, a transport stream (TS)
packet having a data rate of approximately 19.39 Mbps may be transmitted
through a single physical channel. Also, in the transmitting system
according to the present invention provided with backward compatibility
with the conventional transmitting system, additional encoding is
performed on the mobile service data. Thereafter, the additionally
encoded mobile service data are multiplexed with the main service data to
a TS packet form, which is then transmitted. At this point, the data rate
of the multiplexed TS packet is approximately 19.39 Mbps.

[0102] At this point, the service multiplexer 100 receives at least one
type of mobile service data and program specific information
(PSI)/program and system information protocol (PSIP) table data for each
mobile service and encapsulates the received data to each transport
stream (TS) packet. Also, the service multiplexer 100 receives at least
one type of main service data and PSI/PSIP table data for each main
service so as to encapsulate the received data to a TS packet.
Subsequently, the TS packets are multiplexed according to a predetermined
multiplexing rule and outputs the multiplexed packets to the transmitter
200.

Service Multiplexer

[0103] FIG. 2 illustrates a block diagram showing an example of the
service multiplexer. The service multiplexer includes a controller 110
for controlling the overall operations of the service multiplexer, a
PSI/PSIP generator 120 for the main service, a PSI/PSIP generator 130 for
the mobile service, a null packet generator 140, a mobile service
multiplexer 150, and a transport multiplexer 160. The transport
multiplexer 160 may include a main service multiplexer 161 and a
transport stream (TS) packet multiplexer 162. Referring to FIG. 2, at
least one type of compression encoded main service data and the PSI/PSIP
table data generated from the PSI/PSIP generator 120 for the main service
are inputted to the main service multiplexer 161 of the transport
multiplexer 160. The main service multiplexer 161 encapsulates each of
the inputted main service data and PSI/PSIP table data to MPEG-2 TS
packet forms. Then, the MPEG-2 TS packets are multiplexed and outputted
to the TS packet multiplexer 162. Herein, the data packet being outputted
from the main service multiplexer 161 will be referred to as a main
service data packet for simplicity.

[0104] Thereafter, at least one type of the compression encoded mobile
service data and the PSI/PSIP table data generated from the PSI/PSIP
generator 130 for the mobile service are inputted to the mobile service
multiplexer 150. The mobile service multiplexer 150 encapsulates each of
the inputted mobile service data and PSI/PSIP table data to MPEG-TS
packet forms. Then, the MPEG-2 TS packets are multiplexed and outputted
to the TS packet multiplexer 162. Herein, the data packet being outputted
from the mobile service multiplexer 150 will be referred to as a mobile
service data packet for simplicity. At this point, the transmitter 200
requires identification information in order to identify and process the
main service data packet and the mobile service data packet. Herein, the
identification information may use values pre-decided in accordance with
an agreement between the transmitting system and the receiving system, or
may be configured of a separate set of data, or may modify predetermined
location value with in the corresponding data packet. As an example of
the present invention, a different packet identifier (PID) may be
assigned to identify each of the main service data packet and the mobile
service data packet.

[0105] In another example, by modifying a synchronization data byte within
a header of the mobile service data, the service data packet may be
identified by using the synchronization data byte value of the
corresponding service data packet. For example, the synchronization byte
of the main service data packet directly outputs the value decided by the
ISO/IEC13818-1 standard (i.e., 0x47) without any modification. The
synchronization byte of the mobile service data packet modifies and
outputs the value, thereby identifying the main service data packet and
the mobile service data packet. Conversely, the synchronization byte of
the main service data packet is modified and outputted, whereas the
synchronization byte of the mobile service data packet is directly
outputted without being modified, thereby enabling the main service data
packet and the mobile service data packet to be identified.

[0106] A plurality of methods may be applied in the method of modifying
the synchronization byte. For example, each bit of the synchronization
byte may be inversed, or only a portion of the synchronization byte may
be inversed. As described above, any type of identification information
may be used to identify the main service data packet and the mobile
service data packet. Therefore, the scope of the present invention is not
limited only to the example set forth in the description of the present
invention.

[0107] Meanwhile, a transport multiplexer used in the conventional digital
broadcasting system may be used as the transport multiplexer 160
according to the present invention. More specifically, in order to
multiplex the mobile service data and the main service data and to
transmit the multiplexed data, the data rate of the main service is
limited to a data rate of (19.39-K) Mbps. Then, K Mbps, which corresponds
to the remaining data rate, is assigned as the data rate of the mobile
service. Thus, the transport multiplexer which is already being used may
be used as it is without any modification. Herein, the transport
multiplexer 160 multiplexes the main service data packet being outputted
from the main service multiplexer 161 and the mobile service data packet
being outputted from the mobile service multiplexer 150. Thereafter, the
transport multiplexer 160 transmits the multiplexed data packets to the
transmitter 200.

[0108] However, in some cases, the output data rate of the mobile service
multiplexer 150 may not be equal to K Mbps. In this case, the mobile
service multiplexer 150 multiplexes and outputs null data packets
generated from the null packet generator 140 so that the output data rate
can reach K Mbps. More specifically, in order to match the output data
rate of the mobile service multiplexer 150 to a constant data rate, the
null packet generator 140 generates null data packets, which are then
outputted to the mobile service multiplexer 150. For example, when the
service multiplexer 100 assigns K Mbps of the 19.39 Mbps to the mobile
service data, and when the remaining (19.39-K) Mbps is, therefore,
assigned to the main service data, the data rate of the mobile service
data that are multiplexed by the service multiplexer 100 actually becomes
lower than K Mbps. This is because, in case of the mobile service data,
the pre-processor of the transmitting system performs additional
encoding, thereby increasing the amount of data. Eventually, the data
rate of the mobile service data, which may be transmitted from the
service multiplexer 100, becomes smaller than K Mbps.

[0109] For example, since the pre-processor of the transmitter performs an
encoding process on the mobile service data at a coding rate of at least
1/2, the amount of the data outputted from the pre-processor is increased
to more than twice the amount of the data initially inputted to the
pre-processor. Therefore, the sum of the data rate of the main service
data and the data rate of the mobile service data, both being multiplexed
by the service multiplexer 100, becomes either equal to or smaller than
19.39 Mbps. Therefore, in order to match the data rate of the data that
are finally outputted from the service multiplexer 100 to a constant data
rate (e.g., 19.39 Mbps), an amount of null data packets corresponding to
the amount of lacking data rate is generated from the null packet
generator 140 and outputted to the mobile service multiplexer 150.

[0110] Accordingly, the mobile service multiplexer 150 encapsulates each
of the mobile service data and the PSI/PSIP table data that are being
inputted to a MPEG-2 TS packet form. Then, the above-described TS packets
are multiplexed with the null data packets and, then, outputted to the TS
packet multiplexer 162. Thereafter, the TS packet multiplexer 162
multiplexes the main service data packet being outputted from the main
service multiplexer 161 and the mobile service data packet being
outputted from the mobile service multiplexer 150 and transmits the
multiplexed data packets to the transmitter 200 at a data rate of 19.39
Mbps.

[0111] According to an embodiment of the present invention, the mobile
service multiplexer 150 receives the null data packets. However, this is
merely exemplary and does not limit the scope of the present invention.
In other words, according to another embodiment of the present invention,
the TS packet multiplexer 162 may receive the null data packets, so as to
match the data rate of the finally outputted data to a constant data
rate. Herein, the output path and multiplexing rule of the null data
packet is controlled by the controller 110. The controller 110 controls
the multiplexing processed performed by the mobile service multiplexer
150, the main service multiplexer 161 of the transport multiplexer 160,
and the TS packet multiplexer 162, and also controls the null data packet
generation of the null packet generator 140. At this point, the
transmitter 200 discards the null data packets transmitted from the
service multiplexer 100 instead of transmitting the null data packets.

[0112] Further, in order to allow the transmitter 200 to discard the null
data packets transmitted from the service multiplexer 100 instead of
transmitting them, identification information for identifying the null
data packet is required. Herein, the identification information may use
values pre-decided in accordance with an agreement between the
transmitting system and the receiving system. For example, the value of
the synchronization byte within the header of the null data packet may be
modified so as to be used as the identification information.
Alternatively, a transport_error indicator flag may also be used as the
identification information.

[0113] In the description of the present invention, an example of using
the transport_error_indicator flag as the identification information will
be given to describe an embodiment of the present invention. In this
case, the transport_error_indicator flag of the null data packet is set
to `1`, and the transport_error_indicator flag of the remaining data
packets are reset to `0`, so as to identify the null data packet. More
specifically, when the null packet generator 140 generates the null data
packets, if the transport_error_indicator flag from the header field of
the null data packet is set to `1` and then transmitted, the null data
packet may be identified and, therefore, be discarded. In the present
invention, any type of identification information for identifying the
null data packets may be used. Therefore, the scope of the present
invention is not limited only to the examples set forth in the
description of the present invention.

[0114] According to another embodiment of the present invention, a
transmission parameter may be included in at least a portion of the null
data packet, or at least one table or an operations and maintenance (OM)
packet (or OMP) of the PSI/PSIP table for the mobile service. In this
case, the transmitter 200 extracts the transmission parameter and outputs
the extracted transmission parameter to the corresponding block and also
transmits the extracted parameter to the receiving system if required.
More specifically, a packet referred to as an OMP is defined for the
purpose of operating and managing the transmitting system. For example,
the OMP is configured in accordance with the MPEG-2 TS packet format, and
the corresponding PID is given the value of 0x1FFA. The OMP is configured
of a 4-byte header and a 184-byte payload. Herein, among the 184 bytes,
the first byte corresponds to an OM_type field, which indicates the type
of the OM packet.

[0115] In the present invention, the transmission parameter may be
transmitted in the form of an OMP. And, in this case, among the values of
the reserved fields within the OM_type field, a pre-arranged value is
used, thereby indicating that the transmission parameter is being
transmitted to the transmitter 200 in the form of an OMP. More
specifically, the transmitter 200 may find (or identify) the OMP by
referring to the PID. Also, by parsing the OM_type field within the OMP,
the transmitter 200 can verify whether a transmission parameter is
included after the OM_type field of the corresponding packet. The
transmission parameter corresponds to supplemental data required for
processing mobile service data from the transmitting system and the
receiving system.

[0116] Herein, the transmission parameter may include data group
information, region information within the data group, RS frame
information, super frame information, burst information, turbo code
information, and RS code information. The burst information may include
burst size information, burst period information, and time information to
next burst. The burst period signifies the period at which the burst
transmitting the same mobile service is repeated. The data group includes
a plurality of mobile service data packets, and a plurality of such data
groups is gathered (or grouped) to form a burst. A burst section
signifies the beginning of a current burst to the beginning of a next
burst. Herein, the burst section is classified as a section that includes
the data group (also referred to as a burst-on section), and a section
that does not include the data group (also referred to as a burst-off
section). A burst-on section is configured of a plurality of fields,
wherein one field includes one data group.

[0117] The transmission parameter may also include information on how
signals of a symbol domain are encoded in order to transmit the mobile
service data, and multiplexing information on how the main service data
and the mobile service data or various types of mobile service data are
multiplexed. The information included in the transmission parameter is
merely exemplary to facilitate the understanding of the present
invention. And, the adding and deleting of the information included in
the transmission parameter may be easily modified and changed by anyone
skilled in the art. Therefore, the present invention is not limited to
the examples proposed in the description set forth herein. Furthermore,
the transmission parameters may be provided from the service multiplexer
100 to the transmitter 200. Alternatively, the transmission parameters
may also be set up by an internal controller (not shown) within the
transmitter 200 or received from an external source.

Transmitter

[0118]FIG. 3 illustrates a block diagram showing an example of the
transmitter 200 according to an embodiment of the present invention.
Herein, the transmitter 200 includes a demultiplexer 210, a packet jitter
mitigator 220, a pre-processor 230, a packet multiplexer 240, a
post-processor 250, a synchronization (sync) multiplexer 260, and a
transmission unit 270. Herein, when a data packet is received from the
service multiplexer 100, the demultiplexer 210 should identify whether
the received data packet corresponds to a main service data packet, a
mobile service data packet, or a null data packet. For example, the
demultiplexer 210 uses the PID within the received data packet so as to
identify the main service data packet and the mobile service data packet.
Then, the demultiplexer 210 uses a transport_error_indicator field to
identify the null data packet. The main service data packet identified by
the demultiplexer 210 is outputted to the packet jitter mitigator 220,
the mobile service data packet is outputted to the pre-processor 230, and
the null data packet is discarded. If a transmission parameter is
included in the null data packet, then the transmission parameter is
first extracted and outputted to the corresponding block. Thereafter, the
null data packet is discarded.

[0119] The pre-processor 230 performs an additional encoding process of
the mobile service data included in the service data packet, which is
demultiplexed and outputted from the demultiplexer 210. The pre-processor
230 also performs a process of configuring a data group so that the data
group may be positioned at a specific place in accordance with the
purpose of the data, which are to be transmitted on a transmission frame.
This is to enable the mobile service data to respond swiftly and strongly
against noise and channel changes. The pre-processor 230 may also refer
to the transmission parameter when performing the additional encoding
process. Also, the pre-processor 230 groups a plurality of mobile service
data packets to configure a data group. Thereafter, known data, mobile
service data, RS parity data, and MPEG header are allocated to
pre-determined areas within the data group.

Pre-Processor within Transmitter

[0120] FIG. 4 illustrates a block diagram showing an example of the
pre-processor 230 according to the present invention. The pre-processor
230 includes a data randomizer 301, a RS frame encoder 302, a block
processor 303, a group formatter 304, a data deinterleaver 305, a packet
formatter 306. The data randomizer 301 within the above-described
pre-processor 230 randomizes the mobile service data packet including the
mobile service data that is inputted through the demultiplexer 210. Then,
the data randomizer 301 outputs the randomized mobile service data packet
to the RS frame encoder 302. At this point, since the data randomizer 301
performs the randomizing process on the mobile service data, the
randomizing process that is to be performed by the data randomizer 251 of
the post-processor 250 on the mobile service data may be omitted. The
data randomizer 301 may also discard the synchronization byte within the
mobile service data packet and perform the randomizing process. This is
an option that may be chosen by the system designer. In the example given
in the present invention, the randomizing process is performed without
discarding the synchronization byte within the mobile service data
packet.

[0121] The RS frame encoder 302 groups a plurality of mobile the
synchronization byte within the mobile service data packets that is
randomized and inputted, so as to create a RS frame. Then, the RS frame
encoder 302 performs at least one of an error correction encoding process
and an error detection encoding process in RS frame units. Accordingly,
robustness may be provided to the mobile service data, thereby scattering
group error that may occur during changes in a frequency environment,
thereby enabling the mobile service data to respond to the frequency
environment, which is extremely vulnerable and liable to frequent
changes. Also, the RS frame encoder 302 groups a plurality of RS frame so
as to create a super frame, thereby performing a row permutation process
in super frame units. The row permutation process may also be referred to
as a row interleaving process. Hereinafter, the process will be referred
to as row permutation for simplicity.

[0122] More specifically, when the RS frame encoder 302 performs the
process of permuting each row of the super frame in accordance with a
pre-determined rule, the position of the rows within the super frame
before and after the row permutation process is changed. If the row
permutation process is performed by super frame units, and even though
the section having a plurality of errors occurring therein becomes very
long, and even though the number of errors included in the RS frame,
which is to be decoded, exceeds the extent of being able to be corrected,
the errors become dispersed within the entire super frame. Thus, the
decoding ability is even more enhanced as compared to a single RS frame.

[0123] At this point, as an example of the present invention, RS-encoding
is applied for the error correction encoding process, and a cyclic
redundancy check (CRC) encoding is applied for the error detection
process. When performing the RS-encoding, parity data that are used for
the error correction are generated. And, when performing the CRC
encoding, CRC data that are used for the error detection are generated.
The RS encoding is one of forward error correction (FEC) methods. The FEC
corresponds to a technique for compensating errors that occur during the
transmission process. The CRC data generated by CRC encoding may be used
for indicating whether or not the mobile service data have been damaged
by the errors while being transmitted through the channel. In the present
invention, a variety of error detection coding methods other than the CRC
encoding method may be used, or the error correction coding method may be
used to enhance the overall error correction ability of the receiving
system. Herein, the RS frame encoder 302 refers to a pre-determined
transmission parameter and/or the transmission parameter provided from
the service multiplexer 100 so as to perform operations including RS
frame configuration, RS encoding, CRC encoding, super frame
configuration, and row permutation in super frame units.

RS Frame Encoder within Pre-Processor

[0124]FIG. 5(a) to FIG. 5(e) illustrate error correction encoding and
error detection encoding processed according to an embodiment of the
present invention. More specifically, the RS frame encoder 302 first
divides the inputted mobile service data bytes to units of a
predetermined length. The predetermined length is decided by the system
designer. And, in the example of the present invention, the predetermined
length is equal to 187 bytes, and, therefore, the 187-byte unit will be
referred to as a packet for simplicity. For example, when the mobile
service data that are being inputted, as shown in FIG. 5(a), correspond
to a MPEG transport packet stream configured of 188-byte units, the first
synchronization byte is removed, as shown in FIG. 5(b), so as to
configure a 187-byte unit. Herein, the synchronization byte is removed
because each mobile service data packet has the same value.

[0125] Herein, the process of removing the synchronization byte may be
performed during a randomizing process of the data randomizer 301 in an
earlier process. In this case, the process of the removing the
synchronization byte by the RS frame encoder 302 may be omitted.
Moreover, when adding synchronization bytes from the receiving system,
the process may be performed by the data derandomizer instead of the RS
frame decoder. Therefore, if a removable fixed byte (e.g.,
synchronization byte) does not exist within the mobile service data
packet that is being inputted to the RS frame encoder 302, or if the
mobile service data that are being inputted are not configured in a
packet format, the mobile service data that are being inputted are
divided into 187-byte units, thereby configuring a packet for each
187-byte unit.

[0126] Subsequently, as shown in FIG. 5(c), N number of packets configured
of 187 bytes is grouped to configure a RS frame. At this point, the RS
frame is configured as a RS frame having the size of N(row)*187(column)
bytes, in which 187-byte packets are sequentially inputted in a row
direction. In order to simplify the description of the present invention,
the RS frame configured as described above will also be referred to as a
first RS frame. More specifically, only pure mobile service data are
included in the first RS frame, which is the same as the structure
configured of 187 N-byte rows. Thereafter, the mobile service data within
the RS frame are divided into an equal size. Then, when the divided
mobile service data are transmitted in the same order as the input order
for configuring the RS frame, and when one or more errors have occurred
at a particular point during the transmitting/receiving process, the
errors are clustered (or gathered) within the RS frame as well. In this
case, the receiving system uses a RS erasure decoding method when
performing error correction decoding, thereby enhancing the error
correction ability. At this point, the N number of columns within the N
number of RS frame includes 187 bytes, as shown in FIG. 5(c).

[0127] In this case, a (Nc,Kc)-RS encoding process is performed on each
column, so as to generate Nc-Kc(=P) number of parity bytes. Then, the
newly generated P number of parity bytes is added after the very last
byte of the corresponding column, thereby creating a column of (187+P)
bytes. Herein, as shown in FIG. 5(c), Kc is equal to 187 (i.e., Kc=187),
and Nc is equal to 187+P (i.e., Nc=187+P). For example, when P is equal
to 48, (235,187)-RS encoding process is performed so as to create a
column of 235 bytes. When such RS encoding process is performed on all N
number of columns, as shown in FIG. 5(c), a RS frame having the size of
N(row)*(187+P) (column) bytes may be created, as shown in FIG. 5(d). In
order to simplify the description of the present invention, the RS frame
having the RS parity inserted therein will be referred to as s second RS
frame. More specifically, the second RS frame having the structure of
(187+P) rows configured of N bytes may be configured.

[0128] As shown in FIG. 5(c) or FIG. 5(d), each row of the RS frame is
configured of N bytes. However, depending upon channel conditions between
the transmitting system and the receiving system, error may be included
in the RS frame. When errors occur as described above, CRC data (or CRC
code or CRC checksum) may be used on each row unit in order to verify
whether error exists in each row unit. The RS frame encoder 302 may
perform CRC encoding on the mobile service data being RS encoded so as to
create (or generate) the CRC data. The CRC data being generated by CRC
encoding may be used to indicate whether the mobile service data have
been damaged while being transmitted through the channel.

[0129] The present invention may also use different error detection
encoding methods other than the CRC encoding method. Alternatively, the
present invention may use the error correction encoding method to enhance
the overall error correction ability of the receiving system. FIG. 5(e)
illustrates an example of using a 2-byte (i.e., 16-bit) CRC checksum as
the CRC data. Herein, a 2-byte CRC checksum is generated for N number of
bytes of each row, thereby adding the 2-byte CRC checksum at the end of
the N number of bytes. Thus, each row is expanded to (N+2) number of
bytes. Equation 1 below corresponds to an exemplary equation for
generating a 2-byte CRC checksum for each row being configured of N
number of bytes.

g(x)=x16+x12+x.sup.5+1 Equation 1

[0130] The process of adding a 2-byte checksum in each row is only
exemplary. Therefore, the present invention is not limited only to the
example proposed in the description set forth herein. In order to
simplify the understanding of the present invention, the RS frame having
the RS parity and CRC checksum added therein will hereinafter be referred
to as a third RS frame. More specifically, the third RS frame corresponds
to (187+P) number of rows each configured of (N+2) number of bytes. As
described above, when the process of RS encoding and CRC encoding are
completed, the (N*187)-byte RS frame is expanded to a (N+2)*(187+P)-byte
RS frame.

[0131] Based upon an error correction scenario of a RS frame, the data
bytes within the RS frame are transmitted through a channel in a row
direction. At this point, when a large number of errors occur during a
limited period of transmission time, errors also occur in a row direction
within the RS frame being processed with a decoding process in the
receiving system. However, in the perspective of RS encoding performed in
a column direction, the errors are shown as being scattered. Therefore,
error correction may be performed more effectively. At this point, a
method of increasing the number of parity data bytes (P) may be used in
order to perform a more intense error correction process. However, using
this method may lead to a decrease in transmission efficiency. Therefore,
a mutually advantageous method is required. Furthermore, when performing
the decoding process, an erasure decoding process may be used to enhance
the error correction performance.

[0132] The RS frame encoder according to the present invention also
performs a row permutation (or interleaving) process in super frame units
in order to further enhance the error correction performance when error
correction the RS frame. FIG. 6 illustrates an example of performing a
row permutation (or interleaving) process in super frame units according
to the present invention. More specifically, G number of RS frames
encoded as shown in FIG. 5 is grouped to form a super frame, as shown in
FIG. 6(a). At this point, since each RS frame is formed of (N+2)*(187+P)
number of bytes, one super frame is configured to have the size of
(N+2)*(187+P)*G bytes.

[0133] When a row permutation process permuting each row of the super
frame configured as described above is performed based upon a
pre-determined permutation rule, the positions of the rows prior to and
after being permuted (or interleaved) within the super frame may be
altered. More specifically, the ith row of the super frame prior to
the interleaving process, as shown in FIG. 6(b), is positioned in the j
row of the same super frame after the row permutation process. The
above-described relation between i and j can be easily understood with
reference to a permutation rule as shown in Equation 2 below.

j=G(i mod(187+P))+.left brkt-bot.i/(187+P).right brkt-bot.

i=(187+P)(j mod G+.left brkt-bot.j/G.right brkt-bot.

where 0≦i, j≦(187+P)G-1; or

where 0≦i, j<(187+P)G Equation 2

[0134] Herein, each row of the super frame is configured of (N+2) number
of data bytes even after being row-permuted in super frame units.

[0135] When all row permutation processes in super frame units are
completed, the super frame is once again divided into G number of
row-permuted RS frames, as shown in FIG. 6(d), and then provided to the
block processor 303. Herein, the number of RS parity bytes and the number
of columns should be equally provided in each of the RS frames, which
configure a super frame. As described in the error correction scenario of
a RS frame, in case of the super frame, a section having a large number
of error occurring therein is so long that, even when one RS frame that
is to be decoded includes an excessive number of errors (i.e., to an
extent that the errors cannot be corrected), such errors are scattered
throughout the entire super frame. Therefore, in comparison with a single
RS frame, the decoding performance of the super frame is more enhanced.
As described above, the mobile service data being encoded on RS frame
units and row-permuted in super frame units by the RS frame encoders 302
are outputted to the block processor 303.

[0136] As described above, the mobile service data encoded by the RS frame
encoder 302 are inputted to the block processor 303. The block processor
303 then encodes the inputted mobile service data at a coding rate of D/E
(wherein, D is smaller than E (i.e., D<E)) and then outputted to the
group formatter 304. More specifically, the block processor 303 divides
the mobile service data being inputted in byte units into bit units.
Then, the D number of bits is encoded to E number of bits. Thereafter,
the encoded bits are converted back to byte units and then outputted. For
example, if 1 bit of the input data is coded to 2 bits and outputted,
then D is equal to 1 and E is equal to 2 (i.e., D=1 and E=2).
Alternatively, if 1 bit of the input data is coded to 4 bits and
outputted, then D is equal to 1 and E is equal to 4 (i.e., D=1 and E=4).
Hereinafter, the former coding rate will be referred to as a coding rate
of 1/2 (1/2-rate coding), and the latter coding rate will be referred to
as a coding rate of 1/4 (1/4-rate coding), for simplicity.

[0137] Herein, when using the 1/4 coding rate, the coding efficiency is
greater than when using the 1/2 coding rate, and may, therefore, provide
greater and enhanced error correction ability. For such reason, when it
is assumed that the data encoded at a 1/4 coding rate in the group
formatter 304, which is located near the end portion of the system, are
allocated to an area in which the receiving performance may be
deteriorated, and that the data encoded at a 1/2 coding rate are
allocated to an area having excellent receiving performance, the
difference in performance may be reduced. At this point, the block
processor 303 may also receive signaling information including
transmission parameters. Herein, the signaling information may also be
processed with either 1/2-rate coding or 1/4-rate coding as in the step
of processing mobile service data. Thereafter, the signaling information
is also considered the same as the mobile service data and processed
accordingly.

[0138] Meanwhile, the group formatter inserts mobile service data that are
outputted from the block processor 303 in corresponding areas within a
data group, which is configured in accordance with a pre-defined rule.
Also, with respect to the data deinterleaving process, each place holder
or known data (or known data place holders) are also inserted in
corresponding areas within the data group. At this point, the data group
may be divided into at least one hierarchical area. Herein, the type of
mobile service data being inserted in each area may vary depending upon
the characteristics of each hierarchical area. Additionally, each area
may, for example, be divided based upon the receiving performance within
the data group. Furthermore, one data group may be configured to include
a set of field synchronization data.

[0139] In an example given in the present invention, a data group is
divided into A, B, and C regions in a data configuration prior to data
deinterleaving. At this point, the group formatter 304 allocates the
mobile service data, which are inputted after being RS encoded and block
encoded, to each of the corresponding regions by referring to the
transmission parameter. FIG. 7A illustrates an alignment of data after
being data interleaved and identified, and FIG. 7B illustrates an
alignment of data before being data interleaved and identified. More
specifically, a data structure identical to that shown in FIG. 7A is
transmitted to a receiving system. Also, the data group configured to
have the same structure as the data structure shown in FIG. 7A is
inputted to the data deinterleaver 305.

[0140] As described above, FIG. 7A illustrates a data structure prior to
data deinterleaving that is divided into 3 regions, such as region A,
region B, and region C. Also, in the present invention, each of the
regions A to C is further divided into a plurality of regions. Referring
to FIG. 7A, region A is divided into 5 regions (A1 to A5), region B is
divided into 2 regions (B1 and B2), and region C is divided into 3
regions (C1 to C3). Herein, regions A to C are identified as regions
having similar receiving performances within the data group. Herein, the
type of mobile service data, which are inputted, may also vary depending
upon the characteristic of each region.

[0141] In the example of the present invention, the data structure is
divided into regions A to C based upon the level of interference of the
main service data. Herein, the data group is divided into a plurality of
regions to be used for different purposes. More specifically, a region of
the main service data having no interference or a very low interference
level may be considered to have a more resistant (or stronger) receiving
performance as compared to regions having higher interference levels.
Additionally, when using a system inserting and transmitting known data
in the data group, and when consecutively long known data are to be
periodically inserted in the mobile service data, the known data having a
predetermined length may be periodically inserted in the region having no
interference from the main service data (e.g., region A). However, due to
interference from the main service data, it is difficult to periodically
insert known data and also to insert consecutively long known data to a
region having interference from the main service data (e.g., region B and
region C).

[0142] Hereinafter, examples of allocating data to region A (A1 to A5),
region B (B1 and B2), and region C (C1 to C3) will now be described in
detail with reference to FIG. 7A. The data group size, the number of
hierarchically divided regions within the data group and the size of each
region, and the number of mobile service data bytes that can be inserted
in each hierarchically divided region of FIG. 7A are merely examples
given to facilitate the understanding of the present invention. Herein,
the group formatter 304 creates a data group including places in which
field synchronization data bytes are to be inserted, so as to create the
data group that will hereinafter be described in detail.

[0143] More specifically, region A is a region within the data group in
which a long known data sequence may be periodically inserted, and in
which includes regions wherein the main service data are not mixed (e.g.,
A2 to A5). Also, region A includes a region (e.g., A1) located between a
field synchronization region and the region in which the first known data
sequence is to be inserted. The field synchronization region has the
length of one segment (i.e., 832 symbols) existing in an ATSC system.

[0144] For example, referring to FIG. 7A, 2428 bytes of the mobile service
data may be inserted in region A1, 2580 bytes may be inserted in region
A2, 2772 bytes may be inserted in region A3, 2472 bytes may be inserted
in region A4, and 2772 bytes may be inserted in region A5. Herein,
trellis initialization data or known data, MPEG header, and RS parity are
not included in the mobile service data. As described above, when region
A includes a known data sequence at both ends, the receiving system uses
channel information that can obtain known data or field synchronization
data, so as to perform equalization, thereby providing enforced
equalization performance.

[0145] Also, region B includes a region located within 8 segments at the
beginning of a field synchronization region within the data group
(chronologically placed before region A1) (e.g., region B1), and a region
located within 8 segments behind the very last known data sequence which
is inserted in the data group (e.g., region B2). For example, 930 bytes
of the mobile service data may be inserted in the region B1, and 1350
bytes may be inserted in region B2. Similarly, trellis initialization
data or known data, MPEG header, and RS parity are not included in the
mobile service data. In case of region B, the receiving system may
perform equalization by using channel information obtained from the field
synchronization region. Alternatively, the receiving system may also
perform equalization by using channel information that may be obtained
from the last known data sequence, thereby enabling the system to respond
to the channel changes.

[0146] Region C includes a region located within 30 segments including and
preceding the 9th segment of the field synchronization region
(chronologically located before region A) (e.g., region C1), a region
located within 12 segments including and following the 9th segment
of the very last known data sequence within the data group
(chronologically located after region A) (e.g., region C2), and a region
located in 32 segments after the region C2 (e.g., region C3). For
example, 1272 bytes of the mobile service data may be inserted in the
region C1, 1560 bytes may be inserted in region C2, and 1312 bytes may be
inserted in region C3. Similarly, trellis initialization data or known
data, MPEG header, and RS parity are not included in the mobile service
data. Herein, region C (e.g., region C1) is located chronologically
earlier than (or before) region A.

[0147] Since region C (e.g., region C1) is located further apart from the
field synchronization region which corresponds to the closest known data
region, the receiving system may use the channel information obtained
from the field synchronization data when performing channel equalization.
Alternatively, the receiving system may also use the most recent channel
information of a previous data group. Furthermore, in region C (e.g.,
region C2 and region C3) located before region A, the receiving system
may use the channel information obtained from the last known data
sequence to perform equalization. However, when the channels are subject
to fast and frequent changes, the equalization may not be performed
perfectly. Therefore, the equalization performance of region C may be
deteriorated as compared to that of region B.

[0148] When it is assumed that the data group is allocated with a
plurality of hierarchically divided regions, as described above, the
block processor 303 may encode the mobile service data, which are to be
inserted to each region based upon the characteristic of each
hierarchical region, at a different coding rate. For example, the block
processor 303 may encode the mobile service data, which are to be
inserted in regions A1 to A5 of region A, at a coding rate of 1/2. Then,
the group formatter 304 may insert the 1/2-rate encoded mobile service
data to regions A1 to A5.

[0149] The block processor 303 may encode the mobile service data, which
are to be inserted in regions B1 and B2 of region B, at a coding rate of
1/4 having higher error correction ability as compared to the 1/2-coding
rate. Then, the group formatter 304 inserts the 1/4-rate coded mobile
service data in region B1 and region B2. Furthermore, the block processor
303 may encode the mobile service data, which are to be inserted in
regions C1 to C3 of region C, at a coding rate of 1/4 or a coding rate
having higher error correction ability than the 1/4-coding rate. Then,
the group formatter 304 may either insert the encoded mobile service data
to regions C1 to C3, as described above, or leave the data in a reserved
region for future usage.

[0150] In addition, the group formatter 304 also inserts supplemental
data, such as signaling information that notifies the overall
transmission information, other than the mobile service data in the data
group. Also, apart from the encoded mobile service data outputted from
the block processor 303, the group formatter 304 also inserts MPEG header
place holders, non-systematic RS parity place holders, main service data
place holders, which are related to data deinterleaving in a later
process, as shown in FIG. 7A. Herein, the main service data place holders
are inserted because the mobile service data bytes and the main service
data bytes are alternately mixed with one another in regions B and C
based upon the input of the data deinterleaver, as shown in FIG. 7A. For
example, based upon the data outputted after data deinterleaving, the
place holder for the MPEG header may be allocated at the very beginning
of each packet.

[0151] Furthermore, the group formatter 304 either inserts known data
generated in accordance with a pre-determined method or inserts known
data place holders for inserting the known data in a later process.
Additionally, place holders for initializing the trellis encoding module
256 are also inserted in the corresponding regions.

[0152] For example, the initialization data place holders may be inserted
in the beginning of the known data sequence.

[0153] Herein, the size of the mobile service data that can be inserted in
a data group may vary in accordance with the sizes of the trellis
initialization place holders or known data (or known data place holders),
MPEG header place holders, and RS parity place holders.

[0154] FIG. 8 illustrates a part of data region A of the signal frame
shown in FIG. 7A. Various data symbol regions are shown FIG. 8. The top
segment is a field sync segment having a length of 832 symbols. The known
data are included in first, second, and third known data areas as shown
in FIG. 8. The first known data area is located 16 segments below the
field sync signal (top segment in FIG. 8). The second known data area is
located 16 segments below the first known data area, and the third known
data area is located 16 segments below the second known data area.

[0155] Each of the first, second, and third known data areas includes an
initialization data region including data (4 symbols) required to
initialize trellis decoding. Furthermore, each of the first and second
known data regions further includes a dummy data region next to the
initialization data region, and a known data region next to the dummy
data region. The known data region includes known data symbols which may
be used to compensate channel distortion of a channel equalizer or to
transmit an error correction coding mode. In addition, they can be used
for initial carrier recovery. The dummy data region includes dummy known
data symbols which can be combined with the known data symbols in the
known data region to form a total of 1424 known data symbols required for
trellis decoding.

[0156] The known data region (1424 symbols) included in the first known
data area may include a training sequence which can be used to obtain a
channel impulse response (CIR) required for channel equalization. The
first known data region further includes a reserved data region (252
symbols) which may be used to transmit an error correction code mode. For
example, the reserved data region may include information identifying a
Serial Concatenated Convolution Code (SCCC) mode which is an example of
the error correction code mode. Table 1 below shows an example of the
SCCC mode. Herein, the mode designating the coding rate of each region
will be referred to as a serial concatenated convolution code (SCCC) mode
for simplicity. Examples of the SCCC mode are shown in Table 1 below.

[0157] For example, when the SCCC mode value that is extracted from the
known data region is equal to `2`, this indicates that region A and
region C within the corresponding data group are encoded at a coding rate
of 1/2 and that region B is encoded at a coding rate of 1/4. The
transmitting system of the present invention generates 6 patterns
corresponding to each mode value shown in Table 1 based upon an agreement
between the transmitting system and the receiving system. Herein, the
corresponding pattern may be inserted in the known data region for each
data group. In this case, the receiving system may obtain the SCCC mode
information from the known data region prior to performing a decoding
process in accordance with the corresponding SCCC mode.

[0158] If such identification information is included, the broadcast
receiving system may use the identified SCCC mode during SCCC decoding.
The first known data region further includes two 576-symbol ACQ data
regions including data required to acquire initial carrier frequency
synchronization. And, the ACQ data regions can be further used to acquire
synchronization for mobile service data.

[0159] Referring back to FIG. 8, the second known data area located 32
segments below the field sync segment includes an initialization data
region including data required to initialize trellis decoding, a dummy
data region, and a known data region including known data to be used for
channel equalization. Similarly, the third known data area includes an
initialization data region including data required to initialize trellis
decoding, and a known data region including known data to be used for
channel equalization. A part of the initialization data region may be
used to estimate a channel impulse response (CIR) as shown in FIG. 8 in
which a start of CIR TS is located in the initialization data region.

[0160] The data region between the field sync segment and the first known
data region includes 11892 valid data symbols, the data region between
the first and second known data regions includes 10480 valid data
symbols, and the data region between the second and third known data
regions includes 11888 valid data symbols. The size of each data region
shown in FIG. 8 can be altered. The known data can be used for channel
equalization, or they can be used for transmit various signaling
information. The field sync segment can also include signaling
information.

[0161] FIGS. 9(a) to 9(c) illustrate a data structure (arrangement) of
transmission (Tx) parameters included in a mobile service data region as
signaling data. FIG. 9(a) illustrates signaling data having a length of 4
bytes. The signaling data include various information specifying a
service identifier (ID), an RS mode for regions A and B shown in FIG. 7A,
an RS mode for region C shown in FIG. 7A, a super frame size (SFS), a
permuted frame index (PFI) indicating a location of an RS frame in a
super frame, a burst size, a group index (GI) indicating an index of a
data group, and a time to a next burst (TNB). The sizes of these
information are shown in FIG. 9(a). FIGS. 9(b) and 9(c) illustrate
arrangements of the signaling data in the signal frame shown in FIG. 7A.
If an error correction mode for region A in the signal frame is a 1/2
rate SCCC mode (hereinafter, error correction mode 1), region A may
include a first data region having 4-byte signaling data, a second data
region having 4-byte duplicated signaling data, and a third data region
having 32-byte RS parity data, as shown in FIG. 9(b). Alternatively, if
the error correction mode for region A is a 1/4 rate SCCC mode
(hereinafter, error correction mode 2), region A may include a first data
region having 4-byte signaling data and a second data region having
16-byte RS parity data.

[0162] FIG. 10 illustrates how the signaling data are inserted in a signal
frame after interleaving in the broadcast transmitting system. The
signaling data may be multiplexed with mobile service data in region A.
Referring to FIG. 10, region A is divided into sub-regions A1 to A5 by
each known data region, where sub-regions A1 to A5 are positioned from
top to bottom. If mobile service data including the 32-byte data shown in
FIG. 9(b) are encoded in error correction mode 1 (1/2 rate) and
interleaved, 6, 8, 6, 6, and 6 bytes of the 32-byte data are included in
sub-regions A1, A2, A3, A4, and A5, respectively, as shown in FIG. 10. On
the other hand, if mobile service data including the 16-byte data shown
in FIG. 9(c) are encoded in error correction mode 2 (1/4 rate), 3, 4, 3,
3, and 3 bytes of the 16-byte data are inserted in sub-regions A1, A2,
A3, A4, and A5, respectively.

A broadcast receiving system can obtain the transmission parameters from
the mobile service data by protocol with a broadcast transmitting system.
Using the transmission parameters, the receiving system can identify a
SCCC mode before performing SCCC decoding and use the identified SCCC
mode during error correction decoding. The signaling data can be included
in at least one of a field sync region, a known data region, and a mobile
service data region, and the signaling data can include various
transmission parameters.

[0163] The output of the group formatter 304 is inputted to the data
deinterleaver 305. And, the data deinterleaver 305 deinterleaves data by
performing an inverse process of the data interleaver on the data and
place holders within the data group, which are then outputted to the
packet formatter 306. More specifically, when the data and place holders
within the data group configured, as shown in FIG. 7A, are deinterleaved
by the data deinterleaver 305, the data group being outputted to the
packet formatter 306 is configured to have the structure shown in FIG.
7B.

[0164] The packet formatter 306 removes the main service data place
holders and the RS parity place holders that were allocated for the
deinterleaving process from the deinterleaved data being inputted. Then,
the packet formatter 306 groups the remaining portion and replaces the
4-byte MPEG header place holder with an MPEG header having a null packet
PID (or an unused PID from the main service data packet). Also, when the
group formatter 304 inserts known data place holders, the packet
formatter 306 may insert actual known data in the known data place
holders, or may directly output the known data place holders without any
modification in order to make replacement insertion in a later process.
Thereafter, the packet formatter 306 identifies the data within the
packet-formatted data group, as described above, as a 188-byte unit
mobile service data packet (i.e., MPEG TS packet), which is then provided
to the packet multiplexer 240.

[0165] The packet multiplexer 240 multiplexes the mobile service data
packet outputted from the pre-processor 230 and the main service data
packet outputted from the packet jitter mitigator 220 in accordance with
a pre-defined multiplexing method. Then, the packet multiplexer 240
outputs the multiplexed data packets to the data randomizer 251 of the
post-processor 250. Herein, the multiplexing method may vary in
accordance with various variables of the system design. One of the
multiplexing methods of the packet formatter 240 consists of providing a
burst section along a time axis, and, then, transmitting a plurality of
data groups during a burst-on section within the burst section, and
transmitting only the main service data during the burst-off section
within the burst section. Herein, the burst section indicates the section
starting from the beginning of the current burst until the beginning of
the next burst.

[0166] At this point, the main service data may be transmitted during the
burst-on section. The packet multiplexer 240 refers to the transmission
parameter, such as information on the burst size or the burst period, so
as to be informed of the number of data groups and the period of the data
groups included in a single burst. Herein, the mobile service data and
the main service data may co-exist in the burst-on section, and only the
main service data may exist in the burst-off section. Therefore, a main
data service section transmitting the main service data may exist in both
burst-on and burst-off sections. At this point, the main data service
section within the burst-on section and the number of main data service
packets included in the burst-off section may either be different from
one another or be the same.

[0167] When the mobile service data are transmitted in a burst structure,
in the receiving system receiving only the mobile service data turns the
power on only during the burst section, thereby receiving the
corresponding data. Alternatively, in the section transmitting only the
main service data, the power is turned off so that the main service data
are not received in this section. Thus, the power consumption of the
receiving system may be reduced.

[0168] FIG. 11 illustrates an example of acquiring mobile service data
included in a particular data group within a burst according to the
present invention. For simplicity, it will be assumed that the mobile
service data of FIG. 11 include a program associated with a particular
service. Depending upon the data group, mobile service data and main
service data may be multiplexed in a single burst. When the mobile
service data group is included and transmitted in a group being included
in a burst, the broadcast receiving system turns the power on only during
the burst that is included in a burst so as to receive a broadcast signal
(i.e., on-time). Also, the broadcast receiving system may decode and
output the mobile service data included in the data group within the
burst that is being received. Furthermore, the broadcast receiving system
may obtain a time to a next burst (TNB) from the signaling information.
Then, by turning the power off until the next burst is received, the
broadcast receiving system does not receive any broadcast signal (i.e.,
off-time). The broadcast receiving system turns the power back on during
the next burst (burst 2), thereby receiving the mobile service data
included in the newly received burst (i.e., on-time).

[0169] FIG. 12 illustrates an example of mobile service data associated to
a plurality of services within one burst being multiplexed. Referring to
FIG. 12, the mobile service data providing a first service will be
indicated as mo1, and the mobile service data providing a second service
will be indicated as mo2. In this example, a burst represents a signal
section (or block) wherein the mobile service data are multiplexed. More
specifically, the signal block including the mobile service data
associated to the first service may become a first burst section, and the
signal block including the mobile service data associated to the second
service may become a second burst section. When the broadcast receiving
system wishes to receive the program associated to the first service, a
data block including data groups G1 and G3 in which the data
corresponding to the first service is determined as the burst section.
Thus, the power is turned on during the burst section. The broadcast
receiving system obtains the next burst in which the data group
corresponding to the first service from the signaling information
indicated as TNBG1 and TNBG2. Therefore, the power is turned
off until the next burst. Then, the power is turned back on at the point
the next burst is being received.

[0170] Alternatively, when the broadcast receiving system wishes to
receive the program associated to the second service, the power may be
turned on and off only during the burst section corresponding to a signal
section including the data on the second service. More specifically, the
power is turned on during the burst section having the data group
corresponding to the second service included therein. Then, the broadcast
receiving system obtains the next burst in which the data group
corresponding to the second service from the signaling information
indicated as TNBG2 and TNBG4. Therefore, the power is turned
off until the next burst. Then, the power is turned back on at the point
the next burst is being received.

Detailed Embodiments of the RS Frame Structure and Packet Multiplexing

[0171] Hereinafter, detailed embodiments of the pre-processor 230 and the
packet multiplexer 240 will now be described. According to an embodiment
of the present invention, the N value corresponding to the length of a
row, which is included in the RS frame that is configured by the RS frame
encoder 302, is set to 538. Accordingly, the RS frame encoder 302
receives 538 transport stream (TS) packets so as to configure a first RS
frame having the size of 538*187 bytes. Thereafter, as described above,
the first RS frame is processed with a (235,187)-RS encoding process so
as to configure a second RS frame having the size of 538*235 bytes.
Finally, the second RS frame is processed with generating a 16-bit
checksum so as to configure a third RS frame having the sizes of 540*235.

[0172] Meanwhile, as shown in FIG. 7A, the sum of the number of bytes of
regions A1 to A5 of region A, in which 1/2-rate encoded mobile service
data are to be inserted, among the plurality of regions within the data
group is equal to 13024 bytes (=2428+2580+2772+2472+2772 bytes). Herein,
the number of byte prior to performing the 1/2-rate encoding process is
equal to 6512 (=13024/2). On the other hand, the sum of the number of
bytes of regions B1 and B2 of region B, in which 1/4-rate encoded mobile
service data are to be inserted, among the plurality of regions within
the data group is equal to 2280 bytes (=930+1350 bytes). Herein, the
number of byte prior to performing the 1/4-rate encoding process is equal
to 570 (=2280/4).

[0173] In other words, when 7082 bytes of mobile service data are inputted
to the block processor 303, 6512 byte are expanded to 13024 bytes by
being 1/2-rate encoded, and 570 bytes are expanded to 2280 bytes by being
1/4-rate encoded. Thereafter, the block processor 303 inserts the mobile
service data expanded to 13024 bytes in regions A1 to A5 of region A and,
also, inserts the mobile service data expanded to 2280 bytes in regions
B1 and B2 of region B. Herein, the 7082 bytes of mobile service data
being inputted to the block processor 303 may be divided into an output
of the RS frame encoder 302 and signaling information. In the present
invention, among the 7082 bytes of mobile service data, 7050 bytes
correspond to the output of the RS frame encoder 302, and the remaining
32 bytes correspond to the signaling information data. Then, 1/2-rate
encoding or 1/4-rate encoding is performed on the corresponding data
bytes.

[0174] Meanwhile, a RS frame being processed with RS encoding and CRC
encoding from the RS frame encoder 302 is configured of 540*235 bytes, in
other words, 126900 bytes. The 126900 bytes are divided by 7050-byte
units along the time axis, so as to produce 18 7050-byte units.
Thereafter, a 32-byte unit of signaling information data is added to the
7050-byte unit mobile service data being outputted from the RS frame
encoder 302. Subsequently, the RS frame encoder 302 performs 1/2-rate
encoding or 1/4-rate encoding on the corresponding data bytes, which are
then outputted to the group formatter 304. Accordingly, the group
formatter 304 inserts the 1/2-rate encoded data in region A and the
1/4-rate encoded data in region B.

[0175] The process of deciding an N value that is required for configuring
the RS frame from the RS frame encoder 302 will now be described in
detail. More specifically, the size of the final RS frame (i.e., the
third RS frame), which is RS encoded and CRC encoded from the RS frame
encoder 302, which corresponds to (N+2)*235 bytes should be allocated to
X number of groups, wherein X is an integer. Herein, in a single data
group, 7050 data bytes prior to being encoded are allocated. Therefore,
if the (N+2)*235 bytes are set to be the exact multiple of 7050
(=30*235), the output data of the RS frame encoder 302 may be efficiently
allocated to the data group. According to an embodiment of the present
invention, the value of N is decided so that (N+2) becomes a multiple of
30. For example, in the present invention, N is equal to 538, and
(N+2)(=540) divided by 30 is equal to 18. This indicates that the mobile
service data within one RS frame are processed with either 1/2-rate
encoding or 1/4-rate encoding. The encoded mobile service data are then
allocated to 18 data groups.

[0176]FIG. 13 illustrates a process of dividing the RS frame according to
the present invention. More specifically, the RS frame having the size of
(N+2)*235 is divided into 30*235 byte blocks. Then, the divided blocks
are mapped to a single group. In other words, the data of a block having
the size of 30*235 bytes are processed with one of a 1/2-rate encoding
process and a 1/4-rate encoding process and are, then, inserted in a data
group.

[0177] In another example, it is assumed that the mobile service data that
are to be inserted in region C are 1/2-rate encoded by the block
processor 303, and that the mobile service data that are to be inserted
in region C correspond to a different type of mobile service data that
are inserted in regions A and B. In this case, as shown in FIG. 7A, the
total number of 1/2-rate encoded mobile service data bytes that are to be
included in regions C1 to C3 of region C is equal to 4144 bytes (i.e.,
4144=1272+1560+1312). In this case, the total number of mobile service
data bytes prior to being 1/2-rate encoded is equal to 2072 bytes (i.e.,
2072=4144/2). At this point, when it is assumed that 18 data groups are
grouped to form a RS frame, and that the mobile service data of the RS
frame are inserted into the region C, the RS frame is configured of 37296
bytes. Herein, the number of RS parity bytes P is set to be equal to 36
(i.e., P=36), and 2 CRC checksums are set to be included for each row.

[0178] Accordingly, a total of 165 188-byte mobile service data packets
may be transmitted for each RS frame. In this case, 55 bytes may remain
for each RS frame of the region C within the data group. Remaining data
bytes may occur, when dividing each RS frame into a plurality of data
groups having the same size. More specifically, remaining data bytes may
occur in particular regions in each RS frame depending upon the size of
the RS frames, the size and number of divided data groups, the number of
mobile service data bytes that may be inserted into each data group, the
coding rate of the corresponding region, the number of RS parity bytes,
whether or not a CRC checksum has been allocated, and, if any, the number
of CRC checksums allocated.

[0179] When dividing the RS frame into a plurality of data groups having
the same size, and when remaining data bytes occur in the corresponding
RS frame, K number of dummy bytes are added to the corresponding RS
frame, wherein K is equal to the number of remaining data bytes within
the RS frame. Then, the dummy byte-added RS frame is divided into a
plurality of data groups. This process is illustrated in FIG. 14. More
specifically, FIG. 14 illustrates an example of processing K number of
remaining data bytes, which are produced by dividing the RS frame having
the size of (N+2)*(187+P) bytes into M number of data groups having equal
sizes. In this case, as shown in FIG. 14(a), K number of dummy bytes are
added to the RS frame having the size of (N+2)*(187+P) bytes.
Subsequently, the RS frame is read in row units, thereby being divided
into M number of data groups, as shown in FIG. 14(b). At this point, each
data group has the size of NoBytesPerGrp bytes. This may be described by
Equation 3 shown below.

M×NoBytesPerGrp=(N+2)×(187+P)×K Equation 3

[0180] Herein, NoBytesPerGrp indicates the number of bytes allocated for
each group (i.e., the Number of Bytes Per Group). More specifically, the
size corresponding to the number of byte in one RS frame+K bytes is equal
to the size of the M number of data groups.

[0181] When the mobile service data are transmitted by using the
above-described method and transmission mode, the data randomizer 301 of
the pre-processor 230 may receive the mobile service data packets through
a first mobile service data path and a second mobile service data path,
to which data that are to be allocated to regions A and B are inputted.
More specifically, 538 data packets are inputted to the first mobile
service data path, and 165 data packets are inputted to the second mobile
service data path. In order to do so, a plurality of data randomizers and
RS frame encoders may be provided. Accordingly, the 538 data packets
being inputted to the first mobile service data path and the 165 data
packets being inputted to the second mobile service data path are
randomized by each respective data randomizer. Then, each RS frame
encoder performs RS frame unit encoding and super frame unit row
permutation processes on the inputted data packets. Thereafter, the
processed data packets are divided back to RS frame units, thereby being
inputted to the block processor 303.

[0182] For example, the RS frame encoder encoding the data being inputted
through the first mobile service data path adds 48 parity bytes in a
column direction to the corresponding RS frame. This RS frame encoder
also adds a 2-byte CRC checksum in a row direction to the corresponding
RS frame. The RS frame encoder encoding the data being inputted through
the second mobile service data path adds 36 parity bytes in a column
direction to the corresponding RS frame. This RS frame encoder also adds
a 2-byte CRC checksum in a row direction to the corresponding RS frame.

[0183] The block processor 303 performs 1/2-rate encoding on the data that
are to be allocated to regions A and C. And, the block processor 303
performs 1/4-rate encoding on the data that are to be allocated to region
B. The block processor 303 then outputs the encoded data to the group
formatter 304.

[0184] At this point, since 55 bytes remain in region C included in the
data group for each RS frame, as described above, the block processor 303
adds 55 bytes of dummy bytes to region C, once all data that are to be
allocated to region C are inputted. Thereafter, the block processor 303
1/2-rate encodes the processed data. Herein, the dummy bytes may be added
by the block processor 303, as described above, or may be added by an
external block (not shown).

[0185] The group formatter 304 inserts (or allocates) the 1/2-rate or
1/4-rate encoded and inputted mobile service data and known data (e.g.,
MPEG header place holders, non-systematic RS parity place holders,
initialization data place holders, etc.) to the respective regions within
the data group shown in FIG. 7A. For example, the mobile service data
that are inputted through the first mobile service data path and then
1/2-rate or 1/4-rate encoded are inserted in regions A and B. And, the
mobile service data that are inputted through the second mobile service
data path and then 1/2-rate encoded are inserted in region C.

[0186]FIG. 15 illustrates detailed exemplary operations of the packet
multiplexer 240 according to an embodiment of the present invention. More
specifically, the packet multiplexer 240 multiplexes data fields
including a data group and data fields only including main service data
and outputs the randomized data to the data randomizer 251. According to
the present invention, the data fields including a data group are
transmitted to a burst-on section. And, the data fields including only
the main service data are transmitted to a burst-off section. At this
point, the burst-on section may also transmit the main service data.

[0187]FIG. 15 illustrates exemplary operations of a packet multiplexer
for transmitting the data group according to the present invention. More
specifically, the packet multiplexer 240 multiplexes a field including a
data group, in which the mobile service data and main service data are
mixed with one another, and a field including only the main service data.
Thereafter, the packet multiplexer 240 outputs the multiplexed fields to
the data randomizer 251. At this point, in order to transmit the RS frame
having the size of 540*235 bytes, 18 data groups should be transmitted.
Herein, each data group includes field synchronization data, as shown in
FIG. 7A. Therefore, the 18 data groups are transmitted during 18 field
sections, and the section during which the 18 data groups are being
transmitted corresponds to the burst-on section.

[0188] In each field within the burst-on section, a data group including
field synchronization data is multiplexed with main service data, which
are then outputted. For example, in the embodiment of the present
invention, in each field within the burst-on section, a data group having
the size of 118 segments is multiplexed with a set of main service data
having the size of 194 segments. Referring to FIG. 15, during the
burst-on section (i.e., during the 18 field sections), a field including
18 data groups is transmitted. Then, during the burst-off section that
follows (i.e., during the 12 field sections), a field consisting only of
the main service data is transmitted. Subsequently, during a subsequent
burst-on section, 18 fields including 18 data groups are transmitted.
And, during the following burst-off section, 12 fields consisting only of
the main service data are transmitted.

[0189] Furthermore, in the present invention, the same type of data
service may be provided in the first burst-on section including the first
18 data groups and in the second burst-on section including the next 18
data groups. Alternatively, different types of data service may be
provided in each burst-on section. For example, when it is assumed that
different data service types are provided to each of the first burst-on
section and the second burst-on section, and that the receiving system
wishes to receive only one type of data service, the receiving system
turns the power on only during the corresponding burst-on section
including the desired data service type so as to receive the
corresponding 18 data fields. Then, the receiving system turns the power
off during the remaining 42 field sections so as to prevent other data
service types from being received. Thus, the amount of power consumption
of the receiving system may be reduced. In addition, the receiving system
according to the present invention is advantageous in that one RS frame
may be configured from the 18 data groups that are received during a
single burst-on section.

[0190] According to the present invention, the number of data groups
included in a burst-on section may vary based upon the size of the RS
frame, and the size of the RS frame varies in accordance with the value
N. More specifically, by adjusting the value N, the number of data groups
within the burst section may be adjusted. Herein, in an example of the
present invention, the (235,187)-RS encoding process adjusts the value N
during a fixed state. Furthermore, the size of the mobile service data
that can be inserted in the data group may vary based upon the sizes of
the trellis initialization data or known data, the MPEG header, and the
RS parity, which are inserted in the corresponding data group.

[0191] Meanwhile, since a data group including mobile service data
in-between the data bytes of the main service data during the packet
multiplexing process, the shifting of the chronological position (or
place) of the main service data packet becomes relative. Also, a system
object decoder (i.e., MPEG decoder) for processing the main service data
of the receiving system, receives and decodes only the main service data
and recognizes the mobile service data packet as a null data packet.
Therefore, when the system object decoder of the receiving system
receives a main service data packet that is multiplexed with the data
group, a packet jitter occurs.

[0192] At this point, since a multiple-level buffer for the video data
exists in the system object decoder and the size of the buffer is
relatively large, the packet jitter generated from the packet multiplexer
240 does not cause any serious problem in case of the video data.
However, since the size of the buffer for the audio data is relatively
small, the packet jitter may cause considerable problem. More
specifically, due to the packet jitter, an overflow or underflow may
occur in the buffer for the main service data of the receiving system
(e.g., the buffer for the audio data). Therefore, the packet jitter
mitigator 220 re-adjusts the relative position of the main service data
packet so that the overflow or underflow does not occur in the system
object decoder.

[0193] In the present invention, examples of repositioning places for the
audio data packets within the main service data in order to minimize the
influence on the operations of the audio buffer will be described in
detail. The packet jitter mitigator 220 repositions the audio data
packets in the main service data section so that the audio data packets
of the main service data can be as equally and uniformly aligned and
positioned as possible. The standard for repositioning the audio data
packets in the main service data performed by the packet jitter mitigator
220 will now be described. Herein, it is assumed that the packet jitter
mitigator 220 knows the same multiplexing information as that of the
packet multiplexer 240, which is placed further behind the packet jitter
mitigator 220.

[0194] Firstly, if one audio data packet exists in the main service data
section (e.g., the main service data section positioned between two data
groups) within the burst-on section, the audio data packet is positioned
at the very beginning of the main service data section. Alternatively, if
two audio data packets exist in the corresponding data section, one audio
data packet is positioned at the very beginning and the other audio data
packet is positioned at the very end of the main service data section.
Further, if more than three audio data packets exist, one audio data
packet is positioned at the very beginning of the main service data
section, another is positioned at the very end of the main service data
section, and the remaining audio data packets are equally positioned
between the first and last audio data packets. Secondly, during the main
service data section placed immediately before the beginning of a
burst-on section (i.e., during a burst-off section), the audio data
packet is placed at the very end of the corresponding section.

[0195] Thirdly, during a main service data section within the burst-off
section after the burst-on section, the audio data packet is positioned
at the very end of the main service data section. Finally, the data
packets other than audio data packets are positioned in accordance with
the inputted order in vacant spaces (i.e., spaces that are not designated
for the audio data packets). Meanwhile, when the positions of the main
service data packets are relatively re-adjusted, associated program clock
reference (PCR) values may also be modified accordingly. The PCR value
corresponds to a time reference value for synchronizing the time of the
MPEG decoder. Herein, the PCR value is inserted in a specific region of a
TS packet and then transmitted.

[0196] In the example of the present invention, the packet jitter
mitigator 220 also performs the operation of modifying the PCR value. The
output of the packet jitter mitigator 220 is inputted to the packet
multiplexer 240. As described above, the packet multiplexer 240
multiplexes the main service data packet outputted from the packet jitter
mitigator 220 with the mobile service data packet outputted from the
pre-processor 230 into a burst structure in accordance with a
pre-determined multiplexing rule. Then, the packet multiplexer 240
outputs the multiplexed data packets to the data randomizer 251 of the
post-processor 250.

[0197] If the inputted data correspond to the main service data packet,
the data randomizer 251 performs the same randomizing process as that of
the conventional randomizer. More specifically, the synchronization byte
within the main service data packet is deleted. Then, the remaining 187
data bytes are randomized by using a pseudo random byte generated from
the data randomizer 251. Thereafter, the randomized data are outputted to
the RS encoder/non-systematic RS encoder 252.

[0198] On the other hand, if the inputted data correspond to the mobile
service data packet, the data randomizer 251 may randomize only a portion
of the data packet. For example, if it is assumed that a randomizing
process has already been performed in advance on the mobile service data
packet by the pre-processor 230, the data randomizer 251 deletes the
synchronization byte from the 4-byte MPEG header included in the mobile
service data packet and, then, performs the randomizing process only on
the remaining 3 data bytes of the MPEG header. Thereafter, the randomized
data bytes are outputted to the RS encoder/non-systematic RS encoder 252.
More specifically, the randomizing process is not performed on the
remaining portion of the mobile service data excluding the MPEG header.
In other words, the remaining portion of the mobile service data packet
is directly outputted to the RS encoder/non-systematic RS encoder 252
without being randomized. Also, the data randomizer 251 may or may not
perform a randomizing process on the known data (or known data place
holders) and the initialization data place holders included in the mobile
service data packet.

[0199] The RS encoder/non-systematic RS encoder 252 performs an RS
encoding process on the data being randomized by the data randomizer 251
or on the data bypassing the data randomizer 251, so as to add 20 bytes
of RS parity data. Thereafter, the processed data are outputted to the
data interleaver 253. Herein, if the inputted data correspond to the main
service data packet, the RS encoder/non-systematic RS encoder 252
performs the same systematic RS encoding process as that of the
conventional broadcasting system, thereby adding the 20-byte RS parity
data at the end of the 187-byte data. Alternatively, if the inputted data
correspond to the mobile service data packet, the RS
encoder/non-systematic RS encoder 252 performs a non-systematic RS
encoding process. At this point, the 20-byte RS parity data obtained from
the non-systematic RS encoding process are inserted in a pre-decided
parity byte place within the mobile service data packet.

[0200] The data interleaver 253 corresponds to a byte unit convolutional
interleaver. The output of the data interleaver 253 is inputted to the
parity replacer 254 and to the non-systematic RS encoder 255. Meanwhile,
a process of initializing a memory within the trellis encoding module 256
is primarily required in order to decide the output data of the trellis
encoding module 256, which is located after the parity replacer 254, as
the known data pre-defined according to an agreement between the
receiving system and the transmitting system. More specifically, the
memory of the trellis encoding module 256 should first be initialized
before the received known data sequence is trellis-encoded. At this
point, the beginning portion of the known data sequence that is received
corresponds to the initialization data place holder and not to the actual
known data. Herein, the initialization data place holder has been
included in the data by the group formatter within the pre-processor 230
in an earlier process. Therefore, the process of generating
initialization data and replacing the initialization data place holder of
the corresponding memory with the generated initialization data are
required to be performed immediately before the inputted known data
sequence is trellis-encoded.

[0201] Additionally, a value of the trellis memory initialization data is
decided and generated based upon a memory status of the trellis encoding
module 256. Further, due to the newly replaced initialization data, a
process of newly calculating the RS parity and replacing the RS parity,
which is outputted from the data interleaver 253, with the newly
calculated RS parity is required. Therefore, the non-systematic RS
encoder 255 receives the mobile service data packet including the
initialization data place holders, which are to be replaced with the
actual initialization data, from the data interleaver 253 and also
receives the initialization data from the trellis encoding module 256.

[0202] Among the inputted mobile service data packet, the initialization
data place holders are replaced with the initialization data, and the RS
parity data that are added to the mobile service data packet are removed
and processed with non-systematic RS encoding. Thereafter, the new RS
parity obtained by performing the non-systematic RS encoding process is
outputted to the parity replacer 255. Accordingly, the parity replacer
255 selects the output of the data interleaver 253 as the data within the
mobile service data packet, and the parity replacer 255 selects the
output of the non-systematic RS encoder 255 as the RS parity. The
selected data are then outputted to the trellis encoding module 256.

[0203] Meanwhile, if the main service data packet is inputted or if the
mobile service data packet, which does not include any initialization
data place holders that are to be replaced, is inputted, the parity
replacer 254 selects the data and RS parity that are outputted from the
data interleaver 253. Then, the parity replacer 254 directly outputs the
selected data to the trellis encoding module 256 without any
modification. The trellis encoding module 256 converts the byte-unit data
to symbol units and performs a 12-way interleaving process so as to
trellis-encode the received data. Thereafter, the processed data are
outputted to the synchronization multiplexer 260.

[0204] The synchronization multiplexer 260 inserts a field synchronization
signal and a segment synchronization signal to the data outputted from
the trellis encoding module 256 and, then, outputs the processed data to
the pilot inserter 271 of the transmission unit 270. Herein, the data
having a pilot inserted therein by the pilot inserter 271 are modulated
by the modulator 272 in accordance with a pre-determined modulating
method (e.g., a VSB method). Thereafter, the modulated data are
transmitted to each receiving system though the radio frequency (RF)
up-converter 273.

Block Processor

[0205] FIG. 16 illustrates a block diagram showing a structure of a block
processor according to the present invention. Herein, the block processor
includes a byte-bit converter 401, a symbol encoder 402, a symbol
interleaver 403, and a symbol-byte converter 404. The byte-bit converter
401 divides the mobile service data bytes that are inputted from the RS
frame encoder 112 into bits, which are then outputted to the symbol
encoder 402. The byte-bit converter 401 may also receive signaling
information including transmission parameters. The signaling information
data bytes are also divided into bits so as to be outputted to the symbol
encoder 402. Herein, the signaling information including transmission
parameters may be processed with the same data processing step as that of
the mobile service data. More specifically, the signaling information may
be inputted to the block processor 303 by passing through the data
randomizer 301 and the RS frame encoder 302. Alternatively, the signaling
information may also be directly outputted to the block processor 303
without passing though the data randomizer 301 and the RS frame encoder
302.

[0206] The symbol encoder 402 corresponds to a D/E-rate encoder encoding
the inputted data from G bits to H bits and outputting the data encoded
at the coding rate of D/E. According to the embodiment of the present
invention, it is assumed that the symbol encoder 402 performs either a
coding rate of 1/2 (also referred to as a 1/2-rate encoding process) or
an encoding process at a coding rate of 1/4 (also referred to as a
1/4-rate encoding process). The symbol encoder 402 performs one of
1/2-rate encoding and 1/4-rate encoding on the inputted mobile service
data and signaling information. Thereafter, the signaling information is
also recognized as the mobile service data and processed accordingly.

[0208] The symbol encoder 402 may be operated as an encoder having the
coding rate of 1/2 or may be operated as an encoder having the coding
rate of 1/4.

[0209] FIG. 17A to FIG. 17C illustrate block views showing exemplary
operations of the symbol encoder having the coding rate of 1/4 according
to an embodiment of the present invention. The symbol encoder of FIG. 17A
includes a 1/4 outer encoder 411, and a parallel/serial converter 412.
Referring to FIG. 17A, the 1/4 outer encoder 411 encodes a mobile service
data bit U, which is being inputted to the 1/4 outer encoder 411, to u0
to u3 (i.e., to 2 symbols). Then, the 1/4 outer encoder 411 outputs the
encoded 2 symbols to the parallel/serial converter 412. The
parallel/serial converter 412 converts the two inputted symbols to serial
symbol units, which are then serially outputted to the symbol interleaver
403. More specifically, the parallel/serial converter 412 outputs one
symbol, which is configured of u0 and u1, to the symbol interleaver 403.
And, then the parallel/serial converter 412 outputs another symbol, which
is configured of u2 and u3, to the symbol interleaver 403.

[0210] The symbol encoder of FIG. 17B includes a 1/2 outer encoder 421 and
a repeater 422. Referring to FIG. 17B, the 1/2 outer encoder 421 encodes
a mobile service data bit U, which is being inputted to the 1/2 outer
encoder 421, to u0 and u1 (i.e., to 1 symbol). Then, the 1/2 outer
encoder 421 outputs the encoded symbol to the repeater 422. The repeater
422 repeats the 1/2-rate encoded symbol one time and outputs the repeated
symbol to the symbol interleaver 403. More specifically, the repeater 422
outputs the symbol configured of bit u0 and bit u1 to the symbol
interleaver 403. Then, the repeater 422 outputs the symbol configured of
bit u0 and bit u1 once again to the symbol interleaver 403.

[0211] The symbol encoder of FIG. 17C includes a repeater 431 and a 1/2
outer encoder 432. Referring to FIG. 17C, the repeater 431 repeats a
mobile service data bit U, which is being inputted to the repeater 431,
so as to output two bits U and U to the 1/2 outer encoder 432.
Thereafter, the 1/2 outer encoder 432 encodes the mobile service data bit
U being outputted from the repeater 431, to u0 and u1 (i.e., to 1
symbol). Then, the 1/2 outer encoder 431 outputs the encoded symbol to
the symbol interleaver 403. At this point, since identical mobile service
data bits U are sequentially inputted to the 1/2 outer encoder 432 twice,
the 1/2 outer encoder 432 performs the 1/2-rate encoding process twice on
the mobile service data bit U, which is being inputted to the repeater
431.

[0212] More specifically, when the symbol encoder 402 repeatedly outputs 2
symbols encoded at a coding rate of 1/2, as shown in FIG. 17B, or when
the symbol encoder 402 performs the 1/2-rate encoding process two times
on the input data bit and then outputs the encoded data bit, as shown in
FIG. 17C, the overall coding rate becomes 1/4. As described above, when
the symbol encoder 402 is operated as an encoder having a coding rate of
1/4, the input data bit may be encoded at a coding rate of 1/4, so that
each symbol can be sequentially outputted one by one. Alternatively, the
input data may be encoded at a coding rate of 1/2 and then repeated one
time, so that each symbol can be sequentially outputted one by one.
Furthermore, the input data bit may be encoded at a coding rate of 1/2
two times, so that each symbol can be sequentially outputted one by one.

[0213] Meanwhile, when the symbol encoder 402 is operated as an encoder
having a coding rate of 1/2, the input data bit is encoded at a coding
rate of 1/2 by the 1/2 outer encoder and then outputted. Alternatively,
the input data bit may also be encoded at a coding rate of 1/4 by the 1/4
outer encoder. Thereafter, when only one of the two symbols is selected
and outputted, the symbol encoder 402 may be operated as an encoder
having the coding rate of 1/2. In the description of the present
invention, the 1/2-coding rate and the 1/4-coding rate are merely
exemplary, and the coding rate may vary depending upon the selection of
the encoded symbols or the number of repetition of the symbols.
Therefore, the present invention will not be limited only to the examples
given in the embodiments of the present invention. Nevertheless, if the
coding rate is low, the actual amount of data that can be transmitted
becomes smaller, accordingly. Therefore, these two factors should be
accounted for when deciding the coding rate.

[0214]FIG. 18A illustrates a detailed block view of a 1/2 outer encoder
according to an embodiment of the present invention. Referring to FIG.
18A, the 1/2 outer encoder includes two delays (or a first delay and a
second delay) 501 and 503, and one adder 502. Herein, the 1/2 outer
encoder encodes the input data bit U, so that 2 bits (i.e., u0 and u1)
can be outputted. At this point, the input data bit U corresponds to an
upper bit u0, which is outputted without modification and at the same
time encoded to be outputted as a lower bit u1. More specifically, the
input data bit U is directly outputted as the upper bit u0 without
modification and, simultaneously, outputted to the adder 502.

[0215] The adder 502 adds the input data bit U and the output of the first
delay 501, which are then outputted to the second delay 503. Thereafter,
the data that have been delayed by a set period of time (e.g., by 1
clock) are outputted as the lower bit u1 and, at the same time, fed-back
to the first delay 501. Subsequently, the first delay 501 delays data
fed-back by from the second delay 503 by a set period of time (e.g., by 1
clock). Then, the delayed data are outputted to the adder 502. At this
point, if the data bit U being inputted to the symbol encoder 402
corresponds to a data bit that is to be encoded at a coding rate of 1/4,
a symbol configured of u0u1 bits may be repeated twice and then
outputted. Alternatively, the input data bit U may be repeated once,
which is then inputted to the 1/2 outer encoder of FIG. 18A.

[0216] FIG. 18B illustrates a detailed block view of a 1/4 outer encoder
according to an embodiment of the present invention. Referring to FIG.
18B, the 1/4 outer encoder includes two delays (or a first delay and a
second delay) 501 and 503, and three adders 502, 504, and 505. Herein,
the 1/4 outer encoder encodes the input data bit U, so that 4 bits (i.e.,
u0 to u3) can be outputted. At this point, the input data bit U
corresponds to an uppermost bit u0, which is outputted without
modification and at the same time encoded to be outputted as lower bit
u1u2u3. More specifically, the input data bit U is directly outputted as
the uppermost bit u0 and simultaneously outputted to the first and third
adders 502 and 505. The first adder 502 adds the input data bit U and the
output bit of the first delay unit 501 and, then, outputs the added bit
to the second delay unit 503. Then, the data bit delayed by a
pre-determined time (e.g., by 1 clock) in the second delay unit 503 is
outputted as lower bit u1 and simultaneously fed-back to the first delay
unit 501. The first delay unit 501 delays the data bit fed-back from the
second delay unit 503 by a pre-determined time (e.g., by 1 clock). Then,
the first delay unit 501 outputs the delayed data bit to the first adder
502 and the second adder 504. The second adder 504 adds the data bits
outputted from the first and second delay units 501 and 503 as a lower
bit u2. The third adder 505 adds the input data bit U and the output of
the second delay unit 503 and outputs the added data bit as a lower bit
u3.

[0217] At this point, if the input data bit U corresponds to data encoded
at a 1/2-coding rate, the symbol encoder 402 configures a symbol with
u1u0 bits from the 4 output bits u0u1u2u3. Then, the symbol encoder 402
outputs the newly configured symbol. Alternatively, if the input data bit
U corresponds to data encoded at a 1/4-coding rate, the symbol encoder
402 configures and outputs a symbol with bits u1u0 and, then, configures
and outputs another symbol with bits u2u3. According to another
embodiment of the present invention, if the input data bit U corresponds
to data encoded at a 1/4-coding rate, the symbol encoder 402 may also
configure and output a symbol with bits u1u0, and then repeat the process
once again and output the corresponding bits. According to yet another
embodiment of the present invention, the symbol encoder outputs all four
output bits U u0u1u2u3. Then, when using the 1/2-coding rate, the symbol
interleaver 403 located behind the symbol encoder 402 selects only the
symbol configured of bits u1u0 from the four output bits u0u1u2u3.
Alternatively, when using the 1/4-coding rate, the symbol interleaver 403
may select the symbol configured of bits u1u0 and then select another
symbol configured of bits u2u3. According to another embodiment, when
using the 1/4-coding rate, the symbol interleaver 403 may repeatedly
select the symbol configured of bits u1u0.

[0218] The output of the symbol encoder 402 is inputted to the symbol
interleaver 403. Then, the symbol interleaver 403 performs block
interleaving in symbol units on the data outputted from the symbol
encoder 402. Any interleaver performing structural rearrangement (or
realignment) may be applied as the symbol interleaver 403 of the block
processor. However, in the present invention, a variable length symbol
interleaver that can be applied even when a plurality of lengths is
provided for the symbol, so that its order may be rearranged, may also be
used.

[0219]FIG. 19 illustrates a symbol interleaver according to an embodiment
of the present invention. Herein, the symbol interleaver according to the
embodiment of the present invention corresponds to a variable length
symbol interleaver that may be applied even when a plurality of lengths
is provided for the symbol, so that its order may be rearranged.
Particularly, FIG. 19 illustrates an example of the symbol interleaver
when BK=6 and BL=8. Herein, BK indicates a number of symbols that are
outputted for symbol interleaving from the symbol encoder 402. And, BL
represents a number of symbols that are actually interleaved by the
symbol interleaver 403.

[0220] In the present invention, the symbol intereleaver 403 should
satisfy the conditions of BL=2n (wherein n is an integer) and of
BL≧K. If there is a difference in value between BK and BL, (BL-BK)
number of null (or dummy) symbols is added, thereby creating an
interleaving pattern. Therefore, BK becomes a block size of the actual
symbols that are inputted to the symbol interleaver 403 in order to be
interleaved. BL becomes an interleaving unit when the interleaving
process is performed by an interleaving pattern created from the symbol
interleaver 403. The example of what is described above is illustrated in
FIG. 19.

[0221] More specifically, FIG. 19(a) to FIG. 19(c) illustrate a variable
length interleaving process of a symbol interleaver. The number of
symbols outputted from the symbol encoder 402 in order to be interleaved
is equal to 6 (i.e., BK=6). In other words, 6 symbols are outputted from
the symbol encoder 402 in order to be interleaved. And, the actual
interleaving unit (BL) is equal to 8 symbols. Therefore, as shown in FIG.
19(a), 2 symbols are added to the null (or dummy) symbol, thereby
creating the interleaving pattern. Equation 4 shown below described the
process of sequentially receiving BK number of symbols, the order of
which is to be rearranged, and obtaining an BL value satisfying the
conditions of BL=2n (wherein n is an integer) and of BL≧BK,
thereby creating the interleaving so as to realign (or rearrange) the
symbol order.

In relation to all places, wherein 0≦i≦BL-1,

P(i)={S×i×(i+1)/2} mod BL Equation 4

[0222] Herein, BL≧BK, BL=2n, and n and S are integers.
Referring to FIG. 19, it is assumed that S is equal to 89, and that L is
equal to 8, and FIG. 19 illustrates the created interleaving pattern and
an example of the interleaving process. As shown in FIG. 19(b), the order
of BK number of input symbols and (BL-BK) number of null symbols is
rearranged by using the above-mentioned Equation 4. Then, as shown in
FIG. 19(c), the null byte places are removed, so as to rearrange the
order, by using Equation 5 shown below. Thereafter, the symbol that is
interleaved by the rearranged order is then outputted to the symbol-byte
converter.

if P(i)>BK-1, then P(i) place is removed and rearranged Equation 5

[0223] Subsequently, the symbol-byte converter 404 converts to bytes the
mobile service data symbols, having the rearranging of the symbol order
completed and then outputted in accordance with the rearranged order, and
thereafter outputs the converted bytes to the group formatter 304.

[0224] FIG. 20A illustrates a block diagram showing the structure of a
block processor according to another embodiment of the present invention.
Herein, the block processor includes an interleaving unit 610 and a block
formatter 620. The interleaving unit 610 may include a byte-symbol
converter 611, a symbol-byte converter 612, a symbol interleaver 613, and
a symbol-byte converter 614. Herein, the symbol interleaver 613 may also
be referred to as a block interleaver.

[0225] The byte-symbol converter 611 of the interleaving unit 610 converts
the mobile service data X outputted in byte units from the RS frame
encoder 302 to symbol units. Then, the byte-symbol converter 611 outputs
the converted mobile service data symbols to the symbol-byte converter
612 and the symbol interleaver 613. More specifically, the byte-symbol
converter 611 converts each 2 bits of the inputted mobile service data
byte (=8 bits) to 1 symbol and outputs the converted symbols. This is
because the input data of the trellis encoding module 256 consist of
symbol units configured of 2 bits. The relationship between the block
processor 303 and the trellis encoding module 256 will be described in
detail in a later process. At this point, the byte-symbol converter 611
may also receive signaling information including transmission parameters.
Furthermore, the signaling information bytes may also be divided into
symbol units and then outputted to the symbol-byte converter 612 and the
symbol interleaver 613.

[0226] The symbol-byte converter 612 groups 4 symbols outputted from the
byte-symbol converter 611 so as to configure a byte. Thereafter, the
converted data bytes are outputted to the block formatter 620. Herein,
each of the symbol-byte converter 612 and the byte-symbol converter 611
respectively performs an inverse process on one another. Therefore, the
yield of these two blocks is offset. Accordingly, as shown in FIG. 20B,
the input data X bypass the byte-symbol converter 611 and the symbol-byte
converter 612 and are directly inputted to the block formatter 620. More
specifically, the interleaving unit 610 of FIG. 20B has a structure
equivalent to that of the interleaving unit shown in FIG. 20A. Therefore,
the same reference numerals will be used in FIG. 20A and FIG. 20B.

[0227] The symbol interleaver 613 performs block interleaving in symbol
units on the data that are outputted from the byte-symbol converter 611.
Subsequently, the symbol interleaver 613 outputs the interleaved data to
the symbol-byte converter 614. Herein, any type of interleaver that can
rearrange the structural order may be used as the symbol interleaver 613
of the present invention. In the example given in the present invention,
a variable length interleaver that may be applied for symbols having a
wide range of lengths, the order of which is to be rearranged. For
example, the symbol interleaver of FIG. 19 may also be used in the block
processor shown in FIG. 20A and FIG. 20B.

[0228] The symbol-byte converter 614 outputs the symbols having the
rearranging of the symbol order completed, in accordance with the
rearranged order. Thereafter, the symbols are grouped to be configured in
byte units, which are then outputted to the block formatter 620. More
specifically, the symbol-byte converter 614 groups 4 symbols outputted
from the symbol interleaver 613 so as to configure a data byte. As shown
in FIG. 21, the block formatter 620 performs the process of aligning the
output of each symbol-byte converter 612 and 614 within the block in
accordance with a set standard. Herein, the block formatter 620 operates
in association with the trellis encoding module 256.

[0229] More specifically, the block formatter 620 decides the output order
of the mobile service data outputted from each symbol-byte converter 612
and 614 while taking into consideration the place (or order) of the data
excluding the mobile service data that are being inputted, wherein the
mobile service data include main service data, known data, RS parity
data, and MPEG header data.

[0230] According to the embodiment of the present invention, the trellis
encoding module 256 is provided with 12 trellis encoders. FIG. 22
illustrates a block diagram showing the trellis encoding module 256
according to the present invention. In the example shown in FIG. 22, 12
identical trellis encoders are combined to the interleaver in order to
disperse noise. Herein, each trellis encoder may be provided with a
pre-coder.

[0231] FIG. 23A illustrates the block processor 303 being concatenated
with the trellis encoding module 256. In the transmitting system, a
plurality of blocks actually exists between the pre-processor 230
including the block processor 303 and the trellis encoding module 256, as
shown in FIG. 3. Conversely, the receiving system considers the
pre-processor 230 to be concatenated with the trellis encoding module
256, thereby performing the decoding process accordingly. However, the
data excluding the mobile service data that are being inputted to the
trellis encoding module 256, wherein the mobile service data include main
service data, known data, RS parity data, and MPEG header data,
correspond to data that are added to the blocks existing between the
block processor 303 and the trellis encoding module 256. FIG. 23B
illustrates an example of a data processor 650 being positioned between
the block processor 303 and the trellis encoding module 256, while taking
the above-described instance into consideration.

[0232] Herein, when the interleaving unit 610 of the block processor 303
performs a 1/2-rate encoding process, the interleaving unit 610 may be
configured as shown in FIG. 20A (or FIG. 20B). Referring to FIG. 3, for
example, the data processor 650 may include a group formatter 304, a data
deinterleaver 305, a packet formatter 306, a packet multiplexer 240, and
a post-processor 250, wherein the post-processor 250 includes a data
randomizer 251, a RS encoder/non-systematic RS encoder 252, a data
interleaver 253, a parity replacer 254, and a non-systematic RS encoder
255.

[0233] At this point, the trellis encoding module 256 symbolizes the data
that are being inputted so as to divide the symbolized data and to send
the divided data to each trellis encoder in accordance with a pre-defined
method. Herein, one byte is converted into 4 symbols, each being
configured of 2 bits. Also, the symbols created from the single data byte
are all transmitted to the same trellis encoder. Accordingly, each
trellis encoder pre-codes an upper bit of the input symbol, which is then
outputted as the uppermost output bit C2. Alternatively, each trellis
encoder trellis-encodes a lower bit of the input symbol, which is then
outputted as two output bits C1 and C0. The block formatter 620 is
controlled so that the data byte outputted from each symbol-byte
converter can be transmitted to different trellis encoders.

[0234] Hereinafter, the operation of the block formatter 620 will now be
described in detail with reference to FIG. 16 to FIG. 27. Referring to
FIG. 20A, for example, the data byte outputted from the symbol-byte
converter 612 and the data byte outputted from the symbol-byte converter
614 are inputted to different trellis encoders of the trellis encoding
module 256 in accordance with the control of the block formatter 620.
Hereinafter, the data byte outputted from the symbol-byte converter 612
will be referred to as X, and the data byte outputted from the
symbol-byte converter 614 will be referred to as Y, for simplicity.
Referring to FIG. 21(a), each number (i.e., 0 to 11) indicates the first
to twelfth trellis encoders of the trellis encoding module 256,
respectively.

[0235] In addition, the output order of both symbol-byte converters are
arranged (or aligned) so that the data bytes outputted from the
symbol-byte converter 612 are respectively inputted to the 0th to
5th trellis encoders (0 to 5) of the trellis encoding module 256,
and that the data bytes outputted from the symbol-byte converter 614 are
respectively inputted to the 6th to 11th trellis encoders (6 to
11) of the trellis encoding module 256. Herein, the trellis encoders
having the data bytes outputted from the symbol-byte converter 612
allocated therein, and the trellis encoders having the data bytes
outputted from the symbol-byte converter 614 allocated therein are merely
examples given to simplify the understanding of the present invention.
Furthermore, according to an embodiment of the present invention, and
assuming that the input data of the block processor 303 correspond to a
block configured of 12 bytes, the symbol-byte converter 612 outputs 12
data bytes from X0 to X11, and the symbol-byte converter 614 outputs 12
data bytes from Y0 to Y11.

[0236] FIG. 21(b) illustrates an example of data being inputted to the
trellis encoding module 256. Particularly, FIG. 21(b) illustrates an
example of not only the mobile service data but also the main service
data and RS parity data being inputted to the trellis encoding module
256, so as to be distributed to each trellis encoder. More specifically,
the mobile service data outputted from the block processor 303 pass
through the group formatter 304, from which the mobile service data are
mixed with the main service data and RS parity data and then outputted,
as shown in FIG. 21(a). Accordingly, each data byte is respectively
inputted to the trellis encoders in accordance with the positions (or
places) within the data group after being data-interleaved.

[0237] Herein, when the output data bytes X and Y of the symbol-byte
converters 612 and 614 are allocated to each respective trellis encoder,
the input of each trellis encoder may be configured as shown in FIG.
21(b). More specifically, referring to FIG. 21(b), the six mobile service
data bytes (X0 to X5) outputted from the symbol-byte converter 612 are
sequentially allocated (or distributed) to the first to sixth trellis
encoders (0 to 5) of the trellis encoding module 256. Also, the 2 mobile
service data bytes Y0 and Y1 outputted from the symbol-byte converter 614
are sequentially allocated to the 7th and 8th trellis encoders
(6 and 7) of the trellis encoding module 256. Thereafter, among the 5
main service data bytes, 4 data bytes are sequentially allocated to the
9th and 12th trellis encoders (8 to 11) of the trellis encoding
module 256. Finally, the remaining 1 byte of the main service data byte
is allocated once again to the first trellis encoder (0).

[0238] It is assumed that the mobile service data, the main service data,
and the RS parity data are allocated to each trellis encoder, as shown in
FIG. 21(b). It is also assumed that, as described above, the input of the
block processor 303 is configured of 12 bytes, and that 12 bytes from X0
to X11 are outputted from the symbol-byte converter 612, and that 12
bytes from Y0 to Y11 are outputted from the symbol-byte converter 614. In
this case, as shown in FIG. 21(c), the block formatter 620 arranges the
data bytes that are to be outputted from the symbol-byte converters 612
and 614 by the order of X0 to X5, Y0, Y1, X6 to X10, Y2 to Y7, X11, and
Y8 to Y11. More specifically, the trellis encoder that is to perform the
encoding process is decided based upon the position (or place) within the
transmission frame in which each data byte is inserted. At this point,
not only the mobile service data but also the main service data, the MPEG
header data, and the RS parity data are also inputted to the trellis
encoding module 256. Herein, it is assumed that, in order to perform the
above-described operation, the block formatter 620 is informed of (or
knows) the information on the data group format after the
data-interleaving process.

[0239] FIG. 24 illustrates a block diagram of the block processor
performing an encoding process at a coding rate of 1/N according to an
embodiment of the present invention. Herein, the block processor includes
(N-1) number of symbol interleavers 741 to 74N-1, which are configured in
a parallel structure. More specifically, the block processor having the
coding rate of 1/N consists of a total of N number of branches (or paths)
including a branch (or path), which is directly transmitted to the block
formatter 730. In addition, the symbol interleaver 741 to 74N-1 of each
branch may each be configured of a different symbol interleaver.
Furthermore, (N-1) number of symbol-byte converter 751 to 75N-1 each
corresponding to each (N-1) number of symbol interleavers 741 to 74N-1
may be included at the end of each symbol interleaver, respectively.
Herein, the output data of the (N-1) number of symbol-byte converter 751
to 75N-1 are also inputted to the block formatter 730.

[0240] In the example of the present invention, N is equal to or smaller
than 12. If N is equal to 12, the block formatter 730 may align the
output data so that the output byte of the 12th symbol-byte
converter 75N-1 is inputted to the 12th trellis encoder.
Alternatively, if N is equal to 3, the block formatter 730 may arranged
the output order, so that the data bytes outputted from the symbol-byte
converter 720 are inputted to the 1st to 4th trellis encoders
of the trellis encoding module 256, and that the data bytes outputted
from the symbol-byte converter 751 are inputted to the 5th to
8th trellis encoders, and that the data bytes outputted from the
symbol-byte converter 752 are inputted to the 9th to 12th
trellis encoders. At this point, the order of the data bytes outputted
from each symbol-byte converter may vary in accordance with the position
within the data group of the data other than the mobile service data,
which are mixed with the mobile service data that are outputted from each
symbol-byte converter.

[0241] FIG. 25 illustrates a detailed block diagram showing the structure
of a block processor according to another embodiment of the present
invention. Herein, the block formatter is removed from the block
processor so that the operation of the block formatter may be performed
by a group formatter. More specifically, the block processor of FIG. 25
may include a byte-symbol converter 810, symbol-byte converters 820 and
840, and a symbol interleaver 830. In this case, the output of each
symbol-byte converter 820 and 840 is inputted to the group formatter 850.

[0242] Also, the block processor may obtain a desired coding rate by
adding symbol interleavers and symbol-byte converters. If the system
designer wishes a coding rate of 1/N, the block processor needs to be
provided with a total of N number of branches (or paths) including a
branch (or path), which is directly transmitted to the block formatter
850, and (N-1) number of symbol interleavers and symbol-byte converters
configured in a parallel structure with (N-1) number of branches. At this
point, the group formatter 850 inserts place holders ensuring the
positions (or places) for the MPEG header, the non-systematic RS parity,
and the main service data. And, at the same time, the group formatter 850
positions the data bytes outputted from each branch of the block
processor.

[0243] The number of trellis encoders, the number of symbol-byte
converters, and the number of symbol interleavers proposed in the present
invention are merely exemplary. And, therefore, the corresponding numbers
do not limit the spirit or scope of the present invention. It is apparent
to those skilled in the art that the type and position of each data byte
being allocated to each trellis encoder of the trellis encoding module
256 may vary in accordance with the data group format. Therefore, the
present invention should not be understood merely by the examples given
in the description set forth herein. The mobile service data that are
encoded at a coding rate of 1/N and outputted from the block processor
303 are inputted to the group formatter 304. Herein, in the example of
the present invention, the order of the output data outputted from the
block formatter of the block processor 303 are aligned and outputted in
accordance with the position of the data bytes within the data group.

Signaling Information Processing

[0244] The transmitter 200 according to the present invention may insert
transmission parameters by using a plurality of methods and in a
plurality of positions (or places), which are then transmitted to the
receiving system. For simplicity, the definition of a transmission
parameter that is to be transmitted from the transmitter to the receiving
system will now be described. The transmission parameter includes data
group information, region information within a data group, the number of
RS frames configuring a super frame (i.e., a super frame size (SFS)), the
number of RS parity data bytes (P) for each column within the RS frame,
whether or not a checksum, which is added to determine the presence of an
error in a row direction within the RS frame, has been used, the type and
size of the checksum if the checksum is used (presently, 2 bytes are
added to the CRC), the number of data groups configuring one RS
frame--since the RS frame is transmitted to one burst section, the number
of data groups configuring the one RS frame is identical to the number of
data groups within one burst (i.e., burst size (BS)), a turbo code mode,
and a RS code mode.

[0245] Also, the transmission parameter required for receiving a burst
includes a burst period--herein, one burst period corresponds to a value
obtained by counting the number of fields starting from the beginning of
a current burst until the beginning of a next burst, a positioning order
of the RS frames that are currently being transmitted within a super
frame (i.e., a permuted frame index (PFI)) or a positioning order of
groups that are currently being transmitted within a RS frame (burst)
(i.e., a group index (GI)), and a burst size. Depending upon the method
of managing a burst, the transmission parameter also includes the number
of fields remaining until the beginning of the next burst (i.e., time to
next burst (TNB)). And, by transmitting such information as the
transmission parameter, each data group being transmitted to the
receiving system may indicate a relative distance (or number of fields)
between a current position and the beginning of a next burst.

[0246] The information included in the transmission parameter corresponds
to examples given to facilitate the understanding of the present
invention. Therefore, the proposed examples do not limit the scope or
spirit of the present invention and may be easily varied or modified by
anyone skilled in the art. According to the first embodiment of the
present invention, the transmission parameter may be inserted by
allocating a predetermined region of the mobile service data packet or
the data group. In this case, the receiving system performs
synchronization and equalization on a received signal, which is then
decoded by symbol units. Thereafter, the packet deformatter may separate
the mobile service data and the transmission parameter so as to detect
the transmission parameter. According to the first embodiment, the
transmission parameter may be inserted from the group formatter 304 and
then transmitted.

[0247] According to the second embodiment of the present invention, the
transmission parameter may be multiplexed with another type of data. For
example, when known data are multiplexed with the mobile service data, a
transmission parameter may be inserted, instead of the known data, in a
place (or position) where a known data byte is to be inserted.
Alternatively, the transmission parameter may be mixed with the known
data and then inserted in the place where the known data byte is to be
inserted. According to the second embodiment, the transmission parameter
may be inserted from the group formatter 304 or from the packet formatter
306 and then transmitted.

[0248] According to a third embodiment of the present invention, the
transmission parameter may be inserted by allocating a portion of a
reserved region within a field synchronization segment of a transmission
frame. In this case, since the receiving system may perform decoding on a
receiving signal by symbol units before detecting the transmission
parameter, the transmission parameter having information on the
processing methods of the block processor 303 and the group formatter 304
may be inserted in a reserved field of a field synchronization signal.
More specifically, the receiving system obtains field synchronization by
using a field synchronization segment so as to detect the transmission
parameter from a pre-decided position. According to the third embodiment,
the transmission parameter may be inserted from the synchronization
multiplexer 240 and then transmitted.

[0249] According to the fourth embodiment of the present invention, the
transmission parameter may be inserted in a layer (or hierarchical
region) higher than a transport stream (TS) packet. In this case, the
receiving system should be able to receive a signal and process the
received signal to a layer higher than the TS packet in advance. At this
point, the transmission parameter may be used to certify the transmission
parameter of a currently received signal and to provide the transmission
parameter of a signal that is to be received in a later process.

[0250] In the present invention, the variety of transmission parameters
associated with the transmission signal may be inserted and transmitted
by using the above-described methods according to the first to fourth
embodiment of the present invention. At this point, the transmission
parameter may be inserted and transmitted by using only one of the four
embodiments described above, or by using a selection of the
above-described embodiments, or by using all of the above-described
embodiments. Furthermore, the information included in the transmission
parameter may be duplicated and inserted in each embodiment.
Alternatively, only the required information may be inserted in the
corresponding position of the corresponding embodiment and then
transmitted. Furthermore, in order to ensure robustness of the
transmission parameter, a block encoding process of a short cycle (or
period) may be performed on the transmission parameter and, then,
inserted in a corresponding region. The method for performing a
short-period block encoding process on the transmission parameter may
include, for example, Kerdock encoding, BCH encoding, RS encoding, and
repetition encoding of the transmission parameter. Also, a combination of
a plurality of block encoding methods may also be performed on the
transmission parameter.

[0251] The transmission parameters may be grouped to create a block code
of a small size, so as to be inserted in a byte place allocated within
the data group for signaling and then transmitted. However, in this case,
the block code passes through the block decoded from the receiving end so
as to obtain a transmission parameter value. Therefore, the transmission
parameters of the turbo code mode and the RS code mode, which are
required for block decoding, should first be obtained. Accordingly, the
transmission parameters associated with a particular mode may be inserted
in a specific section of a known data region. And, in this case, a
correlation of with a symbol may be used for a faster decoding process.
The receiving system refers to the correlation between each sequence and
the currently received sequences, thereby determining the encoding mode
and the combination mode.

[0252] Meanwhile, when the transmission parameter is inserted in the field
synchronization segment region or the known data region and then
transmitted, and when the transmission parameter has passed through the
transmission channel, the reliability of the transmission parameter is
deteriorated. Therefore, one of a plurality of pre-defined patterns may
also be inserted in accordance with the corresponding transmission
parameter. Herein, the receiving system performs a correlation
calculation between the received signal and the pre-defined patterns so
as to recognize the transmission parameter. For example, it is assumed
that a burst including 5 data groups is pre-decided as pattern A based
upon an agreement between the transmitting system and the receiving
system. In this case, the transmitting system inserts and transmits
pattern A, when the number of groups within the burst is equal to 5.
Thereafter, the receiving system calculates a correlation between the
received data and a plurality of reference patterns including pattern A,
which was created in advance. At this point, if the correlation value
between the received data and pattern A is the greatest, the received
data indicates the corresponding parameter, and most particularly, the
number of groups within the burst. At this point, the number of groups
may be acknowledged as 5. Hereinafter, the process of inserting and
transmitting the transmission parameter will now be described according
to first, second, and third embodiments of the present invention.

First Embodiment

[0253] FIG. 26 illustrates a schematic diagram of the group formatter 304
receiving the transmission parameter and inserting the received
transmission parameter in region A of the data group according to the
present invention. Herein, the group formatter 304 receives mobile
service data from the block processor 303. Conversely, the transmission
parameter is processed with at least one of a data randomizing process, a
RS frame encoding process, and a block processing process, and may then
be inputted to the group formatter 304. Alternatively, the transmission
parameter may be directly inputted to the group formatter 304 without
being processed with any of the above-mentioned processes. In addition,
the transmission parameter may be provided from the service multiplexer
100. Alternatively, the transmission parameter may also be generated and
provided from within the transmitter 200. The transmission parameter may
also include information required by the receiving system in order to
receive and process the data included in the data group. For example, the
transmission parameter may include data group information, and
multiplexing information.

[0254] The group formatter 304 inserts the mobile service data and
transmission parameter which are to be inputted to corresponding regions
within the data group in accordance with a rule for configuring a data
group. For example, the transmission parameter passes through a block
encoding process of a short period and is, then, inserted in region A of
the data group. Particularly, the transmission parameter may be inserted
in a pre-arranged and arbitrary position (or place) within region A. If
it is assumed that the transmission parameter has been block encoded by
the block processor 303, the block processor 303 performs the same data
processing operation as the mobile service data, more specifically,
either a 1/2-rate encoding or 1/4-rate encoding process on the signaling
information including the transmission parameter. Thereafter, the block
processor 303 outputs the processed transmission parameter to the group
formatter 304. Thereafter, the signaling information is also recognized
as the mobile service data and processed accordingly.

[0255]FIG. 27 illustrates a block diagram showing an example of the block
processor receiving the transmission parameter and processing the
received transmission parameter with the same process as the mobile
service data. Particularly, FIG. 27 illustrates an example showing the
structure of FIG. 16 further including a signaling information provider
411 and multiplexer 412. More specifically, the signaling information
provider 411 outputs the signaling information including the transmission
parameter to the multiplexer 412. The multiplexer 412 multiplexes the
signaling information and the output of the RS frame encoder 302. Then,
the multiplexer 412 outputs the multiplexed data to the byte-bit
converter 401.

[0256] The byte-bit converter 401 divides the mobile service data bytes or
signaling information byte outputted from the multiplexer 412 into bits,
which are then outputted to the symbol encoder 402. The subsequent
operations are identical to those described in FIG. 16. Therefore, a
detailed description of the same will be omitted for simplicity. If any
of the detailed structures of the block processor 303 shown in FIG. 20,
FIG. 23, FIG. 24, and FIG. 25, the signaling information provider 411 and
the multiplexer 412 may be provided behind the byte-symbol converter.

Second Embodiment

[0257] Meanwhile, when known data generated from the group formatter in
accordance with a pre-decided rule are inserted in a corresponding region
within the data group, a transmission parameter may be inserted in at
least a portion of a region, where known data may be inserted, instead of
the known data. For example, when a long known data sequence is inserted
at the beginning of region A within the data group, a transmission
parameter may be inserted in at least a portion of the beginning of
region A instead of the known data. A portion of the known data sequence
that is inserted in the remaining portion of region A, excluding the
portion in which the transmission parameter is inserted, may be used to
detect a starting point of the data group by the receiving system.
Alternatively, another portion of region A may be used for channel
equalization by the receiving system.

[0258] In addition, when the transmission parameter is inserted in the
known data region instead of the actual known data. The transmission
parameter may be block encoded in short periods and then inserted. Also,
as described above, the transmission parameter may also be inserted based
upon a pre-defined pattern in accordance with the transmission parameter.
If the group formatter 304 inserts known data place holders in a region
within the data group, wherein known data may be inserted, instead of the
actual known data, the transmission parameter may be inserted by the
packet formatter 306. More specifically, when the group formatter 304
inserts the known data place holders, the packet formatter 306 may insert
the known data instead of the known data place holders. Alternatively,
when the group formatter 304 inserts the known data, the known data may
be directly outputted without modification. FIG. 28 illustrates a block
diagram showing the structure of a packet formatter 306 being expanded so
that the packet formatter 306 can insert the transmission parameter
according to an embodiment of the present invention. More specifically,
the structure of the packet formatter 306 further includes a known data
generator 351 and a signaling multiplexer 352. For example, the
transmission parameter being inputted to the signaling multiplexer 352
may include mode information designating the coding rate of each region
within the data group.

[0259] For example, when the SCCC mode value that is extracted from the
known data region is equal to `3`, this indicates that region A and
region C within the corresponding data group are encoded at a coding rate
of 1/2 and that region B is encoded at a coding rate of 1/4. The
transmitting system of the present invention generates 6 patterns
corresponding to each mode value shown in Table 1 based upon an agreement
between the transmitting system and the receiving system. Herein, the
corresponding pattern may be inserted in the known data region for each
data group. In this case, the receiving system may obtain the SCCC mode
information from the known data region prior to performing a decoding
process in accordance with the corresponding SCCC mode.

[0260] The signaling multiplexer 352 selects one of the transmission
parameter and the known data generated from the known data generator 351
and, then, outputs the selected data to the packet formatter 306. The
packet formatter 306 inserts the known data or transmission parameter
outputted from the signaling multiplexer 352 into the known data place
holders outputted from the data interleaver 305. Then, the packet
formatter 306 outputs the processed data. More specifically, the packet
formatter 306 inserts a transmission parameter in at least a portion of
the known data region instead of the known data, which is then outputted.
For example, when a known data place holder is inserted at a beginning
portion of region A within the data group, a transmission parameter may
be inserted in a portion of the known data place holder instead of the
actual known data.

[0261] Also, when the transmission parameter is inserted in the known data
place holder instead of the known data, the transmission parameter may be
block encoded in short periods and inserted. Alternatively, a pre-defined
pattern may be inserted in accordance with the transmission parameter.
More specifically, the signaling multiplexer 352 multiplexes the known
data and the transmission parameter (or the pattern defined by the
transmission parameter) so as to configure a new known data sequence.
Then, the signaling multiplexer 352 outputs the newly configured known
data sequence to the packet formatter 306. The packet formatter 306
deletes the main service data place holder and RS parity place holder
from the output of the data interleaver 305, and creates a mobile service
data packet of 188 bytes by using the mobile service data, MPEG header,
and the output of the signaling multiplexer. Then, the packet formatter
306 outputs the newly created mobile service data packet to the packet
multiplexer 240.

[0262] In this case, the region A of each data group has a different known
data pattern. Therefore, the receiving system separates only the symbol
in a pre-arranged section of the known data sequence and recognizes the
separated symbol as the transmission parameter. Herein, depending upon
the design of the transmitting system, the known data may be inserted in
different blocks, such as the packet formatter 306, the group formatter
304, or the block processor 303. Therefore, a transmission parameter may
be inserted instead of the known data in the block wherein the known data
are to be inserted.

[0263] According to the second embodiment of the present invention, a
transmission parameter including information on the processing method of
the block processor 303 may be inserted in a portion of the known data
region and then transmitted. In this case, a symbol processing method and
position of the symbol for the actual transmission parameter symbol are
already decided. Also, the position of the transmission parameter symbol
should be positioned so as to be transmitted or received earlier than any
other data symbols that are to be decoded. Accordingly, the receiving
system may detect the transmission symbol before the data symbol decoding
process, so as to use the detected transmission symbol for the decoding
process.

Third Embodiment

[0264] Meanwhile, the transmission parameter may also be inserted in the
field synchronization segment region and then transmitted. FIG. 29
illustrates a block diagram showing the synchronization multiplexer being
expanded in order to allow the transmission parameter to be inserted in
the field synchronization segment region. Herein, a signaling multiplexer
261 is further included in the synchronization multiplexer 260. The
transmission parameter of the general VSB method is configured of 2
fields. More specifically, each field is configured of one field
synchronization segment and 312 data segments. Herein, the first 4
symbols of a data segment correspond to the segment synchronization
portion, and the first data segment of each field corresponds to the
field synchronization portion.

[0265] One field synchronization signal is configured to have the length
of one data segment. The data segment synchronization pattern exists in
the first 4 symbols, which are then followed by pseudo random sequences
PN 511, PN 63, PN 63, and PN 63. The next 24 symbols include information
associated with the VSB mode. Additionally, the 24 symbols that include
information associated with the VSB mode are followed by the remaining
104 symbols, which are reserved symbols. Herein, the last 12 symbols of a
previous segment are copied and positioned as the last 12 symbols in the
reserved region. In other words, only the 92 symbols in the field
synchronization segment are the symbols that correspond to the actual
reserved region.

[0266] Therefore, the signaling multiplexer 261 multiplexes the
transmission parameter with an already-existing field synchronization
segment symbol, so that the transmission parameter can be inserted in the
reserved region of the field synchronization segment. Then, the signaling
multiplexer 261 outputs the multiplexed transmission parameter to the
synchronization multiplexer 260. The synchronization multiplexer 260
multiplexes the segment synchronization symbol, the data symbols, and the
new field synchronization segment outputted from the signaling
multiplexer 261, thereby configuring a new transmission frame. The
transmission frame including the field synchronization segment, wherein
the transmission parameter is inserted, is outputted to the transmission
unit 270. At this point, the reserved region within the field
synchronization segment for inserting the transmission parameter may
correspond to a portion of or the entire 92 symbols of the reserved
region. Herein, the transmission parameter being inserted in the reserved
region may, for example, include information identifying the transmission
parameter as the main service data, the mobile service data, or a
different type of mobile service data.

[0267] If the information on the processing method of the block processor
303 is transmitted as a portion of the transmission parameter, and when
the receiving system wishes to perform a decoding process corresponding
to the block processor 303, the receiving system should be informed of
such information on the block processing method in order to perform the
decoding process. Therefore, the information on the processing method of
the block processor 303 should already be known prior to the block
decoding process. Accordingly, as described in the third embodiment of
the present invention, when the transmission parameter having the
information on the processing method of the block processor 303 (and/or
the group formatter 304) is inserted in the reserved region of the field
synchronization signal and then transmitted, the receiving system is
capable of detecting the transmission parameter prior to performing the
block decoding process on the received signal.

Receiving System

[0268] FIG. 30 illustrates a block diagram showing a structure of a
digital broadcast receiving system according to the present invention.
The digital broadcast receiving system of FIG. 30 uses known data
information, which is inserted in the mobile service data section and,
then, transmitted by the transmitting system, so as to perform carrier
synchronization recovery, frame synchronization recovery, and channel
equalization, thereby enhancing the receiving performance. Referring to
FIG. 30, the digital broadcast receiving system includes a tuner 1001, a
demodulator 1002, an equalizer 1003, a known data detector 1004, a block
decoder 1005, a data deformatter 1006, a RS frame decoder 1007, a
derandomizer 1008, a data deinterleaver 1009, a RS decoder 1010, and a
data derandomizer 1011. Herein, for simplicity of the description of the
present invention, the data deformatter 1006, the RS frame decoder 1007,
and the derandomizer 1008 will be collectively referred to as a mobile
service data processing unit. And, the data deinterleaver 1009, the RS
decoder 1010, and the data derandomizer 1011 will be collectively
referred to as a main service data processing unit.

[0269] More specifically, the tuner 1001 tunes a frequency of a particular
channel and down-converts the tuned frequency to an intermediate
frequency (IF) signal. Then, the tuner 1001 outputs the down-converted IF
signal to the demodulator 1002 and the known data detector 1004. The
demodulator 1002 performs self gain control, carrier recovery, and timing
recovery processes on the inputted IF signal, thereby modifying the IF
signal to a baseband signal. Herein, an analog/digital converter (ADC)
converting pass band analog IF signals to digital IF signals may be
included between the tuner 1001 and the demodulator 1002. Then, the
demodulator 1002 outputs the digitalized and inputted pass band IF signal
to the equalizer 1003 and the known data detector 1004. The equalizer
1003 compensates the distortion of the channel included in the
demodulated signal and then outputs the error-compensated signal to the
block decoder 1005.

[0270] At this point, the known data detector 1004 detects the known
sequence place inserted by the transmitting end from the input/output
data of the demodulator 1002 (i.e., the data prior to the demodulation
process or the data after the demodulation process). Thereafter, the
place information (or position indicator) along with the symbol sequence
of the known data, which are generated from the detected place, is
outputted to the demodulator 1002 and the equalizer 1003. Also, the known
data detector 1004 outputs a set of information to the block decoder
1005. This set of information is used to allow the block decoder 1005 of
the receiving system to identify the mobile service data that are
processed with additional encoding from the transmitting system and the
main service data that are not processed with additional encoding. In
addition, although the connection status is not shown in FIG. 30, the
information detected from the known data detector 1004 may be used
throughout the entire receiving system and may also be used in the data
deformatter 1006 and the RS frame decoder 1007.

[0271] The demodulator 1002 uses the known data (or sequence) position
indicator and the known data symbol sequence during the timing and/or
carrier recovery, thereby enhancing the demodulating performance.
Similarly, the equalizer 1003 uses the known sequence position indicator
and the known data symbol sequence so as to enhance the equalizing
performance. Moreover, the decoding result of the block decoder 1005 may
be fed-back to the equalizer 1003, thereby enhancing the equalizing
performance.

[0272] Demodulator and Known Sequence Detector within Receiving System

[0273] At this point, the transmitting system may periodically insert and
transmit known data within a transmission frame, as shown in FIG. 7A and
FIG. 8.

[0274] FIG. 31 illustrates an example of known data sequence being
periodically inserted and transmitted in-between actual data by the
transmitting system. Referring to FIG. 31, AS represents the number of
valid data symbols, and BS represents the number of known data symbols.
Therefore, BS number of known data symbols are inserted and transmitted
at a period of (AS+BS) symbols. Herein, AS may correspond to mobile
service data, main service data, or a combination of mobile service data
and main service data. In order to be differentiated from the known data,
data corresponding to AS will hereinafter be referred to as valid data.

[0275] Referring to FIG. 31, known data sequence having the same pattern
are included in each known data section that is being periodically
inserted. Herein, the length of the known data sequence having identical
data patterns may be either equal to or different from the length of the
entire (or total) known data sequence of the corresponding known data
section (or block). If the two lengths are different from one another,
the length of the entire known data sequence should be longer than the
length of the known data sequence having identical data patterns. In this
case, the same known data sequences are included in the entire known data
sequence. The known data detector 1004 detects the position of the known
data being periodically inserted and transmitted as described above. At
the same time, the known data detector 1004 may also estimate initial
frequency offset during the process of detecting known data. In this
case, the demodulator 1002 may estimate with more accuracy carrier
frequency offset from the information on the known data position (or
known sequence position indicator) and initial frequency offset
estimation value, thereby compensating the estimated initial frequency
offset.

[0276] FIG. 32 is a flow chart illustrating a method of detecting
positions of known data according to one aspect of the present invention.
The known sequence detector 1004 initially detects the position of the
first known data region using a plurality of repeated data patterns
included in the fifth sub-region of the first known data region (2001).
Next, the known sequence detector 1004 can estimate the position of the
field sync segment from the detected position of the first known data
region according to protocol (2002), and can further estimate positions
of the second, third, fourth, and fifth known data regions in a similar
manner (2003). The estimated position information of the filed sync and
known data regions are provided to the demodulator 1002 and the channel
equalizer 1003. For example, the position information of the field sync
and CIR TS region of each known data region is provided to the equalizer
1003. Then the equalizer 1003 estimates a channel impulse response (CIR)
using these position information.

[0277] FIG. 33 illustrates a detailed block diagram of a demodulator
according to the present invention. Referring to FIG. 33, the demodulator
includes a phase splitter 1010, a numerically controlled oscillator (NCO)
1020, a first multiplier 1030, a resampler 1040, a second multiplier
1050, a matched filter 1060, a DC remover 1070, a timing recovery unit
1080, a carrier recovery unit 1090, and a phase compensator 1110. Herein,
the known sequence detector 1004 includes a known sequence detector and
initial frequency offset estimator 1004-1 for estimating known data
information and initial frequency offset. Also referring to FIG. 33, the
phase splitter 1010 receives a pass band digital signal and splits the
received signal into a pass band digital signal of a real number element
and a pass band digital signal of an imaginary number element both having
a phase of 90 degrees between one another. In other words, the pass band
digital signal is split into complex signals. The split portions of the
pass band digital signal are then outputted to the first multiplier 1030.
Herein, the real number signal outputted from the phase splitter 1010
will be referred to as an `I` signal, and the imaginary number signal
outputted from the phase splitter 1010 will be referred to as a `Q`
signal, for simplicity of the description of the present invention.

[0278] The first multiplier 1030 multiplies the I and Q pass band digital
signals, which are outputted from the phase splitter 1010, to a complex
signal having a frequency proportional to a constant being outputted from
the NCO 1020, thereby changing the I and Q pass band digital signals to
baseband digital complex signals. Then, the baseband digital signals of
the first multiplier 1030 are inputted to the resampler 1040. The
resampler 1040 resamples the signals being outputted from the first
multiplier 1030 so that the signal corresponds to the timing clock
provided by the timing recovery unit 1080. Thereafter, the resampler 1040
outputs the resampled signals to the second multiplier 1050.

[0279] For example, when the analog/digital converter uses a 25 MHz fixed
oscillator, the baseband digital signal having a frequency of 25 MHz,
which is created by passing through the analog/digital converter, the
phase splitter 1010, and the first multiplier 1030, is processed with an
interpolation process by the resampler 1040. Thus, the interpolated
signal is recovered to a baseband digital signal having a frequency twice
that of the receiving signal of a symbol clock (i.e., a frequency of
21.524476 MHz). Alternatively, if the analog/digital converter uses the
timing clock of the timing recovery unit 1080 as the sampling frequency
(i.e., if the analog/digital converter uses a variable frequency) in
order to perform an A/D conversion process, the resampler 1040 is not
required and may be omitted.

[0280] The second multiplier 1050 multiplies an output frequency of the
carrier recovery unit 1090 with the output of the resampler 1040 so as to
compensate any remaining carrier included in the output signal of the
resampler 1040. Thereafter, the compensated carrier is outputted to the
matched filter 1060 and the timing recovery unit 1080. The signal
matched-filtered by the matched filter 1060 is inputted to the DC remover
1070, the known sequence detector and initial frequency offset estimator
1004-1, and the carrier recovery unit 1090.

[0281] The known sequence detector and initial frequency offset estimator
1004-1 detects the place (or position) of the known data sequences that
are being periodically or non-periodically transmitted. Simultaneously,
the known sequence detector and initial frequency offset estimator 1004-1
estimates an initial frequency offset during the known sequence detection
process. More specifically, while the transmission data frame is being
received, as shown in FIG. 5, the known sequence detector and initial
frequency offset estimator 1004-1 detects the position (or place) of the
known data included in the transmission data frame. Then, the known
sequence detector and initial frequency offset estimator 1004-1 outputs
the detected information on the known data place (i.e., a known sequence
position indicator) to the timing recovery unit 1080, the carrier
recovery unit 1090, and the phase compensator 1110 of the demodulator
1002 and the equalizer 1003. Furthermore, the known sequence detector and
initial frequency offset estimator 1004-1 estimates the initial frequency
offset, which is then outputted to the carrier recovery unit 1090. At
this point, the known sequence detector and initial frequency offset
estimator 1004-1 may either receive the output of the matched filter 1060
or receive the output of the resampler 1040. This may be optionally
decided depending upon the design of the system designer.

[0282] The timing recovery unit 1080 uses the output of the second
multiplier 1050 and the known sequence position indicator detected from
the known sequence detector and initial frequency offset estimator
1004-1, so as to detect the timing error and, then, to output a sampling
clock being in proportion with the detected timing error to the resampler
1040, thereby adjusting the sampling timing of the resampler 1040. At
this point, the timing recovery unit 1080 may receive the output of the
matched filter 1060 instead of the output of the second multiplier 1050.
This may also be optionally decided depending upon the design of the
system designer.

[0283] Meanwhile, the DC remover 1070 removes a pilot tone signal (i.e.,
DC signal), which has been inserted by the transmitting system, from the
matched-filtered signal. Thereafter, the DC remover 1070 outputs the
processed signal to the phase compensator 1110. The phase compensator
1110 uses the data having the DC removed by the DC remover 1070 and the
known sequence position indicator detected by the known sequence detector
and initial frequency offset estimator 1004-1 to estimate the frequency
offset and, then, to compensate the phase change included in the output
of the DC remover 1070. The data having its phase change compensated are
inputted to the equalizer 1003. Herein, the phase compensator 1110 is
optional. If the phase compensator 1110 is not provided, then the output
of the DC remover 1070 is inputted to the equalizer 1003 instead.

[0284] FIG. 34 includes detailed block diagrams of the timing recovery
unit 1080, the carrier recovery unit 1090, and the phase compensator 1110
of the demodulator. According to an embodiment of the present invention,
the carrier recovery unit 1090 includes a buffer 1091, a frequency offset
estimator 1092, a loop filter 1093, a holder 1094, an adder 1095, and a
NCO 1096. Herein, a decimator may be included before the buffer 1091. The
timing recovery unit 1080 includes a decimator 1081, a buffer 1082, a
timing error detector 1083, a loop filter 1084, a holder 1085, and a NCO
1086. Finally, the phase compensator 1110 includes a buffer 1111, a
frequency offset estimator 1112, a holder 1113, a NCO 1114, and a
multiplier 1115. Furthermore, a decimator 1200 may be included between
the phase compensator 1110 and the equalizer 1003. The decimator 1200 may
be outputted in front of the DC remover 1070 instead of at the outputting
end of the phase compensator 1110.

[0285] Herein, the decimators correspond to components required when a
signal being inputted to the demodulator is oversampled to N times by the
analog/digital converter. More specifically, the integer N represents the
sampling rate of the received signal. For example, when the input signal
is oversampled to 2 times (i.e., when N=2) by the analog/digital
converter, this indicates that two samples are included in one symbol. In
this case, each of the decimators corresponds to a 1/2 decimator.
Depending upon whether or not the oversampling process of the received
signal has been performed, the signal may bypass the decimators.

[0286] Meanwhile, the output of the second multiplier 1050 is temporarily
stored in the decimator 1081 and the buffer 1082 both included in the
timing recovery unit 1080. Subsequently, the temporarily stored output
data are inputted to the timing error detector 1083 through the decimator
1081 and the buffer 1082. Assuming that the output of the second
multiplier 1050 is oversampled to N times its initial state, the
decimator 1081 decimates the output of the second multiplier 1050 at a
decimation rate of 1/N. Then, the 1/N-decimated data are inputted to the
buffer 1082. In other words, the decimator 1081 performs decimation on
the input signal in accordance with a VSB symbol cycle. Furthermore, the
decimator 1081 may also receive the output of the matched filter 1060
instead of the output of the second multiplier 1050. The timing error
detector 1083 uses the data prior to or after being processed with
matched-filtering and the known sequence position indicator outputted
from the known sequence detector and initial frequency offset estimator
1004-1 in order to detect a timing error. Thereafter, the detected timing
error is outputted to the loop filter 1084. Accordingly, the detected
timing error information is obtained once during each repetition cycle of
the known data sequence.

[0287] For example, if a known data sequence having the same pattern is
periodically inserted and transmitted, as shown in FIG. 37, the timing
error detector 1083 may use the known data in order to detect the timing
error. There exists a plurality of methods for detecting timing error by
using the known data. In the example of the present invention, the timing
error may be detected by using a correlation characteristic between the
known data and the received data in the time domain, the known data being
already known in accordance with a pre-arranged agreement between the
transmitting system and the receiving system. The timing error may also
be detected by using the correlation characteristic of the two known data
types being received in the frequency domain. Thus, the detected timing
error is outputted. In another example, a spectral lining method may be
applied in order to detect the timing error. Herein, the spectral lining
method corresponds to a method of detecting timing error by using
sidebands of the spectrum included in the received signal.

[0288] The loop filter 1084 filters the timing error detected by the
timing error detector 1083 and, then, outputs the filtered timing error
to the holder 1085. The holder 1085 holds (or maintains) the timing error
filtered and outputted from the loop filter 1084 during a pre-determined
known data sequence cycle period and outputs the processed timing error
to the NCO 1086. Herein, the order of positioning of the loop filter 1084
and the holder 1085 may be switched with one another. In additionally,
the function of the holder 1085 may be included in the loop filter 1084,
and, accordingly, the holder 1085 may be omitted. The NCO 1086
accumulates the timing error outputted from the holder 1085. Thereafter,
the NCO 1086 outputs the phase element (i.e., a sampling clock) of the
accumulated timing error to the resampler 1040, thereby adjusting the
sampling timing of the resampler 1040.

[0289] Meanwhile, the buffer 1091 of the carrier recovery unit 1090 may
receive either the data inputted to the matched filter 1060 or the data
outputted from the matched filter 1060 and, then, temporarily store the
received data. Thereafter, the temporarily stored data are outputted to
the frequency offset estimator 1092. If a decimator is provided in front
of the buffer 1091, the input data or output data of the matched filter
1060 are decimated by the decimator at a decimation rate of 1/N.
Thereafter, the decimated data are outputted to the buffer 1091. For
example, when the input data or output data of the matched filter 1060
are oversampled to 2 times (i.e., when N=2), this indicates that the
input data or output data of the matched filter 1060 are decimated at a
rate of 1/2 by the decimator 1081 and then outputted to the buffer 1091.
More specifically, when a decimator is provided in front of the buffer
1091, the carrier recovery unit 1090 operates in symbol units.
Alternatively, if a decimator is not provided, the carrier recovery unit
1090 operates in oversampling units.

[0290] The frequency offset estimator 1092 uses the input data or output
data of the matched filter 1060 and the known sequence position indicator
outputted from the known sequence detector and initial frequency offset
estimator 1004-1 in order to estimate the frequency offset. Then, the
estimated frequency offset is outputted to the loop filter 1093.
Therefore, the estimated frequency offset value is obtained once every
repetition period of the known data sequence. The loop filter 1093
performs low pass filtering on the frequency offset value estimated by
the frequency offset estimator 1092 and outputs the low pass-filtered
frequency offset value to the holder 1094. The holder 1094 holds (or
maintains) the low pass-filtered frequency offset value during a
pre-determined known data sequence cycle period and outputs the frequency
offset value to the adder 1095. Herein, the positions of the loop filter
1093 and the holder 1094 may be switched from one to the other.
Furthermore, the function of the holder 1085 may be included in the loop
filter 1093, and, accordingly, the holder 1094 may be omitted.

[0291] The adder 1095 adds the value of the initial frequency offset
estimated by the known sequence detector and initial frequency offset
estimator 1004-1 to the frequency offset value outputted from the loop
filter 1093 (or the holder 1094). Thereafter, the added offset value is
outputted to the NCO 1096. Herein, if the adder 1095 is designed to also
receive the constant being inputted to the NCO 1020, the NCO 1020 and the
first multiplier 1030 may be omitted. In this case, the second multiplier
1050 may simultaneously perform changing signals to baseband signals and
removing remaining carrier.

[0292] The NCO 1096 generates a complex signal corresponding to the
frequency offset outputted from the adder 1095, which is then outputted
to the second multiplier 1050. Herein, the NCO 1096 may include a ROM. In
this case, the NCO 1096 generates a compensation frequency corresponding
to the frequency offset being outputted from the adder 1095. Then, the
NCO 1096 reads a complex cosine corresponding to the compensation
frequency from the ROM, which is then outputted to the second multiplier
1050. The second multiplier 1050 multiplies the output of the NCO 1094
included in the carrier recovery unit 1090 to the output of the resampler
1040, so as to remove the carrier offset included in the output signal of
the resampler 1040.

[0293] FIG. 35 illustrates a detailed block diagram of the frequency
offset estimator 1092 of the carrier recovery unit 1090 according to an
embodiment of the present invention. Herein, the frequency offset
estimator 1092 operates in accordance with the known sequence position
indicator detected from the known sequence detector and initial frequency
offset estimator 1004-1. At this point, if the input data or output data
of the matched filter 1060 are inputted through the decimator, the
frequency offset estimator 1092 operates in symbol units. Alternatively,
if a decimator is not provided, the frequency offset estimator 1092
operates in oversampling units. In the example given in the description
of the present invention, the frequency offset estimator 1092 operates in
symbol units. Referring to FIG. 35, the frequency offset estimator 1092
includes a controller 1310, a first N symbol buffer 1301, a K symbol
delay 1302, a second N symbol buffer 1303, a conjugator 1304, a
multiplier 1305, an accumulator 1306, a phase detector 1307, a multiplier
1308, and a multiplexer 1309. The frequency offset estimator 1092 having
the above-described structure, as shown in FIG. 35, will now be described
in detail with respect to an operation example during a known data
section.

[0294] The first N symbol buffer 1301 may store a maximum of N number of
symbol being inputted thereto. The symbol data that are temporarily
stored in the first N symbol buffer 1301 are then inputted to the
multiplier 1305. At the same time, the inputted symbol is inputted to the
K symbol delay 1302 so as to be delayed by K symbols. Thereafter, the
delayed symbol passes through the second N symbol buffer 1303 so as to be
conjugated by the conjugator 1304. Thereafter, the conjugated symbol is
inputted to the multiplier 1305. The multiplier 1305 multiplies the
output of the first N symbol buffer 1301 and the output of the conjugator
1304. Then, the multiplier 1305 outputs the multiplied result to the
accumulator 1306. Subsequently, the accumulator 1306 accumulates the
output of the multiplier 1305 during N symbol periods, thereby outputted
the accumulated result to the phase detector 1307.

[0295] The phase detector 1307 extracts the corresponding phase
information from the output of the accumulator 1306, which is then
outputted to the multiplier 1308. The multiplier 1308 then divides the
phase information by K, thereby outputting the divided result to the
multiplexer 1309. Herein, the result of the phase information divided by
becomes the frequency offset estimation value. More specifically, at the
point where the input of the known data ends or at a desired point, the
frequency offset estimator 1092 accumulates during an N symbol period
multiplication of the complex conjugate of N number of the input data
stored in the first N symbol buffer 1301 and the complex conjugate of the
N number of the input data that are delayed by K symbols and stored in
the second N symbol buffer 1303. Thereafter, the accumulated value is
divided by K, thereby extracting the frequency offset estimation value.

[0296] Based upon a control signal of the controller 1310, the multiplexer
1309 selects either the output of the multiplier 1308 or `0` and, then,
outputs the selected result as the final frequency offset estimation
value. The controller 1310 receives the known data sequence position
indicator from the known sequence detector and initial frequency offset
estimator 1004-1 in order to control the output of the multiplexer 1309.
More specifically, the controller 1310 determines based upon the known
data sequence position indicator whether the frequency offset estimation
value being outputted from the multiplier 1308 is valid. If the
controller 1310 determines that the frequency offset estimation value is
valid, the multiplexer 1309 selects the output of the multiplier 1308.
Alternatively, if the controller 1310 determines that the frequency
offset estimation value is invalid, the controller 1310 generates a
control signal so that the multiplexer 1309 selects `0`. At this point,
it is preferable that the input signals stored in the first N symbol
buffer 1301 and in the second N symbol buffer 1303 correspond to signals
each being transmitted by the same known data and passing through almost
the same channel. Otherwise, due to the influence of the transmission
channel, the frequency offset estimating performance may be largely
deteriorated.

[0297] Further, the values N and K of the frequency offset estimator 1092
(shown in FIG. 35) may be diversely decided. This is because a particular
portion of the known data that are identically repeated may be used
herein. For example, when the data having the structure described in FIG.
37 are being transmitted, N may be set as BS (i.e., N=BS), and K may be
set as (AS+BS) (i.e., K=AS+BS)). The frequency offset estimation value
range of the frequency offset estimator 1092 is decided in accordance
with the value K. If the value K is large, then the frequency offset
estimation value range becomes smaller. Alternatively, if the value K is
small, then the frequency offset estimation value range becomes larger.
Therefore, when the data having the structure of FIG. 37 is transmitted,
and if the repetition cycle (AS+BS) of the known data is long, then the
frequency offset estimation value range becomes smaller.

[0298] In this case, even if the initial frequency offset is estimated by
the known sequence detector and initial frequency offset estimator
1004-1, and if the estimated value is compensated by the second
multiplier 1050, the remaining frequency offset after being compensated
will exceed the estimation range of the frequency offset estimator 1092.
In order to overcome such problems, the known data sequence that is
regularly transmitted may be configured of a repetition of a same data
portion by using a cyclic extension process. For example, if the known
data sequence shown in FIG. 37 is configured of two identical portions
having the length of BS/2, then the N and K values of the frequency
offset estimator 1092 (shown in FIG. 35) may be respectively set as B/2
and B/2 (i.e., N=BS/2 and K=BS/2). In this case, the estimation value
range may become larger than when using repeated known data.

[0299] Meanwhile, the known sequence detector and initial frequency offset
estimator 1004-1 detects the place (o position) of the known data
sequences that are being periodically or non-periodically transmitted.
Simultaneously, the known sequence detector and initial frequency offset
estimator 1004-1 estimates an initial frequency offset during the known
sequence detection process. The known data sequence position indicator
detected by the known sequence detector and initial frequency offset
estimator 1004-1 is outputted to the timing recovery unit 1080, the
carrier recovery unit 1090, and the phase compensator 1110 of the
demodulator 1002, and to the equalizer 1003. Thereafter, the estimated
initial frequency offset is outputted to the carrier recovery unit 1090.
At this point, the known sequence detector and initial frequency offset
estimator 1004-1 may either receive the output of the matched filter 1060
or receive the output of the resampler 1040. This may be optionally
decided depending upon the design of the system designer. Herein, the
frequency offset estimator shown in FIG. 35 may be directly applied in
the known sequence detector and initial frequency offset estimator 1004-1
or in the phase compensator 1110 of the frequency offset estimator.

[0300]FIG. 36 illustrates a detailed block diagram showing a known
sequence detector and initial frequency offset estimator according to an
embodiment of the present invention. More specifically, FIG. 36
illustrates an example of an initial frequency offset being estimated
along with the known sequence position indicator. Herein, FIG. 36 shows
an example of an inputted signal being oversampled to N times of its
initial state. In other words, N represents the sampling rate of a
received signal. Referring to FIG. 36, the known sequence detector and
initial frequency offset estimator includes N number of partial
correlators 1411 to 141N configured in parallel, a known data place
detector and frequency offset decider 1420, a known data extractor 1930,
a buffer 1940, a multiplier 1450, a NCO 1460, a frequency offset
estimator 1470, and an adder 1480. Herein, the first partial correlator
1411 consists of a 1/N decimator, and a partial correlator. The second
partial correlator 1412 consists of a 1 sample delay, a 1/N decimator,
and a partial correlator. And, the Nth partial correlator 141N
consists of a N-1 sample delay, a 1/N decimator, and a partial
correlator. These are used to match (or identify) the phase of each of
the samples within the oversampled symbol with the phase of the original
(or initial) symbol, and to decimate the samples of the remaining phases,
thereby performing partial correlation on each sample. More specifically,
the input signal is decimated at a rate of 1/N for each sampling phase,
so as to pass through each partial correlator.

[0301] For example, when the input signal is oversampled to 2 times (i.e.,
when N=2), this indicates that two samples are included in one signal. In
this case, two partial correlators (e.g., 1911 and 1412) are required,
and each 1/N decimator becomes a 1/2 decimator. At this point, the 1/N
decimator of the first partial correlator 1411 decimates (or removes),
among the input samples, the samples located in-between symbol places (or
positions). Then, the corresponding 1/N decimator outputs the decimated
sample to the partial correlator. Furthermore, the 1 sample delay of the
second partial correlator 1412 delays the input sample by sample (i.e.,
performs a 1 sample delay on the input sample) and outputs the delayed
input sample to the 1/N decimator. Subsequently, among the samples
inputted from the sample delay, the 1/N decimator of the second partial
correlator 1412 decimates (or removes) the samples located in-between
symbol places (or positions). Thereafter, the corresponding 1/N decimator
outputs the decimated sample to the partial correlator.

[0302] After each predetermined period of the VSB symbol, each of the
partial correlators outputs a correlation value and an estimation value
of the coarse frequency offset estimated at that particular moment to the
known data place detector and frequency offset decider 1420. The known
data place detector and frequency offset decider 1420 stores the output
of the partial correlators corresponding to each sampling phase during a
data group cycle or a pre-decided cycle. Thereafter, the known data place
detector and frequency offset decider 1420 decides a position (or place)
corresponding to the highest correlation value, among the stored values,
as the place (or position) for receiving the known data. Simultaneously,
the known data place detector and frequency offset decider 1420 finally
decides the estimation value of the frequency offset estimated at the
moment corresponding to the highest correlation value as the coarse
frequency offset value of the receiving system. At this point, the known
sequence position indicator is inputted to the known data extractor 1430,
the timing recovery unit 1080, the carrier recovery unit 1090, the phase
compensator 1110, and the equalizer 1003, and the coarse frequency offset
is inputted to the adder 1480 and the NCO 1460.

[0303] In the meantime, while the N numbers of partial correlators 1411 to
141N detect the known data place (or known sequence position) and
estimate the coarse frequency offset, the buffer 1440 temporarily stores
the received data and outputs the temporarily stored data to the known
data extractor 1430. The known data extractor 1430 uses the known
sequence position indicator, which is outputted from the known data place
detector and frequency offset decider 1420, so as to extract the known
data from the output of the buffer 1440. Thereafter, the known data
extractor 1430 outputs the extracted data to the multiplier 1450. The NCO
1460 generates a complex signal corresponding to the coarse frequency
offset being outputted from the known data place detector and frequency
offset decider 1420. Then, the NCO 1460 outputs the generated complex
signal to the multiplier 1450.

[0304] The multiplier 1450 multiplies the complex signal of the NCO 1460
to the known data being outputted from the known data extractor 1430,
thereby outputting the known data having the coarse frequency offset
compensated to the frequency offset estimator 1470. The frequency offset
estimator 1470 estimates a fine frequency offset from the known data
having the coarse frequency offset compensated. Subsequently, the
frequency offset estimator 1470 outputs the estimated fine frequency
offset to the adder 1480. The adder 1480 adds the coarse frequency offset
to the fine frequency offset. Thereafter, the adder 1480 decides the
added result as a final initial frequency offset, which is then outputted
to the adder 1095 of the carrier recovery unit 1090 included in the
demodulator 1002. More specifically, during the process of acquiring
initial synchronization, the present invention may estimate and use the
coarse frequency offset as well as the fine frequency offset, thereby
enhancing the estimation performance of the initial frequency offset.

[0305] It is assumed that the known data is inserted within the data group
and then transmitted, as shown in FIG. 5. Then, the known sequence
detector and initial frequency offset estimator 1004-1 may use the known
data that have been additionally inserted between the A1 area and the A2
area, so as to estimate the initial frequency offset. The known position
indicator, which was periodically inserted within the A area estimated by
the known sequence detector and initial frequency offset estimator
1004-1, is inputted to the timing error detector 1083 of the timing error
recovery unit 1080, to the frequency offset estimator 1092 of the carrier
recovery unit 1090, to the frequency offset estimator 1112 of the phase
compensator 1110, and to the equalizer 1003.

[0306] FIG. 37 illustrates a block diagram showing the structure of one of
the partial correlators shown in FIG. 36. During the step of detecting
known data, since a frequency offset is included in the received signal,
each partial correlator divides the known data, which is known according
to an agreement between the transmitting system and the receiving system,
to K number of parts each having an L symbol length, thereby correlating
each divided part with the corresponding part of the received signal. In
order to do so, each partial correlator includes K number of phase and
size detector 1511 to 151K each formed in parallel, an adder 1520, and a
coarse frequency offset estimator 1530.

[0307] The first phase and size detector 1511 includes an L symbol buffer
1511-2, a multiplier 1511-3, an accumulator 1511-4, and a squarer 1511-5.
Herein, the first phase and size detector 1511 calculates the correlation
value of the known data having a first L symbol length among the K number
of sections. Also, the second phase and size detector 1512 includes an L
symbol delay 1512-1, an L symbol buffer 1512-2, a multiplier 1512-3, an
accumulator 1512-4, and a squarer 1512-5. Herein, the second phase and
size detector 1512 calculates the correlation value of the known data
having a second L symbol length among the K number of sections. Finally,
the N phase and size detector 151K includes a (K-1)L symbol delay 151K-1,
an L symbol buffer 151K-2, a multiplier 151K-3, an accumulator 151K-4,
and a squarer 151K-5. Herein, the Nth phase and size detector 151K
calculates the correlation value of the known data having an Nth L
symbol length among the K number of sections.

[0308] Referring to FIG. 37, {P0, P1, . . . , PKL-1} each
being multiplied with the received signal in the multiplier represents
the known data known by both the transmitting system and the receiving
system (i.e., the reference known data generated from the receiving
system). And, * represents a complex conjugate. For example, in the first
phase and size detector 1511, the signal outputted from the 1/N decimator
of the first partial correlator 1411, shown in FIG. 36, is temporarily
stored in the L symbol buffer 1511-2 of the first phase and size detector
1511 and then inputted to the multiplier 1511-3. The multiplier 1511-3
multiplies the output of the L symbol buffer 1511-2 with the complex
conjugate of the known data parts P0, P1, . . . , PKL-1
each having a first L symbol length among the known K number of sections.
Then, the multiplied result is outputted to the accumulator 1511-4.
During the L symbol period, the accumulator 1511-4 accumulates the output
of the multiplier 1511-3 and, then, outputs the accumulated value to the
squarer 1511-5 and the coarse frequency offset estimator 1530. The output
of the accumulator 1511-4 is a correlation value having a phase and a
size. Accordingly, the squarer 1511-5 calculates an absolute value of the
output of the multiplier 1511-4 and squares the calculated absolute
value, thereby obtaining the size of the correlation value. The obtained
size is then inputted to the adder 1520.

[0309] The adder 1520 adds the output of the squares corresponding to each
size and phase detector 1511 to 151K. Then, the adder 1520 outputs the
added result to the known data place detector and frequency offset
decider 1420. Also, the coarse frequency offset estimator 1530 receives
the output of the accumulator corresponding to each size and phase
detector 1511 to 151K, so as to estimate the coarse frequency offset at
each corresponding sampling phase. Thereafter, the coarse frequency
offset estimator 1530 outputs the estimated offset value to the known
data place detector and frequency offset decider 1420.

[0310] When the K number of inputs that are outputted from the accumulator
of each phase and size detector 1511 to 151K are each referred to as
{Z0, Z1, . . . , ZK+1}, the output of the coarse frequency
offset estimator 1530 may be obtained by using Equation 6 shown below.

[0311] The known data place detector and frequency offset decider 1420
stores the output of the partial correlator corresponding to each
sampling phase during an enhanced data group cycle or a pre-decided
cycle. Then, among the stored correlation values, the known data place
detector and frequency offset decider 1420 decides the place (or
position) corresponding to the highest correlation value as the place for
receiving the known data.

[0312] Furthermore, the known data place detector and frequency offset
decider 1420 decides the estimated value of the frequency offset taken
(or estimated) at the point of the highest correlation value as the
coarse frequency offset value of the receiving system. For example, if
the output of the partial correlator corresponding to the second partial
correlator 1412 is the highest value, the place corresponding to the
highest value is decided as the known data place. Thereafter, the coarse
frequency offset estimated by the second partial correlator 1412 is
decided as the final coarse frequency offset, which is then outputted to
the demodulator 1002.

[0313] Meanwhile, the output of the second multiplier 1050 is temporarily
stored in the decimator 1081 and the buffer 1082 both included in the
timing recovery unit 1080. Subsequently, the temporarily stored output
data are inputted to the timing error detector 1083 through the decimator
1081 and the buffer 1082. Assuming that the output of the second
multiplier 1050 is oversampled to N times its initial state, the
decimator 1081 decimates the output of the second multiplier 1050 at a
decimation rate of 1/N. Then, the 1/N-decimated data are inputted to the
buffer 1082. In other words, the decimator 1081 performs decimation on
the input signal in accordance with a VSB symbol cycle. Furthermore, the
decimator 1081 may also receive the output of the matched filter 1060
instead of the output of the second multiplier 1050.

[0314] The timing error detector 1083 uses the data prior to or after
being processed with matched-filtering and the known sequence position
indicator outputted from the known data detector and initial frequency
offset estimator 1004-1 in order to detect a timing error. Thereafter,
the detected timing error is outputted to the loop filter 1084.
Accordingly, the detected timing error information is obtained once
during each repetition cycle of the known data sequence.

[0315] For example, if a known data sequence having the same pattern is
periodically inserted and transmitted, as shown in FIG. 37, the timing
error detector 1083 may use the known data in order to detect the timing
error. There exists a plurality of methods for detecting timing error by
using the known data.

[0316] In the example of the present invention, the timing error may be
detected by using a correlation characteristic between the known data and
the received data in the time domain, the known data being already known
in accordance with a pre-arranged agreement between the transmitting
system and the receiving system. The timing error may also be detected by
using the correlation characteristic of the two known data types being
received in the frequency domain. Thus, the detected timing error is
outputted. In another example, a spectral lining method may be applied in
order to detect the timing error. Herein, the spectral lining method
corresponds to a method of detecting timing error by using sidebands of
the spectrum included in the received signal.

[0318] The holder 1085 holds (or maintains) the timing error filtered and
outputted from the loop filter 1084 during a pre-determined known data
sequence cycle period and outputs the processed timing error to the NCO
1086. Herein, the order of positioning of the loop filter 1084 and the
holder 1085 may be switched with one another. In additionally, the
function of the holder 1085 may be included in the loop filter 1084, and,
accordingly, the holder 1085 may be omitted.

[0319] The NCO 1086 accumulates the timing error outputted from the holder
1085. Thereafter, the NCO 1086 outputs the phase element (i.e., a
sampling clock) of the accumulated timing error to the resampler 1040,
thereby adjusting the sampling timing of the resampler 1040.

[0320] FIG. 38 illustrates an example of the timing recovery unit included
in the demodulator 1002 shown in FIG. 36. Referring to FIG. 38, the
timing recovery unit 1080 includes a first timing error detector 1611, a
second timing error detector 1612, a multiplexer 1613, a loop-filter
1614, and an NCO 1615. The timing recovery unit 1080 would be beneficial
when the input signal is divided into a first area in which known data
having a predetermined length are inserted at predetermined position(s)
and a second area that includes no known data. Assuming that the first
timing error detector 1611 detects a first timing error using a sideband
of a spectrum of an input signal and the second timing error detector
1612 detects a second timing error using the known data, the multiplexer
1613 can output the first timing error for the first area and can output
the second timing error for the second area. The multiplexer 1613 may
output both of the first and second timing errors for the first area in
which the known data are inserted. By using the known data a more
reliable timing error can be detected and the performance of the timing
recovery unit 1080 can be enhanced.

[0321] This disclosure describes two ways of detecting a timing error. One
way is to detect a timing error using correlation in the time domain
between known data pre-known to a transmitting system and a receiving
system (reference known data) and the known data actually received by the
receiving system, and the other way is to detect a timing error using
correlation in the frequency domain between two known data actually
received by the receiving system. In FIG. 39, a timing error is detected
by calculating correlation between the reference known data pre-known to
and generated by the receiving system and the known data actually
received. In FIG. 39, correlation between an entire portion of the
reference know data sequence and an entire portion of the received known
data sequence is calculated. The correlation output has a peak value at
the end of each known data sequence actually received.

[0322] In FIG. 40, a timing error is detected by calculating correlation
values between divided portions of the reference known data sequence and
divided portions of the received known data sequence, respectively. The
correlation output has a peak value at the end of each divided portion of
the received known data sequence. The correlation values may be added as
a total correlation value as shown FIG. 40, and the total correlation
value can be used to calculate the timing error. When an entire portion
of the received known data is used for correlation calculation, the
timing error can be obtained for each data block. If the correlation
level of the entire portion of the known data sequence is low, a more
precise correlation can be obtained by using divided portions of the
known data sequence as shown in FIG. 40.

[0323] The use of a final correlation value which is obtained based upon a
plurality of correlation values of divided portions of a received known
data sequence may reduce the carrier frequency error. In addition, the
process time for the timing recovery can be greatly reduced when the
plurality of correlation values are used to calculate the timing error.
For example, when the reference known data sequence which is pre-known to
the transmitting system and receiving system is divided into K portions,
K correlation values between the K portions of the reference known data
sequence and the corresponding divided portions of the received known
data sequence can be calculated, or any combination(s) of the correlation
values can be used. Therefore, the period of the timing error detection
can be reduced when the divided portions of the known data sequence are
used instead of the entire portion of the sequence.

[0324] The timing error can be calculated from the peak value of the
correlation values. The timing error is obtained for each data block if
an entire portion of the known data sequence is used as shown in FIG. 41.
On the other hand, if K divided portions of the known data sequence are
used for correlation calculation, K correlation values and corresponding
peak values can be obtained. This indicates that the timing error can be
detected K times.

[0325] A method of detecting a timing error using the correlation between
the reference known data and the received known data shown will now be
described in more detail. FIG. 41 illustrates correlation values between
the reference known data and the received known data. The correlation
values correspond to data samples sampled at a rate two times greater
than the symbol clock. When the random data effect is minimized and there
is no timing clock error, the correlation values between the reference
known data and the received known data are symmetrical. However, if a
timing phase error exists, the correlation values adjacent to the peak
value are not symmetrical as shown in FIG. 41. Therefore, the timing
error can be obtained by using a difference (timing phase error shown in
FIG. 41) between the correlation values before and after the peak value.

[0326]FIG. 42 illustrates an example of the timing error detector shown
in FIG. 38. The timing error detector includes a correlator 1701, a down
sampler 1702, an absolute value calculator 1703, a delay 1704, and a
subtractor 1705. The correlator 1701 receives a known data sequence
sampled at a rate at least two times higher than the symbol clock
frequency and calculates the correlation values between the received
known data sequence and a reference known data sequence. The down sampler
1702 performs down sampling on the correlation values and obtains samples
having a symbol frequency. For example, if the data inputted to the
correlator 1701 is pre-sampled at a sampling rate of 2, then the down
sampler 1702 performs down sampling at a rate of 1/2 to obtain samples
having the symbol frequency. The absolute value calculator 1703
calculates absolute values (or square values) of the down-sampled
correlation values. These absolute values are inputted to the delay 1704
and the subtractor 1705. The delay 1704 delays the absolute values for a
symbol and the subtractor then outputs a timing error by subtracting the
delayed absolute value from the values outputted from the absolute value
calculator 1703.

[0327] The arrangement of the correlator 1701, the down sampler 1702, the
absolute value calculator 1703, and the delay 1704, and the subtractor
1705 shown in FIG. 42 can be modified. For example, the timing phase
error can be calculated in the order of the down sampler 1702, the
correlator 1701, and the absolute value calculator 1703, or in the order
of the correlator 1701, the absolute value calculator 1703, and the down
sampler 1702.

[0328] The timing error can also be obtained using the frequency
characteristic of the known data. When there is a timing frequency error,
a phase of the input signal increases at a fixed slope as the frequency
of the signal increases and this slope is different for current and next
data block. Therefore, the timing error can be calculated based on the
frequency characteristic of two different known data blocks. In FIG. 43,
a current known data sequence (right) and a previous known data sequence
(left) are converted into first and second frequency domain signals,
respectively, using a Fast Fourier Transform (FFT) algorithm. The
conjugate value of the first frequency domain signal is then multiplied
with the second frequency domain signal in order to obtain the
correlation value between two frequency domain signals. In other words,
the correlation between the frequency value of the previous known data
sequence and the frequency value of the current known data sequence is
used to detect a phase change between the known data blocks for each
frequency. In this way the phase distortion of a channel can be
eliminated.

[0329] The frequency response of a complex VSB signal does not have a full
symmetric distribution as shown in FIG. 41. Rather, its distribution is a
left or right half of the distribution and the frequency domain
correlation values also have a half distribution. In order to the phase
difference between the frequency domain correlation values, the frequency
domain having the correlation values can be divided into two sub-areas
and a phase of a combined correlation value in each sub-area can be
obtained. Thereafter, the difference between the phases of sub-areas can
be used to calculate a timing frequency error. When a phase of a combined
correlation values is used for each frequency, the magnitude of each
correlation value is proportional to reliability and a phase component of
each correlation value is reflected to the final phase component in
proportion to the magnitude.

[0330] FIG. 44 illustrates another example of the timing error detector
shown in FIG. 38. The timing error detector shown in FIG. 44 includes a
Fast Fourier Transform (FFT) unit 1801, a first delay 1802, a conjugator
1803, a multiplier 1804, an accumulator (adder) 1805, a phase detector
1806, a second delay 1807, and a subtractor 1808. The first delay 1802
delays for one data block and the second delay 1807 delays for 1/4 data
block. One data block includes a frequency response of a sequence of N
known data symbol sequences. When a known data region is known and the
data symbols are received, the FFT unit 1801 converts complex values of
consecutive N known data symbol sequences into complex values in the
frequency domain. The first delay 1802 delays the frequency domain
complex values for a time corresponding to one data block, and the
conjugator 1803 generate conjugate values of the delayed complex values.
The multiplier 1804 multiplies the current block of known data outputted
from the FFT unit 1801 with the previous block of known data outputted
from the conjugator 1803. The output of the multiplier 1804 represents
frequency region correlation values within a known data block.

[0331] Since the complex VSB data exist only on a half of the frequency
domain, the accumulator 1805 divides a data region in the known data
block into two sub-regions, and accumulates correlation values for each
sub-region. The phase detector 1806 detects a phase of the accumulated
correlation value for each sub-region. The second delay 1807 delays the
detected phase for a time corresponding to a 1/4 data block. The
subtractor 1808 obtains a phase difference between the delayed phase and
the phase outputted from the accumulator 1806 and outputs the phase
difference as a timing frequency error.

[0332] In the method of calculating a timing error by using a peak of
correlation between the reference known data and the received known data
in the time domain, the contribution of the correlation values may affect
a channel when the channel is a multi path channel. However, this can be
greatly eliminated if the timing error is obtained using the correlation
between two received known data. In addition, the timing error can be
detected using an entire portion of the known data sequence inserted by
the transmitting system, or it can be detected using a portion of the
known data sequence which is robust to random or noise data.

[0333] Meanwhile, the DC remover 1070 removes pilot tone signal (i.e., DC
signal), which has been inserted by the transmitting system, from the
matched-filtered signal. Thereafter, the DC remover 1070 outputs the
processed signal to the phase compensator 1110.

[0334]FIG. 45 illustrates a detailed block diagram of a DC remover
according to an embodiment of the present invention. Herein, identical
signal processing processes are performed on each of a real number
element (or in-phase (I)) and an imaginary number element (or a
quadrature (Q)) of the inputted complex signal, thereby estimating and
removing the DC value of each element. In order to do so, the DC remover
shown in FIG. 45 includes a first DC estimator and remover 1900 and a
second DC estimator and remover 1950. Herein, the first DC estimator and
remover 1900 includes an R sample buffer 1901, a DC estimator 1902, an M
sample holder 1903, a C sample delay 1904, and a subtractor 1905. Herein,
the first DC estimator and remover 1900 estimates and removes the DC of
the real number element (i.e., an in-phase DC). Furthermore, the second
DC estimator and remover 1950 includes an R sample buffer 1951, a DC
estimator 1952, an M sample holder 1953, a C sample delay 1954, and a
subtractor 1955. The second DC estimator and remover 1950 estimates and
removes the DC of the imaginary number element (i.e., a quadrature DC).
In the present invention, the first DC estimator and remover 1900 and the
second DC estimator and remover 1950 may receive different input signals.
However, each DC estimator and remover 1900 and 1950 has the same
structure. Therefore, a detailed description of the first DC estimator
and remover 1900 will be presented herein, and the second DC estimator
and remover 1950 will be omitted for simplicity.

[0335] More specifically, the in-phase signal matched-filtered by the
matched filter 1060 is inputted to the R sample buffer 1901 of the first
DC estimator and remover 1900 within the DC remover 1070 and is then
stored. The R sample buffer 1901 is a buffer having the length of R
sample. Herein, the output of the R sample buffer 1901 is inputted to the
DC estimator 1902 and the C sample delay 1904. The DC estimator 1902 uses
the data having the length of R sample, which are outputted from the
buffer 1901, so as to estimate the DC value by using Equation 7 shown
below.

y [ n ] = 1 R k = 0 R - 1 x [ k + M *
n ] Equation 7 ##EQU00002##

[0336] In the above-described Equation 7, x[n] represents the inputted
sample data stored in the buffer 1901. And, y[n] indicates the DC
estimation value. More specifically, the DC estimator 1902 accumulates R
number of sample data stored in the buffer 1901 and estimates the DC
value by dividing the accumulated value by R. At this point, the stored
input sample data set is shifted as much as M sample. Herein, the DC
estimation value is outputted once every M samples.

[0337]FIG. 46 illustrates a shifting of the input sample data used for DC
estimation. For example, when M is equal to 1 (i.e., M=1), the DC
estimator 1902 estimates the DC value each time a sample is shifted to
the buffer 1901. Accordingly, each estimated result is outputted for each
sample. If M is equal to R (i.e., M=R), the DC estimator 1902 estimates
the DC value each time R number of samples are shifted to the buffer
1901. Accordingly, each estimated result is outputted for each cycle of R
samples. Therefore, in this case, the DC estimator 1902 corresponds to a
DC estimator that operates in a block unit of R samples. Herein, any
value within the range of 1 and R may correspond to the value M.

[0338] As described above, since the output of the DC estimator 1902 is
outputted after each cycle of M samples, the M sample holder 1903 holds
the DC value estimated from the DC estimator 1902 for a period of M
samples. Then, the estimated DC value is outputted to the subtractor
1905. Also, the C sample delay 1904 delays the input sample data stored
in the buffer 1901 by C samples, which are then outputted to the
subtractor 1905. The subtractor 1905 subtracts the output of the M sample
holder 1903 from the output of the C sample delay 1904. Thereafter, the
subtractor 1905 outputs the signal having the in-phase DC removed.

[0339] Herein, the C sample delay 1904 decides which portion of the input
sample data is to be compensated with the output of the DC estimator
1902. More specifically, the DC estimator and remover 1900 may be divided
into a DC estimator 1902 for estimating the DC and the subtractor for
compensating the input sample data within the estimated DC value. At this
point, the C sample delay 1904 decides which portion of the input sample
data is to be compensated with the estimated DC value. For example, when
C is equal to 0 (i.e., C=0), the beginning of the R samples is
compensated with the estimated DC value obtained by using R samples.
Alternatively, when C is equal to R (i.e., C=R), the end of the R samples
is compensated with the estimated DC value obtained by using R samples.
Similarly, the data having the DC removed are inputted to the buffer 1111
and the frequency offset estimator 1112 of the phase compensator 1110.

[0340] Meanwhile, FIG. 47 illustrates a detailed block diagram of a DC
remover according to another embodiment of the present invention. Herein,
identical signal processing processes are performed on each of a real
number element (or in-phase (I)) and an imaginary number element (or a
quadrature (Q)) of the inputted complex signal, thereby estimating and
removing the DC value of each element. In order to do so, the DC remover
shown in FIG. 47 includes a first DC estimator and remover 2100 and a
second DC estimator and remover 2150. FIG. 47 corresponds to an infinite
impulse response (IIR) structure.

[0341] Herein, the first DC estimator and remover 2100 includes a
multiplier 2101, an adder 2102, an 1 sample delay 2103, a multiplier
2104, a C sample delay 2105, and a subtractor 2106. Also, the second DC
estimator and remover 2150 includes a multiplier 2151, an adder 2152, an
1 sample delay 2153, a multiplier 2154, a C sample delay 2155, and a
subtractor 2156. In the present invention, the first DC estimator and
remover 2100 and the second DC estimator and remover 2150 may receive
different input signals. However, each DC estimator and remover 2100 and
2150 has the same structure. Therefore, a detailed description of the
first DC estimator and remover 2100 will be presented herein, and the
second DC estimator and remover 2150 will be omitted for simplicity.

[0342] More specifically, the in-phase signal matched-filtered by the
matched filter 1060 is inputted to the multiplier 2101 and the C sample
delay 2105 of the first DC estimator and remover 2100 within the DC
remover 1070. The multiplier 2101 multiplies a pre-determined constant
α to the in-phase signal that is being inputted. Then, the
multiplier 2101 outputs the multiplied result to the adder 2102. The
adder 2102 adds the output of the multiplier 2101 to the output of the
multiplier 2104 that is being fed-back. Thereafter, the adder 2102
outputs the added result to the 1 sample delay 2103 and the subtractor
2106. More specifically, the output of the adder 2102 corresponds to the
estimated in-phase DC value.

[0343] The 1 sample delay 2103 delays the estimated DC value by 1 sample
and outputs the DC value delayed by 1 sample to the multiplier 2104. The
multiplier 2109 multiplies a pre-determined constant (1-α) to the
DC value delayed by 1 sample. Then, the multiplier 2104 feeds-back the
multiplied result to the adder 2102.

[0344] Subsequently, the C sample delay 2105 delays the in-phase sample
data by C samples and, then, outputs the delayed in-phase sample data to
the subtractor 2106. The subtractor 2106 subtracts the output of the
adder 2102 from the output of the C sample delay 2105, thereby outputting
the signal having the in-phase DC removed therefrom.

[0345] Similarly, the data having the DC removed are inputted to the
buffer 1111 and the frequency offset estimator 1112 of the phase
compensator 1110 of FIG. 34.

[0346] The frequency offset estimator 1112 uses the known sequence
position indicator outputted from the known sequence detector and initial
frequency offset estimator 1004-1 in order to estimate the frequency
offset from the known data sequence that is being inputted, the known
data sequence having the DC removed by the DC remover 1070. Then, the
frequency offset estimator 1112 outputs the estimated frequency offset to
the holder 1113. Similarly, the frequency offset estimation value is
obtained at each repetition cycle of the known data sequence.

[0347] Therefore, the holder 1113 holds the frequency offset estimation
value during a cycle period of the known data sequence and then outputs
the frequency offset estimation value to the NCO 1114. The NCO 1114
generates a complex signal corresponding to the frequency offset held by
the holder 1113 and outputs the generated complex signal to the
multiplier 1115.

[0348] The multiplier 1115 multiplies the complex signal outputted from
the NCO 1114 to the data being delayed by a set period of time in the
buffer 1111, thereby compensating the phase change included in the
delayed data. The data having the phase change compensated by the
multiplier 1115 pass through the decimator 1200 so as to be inputted to
the equalizer 1003. At this point, since the frequency offset estimated
by the frequency offset estimator 1112 of the phase compensator 1110 does
not pass through the loop filter, the estimated frequency offset
indicates the phase difference between the known data sequences. In other
words, the estimated frequency offset indicates a phase offset.

Channel Equalizer

[0349] The demodulated data using the known data in the demodulator 1002
is inputted to the channel equalizer 1003. The demodulated data is
inputted to the known sequence detector 1004.

[0350] The equalizer 1003 may perform channel equalization by using a
plurality of methods. An example of estimating a channel impulse response
(CIR) so as to perform channel equalization will be given in the
description of the present invention. Most particularly, an example of
estimating the CIR in accordance with each region within the data group,
which is hierarchically divided and transmitted from the transmitting
system, and applying each CIR differently will also be described herein.
Furthermore, by using the known data, the place and contents of which is
known in accordance with an agreement between the transmitting system and
the receiving system, and/or the field synchronization data, so as to
estimate the CIR, the present invention may be able to perform channel
equalization with more stability.

[0351] Herein, the data group that is inputted for the equalization
process is divided into regions A to D, as shown in FIG. 5. More
specifically, in the example of the present invention, each region A, B,
C, and D are further divided into MPH blocks B4 to B7, MPH blocks B3 and
B8, MPH blocks B2 and B9, MPH blocks B1 and B10, respectively.

[0352] More specifically, a data group can be assigned and transmitted a
maximum the number of 4 in a VSB frame in the transmitting system. In
this case, all data group do not include field synchronization data. In
the present invention, the data group including the field synchronization
data performs channel-equalization using the field synchronization data
and known data. And the data group not including the field
synchronization data performs channel-equalization using the known data.
For example, the data of the MPH block B3 including the field
synchronization data performs channel-equalization using the CIR
calculated from the field synchronization data area and the CIR
calculated from the first known data area. Also, the data of the MPH
blocks B1 and B2 performs channel-equalization using the CIR calculated
from the field synchronization data area and the CIR calculated from the
first known data area. Meanwhile, the data of the MPH blocks B4 to B6 not
including the field synchronization data performs channel-equalization
using CIRS calculated from the first known data area and the third known
data area.

[0353] As described above, the present invention uses the CIR estimated
from the field synchronization data and the known data sequences in order
to perform channel equalization on data within the data group. At this
point, each of the estimated CIRs may be directly used in accordance with
the characteristics of each region within the data group. Alternatively,
a plurality of the estimated CIRs may also be either interpolated or
extrapolated so as to create a new CIR, which is then used for the
channel equalization process.

[0354] Herein, when a value F(Q) of a function F(x) at a particular point
Q and a value F(S) of the function F(x) at another particular point S are
known, interpolation refers to estimating a function value of a point
within the section between points Q and S. Linear interpolation
corresponds to the simplest form among a wide range of interpolation
operations. The linear interpolation described herein is merely exemplary
among a wide range of possible interpolation methods. And, therefore, the
present invention is not limited only to the examples set forth herein.

[0355] Alternatively, when a value F(Q) of a function F(x) at a particular
point Q and a value F(S) of the function F(x) at another particular point
S are known, extrapolation refers to estimating a function value of a
point outside of the section between points Q and S. Linear extrapolation
is the simplest form among a wide range of extrapolation operations.
Similarly, the linear extrapolation described herein is merely exemplary
among a wide range of possible extrapolation methods. And, therefore, the
present invention is not limited only to the examples set forth herein.

[0356] FIG. 48 is a flow chart illustrating a channel equalization method
according to one aspect of the present invention. An input data group
(current data group) is temporarily stored (2301), and CIRs of the field
sync data and the known data sequences included in the stored data group
are estimated (2302). In step 2301, a portion of the data group can be
stored, because regions B1, C1, and A1 are received before the first
known data region and the channel equalization for regions B1, C1, and A1
are performed using a CIR estimated from the first known data region.

[0357] In step 2303, the channel equalization for region C1 of a current
data group may be performed using a CIR which is estimated by
extrapolating CIR_FS and CIR_N0 estimated from the current data group.
Alternatively, the channel equalization for region C1 of the current data
group can be performed using any one of CIR_N4 estimated from a previous
data group and CIR_FS estimated from the current data group. If the
extrapolated CIR is used, the data included in region C1 must be stored
until CIR_N0 is estimated because the region C1 data are inputted before
the first known data region in the current group. The data included in
region C1 can be stored in a memory in the broadcast receiving system, or
in an external storage.

[0358] In step 2303, the channel equalization for region B1 of a current
data group may be performed using a CIR which is estimated by
extrapolating CIR_FS and CIR_N0 estimated from the current data group. In
further example, the channel equalization for region B1 can be performed
using CIR_FS of the current data group. Similarly, the data included in
the region B1 must be stored until CIR_N0 (or CIR_FS) is estimated
because the B1 region data are inputted before the first known data
region. The data included in region B1 can be stored in a memory in the
broadcast receiving system, or in an external storage,

[0359] In step 2304, the channel equalization for region A1 of a current
data group may be performed using a CIR which is estimated by
interpolating CIR_FS and CIR_N0 estimated from the current data group.
Alternatively, the channel equalization for region A1 can be performed
using any one of CIR_FS and CIR_N0 estimated from the currently data
group. If region A1 is equalized using the interpolated CIR, the data
included in region A1 must be stored until CIR_N0 (or CIR_FS) is
estimated. The data included in region A1 can be stored in a memory in
the broadcast receiving system, or in an external storage.

[0360] For Ai, (i=2, 3, 4, and 5) of a current data group, the channel
equalization may be performed using a CIR which is estimated by
interpolating CIR_N (i-1) and CIR_N(i) of the current data group (2305).
Alternatively, the channel equalization for Ai may be performed using any
one of CIR_N(i-1) and CIR_N(i). For example, channel equalization for A2
(i=2) is performed using a CIR estimated by interpolating CIR_N1 and
CIR_N2 of the current data group or using any one of CIR_N1 and CIR_N2 of
the current data group.

[0361] In step 2306, the channel equalization for regions B2, C2, and C3
may be performed using a CIR estimated by interpolating CIR_N3 and CIR_N4
estimated from the current data group. Alternatively, the channel
equalization may be performed using CIR_N4 estimated from the current
data group.

[0362]FIG. 49 illustrates a block diagram of a channel equalizer
according to another embodiment of the present invention. Herein, by
estimating and compensating a remaining carrier phase error from a
channel-equalized signal, the receiving system of the present invention
may be enhanced. Referring to FIG. 49, the channel equalizer includes a
first frequency domain converter 3100, a channel estimator 3110, a second
frequency domain converter 3121, a coefficient calculator 3122, a
distortion compensator 3130, a time domain converter 3140, a remaining
carrier phase error remover 3150, a noise canceller (NC) 3160, and a
decision unit 3170.

[0365] The second frequency domain converter 3121 includes a fast fourier
transform (FFT) unit converting the CIR being outputted from the channel
estimator 3110 to frequency domain CIR.

[0366] The time domain converter 3140 includes an IFFT unit 3141
converting the data having the distortion compensated by the distortion
compensator 3130 to time domain data, and a save unit 3142 extracting
only valid data from the data outputted from the IFFT unit 3141.

[0367] The remaining carrier phase error remover 3150 includes an error
compensator 3151 removing the remaining carrier phase error included in
the channel equalized data, and a remaining carrier phase error estimator
3152 using the channel equalized data and the decision data of the
decision unit 3170 so as to estimate the remaining carrier phase error,
thereby outputting the estimated error to the error compensator 3151.
Herein, any device performing complex number multiplication may be used
as the distortion compensator 3130 and the error compensator 3151.

[0368] At this point, since the received data correspond to data modulated
to VSB type data, 8-level scattered data exist only in the real number
element. Therefore, referring to FIG. 49, all of the signals used in the
noise canceller 3160 and the decision unit 3170 correspond to real number
(or in-phase) signals. However, in order to estimate and compensate the
remaining carrier phase error and the phase noise, both real number
(in-phase) element and imaginary number (quadrature) element are
required. Therefore, the remaining carrier phase error remover 3150
receives and uses the quadrature element as well as the in-phase element.
Generally, prior to performing the channel equalization process, the
demodulator 902 within the receiving system performs frequency and phase
recovery of the carrier. However, if a remaining carrier phase error that
is not sufficiently compensated is inputted to the channel equalizer, the
performance of the channel equalizer may be deteriorated. Particularly,
in a dynamic channel environment, the remaining carrier phase error may
be larger than in a static channel environment due to the frequent and
sudden channel changes. Eventually, this acts as an important factor that
deteriorates the receiving performance of the present invention.

[0369] Furthermore, a local oscillator (not shown) included in the
receiving system should preferably include a single frequency element.
However, the local oscillator actually includes the desired frequency
elements as well as other frequency elements. Such unwanted (or
undesired) frequency elements are referred to as phase noise of the local
oscillator. Such phase noise also deteriorates the receiving performance
of the present invention. It is difficult to compensate such remaining
carrier phase error and phase noise from the general channel equalizer.
Therefore, the present invention may enhance the channel equaling
performance by including a carrier recovery loop (i.e., a remaining
carrier phase error remover 3150) in the channel equalizer, as shown in
FIG. 49, in order to remove the remaining carrier phase error and the
phase noise.

[0370] More specifically, the receiving data demodulated in FIG. 49 are
overlapped by the overlap unit 3101 of the first frequency domain
converter 3100 at a pre-determined overlapping ratio, which are then
outputted to the FFT unit 3102. The FFT unit 3102 converts the overlapped
time domain data to overlapped frequency domain data through by
processing the data with FFT. Then, the converted data are outputted to
the distortion compensator 3130.

[0371] The distortion compensator 3130 performs a complex number
multiplication on the overlapped frequency domain data outputted from the
FFT unit 3102 included in the first frequency domain converter 3100 and
the equalization coefficient calculated from the coefficient calculator
3122, thereby compensating the channel distortion of the overlapped data
outputted from the FFT unit 3102. Thereafter, the compensated data are
outputted to the IFFT unit 3141 of the time domain converter 3140. The
IFFT unit 3141 performs IFFT on the overlapped data having the channel
distortion compensated, thereby converting the overlapped data to time
domain data, which are then outputted to the error compensator 3151 of
the remaining carrier phase error remover 3150.

[0372] The error compensator 3151 multiplies a signal compensating the
estimated remaining carrier phase error and phase noise with the valid
data extracted from the time domain. Thus, the error compensator 3151
removes the remaining carrier phase error and phase noise included in the
valid data.

[0373] The data having the remaining carrier phase error compensated by
the error compensator 3151 are outputted to the remaining carrier phase
error estimator 3152 in order to estimate the remaining carrier phase
error and phase noise and, at the same time, outputted to the noise
canceller 3160 in order to remove (or cancel) the noise.

[0374] The remaining carrier phase error estimator 3152 uses the output
data of the error compensator 3151 and the decision data of the decision
unit 3170 to estimate the remaining carrier phase error and phase noise.
Thereafter, the remaining carrier phase error estimator 3152 outputs a
signal for compensating the estimated remaining carrier phase error and
phase noise to the error compensator 3151. In this embodiment of the
present invention, an inverse number of the estimated remaining carrier
phase error and phase noise is outputted as the signal for compensating
the remaining carrier phase error and phase noise.

[0375] FIG. 50 illustrates a detailed block diagram of the remaining
carrier phase error estimator 3152 according to an embodiment of the
present invention. Herein, the remaining carrier phase error estimator
3152 includes a phase error detector 3211, a loop filter 3212, a
numerically controlled oscillator (NCO) 3213, and a conjugator 3214.
Referring to FIG. 50, the decision data, the output of the phase error
detector 3211, and the output of the loop filter 3212 are all real number
signals. And, the output of the error compensator 3151, the output of the
NCO 3213, and the output of the conjugator 3214 are all complex number
signals.

[0376] The phase error detector 3211 receives the output data of the error
compensator 3151 and the decision data of the decision unit 3170 in order
to estimate the remaining carrier phase error and phase noise. Then, the
phase error detector 3211 outputs the estimated remaining carrier phase
error and phase noise to the loop filter.

[0377] The loop filter 3212 then filters the remaining carrier phase error
and phase noise, thereby outputting the filtered result to the NCO 3213.
The NCO 3213 generates a cosine corresponding to the filtered remaining
carrier phase error and phase noise, which is then outputted to the
conjugator 3214.

[0378] The conjugator 3214 calculates the conjugate value of the cosine
wave generated by the NCO 3213. Thereafter, the calculated conjugate
value is outputted to the error compensator 3151. At this point, the
output data of the conjugator 3214 becomes the inverse number of the
signal compensating the remaining carrier phase error and phase noise. In
other words, the output data of the conjugator 3214 becomes the inverse
number of the remaining carrier phase error and phase noise.

[0379] The error compensator 3151 performs complex number multiplication
on the equalized data outputted from the time domain converter 3140 and
the signal outputted from the conjugator 3214 and compensating the
remaining carrier phase error and phase noise, thereby removing the
remaining carrier phase error and phase noise included in the equalized
data. Meanwhile, the phase error detector 3211 may estimate the remaining
carrier phase error and phase noise by using diverse methods and
structures. According to this embodiment of the present invention, the
remaining carrier phase error and phase noise are estimated by using a
decision-directed method.

[0380] If the remaining carrier phase error and phase noise are not
included in the channel-equalized data, the decision-directed phase error
detector according to the present invention uses the fact that only real
number values exist in the correlation values between the
channel-equalized data and the decision data. More specifically, if the
remaining carrier phase error and phase noise are not included, and when
the input data of the phase error detector 3211 are referred to as
xi+jxq, the correlation value between the input data of the
phase error detector 3211 and the decision data may be obtained by using
Equation 8 shown below:

[0381] At this point, there is no correlation between xi and xq.
Therefore, the correlation value between xi and xq is equal to
0. Accordingly, if the remaining carrier phase error and phase noise are
not included, only the real number values exist herein. However, if the
remaining carrier phase error and phase noise are included, the real
number element is shown in the imaginary number value, and the imaginary
number element is shown in the real number value. Thus, in this case, the
imaginary number element is shown in the correlation value. Therefore, it
can be assumed that the imaginary number portion of the correlation value
is in proportion with the remaining carrier phase error and phase noise.
Accordingly, as shown in Equation 9 below, the imaginary number of the
correlation value may be used as the remaining carrier phase error and
phase noise.

Phase Error=imag{(xi+jxq)({circumflex over
(x)}i+j{circumflex over (x)}q)*}

[0382]FIG. 51 illustrates a block diagram of a phase error detector 3211
obtaining the remaining carrier phase error and phase noise. Herein, the
phase error detector 3211 includes a Hilbert converter 3311, a complex
number configurator 3312, a conjugator 3313, a multiplier 3314, and a
phase error output 3315. More specifically, the Hilbert converter 3311
creates an imaginary number decision data {circumflex over (x)}q by
performing a Hilbert conversion on the decision value {circumflex over
(x)}i of the decision unit 3170. The generated imaginary number
decision value is then outputted to the complex number configurator 3312.
The complex number configurator 3312 uses the decision data {circumflex
over (x)}i and {circumflex over (x)}q to configure the complex
number decision data {circumflex over (x)}i+j{circumflex over
(x)}g, which are then outputted to the conjugator 3313. The
conjugator 3313 conjugates the output of the complex number configurator
3312, thereby outputting the conjugated value to the multiplier 3314. The
multiplier 3314 performs a complex number multiplication on the output
data of the error compensator 3151 and the output data {circumflex over
(x)}i-j{circumflex over (x)}q of the conjugator 3313, thereby
obtaining the correlation between the output data xi+jxq of the
error compensator 3151 and the decision value {circumflex over
(x)}i-j{circumflex over (x)}q of the decision unit 3170. The
correlation data obtained from the multiplier 3314 are then inputted to
the phase error output 3315. The phase error output 3315 outputs the
imaginary number portion xq{circumflex over
(x)}i-xi{circumflex over (x)}q of the correlation data
outputted from the multiplier 3314 as the remaining carrier phase error
and phase noise.

[0383] The phase error detector shown in FIG. 51 is an example of a
plurality of phase error detecting methods. Therefore, other types of
phase error detectors may be used in the present invention. Therefore,
the present invention is not limited only to the examples and embodiments
presented in the description of the present invention. Furthermore,
according to another embodiment of the present invention, at least 2
phase error detectors are combined so as to detect the remaining carrier
phase error and phase noise.

[0384] Accordingly, the output of the remaining carrier phase error
remover 3150 having the detected remaining carrier phase error and phase
noise removed as described above, is configured of an addition of the
original (or initial) signal having the channel equalization, the
remaining carrier phase error and phase noise, and the signal
corresponding to a white noise being amplified to a colored noise during
the channel equalization.

[0386] In order to do so, the noise canceller 3160 includes a subtractor
and a noise predictor. More specifically, the subtractor subtracts the
noise predicted by the noise predictor from the output data of the
residual carrier phase error estimator 3150. Then, the subtractor outputs
the signal from which amplified noise is cancelled (or removed) for data
recovery and, simultaneously, outputs the same signal to the decision
unit 3170. The noise predictor calculates a noise element by subtracting
the output of the decision unit 3170 from the signal having residual
carrier phase error removed therefrom by the residual carrier phase error
estimator 3150. Thereafter, the noise predictor uses the calculated noise
element as input data of a filter included in the noise predictor. Also,
the noise predictor uses the filter (not shown) in order to predict any
color noise element included in the output symbol of the residual carrier
phase error estimator 3150. Accordingly, the noise predictor outputs the
predicted color noise element to the subtractor.

[0387] The data having the noise removed (or cancelled) by the noise
canceller 3160 are outputted for the data decoding process and, at the
same time, outputted to the decision unit 3170.

[0388] The decision unit 3170 selects one of a plurality of pre-determined
decision data sets (e.g., 8 decision data sets) that is most approximate
to the output data of the noise canceller 3160, thereby outputting the
selected data to the remaining carrier phase error estimator 3152 and the
noise canceller 3160.

[0389] Meanwhile, the received data are inputted to the overlap unit 3101
of the first frequency domain converter 3100 included in the channel
equalizer and, at the same time, inputted to the CIR estimator 3111 of
the channel estimator 3110.

[0390] The CIR estimator 3111 uses a training sequence, for example, data
being inputted during the known data section and the known data in order
to estimate the CIR, thereby outputting the estimated CIR to the phase
compensator 3112. If the data to be channel-equalizing is the data within
the data group including field synchronization data, the training
sequence using in the CIR estimator 3111 may become the field
synchronization data and known data. Meanwhile, if the data to be
channel-equalizing is the data within the data group not including field
synchronization data, the training sequence using in the CIR estimator
3111 may become only the known data.

[0391] For example, the CIR estimator 3111 estimates CIR using the known
data correspond to reference known data generated during the known data
section by the receiving system in accordance with an agreement between
the receiving system and the transmitting system. For this, the CIR
estimator 3111 is provided known data position information from the known
sequence detector 1004. Also the CIR estimator 3111 may be provided field
synchronization position information from the known sequence detector
1004.

[0392] Furthermore, in this embodiment of the present invention, the CIR
estimator 3111 estimates the CIR by using the least square (LS) method.

[0393] The LS estimation method calculates a cross correlation value p
between the known data that have passed through the channel during the
known data section and the known data that are already known by the
receiving end. Then, a cross correlation matrix R of the known data is
calculated. Subsequently, a matrix operation is performed on R-1p so
that the cross correlation portion within the cross correlation value p
between the received data and the initial known data, thereby estimating
the CIR of the transmission channel.

[0394] The phase compensator 3112 compensates the phase change of the
estimated CIR. Then, the phase compensator 3112 outputs the compensated
CIR to the linear interpolator 3113. At this point, the phase compensator
3112 may compensate the phase change of the estimated CIR by using a
maximum likelihood method.

[0395] More specifically, the remaining carrier phase error and phase
noise that are included in the demodulated received data and, therefore,
being inputted change the phase of the CIR estimated by the CIR estimator
3111 at a cycle period of one known data sequence. At this point, if the
phase change of the inputted CIR, which is to be used for the linear
interpolation process, is not performed in a linear form due to a high
rate of the phase change, the channel equalizing performance of the
present invention may be deteriorated when the channel is compensated by
calculating the equalization coefficient from the CIR, which is estimated
by a linear interpolation method.

[0396] Therefore, the present invention removes (or cancels) the amount of
phase change of the CIR estimated by the CIR estimator 3111 so that the
distortion compensator 3130 allows the remaining carrier phase error and
phase noise to bypass the distortion compensator 3130 without being
compensated. Accordingly, the remaining carrier phase error and phase
noise are compensated by the remaining carrier phase error remover 3150.

[0397] For this, the present invention removes (or cancels) the amount of
phase change of the CIR estimated by the phase compensator 3112 by using
a maximum likelihood method.

[0398] The basic idea of the maximum likelihood method relates to
estimating a phase element mutually (or commonly) existing in all CIR
elements, then to multiply the estimated CIR with an inverse number of
the mutual (or common) phase element, so that the channel equalizer, and
most particularly, the distortion compensator 3130 does not compensate
the mutual phase element.

[0399] More specifically, when the mutual phase element is referred to as
θ, the phase of the newly estimated CIR is rotated by θ as
compared to the previously estimated CIR. When the CIR of a point t is
referred to as hi(t), the maximum likelihood phase compensation
method obtains a phase θML corresponding to when hi(t) is
rotated by θ, the squared value of the difference between the CIR
of hi(t) and the CIR of hi(t+1), i.e., the CIR of a point
(t+1), becomes a minimum value. Herein, when i represents a tap of the
estimated CIR, and when N represents a number of taps of the CIR being
estimated by the CIR estimator 3111, the value of θML is equal
to or greater than 0 and equal to or less than N-1. This value may be
calculated by using Equation 10 shown below:

[0400] Herein, in light of the maximum likelihood method, the mutual phase
element θML is equal to the value of θ, when the right
side of Equation 10 being differentiated with respect to θ is equal
to 0. The above-described condition is shown in Equation 11 below:

[0402] More specifically, Equation 12 corresponds to the θML
value that is to be estimated by the argument of the correlation value
between hi(t) and hi(t+1).

[0403] FIG. 52 illustrates a phase compensator according to an embodiment
of the present invention, wherein the mutual phase element θML
is calculated as described above, and wherein the estimated phase element
is compensated at the estimated CIR. Referring to FIG. 52, the phase
compensator includes a correlation calculator 3410, a phase change
estimator 3420, a compensation signal generator 3430, and a multiplier
3440.

[0404] The correlation calculator 3410 includes a first N symbol buffer
3411, an N symbol delay 3412, a second N symbol buffer 3413, a conjugator
3414, and a multiplier 3415. More specifically, the first N symbol buffer
3411 included in the correlation calculator 3410 is capable of storing
the data being inputted from the CIR estimator 3111 in symbol units to a
maximum limit of N number of symbols. The symbol data being temporarily
stored in the first N symbol buffer 3411 are then inputted to the
multiplier 3415 included in the correlation calculator 3410 and to the
multiplier 3440.

[0405] At the same time, the symbol data being outputted from the CIR
estimator 3111 are delayed by N symbols from the N symbol delay 3412.
Then, the delayed symbol data pass through the second N symbol buffer
3413 and inputted to the conjugator 3414, so as to be conjugated and then
inputted to the multiplier 3415.

[0406] The multiplier 3415 multiplies the output of the first N symbol
buffer 3411 and the output of the conjugator 3414. Then, the multiplier
3415 outputs the multiplied result to an accumulator 3421 included in the
phase change estimator 3420.

[0407] More specifically, the correlation calculator 3410 calculates a
correlation between a current CIR hi(t+1) having the length of N and
a previous CIR hi(t) also having the length of N. Then, the
correlation calculator 3410 outputs the calculated correlation value to
the accumulator 3421 of the phase change estimator 3420.

[0408] The accumulator 3421 accumulates the correlation values outputted
from the multiplier 3415 during an N symbol period. Then, the accumulator
3421 outputs the accumulated value to the phase detector 3422. The phase
detector 3422 then calculates a mutual phase element θML from
the output of the accumulator 3421 as shown in the above-described
Equation 11. Thereafter, the calculated θML value is outputted
to the compensation signal generator 3430.

[0409] The compensation signal generator 3430 outputs a complex signal
e-jθML having a phase opposite to that of the detected
phase as the phase compensation signal to the multiplier 3440. The
multiplier 3440 multiplies the current CIR hi(t+1) being outputted
from the first N symbol buffer 3411 with the phase compensation signal
e-jθML, thereby removing the amount of phase change of
the estimated CIR.

[0410] The CIR having its phase change compensated, as described above,
passes through a first cleaner (or pre-CIR cleaner) 3113 or bypasses the
first cleaner 3113, thereby being inputted to a CIR calculator (or CIR
interpolator-extrapolator) 3114. The CIR interpolator-extrapolator 3114
either interpolates or extrapolates an estimated CIR, which is then
outputted to a second cleaner (or post-CIR cleaner) 3115. Herein, the
estimated CIR corresponds to a CIR having its phase change compensated.
The first cleaner 3113 may or may not operate depending upon whether the
CIR interpolator-extrapolator 3114 interpolates or extrapolates the
estimated CIR. For example, if the CIR interpolator-extrapolator 3114
interpolates the estimated CIR, the first cleaner 3113 does not operate.
Conversely, if the CIR interpolator-extrapolator 3114 extrapolates the
estimated CIR, the first cleaner 3113 operates.

[0411] More specifically, the CIR estimated from the known data includes a
channel element that is to be obtained as well as a jitter element caused
by noise. Since such jitter element deteriorates the performance of the
equalizer, it preferable that a coefficient calculator 3122 removes the
jitter element before using the estimated CIR. Therefore, according to
the embodiment of the present invention, each of the first and second
cleaners 3113 and 3115 removes a portion of the estimated CIR having a
power level lower than the predetermined threshold value (i.e., so that
the estimated CIR becomes equal to `0`). Herein, this removal process
will be referred to as a "CIR cleaning" process.

[0412] The CIR interpolator-extrapolator 3114 performs CIR interpolation
by multiplying a CIR estimated from the CIR estimator 3112 by a
coefficient and by multiplying a CIR having its phase change compensated
from the phase compensator (or maximum likelihood phase compensator) 3112
by another coefficient, thereby adding the multiplied values. At this
point, some of the noise elements of the CIR may be added to one another,
thereby being cancelled. Therefore, when the CIR
interpolator-extrapolator 3114 performs CIR interpolation, the original
(or initial) CIR having noise elements remaining therein. In other words,
when the CIR interpolator-extrapolator 3114 performs CIR interpolation,
an estimated CIR having its phase change compensated by the phase
compensator 3112 bypasses the first cleaner 3113 and is inputted to the
CIR interpolator-extrapolator 3114. Subsequently, the second cleaner 3115
cleans the CIR interpolated by the CIR interpolator-extrapolator 3114.

[0413] Conversely, the CIR interpolator-extrapolator 3114 performs CIR
extrapolation by using a difference value between two CIRs, each having
its phase change compensated by the phase compensator 3112, so as to
estimate a CIR positioned outside of the two CIRs. Therefore, in this
case, the noise element is rather amplified. Accordingly, when the CIR
interpolator-extrapolator 3114 performs CIR extrapolation, the CIR
cleaned by the first cleaner 3113 is used. More specifically, when the
CIR interpolator-extrapolator 3114 performs CIR extrapolation, the
extrapolated CIR passes through the second cleaner 3115, thereby being
inputted to the zero-padding unit 3116.

[0414] Meanwhile, when a second frequency domain converter (or fast
fourier transform (FFT2)) 3121 converts the CIR, which has been cleaned
and outputted from the second cleaner 3115, to a frequency domain, the
length and of the inputted CIR and the FFT size may not match (or be
identical to one another). In other words, the CIR length may be smaller
than the FFT size. In this case, the zero-padding unit 3116 adds a number
of zeros `0`s corresponding to the difference between the FFT size and
the CIR length to the inputted CIR, thereby outputting the processed CIR
to the second frequency domain converter (FFT2) 3121. Herein, the
zero-padded CIR may correspond to one of the interpolated CIR,
extrapolated CIR, and the CIR estimated in the known data section.

[0415] The second frequency domain converter 3121 performs FFT on the CIR
being outputted from the zero padding unit 3116, thereby converting the
CIR to a frequency domain CIR. Then, the second frequency domain
converter 3121 outputs the converted CIR to the coefficient calculator
3122.

[0416] The coefficient calculator 3122 uses the frequency domain CIR being
outputted from the second frequency domain converter 3121 to calculate
the equalization coefficient. Then, the coefficient calculator 3122
outputs the calculated coefficient to the distortion compensator 3130.
Herein, for example, the coefficient calculator 3122 calculates a channel
equalization coefficient of the frequency domain that can provide minimum
mean square error (MMSE) from the CIR of the frequency domain, which is
outputted to the distortion compensator 3130.

[0417] The distortion compensator 3130 performs a complex number
multiplication on the overlapped data of the frequency domain being
outputted from the FFT unit 3102 of the first frequency domain converter
3100 and the equalization coefficient calculated by the coefficient
calculator 3122, thereby compensating the channel distortion of the
overlapped data being outputted from the FFT unit 3102.

[0418] FIG. 53 illustrates a block diagram of a channel equalizer
according to another embodiment of the present invention. In other words,
FIG. 53 illustrates a block diagram showing another example of a channel
equalizer by using different CIR estimation and application methods in
accordance with regions A, B, C, and D, when the data group is divided
into the structure shown in FIG. 5.

[0419] More specifically, as shown in FIG. 5, known data that are
sufficiently are being periodically transmitted in regions A/B (i.e., MPH
blocks B3 to B8). Therefore, an indirect equalizing method using the CIR
may be used herein. However, in regions C/D (i.e., MPH blocks B1, B2, B9,
and B10), the known data are neither able to be transmitted at a
sufficiently long length nor able to be periodically and equally
transmitted. Therefore, it is inadequate to estimate the CIR by using the
known data. Accordingly, in regions C/D, a direct equalizing method in
which an error is obtained from the output of the equalizer, so as to
update the coefficient.

[0420] The examples presented in the embodiments of the present invention
shown in FIG. 53 include a method of performing indirect channel
equalization by using a cyclic prefix on the data of regions A/B, and a
method of performing direct channel equalization by using an overlap &
save method on the data of regions C/D.

[0421] Accordingly, referring to FIG. 53, the frequency domain channel
equalizer includes a frequency domain converter 3510, a distortion
compensator 3520, a time domain converter 3530, a first coefficient
calculating unit 3540, a second coefficient calculating unit 3550, and a
coefficient selector 3560.

[0422] Herein, the frequency domain converter 3510 includes an overlap
unit 3511, a select unit 3512, and a first FFT unit 3513.

[0423] The time domain converter 3530 includes an IFFT unit 3531, a save
unit 3532, and a select unit 3533.

[0424] The first coefficient calculating unit 3540 includes a CIR
estimator 3541, an average calculator 3542, and second FFT unit 3543, and
a coefficient calculator 3544.

[0425] The second coefficient calculating unit 3550 includes a decision
unit 3551, a select unit 3552, a subtractor 3553, a zero-padding unit
3554, a third FFT unit 3555, a coefficient updater 3556, and a delay unit
3557.

[0426] Also, a multiplexer (MUX), which selects data that are currently
being inputted as the input data depending upon whether the data
correspond to regions A/B or to regions C/D, may be used as the select
unit 3512 of the frequency domain converter 3510, the select unit 3533 of
the time domain converter 3530, and the coefficient selector 3560.

[0427] In the channel equalizer having the above-described structure, as
shown in FIG. 53, if the data being inputted correspond to the data of
regions A/B, the select unit 3512 of the frequency domain converter 3510
selects the input data and not the output data of the overlap unit 3511.
In the same case, the select unit 3533 of the time domain converter 3530
selects the output data of the IFFT unit 3531 and not the output data of
the save unit 3532. The coefficient selector 3560 selects the
equalization coefficient being outputted from the first coefficient
calculating unit 3540.

[0428] Conversely, if the data being inputted correspond to the data of
regions C/D, the select unit 3512 of the frequency domain converter 3510
selects the output data of the overlap unit 3511 and not the input data.
In the same case, the select unit 3533 of the time domain converter 3530
selects the output data of the save unit 3532 and not the output data of
the IFFT unit 3531. The coefficient selector 3560 selects the
equalization coefficient being outputted from the second coefficient
calculating unit 3550.

[0429] More specifically, the received data are inputted to the overlap
unit 3511 and select unit 3512 of the frequency domain converter 3510,
and to the first coefficient calculating unit 3540. If the inputted data
correspond to the data of regions A/B, the select unit 3512 selects the
received data, which are then outputted to the first FFT unit 3513. On
the other hand, if the inputted data correspond to the data of regions
C/D, the select unit 3512 selects the data that are overlapped by the
overlap unit 3513 and are, then, outputted to the first FFT unit 3513.
The first FFT unit 3513 performs FFT on the time domain data that are
outputted from the select unit 3512, thereby converting the time domain
data to frequency domain data. Then, the converted data are outputted to
the distortion compensator 3520 and the delay unit 3557 of the second
coefficient calculating unit 3550.

[0430] The distortion compensator 3520 performs complex multiplication on
frequency domain data outputted from the first FFT unit 3513 and the
equalization coefficient outputted from the coefficient selector 3560,
thereby compensating the channel distortion detected in the data that are
being outputted from the first FFT unit 3513.

[0431] Thereafter, the distortion-compensated data are outputted to the
IFFT unit 3531 of the time domain converter 3530. The IFFT unit 3531 of
the time domain converter 3530 performs IFFT on the
channel-distortion-compensated data, thereby converting the compensated
data to time domain data. The converted data are then outputted to the
save unit 3532 and the select unit 3533. If the inputted data correspond
to the data of regions A/B, the select unit 3533 selects the output data
of the IFFT unit 3531. On the other hand, if the inputted data correspond
to regions C/D, the select unit 3533 selects the valid data extracted
from the save unit 3532. Thereafter, the selected data are outputted to
be decoded and, simultaneously, outputted to the second coefficient
calculating unit 3550.

[0432] The CIR estimator 3541 of the first coefficient calculating unit
3540 uses the data being received during the known data section and the
known data of the known data section, the known data being already known
by the receiving system in accordance with an agreement between the
receiving system and the transmitting system, in order to estimate the
CIR. Subsequently, the estimated CIR is outputted to the average
calculator 3542. The average calculator 3542 calculates an average value
of the CIRs that are being inputted consecutively. Then, the calculated
average value is outputted to the second FFT unit 3543. For example,
referring to FIG. 37, the average value of the CIR value estimated at
point T1 and the CIR value estimated at point T2 is used for the channel
equalization process of the general data existing between point T1 and
point T2. Accordingly, the calculated average value is outputted to the
second FFT unit 3543.

[0433] The second FFT unit 3543 performs FFT on the CIR of the time domain
that is being inputted, so as to convert the inputted CIR to a frequency
domain CIR. Thereafter, the converted frequency domain CIR is outputted
to the coefficient calculator 3544. The coefficient calculator 3544
calculates a frequency domain equalization coefficient that satisfies the
condition of using the CIR of the frequency domain so as to minimize the
mean square error. The calculated equalizer coefficient of the frequency
domain is then outputted to the coefficient calculator 3560.

[0434] The decision unit 3551 of the second coefficient calculating unit
3550 selects one of a plurality of decision values (e.g., 8 decision
values) that is most approximate to the equalized data and outputs the
selected decision value to the select unit 3552. Herein, a multiplexer
may be used as the select unit 3552. In a general data section, the
select unit 3552 selects the decision value of the decision unit 3551.
Alternatively, in a known data section, the select unit 3552 selects the
known data and outputs the selected known data to the subtractor 3553.
The subtractor 3553 subtracts the output of the select unit 3533 included
in the time domain converter 3530 from the output of the select unit 652
so as to calculate (or obtain) an error value. Thereafter, the calculated
error value is outputted to the zero-padding unit 3554.

[0435] The zero-padding unit 3554 adds (or inserts) the same amount of
zeros (0) corresponding to the overlapped amount of the received data in
the inputted error. Then, the error extended with zeros (0) is outputted
to the third FFT unit 3555. The third FFT unit 3555 converts the error of
the time domain having zeros (0) added (or inserted) therein, to the
error of the frequency domain. Thereafter, the converted error is
outputted to the coefficient update unit 3556. The coefficient update
unit 3556 uses the received data of the frequency domain that have been
delayed by the delay unit 3557 and the error of the frequency domain so
as to update the previous equalization coefficient. Thereafter, the
updated equalization coefficient is outputted to the coefficient selector
3560.

[0436] At this point, the updated equalization coefficient is stored so as
that it can be used as a previous equalization coefficient in a later
process. If the input data correspond to the data of regions A/B, the
coefficient selector 3560 selects the equalization coefficient calculated
from the first coefficient calculating unit 3540. On the other hand, if
the input data correspond to the data of regions C/D, the coefficient
selector 3560 selects the equalization coefficient updated by the second
coefficient calculating unit 3550. Thereafter, the selected equalization
coefficient is outputted to the distortion compensator 3520.

[0437] FIG. 54 illustrates a block diagram of a channel equalizer
according to another embodiment of the present invention. In other words,
FIG. 54 illustrates a block diagram showing another example of a channel
equalizer by using different CIR estimation and application methods in
accordance with regions A, B, C, and D, when the data group is divided
into the structure shown in FIG. 5. In this example, a method of
performing indirect channel equalization by using an overlap & save
method on the data of regions A/B, and a method of performing direct
channel equalization by using an overlap & save method on the data of
regions C/D are illustrated.

[0438] Accordingly, referring to FIG. 54, the frequency domain channel
equalizer includes a frequency domain converter 3610, a distortion
compensator 3620, a time domain converter 3630, a first coefficient
calculating unit 3640, a second coefficient calculating unit 3650, and a
coefficient selector 3660.

[0439] Herein, the frequency domain converter 3610 includes an overlap
unit 3611 and a first FFT unit 3612.

[0440] The time domain converter 3630 includes an IFFT unit 3631 and a
save unit 3632.

[0441] The first coefficient calculating unit 3640 includes a CIR
estimator 3641, an interpolator 3642, a second FFT unit 3643, and a
coefficient calculator 3644.

[0442] The second coefficient calculating unit 3650 includes a decision
unit 3651, a select unit 3652, a subtractor 3653, a zero-padding unit
3654, a third FFT unit 3655, a coefficient updater 3656, and a delay unit
3657.

[0443] Also, a multiplexer (MUX), which selects data that are currently
being inputted as the input data depending upon whether the data
correspond to regions A/B or to regions C/D, may be used as the
coefficient selector 3660. More specifically, if the input data
correspond to the data of regions A/B, the coefficient selector 3660
selects the equalization coefficient calculated from the first
coefficient calculating unit 3640. On the other hand, if the input data
correspond to the data of regions C/D, the coefficient selector 3660
selects the equalization coefficient updated by the second coefficient
calculating unit 3650.

[0444] In the channel equalizer having the above-described structure, as
shown in FIG. 54, the received data are inputted to the overlap unit 3611
of the frequency domain converter 3610 and to the first coefficient
calculating unit 3640. The overlap unit 3611 overlaps the input data to a
pre-determined overlapping ratio and outputs the overlapped data to the
first FFT unit 3612. The first FFT unit 3612 performs FFT on the
overlapped time domain data, thereby converting the overlapped time
domain data to overlapped frequency domain data. Then, the converted data
are outputted to the distortion compensator 3620 and the delay unit 3657
of the second coefficient calculating unit 3650.

[0445] The distortion compensator 3620 performs complex multiplication on
the overlapped frequency domain data outputted from the first FFT unit
3612 and the equalization coefficient outputted from the coefficient
selector 3660, thereby compensating the channel distortion detected in
the overlapped data that are being outputted from the first FFT unit
3612. Thereafter, the distortion-compensated data are outputted to the
IFFT unit 3631 of the time domain converter 3630. The IFFT unit 3631 of
the time domain converter 3630 performs IFFT on the
distortion-compensated data, thereby converting the compensated data to
overlapped time domain data. The converted overlapped data are then
outputted to the save unit 3632. The save unit 3632 extracts only the
valid data from the overlapped time domain data, which are then outputted
for data decoding and, at the same time, outputted to the second
coefficient calculating unit 3650 in order to update the coefficient.

[0446] The CIR estimator 3641 of the first coefficient calculating unit
3640 uses the data received during the known data section and the known
data in order to estimate the CIR. Subsequently, the estimated CIR is
outputted to the interpolator 3642. The interpolator 3642 uses the
inputted CIR to estimate the CIRs (i.e., CIRs of the region that does not
include the known data) corresponding to the points located between the
estimated CIRs according to a predetermined interpolation method.
Thereafter, the estimated result is outputted to the second FFT unit
3643. The second FFT unit 3643 performs FFT on the inputted CIR, so as to
convert the inputted CIR to a frequency domain CIR. Thereafter, the
converted frequency domain CIR is outputted to the coefficient calculator
3644. The coefficient calculator 3644 calculates a frequency domain
equalization coefficient that satisfies the condition of using the CIR of
the frequency domain so as to minimize the mean square error. The
calculated equalizer coefficient of the frequency domain is then
outputted to the coefficient calculator 3660.

[0447] The structure and operations of the second coefficient calculating
unit 3650 is identical to those of the second coefficient calculating
unit 3550 shown in FIG. 53. Therefore, the description of the same will
be omitted for simplicity.

[0448] If the input data correspond to the data of regions A/B, the
coefficient selector 3660 selects the equalization coefficient calculated
from the first coefficient calculating unit 3640. On the other hand, if
the input data correspond to the data of regions C/D, the coefficient
selector 3660 selects the equalization coefficient updated by the second
coefficient calculating unit 3650. Thereafter, the selected equalization
coefficient is outputted to the distortion compensator 3620.

[0449] FIG. 55 illustrates a block diagram of a channel equalizer
according to another embodiment of the present invention. In other words,
FIG. 55 illustrates a block diagram showing another example of a channel
equalizer by using different CIR estimation and application methods in
accordance with regions A, B, C, and D, when the data group is divided
into the structure shown in FIG. 5. For example, in regions A/B, the
present invention uses the known data in order to estimate the CIR by
using a least square (LS) method, thereby performing the channel
equalization process. On the other hand, in regions C/D, the present
invention estimates the CIR by using a least mean square (LMS) method,
thereby performing the channel equalization process. More specifically,
since the periodic known data do not exist in regions C/D, as in regions
A/B, the same channel equalization process as that of regions A/B cannot
be performed in regions C/D. Therefore, the channel equalization process
may only be performed by using the LMS method.

[0450] Referring to FIG. 55, the channel equalizer includes an overlap
unit 3701, a first fast fourier transform (FFT) unit 3702, a distortion
compensator 3703, an inverse fast fourier transform (IFFT) unit 3704, a
save unit 3705, a first CIR estimator 3706, a CIR interpolator 3707, a
decision unit 3708, a second CIR estimator 3710, a selection unit 3711, a
second FFT unit 3712, and a coefficient calculator 3713. Herein, any
device performed complex number multiplication may be used as the
distortion compensator 3703. In the channel equalizer having the
above-described structure, as shown in FIG. 55, the overlap unit 3701
overlaps the data being inputted to the channel equalizer to a
predetermined overlapping ratio and then outputs the overlapped data to
the first FFT unit 3702. The first FFT unit 3702 converts (or transforms)
the overlapped data of the time domain to overlapped data of the
frequency domain by using fast fourier transform (FFT). Then, the
converted data are outputted to the distortion compensator 3703.

[0451] The distortion converter 3703 performs complex multiplication on
the equalization coefficient calculated from the coefficient calculator
3713 and the overlapped data of the frequency domain, thereby
compensating the channel distortion of the overlapped data being
outputted from the first FFT unit 3702. Thereafter, the
distortion-compensated data are outputted to the IFFT unit 3704. The IFFT
unit 3704 performs inverse fast fourier transform (IFFT) on the
distortion-compensated overlapped data, so as to convert the
corresponding data back to data (i.e., overlapped data) of the time
domain. Subsequently, the converted data are outputted to the save unit
3705. The save unit 3705 extracts only the valid data from the overlapped
data of the time domain. Then, the save unit 3705 outputs the extracted
valid data for a data decoding process and, at the same time, outputs the
extracted valid data to the decision unit 3708 for a channel estimation
process.

[0452] The decision unit 3708 selects one of a plurality of decision
values (e.g., 8 decision values) that is most approximate to the
equalized data and outputs the selected decision value to the select unit
3709. Herein, a multiplexer may be used as the select unit 3709. In a
general data section, the select unit 3709 selects the decision value of
the decision unit 3708. Alternatively, in a known data section, the
select unit 3709 selects the known data and outputs the selected known
data to the second CIR estimator 3710.

[0453] Meanwhile, the first CIR estimator 3706 uses the data that are
being inputted in the known data section and the known data so as to
estimate the CIR.

[0454] Thereafter, the first CIR estimator 3706 outputs the estimated CIR
to the CIR interpolator 3707. Herein, the known data correspond to
reference known data created during the known data section by the
receiving system in accordance to an agreement between the transmitting
system and the receiving system. At this point, according to an
embodiment of the present invention, the first CIR estimator 3706 uses
the LS method to estimate the CIR. The LS estimation method calculates a
cross correlation value p between the known data that have passed through
the channel during the known data section and the known data that are
already known by the receiving end. Then, a cross correlation matrix R of
the known data is calculated. Subsequently, a matrix operation is
performed on R-1p so that the cross correlation portion within the
cross correlation value p between the received data and the initial known
data, thereby estimating the CIR of the transmission channel.

[0455] The CIR interpolator 3707 receives the CIR from the first CIR
estimator 3706. And, in the section between two sets of known data, the
CIR is interpolated in accordance with a pre-determined interpolation
method. Then, the interpolated CIR is outputted. At this point, the
pre-determined interpolation method corresponds to a method of estimating
a particular set of data at an unknown point by using a set of data known
by a particular function. For example, such method includes a linear
interpolation method. The linear interpolation method is only one of the
most simple interpolation methods. A variety of other interpolation
methods may be used instead of the above-described linear interpolation
method. It is apparent that the present invention is not limited only to
the example set forth in the description of the present invention. More
specifically, the CIR interpolator 3707 uses the CIR that is being
inputted in order to estimate the CIR of the section that does not
include any known data by using the pre-determined interpolation method.
Thereafter, the estimated CIR is outputted to the select unit 3711.

[0456] The second CIR estimator 3710 uses the input data of the channel
equalizer and the output data of the select unit 3709 in order to
estimate the CIR. Then, the second CIR estimator 3710 outputs the
estimated CIR to the select unit 3711. At this point, according to an
embodiment of the present invention, the CIR is estimated by using the
LMS method. The LMS estimation method will be described in detail in a
later process.

[0458] The second FFT unit 3712 converts the CIR that is being inputted to
a CIR of the frequency domain, which is then outputted to the coefficient
calculator 3713. The coefficient calculator 3713 uses the CIR of the
frequency domain that is being inputted, so as to calculate the
equalization coefficient and to output the calculated equalization
coefficient to the distortion compensator 3703. At this point, the
coefficient calculator 3713 calculates a channel equalization coefficient
of the frequency domain that can provide minimum mean square error (MMSE)
from the CIR of the frequency domain. At this point, the second CIR
estimator 3710 may use the CIR estimated in regions A/B as the CIR at the
beginning of regions C/D. For example, the CIR value of MPH block B8 may
be used as the CIR value at the beginning of the MPH block B9.
Accordingly, the convergence speed of regions C/D may be reduced.

[0459] The basic principle of estimating the CIR by using the LMS method
in the second CIR estimator 3710 corresponds to receiving the output of
an unknown transmission channel and to updating (or renewing) the
coefficient of an adaptive filter (not shown) so that the difference
value between the output value of the unknown channel and the output
value of the adaptive filter is minimized. More specifically, the
coefficient value of the adaptive filter is renewed so that the input
data of the channel equalizer is equal to the output value of the
adaptive filter (not shown) included in the second CIR estimator 3710.
Thereafter, the filter coefficient is outputted as the CIR after each FFT
cycle.

[0460] Referring to FIG. 56, the second CIR estimator 3710 includes a
delay unit T, a multiplier, and a coefficient renewal unit for each tab.
Herein, the delay unit T sequentially delays the output data {circumflex
over (x)}(n) of the select unit 3709. The multiplier multiplies
respective output data outputted from each delay unit T with error data
e(n). The coefficient renewal unit renews the coefficient by using the
output corresponding to each multiplier. Herein, the multipliers that are
being provided as many as the number of tabs will be referred to as a
first multiplying unit for simplicity. Furthermore, the second CIR
estimator 3710 further includes a plurality of multipliers each
multiplying the output data of the select unit 3709 and the output data
of the delay unit T (wherein the output data of the last delay unit are
excluded) with the output data corresponding to each respective
coefficient renewal unit. These multipliers are also provided as many as
the number of tabs. This group of multipliers will be referred to as a
second multiplying unit for simplicity.

[0461] The second CIR estimator 3710 further includes an adder and a
subtractor. Herein, the adder adds all of the data outputted from each
multipliers included in the second multiplier unit. Then, the added value
is outputted as the estimation value y(n) of the data inputted to the
channel equalizer. The subtractor calculates the difference between the
output data y(n) of the adder and the input data y(n) of the channel
equalizer. Thereafter, the calculated difference value is outputted as
the error data e(n). Referring to FIG. 56, in a general data section, the
decision value of the equalized data is inputted to the first delay unit
included in the second CIR estimator 3710 and to the first multiplier
included in the second multiplier. In the known data section, the known
data are inputted to the first delay unit included in the second CIR
estimator 3710 and to the first multiplier included in the second
multiplier unit. The input data {circumflex over (x)}(n) are sequentially
delayed by passing through a number of serially connected delay units T,
the number corresponding to the number of tabs. The output data of each
delay unit T and the error data e(n) are multiplied by each corresponding
multiplier included in the first multiplier unit. Thereafter, the
coefficients are renewed by each respective coefficient renewal unit.

[0462] Each coefficient that is renewed by the corresponding coefficient
renewal unit is multiplied with the input data the output data
{circumflex over (x)}(n) and also with the output data of each delay unit
T with the exception of the last delay. Thereafter, the multiplied value
is inputted to the adder. The adder then adds all of the output data
outputted from the second multiplier unit and outputs the added value to
the subtractor as the estimation value y(n) of the input data of the
channel equalizer. The subtractor calculates a difference value between
the estimation value y(n) and the input data y(n) of the channel
equalizer. The difference value is then outputted to each multiplier of
the first multiplier unit as the error data e(n). At this point, the
error data e(n) is outputted to each multiplier of the first multiplier
unit by passing through each respective delay unit T. As described above,
the coefficient of the adaptive filter is continuously renewed. And, the
output of each coefficient renewal unit is outputted as the CIR of the
second CIR estimator 3710 after each FFT cycle.

Block Decoder

[0463] Meanwhile, if the data being inputted to the block decoder 1005,
after being channel-equalized by the equalizer 1003, correspond to the
data having both block encoding and trellis encoding performed thereon
(i.e., the data within the RS frame, the signaling information data,
etc.) by the transmitting system, trellis decoding and block decoding
processes are performed on the inputted data as inverse processes of the
transmitting system. Alternatively, if the data being inputted to the
block decoder 1005 correspond to the data having only trellis encoding
performed thereon (i.e., the main service data), and not the block
encoding, only the trellis decoding process is performed on the inputted
data as the inverse process of the transmitting system.

[0464] The trellis decoded and block decoded data by the block decoder
1005 are then outputted to the RS frame decoder 1006. More specifically,
the block decoder 1005 removes the known data, data used for trellis
initialization, and signaling information data, MPEG header, which have
been inserted in the data group, and the RS parity data, which have been
added by the RS encoder/non-systematic RS encoder or non-systematic RS
encoder of the transmitting system. Then, the block decoder 1005 outputs
the processed data to the RS frame decoder 1006. Herein, the removal of
the data may be performed before the block decoding process, or may be
performed during or after the block decoding process.

[0465] Meanwhile, the data trellis-decoded by the block decoder 1005 are
outputted to the data deinterleaver 1009. At this point, the data being
trellis-decoded by the block decoder 1005 and outputted to the data
deinterleaver 1009 may not only include the main service data but may
also include the data within the RS frame and the signaling information.
Furthermore, the RS parity data that are added by the transmitting system
after the pre-processor 230 may also be included in the data being
outputted to the data deinterleaver 1009.

[0466] According to another embodiment of the present invention, data that
are not processed with block decoding and only processed with trellis
encoding by the transmitting system may directly bypass the block decoder
1005 so as to be outputted to the data deinterleaver 1009. In this case,
a trellis decoder should be provided before the data deinterleaver 1009.
More specifically, if the inputted data correspond to the data having
only trellis encoding performed thereon and not block encoding, the block
decoder 1005 performs Viterbi (or trellis) decoding on the inputted data
so as to output a hard decision value or to perform a hard-decision on a
soft decision value, thereby outputting the result.

[0467] Meanwhile, if the inputted data correspond to the data having both
block encoding process and trellis encoding process performed thereon,
the block decoder 1005 outputs a soft decision value with respect to the
inputted data.

[0468] In other words, if the inputted data correspond to data being
processed with block encoding by the block processor 302 and being
processed with trellis encoding by the trellis encoding module 256, in
the transmitting system, the block decoder 1005 performs a decoding
process and a trellis decoding process on the inputted data as inverse
processes of the transmitting system. At this point, the RS frame encoder
of the pre-processor included in the transmitting system may be viewed as
an outer (or external) encoder. And, the trellis encoder may be viewed as
an inner (or internal) encoder. When decoding such concatenated codes, in
order to allow the block decoder 1005 to maximize its performance of
decoding externally encoded data, the decoder of the internal code should
output a soft decision value.

[0469] FIG. 57 illustrates a detailed block view of the block decoder 1005
according to an embodiment of the present invention. Referring to FIG.
57, the block decoder 1005 includes a feedback controller 4010, an input
buffer 4011, a trellis decoding unit (or 12-way trellis coded modulation
(TCM) decoder or inner decoder) 4012, a symbol-byte converter 4013, an
outer block extractor 4014, a feedback deformatter 4015, a symbol
deinterleaver 4016, an outer symbol mapper 4017, a symbol decoder 4018,
an inner symbol mapper 4019, a symbol interleaver 4020, a feedback
formatter 4021, and an output buffer 4022. Herein, just as in the
transmitting system, the trellis decoding unit 4012 may be viewed as an
inner (or internal) decoder. And, the symbol decoder 4018 may be viewed
as an outer (or external) decoder.

[0470] The input buffer 4011 temporarily stores the mobile service data
symbols being channel-equalized and outputted from the equalizer 1003.
(Herein, the mobile service data symbols may include symbols
corresponding to the signaling information, RS parity data symbols and
CRC data symbols added during the encoding process of the RS frame.)
Thereafter, the input buffer 4011 repeatedly outputs the stored symbols
for M number of times to the trellis decoding unit 4012 in a turbo block
(TEL) size required for the turbo decoding process. Herein, the size of
the input buffer 4011 is larger than or equal to the size of the turbo
block (TBL) required for turbo decoding. The turbo block (TBL) size is
larger than or equal to the block length (BK) of the symbol interleaver
within the block processor. More specifically, there are no limitations
for input data configured only of symbols that are not processed with
block encoding, since such input data bypass the inputted buffer 4011.

[0471] Conversely, the input data including symbols processed with block
encoding are stored in the input buffer 4011. At this point, the input
data should include a number of symbols being inputted to the symbol
interleaver, wherein the number of symbols is equivalent to the block
length (K). Therefore, in this case, the length of the TBL is larger than
or equal to BK. Also, M represents a number of repetitions of the turbo
decoding process, the number being predetermined by the feedback
controller 4010. More specifically, the input buffer 4011 stores mobile
service data symbols corresponding to the block size TBL for the block
decoding process. Herein, the mobile service data symbols corresponding
to the block size TBL required for the block decoding process are
repeatedly outputted to the trellis decoding unit 4012 as many times as
the number of cycle periods during the turbo decoding process.

[0472] Furthermore, if a symbol being channel-equalized and outputted from
the equalizer 1003 does not correspond to a mobile service data symbol
(wherein the mobile service data symbol includes symbols corresponding to
the signaling information, RS parity data symbols that are added during
the encoding process of the RS frame, and CRC data symbols), the input
buffer 4011 does not store nor repeatedly output the corresponding symbol
and directly outputs the symbol to the trellis decoding unit 4012 without
modification. Herein, the storage, repetition, and output of the input
buffer 4011 are controlled by the feedback controller 4010.

[0473] The trellis decoding unit 4012 includes a 12-way trellis encoder,
shown in FIG. 22, and a 12-way TCM decoder. Herein, the trellis decoding
unit 4012 performs 12-way trellis decoding as inverse processes of the
12-way trellis encoder. More specifically, the trellis decoding unit 4012
receives a number of output symbols of the input buffer 4011 and
soft-decision values of the feedback formatter 4021 equivalent to each
TBL, so as to perform the TCM decoding process. At this point, based upon
the control of the feedback controller 4010, the soft-decision values
outputted from the feedback formatter 4021 are matched with a number of
mobile service data symbol places so as to be in a one-to-one (1:1)
correspondence. Herein, the number of mobile service data symbol places
is equivalent to the TBL being outputted from the input buffer 4011.

[0474] More specifically, the mobile service data being outputted from the
input buffer 4011 are matched with the turbo decoded data being inputted,
so that each respective data place can correspond with one another.
Thereafter, the matched data are outputted to the trellis decoding unit
4012. For example, if the turbo decoded data correspond to the third
symbol within the turbo block, the corresponding symbol (or data) is
matched with the third symbol included in the turbo block, which is
outputted from the input buffer 4011. Subsequently, the matched symbol
(or data) is outputted to the trellis decoding unit 4012.

[0475] In order to do so, while the regressive turbo decoding is in
process, the feedback controller 4010 controls the input buffer 4011 so
that the input buffer 4011 stores the corresponding turbo block data.
Also, by delaying data (or symbols), the soft decision value (e.g., LLR)
of the symbol outputted from the symbol interleaver 4020 and the symbol
of the input buffer 4011 corresponding to the same place (or position)
within the block of the output symbol are matched with one another to be
in a one-to-one correspondence. Thereafter, the matched symbols are
controlled so that they can be inputted to the TCM decoder through the
respective path. This process is repeated for a predetermined number of
turbo decoding cycle periods. Then, the data of the next turbo block are
outputted from the input buffer 4011, thereby repeating the turbo
decoding process.

[0476] The output of the trellis decoding unit 4012 signifies a degree of
reliability of the transmission bits configuring each symbol. For
example, in the transmitting system, since the input data of the trellis
encoding module correspond to two bits as one symbol, a log likelihood
ratio (LLR) between the likelihood of a bit having the value of `1` and
the likelihood of the bit having the value of `0` may be respectively
outputted (in bit units) to the upper bit and the lower bit. Herein, the
log likelihood ratio corresponds to a log value for the ratio between the
likelihood of a bit having the value of `1` and the likelihood of the bit
having the value of `0`. Alternatively, a LLR for the likelihood of 2
bits (i.e., one symbol) being equal to "00", "01", "10", and "11" may be
respectively outputted (in symbol units) to all 4 combinations of bits
(i.e., 00, 01, 10, 11). Consequently, this becomes the soft decision
value that indicates the degree of reliability of the transmission bits
configuring each symbol. A maximum a posteriori probability (MAP) or a
soft-out Viterbi algorithm (SOVA) may be used as a decoding algorithm of
each TCM decoder within the trellis decoding unit 4012.

[0477] The output of the trellis decoding unit 4012 is inputted to the
symbol-byte converter 4013 and the outer block extractor 4014. The
symbol-byte converter 4013 performs a hard-decision process of the soft
decision value that is trellis decoded and outputted from the trellis
decoding unit 4012. Thereafter, the symbol-byte converter 4013 groups 4
symbols into byte units, which are then outputted to the data
deinterleaver 1009. More specifically, the symbol-byte converter 4013
performs hard-decision in bit units on the soft decision value of the
symbol outputted from the trellis decoding unit 4012. Therefore, the data
processed with hard-decision and outputted in bit units from the
symbol-byte converter 4013 not only include main service data, but may
also include mobile service data, known data, RS parity data, and MPEG
headers.

[0478] Among the soft decision values of the trellis decoding unit 4012,
the outer block extractor 4014 identifies the soft decision values
corresponding to the mobile service data symbols (wherein symbols
corresponding to signaling information, RS parity data symbols that are
added during the encoding of the RS frame, and CRC data symbols are
included) and outputs the identified soft decision values to the feedback
deformatter 4015. The feedback deformatter 4015 changes the processing
order of the soft decision values corresponding to the mobile service
data symbols. This is an inverse process of an initial change in the
processing order of the mobile service data symbols, which are generated
during an intermediate step, wherein the output symbols outputted from
the block processor 303 of the transmitting system are being inputted to
the trellis encoding module (e.g., when the symbols pass through the
group formatter, the data deinterleaver, the packet formatter, the RS
encoder, and the data interleaver). Thereafter, the feedback deformatter
4015 outputs the processed mobile service data symbols to the symbol
deinterleaver 4016.

[0479] The symbol deinterleaver 4016 performs deinterleaving on the mobile
service data symbols having their processing orders changed and outputted
from the feedback deformatter 4015, as an inverse process of the symbol
interleaving process of the symbol interleaver 403 included in the
transmitting system. The size of the block used by the symbol
deinterleaver 4016 during the deinterleaving process is identical to
interleaving size of an actual symbol (i.e., BK) of the symbol
interleaver, shown in FIG. 19, which is included in the transmitting
system. This is because the turbo decoding process is performed between
the trellis decoding unit 4012 and the symbol decoder 4018. Both the
input and output of the symbol deinterleaver 4016 correspond to soft
decision values, and the deinterleaved soft decision values are outputted
to the outer symbol mapper 4017.

[0480] The operations of the outer symbol mapper 4017 may vary depending
upon the structure and coding rate of the symbol encoder 402 included in
the transmitting system. For example, when data are 1/2-rate encoded by
the symbol encoder 402 and then transmitted, the outer symbol mapper 4017
directly outputs the input data without modification. In another example,
when data are 1/4-rate encoded by the symbol encoder 402 and then
transmitted, the outer symbol mapper 4017 converts the input data so that
it can match the input data format of the symbol decoder 4018. Then, the
outer symbol mapper 4017 outputs the converted data to the symbol decoder
4018.

[0481] The symbol decoder 4018 (i.e., the outer decoder) receives the data
outputted from the outer symbol mapper 4017 and performs symbol decoding
as an inverse process of the symbol encoder 402 included in the
transmitting system. At this point, two different soft decision values
are outputted from the symbol decoder 4018. One of the outputted soft
decision values corresponds to a soft decision value matching the output
symbol of the symbol encoder 402 (hereinafter referred to as a "first
decision value"). The other one of the outputted soft decision values
corresponds to a soft decision value matching the input bit of the symbol
encoder 402 (hereinafter referred to as a "second decision value").

[0482] More specifically, the first decision value represents a degree of
reliability the output symbol (i.e., 2 bits) of the symbol encoder 402.
Herein, the first soft decision value may output (in bit units) a LLR
between the likelihood of 1 bit being equal to `1` and the likelihood of
1 bit being equal to `0` with respect to each of the upper bit and lower
bit, which configures a symbol. Alternatively, the first soft decision
value may also output (in symbol units) a LLR for the likelihood of 2
bits being equal to "00", "01", "10", and "11" with respect to all
possible combinations. The first soft decision value is fed-back to the
trellis decoding unit 4012 through the inner symbol mapper 4019, the
symbol interleaver 4020, and the feedback formatter 4021. On the other
hand, the second soft decision value indicates a degree of reliability
the input bit of the symbol encoder 402 included in the transmitting
system. Herein, the second soft decision value is represented as the LLR
between the likelihood of 1 bit being equal to `1` and the likelihood of
1 bit being equal to `0`. Thereafter, the second soft decision value is
outputted to the outer buffer 4022. In this case, a maximum a posteriori
probability (MAP) or a soft-out Viterbi algorithm (SOVA) may be used as
the decoding algorithm of the symbol decoder 4018.

[0483] The first soft decision value that is outputted from the symbol
decoder 4018 is inputted to the inner symbol mapper 4019. The inner
symbol mapper 4019 converts the first soft decision value to a data
format corresponding the input data of the trellis decoding unit 4012.
Thereafter, the inner symbol mapper 4019 outputs the converted soft
decision value to the symbol interleaver 4020. The operations of the
inner symbol mapper 4019 may also vary depending upon the structure and
coding rate of the symbol encoder 402 included in the transmitting
system.

[0484] Hereinafter, when the symbol encoder 402 of the transmitting system
operates as a 1/4 encoder, the operations of the outer symbol mapper 4017
and the inner symbol mapper 4019 will now be described in detail with
reference to FIG. 17A to FIG. 17C. According to an embodiment of the
present invention, it is assumed that the symbol encoder is configured as
shown in FIG. 17A, and that the 1/4 outer encoder 411 encodes one bit U
so as to output 4 bits u0, u1, u2, and u3, and also that the 4 bits
(i.e., 2 symbols) are transmitted twice in symbol units (i.e., each of
the 2 symbols is transmitted twice) through the parallel/serial converter
412. In this case, the symbol that is outputted first is referred to as
an odd-number-designated symbol, and the symbol that is outputted
subsequently is referred to as an even-number-designated symbol for
simplicity.

[0485] At this point, when the input/output units of the outer symbol
mapper 4017 and the inner symbol mapper 4019 corresponds to symbol units,
16 (i.e., 24=16) different soft decision values may be outputted in
symbol units from the outer symbol mapper 4017. For example, among the 16
(i.e., 24=16) different soft decision values that are to be
outputted from the outer symbol mapper 4017, the soft decision value of
s=(1, 0, 0, 1) may be calculated by adding the soft decision value of the
inputted odd-number-designated symbol m0=(1, 0) and the soft
decision value of the inputted even-number-designated symbol m2=(0,
1). Afterwards, the added value is inputted to the symbol decoder 4018.

[0486] Furthermore, a total of 4 (i.e., 22=4) different soft decision
values may be outputted in symbol units from the inner symbol mapper
4019. For example, among the 4 (i.e., 22=4) different soft decision
values that are to be outputted from the inner symbol mapper 4019, the
soft decision value of the odd-number-designated symbol m0=(1, 1)
may be obtained by calculating the largest value among the soft decision
value for each of the output symbols s=(1, 1, X, X) outputted from the
symbol decoder 4018. Afterwards, the added value is inputted to the
symbol decoder 4018. Also, the soft decision value of the
even-number-designated symbol m1=(0, 0) may be obtained by
calculating the largest value among the soft decision value for each of
the output symbols s=(X, X, 0, 0) outputted from the symbol decoder 4018.
Herein, `X` randomly corresponds to one of `1` and `0`. The output of the
inner symbol mapper 4019 is then provided to the symbol interleaver 4020.

[0487] Meanwhile, if the input/output units of the outer symbol mapper
4017 and the inner symbol mapper 4019 correspond to bit units, a total of
4 different soft decision values may be outputted in bit units from the
outer symbol mapper 4017. More specifically, the outer symbol mapper 4017
simultaneously outputs 2 soft decision values of an odd-number-designated
input symbol (i.e., a soft decision value for each of the upper bit and
lower bit configuring the odd-number-designated input symbol) and 2 soft
decision values of an even-number-designated input symbol (i.e., a soft
decision value for each of the upper bit and lower bit configuring the
even-number-designated input symbol) to the symbol decoder 4018. Also,
with respect to the 4 inputs provided by the symbol decoder 4018, the
inner symbol mapper 4019 also identifies 2 soft decision values of an
odd-number-designated output symbol (i.e., a soft decision value for each
of the upper bit and lower bit configuring the odd-number-designated
output symbol of the symbol decoder 4018) and 2 soft decision values of
an even-number-designated output symbol (i.e., a soft decision value for
each of the upper bit and lower bit configuring the
even-number-designated output symbol of the symbol decoder 4018), which
are then outputted to the symbol interleaver 4020.

[0488] In other words, if the symbol encoding process is performed as
shown in FIG. 17A, the LLR for each of the 16 symbols is respectively
received and symbol-decoded. Thereafter, the processed LLR for each of
the 16 symbols may be outputted as the first soft decision value.
Alternatively, the LLR for each of the 4 symbols is respectively received
and symbol-decoded. Thereafter, the processed LLR for each of the 4
symbols may be outputted as the first soft decision value.

[0489] According to another embodiment of the present invention, it is
assumed that the symbol encoder is configured as shown in FIG. 17B, and
that the 1/2 outer encoder 421 encodes one bit U so as to output 2 bits
u0 and u1, and also that the 2 bits (i.e., 1 symbol) is repeated once
through the repeater 422. In this case, the symbol that is outputted
first is referred to as an odd-number-designated symbol, and the symbol
that is outputted subsequently is referred to as an
even-number-designated symbol for simplicity.

[0490] At this point, when the input/output units of the outer symbol
mapper 4017 and the inner symbol mapper 4019 corresponds to symbol units,
4 (i.e., 22=4) different soft decision values may be outputted in
symbol units from the outer symbol mapper 4017. For example, among the 4
(i.e., 22=4) different soft decision values that are to be outputted
in symbol units from the outer symbol mapper 4017, the soft decision
value of s=(1, 0) may be calculated by adding the soft decision value of
the inputted odd-number-designated symbol m0=(1, 0) and the soft
decision value of the inputted even-number-designated symbol m1=(1,
0). Afterwards, the added value is provided to the symbol decoder 4018.
Furthermore, a total of 4 (i.e., 22=4) different soft decision
values is to be outputted from the inner symbol mapper 4019. For example,
among the 4 (i.e., 22=4) different soft decision values, the soft
decision value of the odd-number-designated symbol m0=(1, 1) and the
even-number-designated symbol m1=(1, 1) become the soft decision
value of the input symbol s=(1, 1) of the symbol decoder 4018. This soft
decision value is then outputted to the symbol interleaver 4020.

[0491] Meanwhile, if the input/output units of the outer symbol mapper
4017 and the inner symbol mapper 4019 correspond to bit units, a total of
2 soft decision values (i.e., a soft decision for the upper bit and a
soft decision value for the lower bit) may be outputted in bit units from
the outer symbol mapper 4017. Herein, the soft decision value for the
upper bit may be obtained by adding the soft decision for the upper bit
of the odd-number-designated symbol and the soft decision for the upper
bit of the even-number-designated symbol. Also, the soft decision value
for the lower bit may be obtained by adding the soft decision for the
lower bit of the odd-number-designated symbol and the soft decision for
the lower bit of the even-number-designated symbol.

[0492] The inner symbol mapper 4019 receives the soft decision value for
the upper bit and the soft decision value for the lower bit from the
symbol decoder 4018. Thereafter, the inner symbol mapper 4019 outputs the
received soft decision values as 2 soft decision values corresponding to
each of the odd-number-designated output bits (i.e., a soft decision
value for each of the lower bit and upper bit that are outputted from the
symbol decoder 4018). Then, the 2 soft decision values corresponding to
each of the odd-number-designated output bits are repeated, thereby being
outputted as 2 soft decision values corresponding to each of the
even-number-designated output bits.

[0493] According to yet another embodiment of the present invention, it is
assumed that the symbol encoder is configured as shown in FIG. 17C, and
that the input bit is repeated once by the repeater 431, and that the 1/2
outer encoder 432 1/2-rate encodes the bit that is repeated and inputted
from the repeater 431, so as to output 2 bits u0 and u1 (i.e., 1 symbol)
twice. In this case, the symbol encoder repeats one bit and encodes the
repeated bit at a coding rate of 1/2. Herein, the symbol that is
outputted first is referred to as an odd-number-designated symbol, and
the symbol that is outputted subsequently is referred to as an
even-number-designated symbol for simplicity.

[0494] At this point, if the input/output units of the outer symbol mapper
4017 and the inner symbol mapper 4019 correspond to bit units, the outer
symbol mapper 4017 directly transmits the output of the symbol
deinterleaver 4016 to the symbol decoder 4018 without modification. The
inner symbol mapper 4019 directly transmits the output of the symbol
decoder 4018 to the symbol interleaver 4020 without modification. Also,
even when the input/output units of the outer symbol mapper 4017 and the
inner symbol mapper 4019 correspond to symbol units, the outer symbol
mapper 4017 directly transmits the output of the symbol deinterleaver
4016 to the symbol decoder 4018 without modification. The inner symbol
mapper 4019 directly transmits the output of the symbol decoder 4018 to
the symbol interleaver 4020 without modification.

[0495] Referring to FIG. 17C, since the input of the 1/2 outer encoder 432
is repeated by the repeater 431, the soft decisions values for the 2
symbols corresponding to the output data of the block decoder should be
determined and outputted as a single soft decision value. More
specifically, when the symbol encoding is processed as shown in FIG. 17B
and FIG. 17C, the LLR for each of the 4 different symbols may be received
and symbol-decoded. Thereafter, the LLR for each of the 4 symbols may be
outputted as the first soft decision value. Alternatively, the LLR for 2
bits may be received and symbol-decoded. Thereafter, the LLR for the 2
bits may be outputted as the first soft decision value.

[0496] The symbol interleaver 4020 performs symbol interleaving, as shown
in FIG. 19, on the first soft decision value that is outputted from the
inner symbol mapper 4019. Then, the symbol interleaver 4020 outputs the
symbol-interleaved first soft decision value to the feedback formatter
4021. Herein, the output of the symbol interleaver 4020 also corresponds
to a soft decision value. With respect to the changed processing order of
the soft decision values corresponding to the symbols that are generated
during an intermediate step, wherein the output symbols outputted from
the block processor 303 of the transmitting system are being inputted to
the trellis encoding module (e.g., when the symbols pass through the
group formatter, the data deinterleaver, the packet formatter, the RS
encoder, and the data interleaver), the feedback formatter 4021 alters
(or changes) the order of the output values outputted from the symbol
interleaver 4020. Subsequently, the feedback formatter 4020 outputs
values to the trellis decoding unit 4012 in the changed order.

[0497] The soft decision values outputted from the symbol interleaver 4020
are matched with the positions of mobile service data symbols each having
the size of TBL, which are outputted from the input buffer 4011, so as to
be in a one-to-one correspondence. Thereafter, the soft decision values
matched with the respective symbol position are inputted to the trellis
decoding unit 4012. At this point, since the main service data symbols or
the RS parity data symbols and known data symbols of the main service
data do not correspond to the mobile service data symbols, the feedback
formatter 4021 inserts null data in the corresponding positions, thereby
outputting the processed data to the trellis decoding unit 4012.
Additionally, each time the symbols having the size of TBL are turbo
decoded, no value is fed-back by the symbol interleaver 4020 starting
from the beginning of the first decoding process. Therefore, the feedback
formatter 4021 is controlled by the feedback controller 4010, thereby
inserting null data into all symbol positions including a mobile service
data symbol. Then, the processed data are outputted to the trellis
decoding unit 4012.

[0498] The output buffer 4022 receives the second soft decision value from
the symbol decoder 4018 based upon the control of the feedback controller
4010. Then, the output buffer 4022 temporarily stores the received second
soft decision value. Thereafter, the output buffer 4022 outputs the
second soft decision value to the data deformatter 1006. For example, the
output buffer 4022 overwrites the second soft decision value of the
symbol decoder 4018 until the turbo decoding process is performed for M
number of times. Then, once all M number of turbo decoding processes is
performed for a single TBL, the corresponding second soft decision value
is outputted to the data deformatter 1006.

[0499] The feedback controller 4010 controls the number of turbo decoding
and turbo decoding repetition processes of the overall block decoder,
shown in FIG. 57. More specifically, once the turbo decoding process has
been repeated for a predetermined number of times, the second soft
decision value of the symbol decoder 4018 is outputted to the data
deformatter 1006 through the output buffer 4022. Thus, the block decoding
process of a turbo block is completed. In the description of the present
invention, this process is referred to as a regressive turbo decoding
process for simplicity. At this point, the number of regressive turbo
decoding rounds between the trellis decoding unit 4012 and the symbol
decoder 4018 may be defined while taking into account hardware complexity
and error correction performance. Accordingly, if the number of rounds
increases, the error correction performance may be enhanced. However,
this may lead to a disadvantageous of the hardware becoming more
complicated (or complex).

[0500] Meanwhile, the data deinterleaver 1009, the RS decoder 4010, and
the data derandomizer 4011 correspond to blocks required for receiving
the main service data. Therefore, the above-mentioned blocks may not be
necessary (or required) in the structure of a digital broadcast receiving
system for receiving mobile service data only. The data deinterleaver
1009 performs an inverse process of the data interleaver included in the
transmitting system. In other words, the data deinterleaver 1009
deinterleaves the main service data outputted from the block decoder 1005
and outputs the deinterleaved main service data to the RS decoder 4010.
The data being inputted to the data deinterleaver 1009 include main
service data, as well as mobile service data, known data, RS parity data,
and an MPEG header. At this point, among the inputted data, only the main
service data and the RS parity data added to the main service data packet
may be outputted to the RS decoder 4010. Also, all data outputted after
the data derandomizer 4011 may all be removed with the exception for the
main service data. In the embodiment of the present invention, only the
main service data and the RS parity data added to the main service data
packet are inputted to the RS decoder 4010.

[0501] The RS decoder 4010 performs a systematic RS decoding process on
the deinterleaved data and outputs the processed data to the data
derandomizer 4011. The data derandomizer 4011 receives the output of the
RS decoder 4010 and generates a pseudo random data byte identical to that
of the randomizer included in the digital broadcast transmitting system.
Thereafter, the data derandomizer 4011 performs a bitwise exclusive OR
(XOR) operation on the generated pseudo random data byte, thereby
inserting the MPEG synchronization bytes to the beginning of each packet
so as to output the data in 188-byte main service data packet units.

[0502] Meanwhile, the data being outputted from the block decoder 1005 to
the data deformatter 1006 are inputted in the form of a data group. At
this point, the data deformatter 1006 already knows the structure of the
data that are to be inputted and is, therefore, capable of identifying
the signaling information including system information and the mobile
service data from the data group. Thereafter, the data deformatter 1006
outputs the identified signaling information to a block (not shown) for
processing the signaling information and outputs the identified mobile
service data to the RS frame decoder 1007. More specifically, the RS
frame decoder 1007 receives only the RS-encoded and CRC-encoded mobile
service data that are transmitted from the data deformatter 1006.

[0503] The RS frame encoder 1007 performs an inverse process of the RS
frame encoder included in the transmitting system so as to correct the
error within the RS frame. Then, the RS frame decoder 1007 adds the
1-byte MPEG synchronization service data packet, which had been removed
during the RS frame encoding process, to the error-corrected mobile
service data packet. Thereafter, the processed data packet is outputted
to the derandomizer 1008. The operation of the RS frame decoder 1007 will
be described in detail in a later process. The derandomizer 1008 performs
a derandomizing process, which corresponds to the inverse process of the
randomizer included in the transmitting system, on the received mobile
service data. Thereafter, the derandomized data are outputted, thereby
obtaining the mobile service data transmitted from the transmitting
system. Hereinafter, detailed operations of the RS frame decoder 1007
will now be described.

[0504] FIG. 58 illustrates a process of grouping a plurality of data
groups (e.g., 18 data groups) to create a RS frame and a RS frame
reliability map, and also a process of performing data deinterleaving in
super frame units as an inverse process of the transmitting system and
identifying the deinterleaved RS frame and RS frame reliability map. More
specifically, the RS frame decoder 907 groups the inputted mobile service
data so as to create a RS frame. The mobile service data have been
RS-encoded RS frame units by the transmitting system, and then
interleaved in super frame units. At this point, the error correction
encoding process (e.g., the CRC encoding process) may have been performed
on the mobile service data (as shown in FIG. 5).

[0505] If it is assumed that the transmitting system has divided the RS
frame having the size of (N+2)*(187+P) bytes into M number of data groups
(wherein, for example, M is equal to 18) and then transmitted the divided
RS frame, the receiving system groups the mobile service data of each
data group, as shown in FIG. 58(a), so as to create a RS frame having the
size of (N+2)*(187+P) bytes. At this point, if a dummy byte has been
added to at least one of the data groups configuring the corresponding RS
frame and, then, transmitted, the dummy byte is removed, and a RS frame
and a RS frame reliability map are created. For example, as shown in FIG.
14, if K number of dummy bytes has been added, the RS frame and RS frame
reliability map are created after the K number of dummy bytes has been
removed.

[0506] Furthermore, if it is assumed that the RS frame is divided into 18
data groups, which are then transmitted from a single burst section, the
receiving system also groups mobile service data of 18 data groups within
the corresponding burst section, thereby creating the RS frame. Herein,
when it is assumed that the block decoder 905 outputs a soft decision
value for the decoding result, the RS frame decoder may decide the `0`
and `1` of the corresponding bit by using the codes of the soft decision
value. 8 bits that are each decided as described above are grouped to
create one data byte. If the above-described process is performed on all
soft decision values of the 18 data groups included in a single burst,
the RS frame having the size of (N+2)*(187+P) bytes may be configured.
Additionally, the present invention uses the soft decision value not only
to configure the RS frame but also to configure a reliability map.
Herein, the reliability map indicates the reliability of the
corresponding data byte, which is configured by grouping 8 bits, the 8
bits being decided by the codes of the soft decision value.

[0507] For example, when the absolute value of the soft decision value
exceeds a pre-determined threshold value, the value of the corresponding
bit, which is decided by the code of the corresponding soft decision
value, is determined to be reliable. Conversely, when the absolute value
of the soft decision value does not exceed the pre-determined threshold
value, the value of the corresponding bit is determined to be unreliable.
Thereafter, if even a single bit among the 8 bits, which are decided by
the codes of the soft decision value and group to configure one data
byte, is determined to be unreliable, the corresponding data byte is
marked on the reliability map as an unreliable data byte.

[0508] Herein, determining the reliability of one data byte is only
exemplary. More specifically, when a plurality of data bytes (e.g., at
least 4 data bytes) are determined to be unreliable, the corresponding
data bytes may also be marked as unreliable data bytes within the
reliability map. Conversely, when all of the data bits within the one
data byte are determined to be reliable (i.e., when the absolute value of
the soft decision values of all 8 bits included in the one data byte
exceed the predetermined threshold value), the corresponding data byte is
marked to be a reliable data byte on the reliability map. Similarly, when
a plurality of data bytes (e.g., at least 4 data bytes) are determined to
be reliable, the corresponding data bytes may also be marked as reliable
data bytes within the reliability map. The numbers proposed in the
above-described example are merely exemplary and, therefore, do not limit
the scope or spirit of the present invention.

[0509] The process of configuring the RS frame and the process of
configuring the reliability map both using the soft decision value may be
performed at the same time. Herein, the reliability information within
the reliability map is in a one-to-one correspondence with each byte
within the RS frame. For example, if a RS frame has the size of
(N+2)*(187+P) bytes, the reliability map is also configured to have the
size of (N+2)*(187+P) bytes. FIG. 58(a') and FIG. 58(b') respectively
illustrate the process steps of configuring the reliability map according
to the present invention.

[0510] At this point, the RS frame of FIG. 58(b) and the RS frame
reliability map of FIG. 58(b') are interleaved in super frame units (as
shown in FIG. 6). Therefore, the RS frame and the RS frame reliability
maps are grouped to create a super frame and a super frame reliability
map. Subsequently, as shown in FIG. 58(c) and FIG. 58(c'), a
de-permutation (or deinterleaving) process is performed in super frame
units on the RS frame and the RS frame reliability maps, as an inverse
process of the transmitting system. Then, when the de-permutation process
is performed in super frame units, the processed data are divided into
de-permuted (or deinterleaved) RS frames having the size of (N+2)*(187+P)
bytes and de-permuted RS frame reliability maps having the size of
(N+2)*(187+P) bytes, as shown in FIG. 58(d) and FIG. 58(d').
Subsequently, the RS frame reliability map is used on the divided RS
frames so as to perform error correction.

[0511] FIG. 59 illustrates example of the error correction processed
according to embodiments of the present invention. FIG. 59 illustrates an
example of performing an error correction process when the transmitting
system has performed both RS encoding and CRC encoding processes on the
RS frame (as shown in FIG. 5).

[0512] As shown in FIG. 59(a) and FIG. 59(a'), when the RS frame having
the size of (N+2)*(187+P) bytes and the RS frame reliability map having
the size of (N+2)*(187+P) bytes are created, a CRC syndrome checking
process is performed on the created RS frame, thereby verifying whether
any error has occurred in each row. Subsequently, as shown in FIG. 59(b),
a 2-byte checksum is removed to configure an RS frame having the size of
N*(187+P) bytes. Herein, the presence (or existence) of an error is
indicated on an error flag corresponding to each row. Similarly, since
the portion of the reliability map corresponding to the CRC checksum has
hardly any applicability, this portion is removed so that only N*(187+P)
number of the reliability information bytes remain, as shown in FIG.
59(b').

[0513] After performing the CRC syndrome checking process, as described
above, a RS decoding process is performed in a column direction. Herein,
a RS erasure correction process may be performed in accordance with the
number of CRC error flags. More specifically, as shown in FIG. 59(c), the
CRC error flag corresponding to each row within the RS frame is verified.
Thereafter, the RS frame decoder 907 determines whether the number of
rows having a CRC error occurring therein is equal to or smaller than the
maximum number of errors on which the RS erasure correction may be
performed, when performing the RS decoding process in a column direction.
The maximum number of errors corresponds to P number of parity bytes
inserted when performing the RS encoding process. In the embodiment of
the present invention, it is assumed that 48 parity bytes have been added
to each column (i.e., P=48).

[0514] If the number of rows having the CRC errors occurring therein is
smaller than or equal to the maximum number of errors (i.e., 48 errors
according to this embodiment) that can be corrected by the RS erasure
decoding process, a (235,187)-RS erasure decoding process is performed in
a column direction on the RS frame having (187+P) number of N-byte rows
(i.e., 235 N-byte rows), as shown in FIG. 59(d). Thereafter, as shown in
FIG. 59(e), the 48-byte parity data that have been added at the end of
each column are removed. Conversely, however, if the number of rows
having the CRC errors occurring therein is greater than the maximum
number of errors (i.e., 48 errors) that can be corrected by the RS
erasure decoding process, the RS erasure decoding process cannot be
performed. In this case, the error may be corrected by performing a
general RS decoding process. In addition, the reliability map, which has
been created based upon the soft decision value along with the RS frame,
may be used to further enhance the error correction ability (or
performance) of the present invention.

[0515] More specifically, the RS frame decoder 907 compares the absolute
value of the soft decision value of the block decoder 905 with the
pre-determined threshold value, so as to determine the reliability of the
bit value decided by the code of the corresponding soft decision value.
Also, 8 bits, each being determined by the code of the soft decision
value, are grouped to form one data byte. Accordingly, the reliability
information on this one data byte is indicated on the reliability map.
Therefore, as shown in FIG. 59(c), even though a particular row is
determined to have an error occurring therein based upon a CRC syndrome
checking process on the particular row, the present invention does not
assume that all bytes included in the row have errors occurring therein.
The present invention refers to the reliability information of the
reliability map and sets only the bytes that have been determined to be
unreliable as erroneous bytes. In other words, with disregard to whether
or not a CRC error exists within the corresponding row, only the bytes
that are determined to be unreliable based upon the reliability map are
set as erasure points.

[0516] According to another method, when it is determined that CRC errors
are included in the corresponding row, based upon the result of the CRC
syndrome checking result, only the bytes that are determined by the
reliability map to be unreliable are set as errors. More specifically,
only the bytes corresponding to the row that is determined to have errors
included therein and being determined to be unreliable based upon the
reliability information, are set as the erasure points. Thereafter, if
the number of error points for each column is smaller than or equal to
the maximum number of errors (i.e., 48 errors) that can be corrected by
the RS erasure decoding process, an RS erasure decoding process is
performed on the corresponding column. Conversely, if the number of error
points for each column is greater than the maximum number of errors
(i.e., 98 errors) that can be corrected by the RS erasure decoding
process, a general decoding process is performed on the corresponding
column.

[0517] More specifically, if the number of rows having CRC errors included
therein is greater than the maximum number of errors (i.e., 48 errors)
that can be corrected by the RS erasure decoding process, either an RS
erasure decoding process or a general RS decoding process is performed on
a column that is decided based upon the reliability information of the
reliability map, in accordance with the number of erasure points within
the corresponding column. For example, it is assumed that the number of
rows having CRC errors included therein within the RS frame is greater
than 48. And, it is also assumed that the number of erasure points
decided based upon the reliability information of the reliability map is
indicated as 40 erasure points in the first column and as 50 erasure
points in the second column. In this case, a (235,187)-RS erasure
decoding process is performed on the first column. Alternatively, a
(235,187)-RS decoding process is performed on the second column. When
error correction decoding is performed on all column directions within
the RS frame by using the above-described process, the 48-byte parity
data which were added at the end of each column are removed, as shown in
FIG. 59(e).

[0518] As described above, even though the total number of CRC errors
corresponding to each row within the RS frame is greater than the maximum
number of errors that can be corrected by the RS erasure decoding
process, when the number of bytes determined to have a low reliability
level, based upon the reliability information on the reliability map
within a particular column, while performing error correction decoding on
the particular column. Herein, the difference between the general RS
decoding process and the RS erasure decoding process is the number of
errors that can be corrected. More specifically, when performing the
general RS decoding process, the number of errors corresponding to half
of the number of parity bytes (i.e., (number of parity bytes)/2) that are
inserted during the RS encoding process may be error corrected (e.g., 24
errors may be corrected). Alternatively, when performing the RS erasure
decoding process, the number of errors corresponding to the number of
parity bytes that are inserted during the RS encoding process may be
error corrected (e.g., 98 errors may be corrected). After performing the
error correction decoding process, as described above, a RS frame
configured of 187 N-byte rows (or packet) may be obtained as shown in
FIG. 59(e). The RS frame having the size of N*187 bytes is outputted by
the order of N number of 187-byte units. At this point, 1 MPEG
synchronization byte, which had been removed by the transmitting system,
is added to each 187-byte packet, as shown in FIG. 59(f). Therefore, a
188-byte unit mobile service data packet is outputted.

[0519]FIG. 60 illustrates an example of a digital broadcast receiving
system according to the present invention. The tuner 1002 tunes to a
channel to receive a digital broadcast signal and the demodulator 1002
demodulates the received signal. The demodulator further outputs field
sync data or known data including transmission parameters to a
transmission parameter detector 1013. The equalizer 1003 performs channel
equalization on the demodulated signal and outputs the equalized signal
to the transmission parameter detector 1013.

[0520] The transmission parameter detector 1013 detects a SCCC mode from
the channel-equalized signal or from the data received from the
demodulator 1002, and outputs the detected SCCC mode to the block decoder
1005 and the RS frame decoder 1007, respectively. The block decoder 1005
performs block decoding on mobile service data included in the
channel-equalized signal according to the detected SCCC mode. The data
deformatter 1006 deformats the block-decoded signal and outputs signaling
data included in the block-decoded signal to the transmission parameter
detector 1013 and further outputs mobile service data included in the
block-decoded signal to the RS frame decoder 1007.

[0521] The transmission parameter detector 1013 detects transmission
parameters from the signals) outputted from the demodulator 1013, the
equalizer 1003, and/or the data deformatter 1006. For example, the
transmission parameter detector 1013 obtains the location information of
the known data and detects a SCCC mode and an RS mode from the signal
outputted from the demodulator 1013 or the equalizer 1003, and provides
the detected SCCC mode to the block decoder 1005 and the RS frame decoder
1007, respectively.

[0522] The block decoder 1005 performs error correction decoding on the
channel-equalized signal using the SCCC mode provided from the
transmission parameter detector 1013. The data deformatter 1006 deformats
the signal outputted from the block decoder 1005 into mobile service data
and signaling data including the transmission parameters, and outputs the
mobile service data and the signaling data to the RS frame decoder 1007
and the transmission parameter detector 1013, respectively. The RS frame
decoder 1007 performs RS frame decoding on the mobile service data and
outputs the RS-decoded mobile service data to the de-randomizer 1008. The
transmission parameter detector 1013 performs error correction decoding
(e.g., RS decoding) on the signaling data and obtains transmission
parameters other than a SCCC mode. The transmission parameters include at
least one of a service identifier (ID), an RS mode for regions A and B of
a signal frame, an RS mode for region C of the signal frame, a super
frame size (SFS), a permuted frame index (PFI) indicating the location
information of an RS frame in a super frame, a burst size (BS), a data
group index (GI), and a time to a next burst (TNB).

[0523] The transmission parameter detector 1013 may output the detected
burst information including the burst size (BS), the data group index
(GI), and the time to a next burst (TNB) to the known sequence detector
1004 which provides these information to the burst controller 5000. The
burst controller 5000 controls power supply to each component of the
broadcast receiving system as shown in FIG. 60 using the burst
information. Therefore, the power consumption can be minimized when the
broadcast receiving system is a mobile system.

[0524] A burst of data includes a plurality of data groups, and various
transmission parameters such as an RS mode for regions A and B in a data
frame, an RS mode for region C in the data frame, a super frame size
(SFS), a permuted frame index (PFI), and a burst size (BS) for the data
groups may be identical. When a burst of data includes a plurality of
data groups, there are various ways of detecting and using the
transmission parameters of the data groups. In a first example, the
transmission parameters of all the data groups must be successfully
detected or decoded in order to be used. In a second example, when the
transmission parameters included in a particular data group are
successfully detected or decoded, the detected parameters can be used
assuming that the detected parameters of the particular group are
identical to those of the remaining data group(s). Transmission
parameters may include an error due to channel distortion or noise.
Therefore, the transmission parameters which are previously detected can
be used if a number of errors included in current transmission parameters
is greater than a predetermined value. Alternatively, new transmission
parameters which are successfully detected can be used if the number of
errors in the current transmission parameters is greater than the
predetermined value.

[0525] FIG. 61 illustrates a block diagram of the transmission parameter
detector 1013 shown in FIG. 60 in detail. The transmission parameter
detector 1013 includes a mode detector 1011 and a signaling RS decoder
1013. The mode detector 1011 detects a SCCC mode from the signal
outputted from the channel equalizer 1003 or from the demodulator 1002
and outputs the detected SCCC mode to the block decoder 1005 and the RS
frame decoder 1007. The signaling RS decoder 1013 performs RS decoding on
the signaling data provided from the data deformatter 1006 (or from the
block decoder 1005) and obtains transmission parameters. The transmission
parameters include at least one of a service identifier (ID), an RS mode
for regions A and B of a signal frame, an RS mode for region C of the
signal frame, a super frame size (SFS), a permuted frame index (PFI)
indicating the location information of an RS frame in a super frame, a
burst size (BS), a data group index (GI), and a time to a next burst
(TNB). The transmission parameters detected by the signaling RS decoder
1013 are applicable to a data group including the transmission
parameters, and the data group index (GI) and the timing to a next burst
(TNB) can be renewed or updated for each data group. The RS mode obtained
by the signaling RS decoder 1013 is provided to the RS frame decoder
which performs error correction decoding on an RS frame including the
mobile service data using the RS mode.

[0526] FIG. 62 illustrates a block diagram of the mode detector 1011 shown
in FIG. 61 in detail. The mode detector 1011 includes a pattern
correlation unit 1120, a data point controller 1110, and a mode decision
unit 1130. The transmission parameter detector 1013 receives known data
identifying a SCCC mode from the demodulator 1002 or the equalizer 1003.
The data point controller determines the location of the known data and
allows the pattern correlation unit 1120 to receive data symbols
corresponding to a data region including the signaling information. The
pattern correlation unit 1120 calculates correlation values of the data
symbols, and the mode decision unit 1130 obtains a SCCC mode from the
pattern of a signal having the maximum correlation value. The detected
SCCC mode is provided to the block decoder 1005 or RS frame decoder.

[0527] FIG. 63 illustrates an example of the group burst indicator
outputting the group valid indicator. Referring to FIG. 63, when a
partial correlation value of a broadcast signal is checked according to a
cycle period of a counter, a peak value of the partial correlation value
corresponding to a data group position (marked as a group) of the
broadcast signal, wherein the data group includes known data, may be
indicated. The group burst indicator may output a group valid indicator
corresponding to the position where the partial correlation value occurs.

[0528] FIG. 64 illustrates an example of the group burst indicator
outputting the burst valid indicator. Herein, the group burst indicator
may obtain burst information from the signaling information, wherein the
burst information may include burst cycle information (i.e., one burst
cycle corresponds to 30 fields in the example shown in FIG. 64) and burst
length (i.e., one burst corresponds to 18 fields in the example shown in
FIG. 64). In a data group corresponding to a data section including
mobile service data, partial correlation values may periodically occur as
shown in the example of FIG. 63.

[0529] The burst controller receives the group valid indicator and burst
valid indicator and may use the received information to control power
on/off states of the receiving system, so as to allow the system to
process only the signal of the mobile service data section including the
user-desired broadcast program. If the broadcast receiving system wishes
(or desires) to receive only the mobile service data, the system
considers only the mobile service data group included in the
corresponding burst as the valid data. Accordingly, the receiving system
does not receive data other than the mobile service data group of the
corresponding burst. When data corresponding to the mobile service data
group are being processed, even though the corresponding data are
included in the burst section, the burst controller may use the group
valid indicator, which is generated while the data that are being
processed, so as to turn the power on or off.

[0530]FIG. 65 illustrates an example of comparing actual on/off time and
the burst section. Referring to FIG. 65, (a) represents a data receiving
section based upon the burst valid indicator and the group valid
indicator. The broadcast receiving system may turn the power on starting
from an arbitrary (or random) time prior to a burst starting point or a
data group starting point (i.e., set-up time). Alternatively, the
broadcast receiving system may turn the power off starting from an
arbitrary (or random) time after a burst ending point or a data group
ending point (i.e., hold time). Herein, the set-up time or the hold time
may be adjusted arbitrarily depending upon specific circumstances.

General Digital Broadcast Receiving System

[0531] FIG. 66 illustrates a block diagram showing a structure of a
digital broadcast receiving system according to an embodiment of the
present invention. Herein, the demodulating unit of FIG. 36 may be
applied in the digital broadcast receiving system. Referring to FIG. 66,
the digital broadcast receiving system includes a tuner 6001, a
demodulating unit 6002, a demultiplexer 6003, an audio decoder 6004, a
video decoder 6005, a native TV application manager 6006, a channel
manager 6007, a channel map 6008, a first memory 6009, an SI and/or data
decoder 6010, a second memory 6011, a system manager 6012, a data
broadcast application manager 6013, a storage controller 6014, a third
memory 6015, and a GPS module 6020. Herein, the first memory 6009
corresponds to a non-volatile random access memory (NVRAM) (or a flash
memory). The third memory 6015 corresponds to a large-scale storage
device, such as a hard disk drive (HDD), a memory chip, and so on.

[0532] The tuner 6001 tunes a frequency of a specific channel through any
one of an antenna, cable, and satellite. Then, the tuner 6001
down-converts the tuned frequency to an intermediate frequency (IF),
which is then outputted to the demodulating unit 6002. At this point, the
tuner 6001 is controlled by the channel manager 6007. Additionally, the
result and strength of the broadcast signal of the tuned channel are also
reported to the channel manager 6007. The data that are being received by
the frequency of the tuned specific channel include main service data,
mobile service data, and table data for decoding the main service data
and mobile service data.

[0533] According to the embodiment of the present invention, audio data
and video data for mobile broadcast programs may be applied as the mobile
service data. Such audio data and video data are compressed by various
types of encoders so as to be transmitted to a broadcasting station. In
this case, the video decoder 6004 and the audio decoder 6005 will be
provided in the receiving system so as to correspond to each of the
encoders used for the compression process. Thereafter, the decoding
process will be performed by the video decoder 6004 and the audio decoder
6005. Then, the processed video and audio data will be provided to the
users. Examples of the encoding/decoding scheme for the audio data may
include AC 3, MPEG 2 AUDIO, MPEG 4 AUDIO, AAC, AAC+, HE AAC, AAC SBR,
MPEG-Surround, and BSAC. And, examples of the encoding/decoding scheme
for the video data may include MPEG 2 VIDEO, MPEG 4 VIDEO, H.264, SVC,
and VC-1.

[0534] Depending upon the embodiment of the present invention, examples of
the mobile service data may include data provided for data service, such
as Java application data, HTML application data, XML data, and so on. The
data provided for such data services may correspond either to a Java
class file for the Java application, or to a directory file designating
positions (or locations) of such files. Furthermore, such data may also
correspond to an audio file and/or a video file used in each application.
The data services may include weather forecast services, traffic
information services, stock information services, services providing
information quiz programs providing audience participation services, real
time poll, user interactive education programs, gaming services, services
providing information on soap opera (or TV series) synopsis, characters,
original sound track, filing sites, services providing information on
past sports matches, profiles and accomplishments of sports players,
product information and product ordering services, services providing
information on broadcast programs by media type, airing time, subject,
and so on. The types of data services described above are only exemplary
and are not limited only to the examples given herein. Furthermore,
depending upon the embodiment of the present invention, the mobile
service data may correspond to meta data. For example, the meta data be
written in XML format so as to be transmitted through a DSM-CC protocol.

[0535] The demodulating unit 6002 performs VSB-demodulation and channel
equalization on the signal being outputted from the tuner 6001, thereby
identifying the main service data and the mobile service data.
Thereafter, the identified main service data and mobile service data are
outputted in TS packet units. An example of the demodulating unit 6002 is
shown in FIG. 36 to FIG. 65. Therefore, the structure and operation of
the demodulator will be described in detail in a later process. However,
this is merely exemplary and the scope of the present invention is not
limited to the example set forth herein. In the embodiment given as an
example of the present invention, only the mobile service data packet
outputted from the demodulating unit 6002 is inputted to the
demultiplexer 6003. In this case, the main service data packet is
inputted to another demultiplexer (not shown) that processes main service
data packets. Herein, the storage controller 6014 is also connected to
the other demultiplexer in order to store the main service data after
processing the main service data packets. The demultiplexer of the
present invention may also be designed to process both mobile service
data packets and main service data packets in a single demultiplexer.

[0536] The storage controller 6014 is interfaced with the demultiplexer so
as to control instant recording, reserved (or pre-programmed) recording,
time shift, and so on of the mobile service data and/or main service
data. For example, when one of instant recording, reserved (or
pre-programmed) recording, and time shift is set and programmed in the
receiving system (or receiver) shown in FIG. 66, the corresponding mobile
service data and/or main service data that are inputted to the
demultiplexer are stored in the third memory 6015 in accordance with the
control of the storage controller 6014. The third memory 6015 may be
described as a temporary storage area and/or a permanent storage area.
Herein, the temporary storage area is used for the time shifting
function, and the permanent storage area is used for a permanent storage
of data according to the user's choice (or decision).

[0537] When the data stored in the third memory 6015 need to be reproduced
(or played), the storage controller 6014 reads the corresponding data
stored in the third memory 6015 and outputs the read data to the
corresponding demultiplexer (e.g., the mobile service data are outputted
to the demultiplexer 6003 shown in FIG. 66). At this point, according to
the embodiment of the present invention, since the storage capacity of
the third memory 6015 is limited, the compression encoded mobile service
data and/or main service data that are being inputted are directly stored
in the third memory 6015 without any modification for the efficiency of
the storage capacity. In this case, depending upon the reproduction (or
reading) command, the data read from the third memory 6015 pass trough
the demultiplexer so as to be inputted to the corresponding decoder,
thereby being restored to the initial state.

[0538] The storage controller 6014 may control the reproduction (or play),
fast-forward, rewind, slow motion, instant replay functions of the data
that are already stored in the third memory 6015 or presently being
buffered. Herein, the instant replay function corresponds to repeatedly
viewing scenes that the viewer (or user) wishes to view once again. The
instant replay function may be performed on stored data and also on data
that are currently being received in real time by associating the instant
replay function with the time shift function. If the data being inputted
correspond to the analog format, for example, if the transmission mode is
NTSC, PAL, and so on, the storage controller 6014 compression encodes the
inputted data and stored the compression-encoded data to the third memory
6015. In order to do so, the storage controller 6014 may include an
encoder, wherein the encoder may be embodied as one of software,
middleware, and hardware. Herein, an MPEG encoder may be used as the
encoder according to an embodiment of the present invention. The encoder
may also be provided outside of the storage controller 6014.

[0539] Meanwhile, in order to prevent illegal duplication (or copies) of
the input data being stored in the third memory 6015, the storage
controller 6014 scrambles (or encrypts) the input data and stores the
scrambled (or encrypted) data in the third memory 6015. Accordingly, the
storage controller 6014 may include a scramble algorithm (or encryption
algorithm) for scrambling the data stored in the third memory 6015 and a
descramble algorithm (or decryption algorithm) for descrambling (or
decrypting) the data read from the third memory 6015. The scrambling
method may include using an arbitrary key (e.g., control word) to modify
a desired set of data, and also a method of mixing signals.

[0540] Meanwhile, the demultiplexer 6003 receives the real-time data
outputted from the demodulating unit 6002 or the data read from the third
memory 6015 and demultiplexes the received data. In the example given in
the present invention, the demultiplexer 6003 performs demultiplexing on
the mobile service data packet. Therefore, in the present invention, the
receiving and processing of the mobile service data will be described in
detail. However, depending upon the many embodiments of the present
invention, not only the mobile service data but also the main service
data may be processed by the demultiplexer 6003, the audio decoder 6004,
the video decoder 6005, the native TV application manager 6006, the
channel manager 6007, the channel map 6008, the first memory 6009, the SI
and/or data decoder 6010, the second memory 6011, a system manager 6012,
the data broadcast application manager 6013, the storage controller 6014,
the third memory 6015, and the GPS module 6020. Thereafter, the processed
data may be used to provide diverse services to the users.

[0541] The demultiplexer 6003 demultiplexes mobile service data and system
information (SI) tables from the mobile service data packet inputted in
accordance with the control of the SI and/or data decoder 6010.
Thereafter, the demultiplexed mobile service data and SI tables are
outputted to the SI and/or data decoder 6010 in a section format. In this
case, it is preferable that data for the data service are used as the
mobile service data that are inputted to the SI and/or data decoder 6010.
In order to extract the mobile service data from the channel through
which mobile service data are transmitted and to decode the extracted
mobile service data, system information is required. Such system
information may also be referred to as service information. The system
information may include channel information, event information, etc. In
the embodiment of the present invention, the PSI/PSIP tables are applied
as the system information. However, the present invention is not limited
to the example set forth herein. More specifically, regardless of the
name, any protocol transmitting system information in a table format may
be applied in the present invention.

[0542] The PSI table is an MPEG-2 system standard defined for identifying
the channels and the programs. The PSIP table is an advanced television
systems committee (ATSC) standard that can identify the channels and the
programs. The PSI table may include a program association table (PAT), a
conditional access table (CAT), a program map table (PMT), and a network
information table (NIT). Herein, the PAT corresponds to special
information that is transmitted by a data packet having a PID of `0`. The
PAT transmits PID information of the PMT and PID information of the NIT
corresponding to each program. The CAT transmits information on a paid
broadcast system used by the transmitting system. The PMT transmits PID
information of a transport stream (TS) packet, in which program
identification numbers and individual bit sequences of video and audio
data configuring the corresponding program are transmitted, and the PID
information, in which PCR is transmitted. The NIT transmits information
of the actual transmission network.

[0543] The PSIP table may include a virtual channel table (VCT), a system
time table (STT), a rating region table (RRT), an extended text table
(ETT), a direct channel change table (DCCT), an event information table
(EIT), and a master guide table (MGT). The VCT transmits information on
virtual channels, such as channel information for selecting channels and
information such as packet identification (PID) numbers for receiving the
audio and/or video data. More specifically, when the VCT is parsed, the
PID of the audio/video data of the broadcast program may be known.
Herein, the corresponding audio/video data are transmitted within the
channel along with the channel name and the channel number.

[0544] FIG. 67 illustrates a VCT syntax according to an embodiment of the
present invention. The VCT syntax of FIG. 67 is configured by including
at least one of a table_id field, a section_syntax_indicator field, a
private_indicator field, a section_length field, a transport_stream_id
field, a version_number field, a current_next_indicator field, a
section_number field, a last_section_number field, a protocol_version
field, and a num_channels_in_section field.

[0545] The VCT syntax further includes a first `for` loop repetition
statement that is repeated as much as the num_channels_in_section field
value. The first repetition statement may include at least one of a
short_name field, a major_channel_number field, a minor_channel_number
field, a modulation_mode field, a carrier_frequency field, a channel_TSID
field, a program_number field, an ETM_location field, an
access_controlled field, a hidden field, a service_type field, a
source_id field, a descriptor_length field, and a second `for` loop
statement that is repeated as much as the number of descriptors included
in the first repetition statement. Herein, the second repetition
statement will be referred to as a first descriptor loop for simplicity.
The descriptor descriptors( ) included in the first descriptor loop is
separately applied to each virtual channel.

[0546] Furthermore, the VCT syntax may further include an
additional_descriptor_length field, and a third `for` loop statement that
is repeated as much as the number of descriptors additionally added to
the VCT. For simplicity of the description of the present invention, the
third repetition statement will be referred to as a second descriptor
loop. The descriptor additional descriptors( ) included in the second
descriptor loop is commonly applied to all virtual channels described in
the VCT.

[0547] As described above, referring to FIG. 67, the table_id field
indicates a unique identifier (or identification) (ID) that can identify
the information being transmitted to the table as the VCT. More
specifically, the table_id field indicates a value informing that the
table corresponding to this section is a VCT. For example, a 0xC8 value
may be given to the table_id field.

[0548] The version_number field indicates the version number of the VCT.
The section_number field indicates the number of this section. The
last_section_number field indicates the number of the last section of a
complete VCT. And, the num_channel_in_section field designates the number
of the overall virtual channel existing within the VCT section.
Furthermore, in the first `for` loop repetition statement, the short_name
field indicates the name of a virtual channel. The major_channel_number
field indicates a `major` channel number associated with the virtual
channel defined within the first repetition statement, and the
minor_channel_number field indicates a `minor` channel number. More
specifically, each of the channel numbers should be connected to the
major and minor channel numbers, and the major and minor channel numbers
are used as user reference numbers for the corresponding virtual channel.

[0549] The program_number field is shown for connecting the virtual
channel having an MPEG-2 program association table (PAT) and program map
table (PMT) defined therein, and the program_number field matches the
program number within the PAT/PMT. Herein, the PAT describes the elements
of a program corresponding to each program number, and the PAT indicates
the PID of a transport packet transmitting the PMT. The PMT described
subordinate information, and a PID list of the transport packet through
which a program identification number and a separate bit sequence, such
as video and/or audio data configuring the program, are being
transmitted.

[0550] FIG. 68 illustrates a service_type field according to an embodiment
of the present invention. The service_type field indicates the service
type provided in a corresponding virtual channel. Referring to FIG. 68,
it is provided that the service_type field should only indicate an analog
television, a digital television, digital audio data, and digital video
data. Also, according to the embodiment of the present invention, it may
be provided that a mobile broadcast program should be designated to the
service_type field. The service_type field, which is parsed by the SI
and/or data decoder 6010 may be provided to a receiving system, as shown
in FIG. 66, and used accordingly. According to other embodiments of the
present invention, the parsed service_type field may also be provided to
each of the audio decoder 6004 and video decoder 6005, so as to be used
in the decoding process.

[0551] The source_id field indicates a program source connected to the
corresponding virtual channel. Herein, a source refers to a specific
source, such as an image, a text, video data, or sound. The source_id
field value has a unique value within the transport stream transmitting
the VCT. Meanwhile, a service location descriptor may be included in a
descriptor loop (i.e., descriptor{ }) within a next `for` loop repetition
statement. The service location descriptor may include a stream type,
PID, and language code for each elementary stream.

[0552] FIG. 69 illustrates a service location descriptor according to an
embodiment of the present invention. As shown in FIG. 69, the service
location descriptor may include a descriptor_tag field, a
descriptor_length field, and a PCR_PID field. Herein, the PCR_PID field
indicates the PID of a transport stream packet within a program specified
by a program_number field, wherein the transport stream packet includes a
valid PCR field. Meanwhile, the service location descriptor includes a
number_elements field so as to indicate a number of PIDs used in the
corresponding program. The number of repetition of a next `for`
descriptor loop repetition statement can be decided, depending upon the
value of the number_elements field. Referring to FIG. 69, the `for` loop
repetition statement includes a stream_type field, an elementary_PID
field, and an ISO--639_language_code field. Herein, the stream_type
field indicates the stream type of the corresponding elementary stream
(i.e., video/audio data). The elementary_PID field indicates the PID of
the corresponding elementary stream. The ISO--639_language_code
field indicates a language code of the corresponding elementary stream.

[0554] As described above, "MPH" corresponds to the initials of "mobile",
"pedestrian", and "handheld" and represents the opposite concept of a
fixed-type system. Therefore, the MPH video stream:Non-hierarchical mode,
the MPH audio stream:Non-hierarchical mode, the MPH Non-A/V
stream:Non-hierarchical mode, the MPH High Priority video
stream:Hierarchical mode, the MPH High Priority audio stream:Hierarchical
mode, the MPH Low Priority video stream:Hierarchical mode, and the MPH
Low priority audio stream:Hierarchical mode correspond to stream types
that are applied when mobile broadcast programs are being transmitted and
received. Also the Hierarchical mode and the Non-hierarchical mode each
correspond to values that are used in stream types having different
priority levels. Herein, the priority level is determined based upon a
hierarchical structure applied in any one of the encoding or decoding
method.

[0555] Therefore, when a hierarchical structure-type codec is used, a
field value including the hierarchical mode and the non-hierarchical mode
is respectively designated so as to identify each stream. Such stream
type information is parsed by the SI and/or data decoder 6010, so as to
be provided to the video and audio decoders 6004 and 6005. Thereafter,
each of the video and audio decoders 6004 and 6005 uses the parsed stream
type information in order to perform the decoding process. Other stream
types that may be applied in the present invention may include MPEG 4
AUDIO, AC 3, AAC, AAC+, BSAC, HE AAC, AAC SBR, and MPEG-S for the audio
data, and may also include MPEG 2 VIDEO, MPEG 4 VIDEO, H.264, SVC, and
VC-1 for the video data.

[0556] Furthermore, referring to FIG. 70, in fields using the hierarchical
mode and the non-hierarchical mode, such as the MPH video stream
Non-hierarchical mode and the MPH audio stream:Non-hierarchical mode,
examples of using the MPEG 4 AUDIO, AC 3, AAC, AAC+, BSAC, HE AAC, AAC
SBR, and MPEG-S for the audio data, and the MPEG 2 VIDEO, MPEG 4 VIDEO,
H.264, SVC, and VC-1 for the video data may also be respectively used as
replacements for each of the audio stream and the video stream may be
considered as other embodiments of the present invention and may,
therefore, be included in the scope of the present invention. Meanwhile,
the stream_type field may be provided as one of the fields within the
PMT. And, in this case, it is apparent that such stream_type field
includes the above-described syntax. The STT transmits information on the
current data and timing information. The RRT transmits information on
region and consultation organs for program ratings. The ETT transmits
additional description of a specific channel and broadcast program. The
EIT transmits information on virtual channel events (e.g., program title,
program start time, etc.).

[0557] FIG. 71 illustrates a bit stream syntax for an event information
table (EIT) according to the present invention. In this embodiment, the
EIT shown in FIG. 71 corresponds to a PSIP table including information on
a title, start time, duration, and so on of an event in a virtual
channel. Referring to FIG. 71, the EIT is configured of a plurality of
fields including a table_id field, a section_syntax_indicator field, a
private_indicator field, a source_ID, a version_numbers_in_section field,
a current_next_indicator field, and a num_event field. More specifically,
the table_id field is an 8-bit field having the value of `oxCB`, which
indicates that the corresponding section is included in the EIT. The
section_syntax_indicator field is a 1-bit field having the value of `1`.
This indicates that the corresponding section passes through the
section_length field and is in accordance with a generic section syntax.
The private_indicator field corresponds to a 1-bit field having the value
of `1`.

[0558] Also, the source_ID corresponds to an ID identifying a virtual
channel that carries an event shown in the above-described table. The
version_numbers_in_section field indicates the version of an element
included in the event information table. In the present invention, with
respect to the previous version number, an event change information
included in the event information table, wherein the event change
information has a new version number is recognized as the latest change
in information. The current_next_indicator field indicates whether the
event information included in the corresponding EIT is a current
information or a next information. And, finally, the num_event field
represents the number of events included in the channel having a source
ID. More specifically, an event loop shown below is repeated as many
times as the number of events.

[0559] The above-described EIT field is commonly applied to at least one
or more events included in one EIT syntax. A loop statement, which is
included as "for(j=0;j<num_event_in_section;j++){ }", describes the
characteristics of each event. The following fields represent detailed
information of each individual event. Therefore, the following fields are
individually applied to each corresponding event described by the EIT
syntax. An event_ID included in an event loop is an identifier for
identifying each individual event. The number of the event ID corresponds
to a portion of the identifier for even extended text message (i.e.,
ETM_ID). A start_time field indicates the starting time of an event.
Therefore, the start_time field collects the starting time information of
a program provided from an electronic program information. A
length_in_seconds field indicates the duration of an event. Therefore,
the length_in_seconds field collects the ending time information of a
program provided from an electronic program information. More
specifically, the ending time information is collected by adding the
start_time field value and the length_in_seconds field value. A
title_text( ) field may be used to indicate the tile of a broadcast
program.

[0560] Meanwhile, the descriptor applied to each event may be included in
the EIT. Herein, a descriptors length field indicates the length of a
descriptor. Also, a descriptor loop (i.e., descriptor{ }) included in a
`for` loop repetition statement includes at least one of an AC-3 audio
descriptor, an MPEG 2 audio descriptor, an MPEG 4 audio descriptor, an
AAC descriptor, an AAC+ descriptor, an HE AAC descriptor, an AAC SBR
descriptor, an MPEG surround descriptor, a BSAC descriptor, an MPEG 2
video descriptor, an MPEG 4 video descriptor, an H.264 descriptor, an SVC
descriptor, and a VC-1 descriptor. Herein, each descriptor describes
information on audio/video codec applied to each event. Such codec
information may be provided to the audio/video decoder 6004 and 6005 and
used in the decoding process.

[0561] Finally, the DCCT/DCCSCT transmits information associated with
automatic (or direct) channel change. And, the MGT transmits the versions
and PID information of the above-mentioned tables included in the PSIP.
Each of the above-described tables included in the PSI/PSIP is configured
of a basic unit referred to as a "section", and a combination of one or
more sections forms a table. For example, the VCT may be divided into 256
sections. Herein, one section may include a plurality of virtual channel
information. However, a single set of virtual channel information is not
divided into two or more sections. At this point, the receiving system
may parse and decode the data for the data service that are transmitting
by using only the tables included in the PSI, or only the tables included
in the PSIP, or a combination of tables included in both the PSI and the
PSIP. In order to parse and decode the mobile service data, at least one
of the PAT and PMT included in the PSI, and the VCT included in the PSIP
is required. For example, the PAT may include the system information for
transmitting the mobile service data, and the PID of the PMT
corresponding to the mobile service data (or program number). The PMT may
include the PID of the TS packet used for transmitting the mobile service
data. The VCT may include information on the virtual channel for
transmitting the mobile service data, and the PID of the TS packet for
transmitting the mobile service data.

[0562] Meanwhile, depending upon the embodiment of the present invention,
a DVB-SI may be applied instead of the PSIP. The DVB-SI may include a
network information table (NIT), a service description table (SDT), an
event information table (EIT), and a time and data table (TDT). The
DVB-SI may be used in combination with the above-described PSI. Herein,
the NIT divides the services corresponding to particular network
providers by specific groups. The NIT includes all tuning information
that are used during the IRD set-up. The NIT may be used for informing or
notifying any change in the tuning information. The SDT includes the
service name and different parameters associated with each service
corresponding to a particular MPEG multiplex. The EIT is used for
transmitting information associated with all events occurring in the MPEG
multiplex. The EIT includes information on the current transmission and
also includes information selectively containing different transmission
streams that may be received by the IRD. And, the TDT is used for
updating the clock included in the IRD.

[0563] Furthermore, three selective SI tables (i.e., a bouquet associate
table (BAT), a running status table (RST), and a stuffing table (ST)) may
also be included. More specifically, the bouquet associate table (BAT)
provides a service grouping method enabling the IRD to provide services
to the viewers. Each specific service may belong to at least one
`bouquet` unit. A running status table (RST) section is used for promptly
and instantly updating at least one event execution status. The execution
status section is transmitted only once at the changing point of the
event status. Other SI tables are generally transmitted several times.
The stuffing table (ST) may be used for replacing or discarding a
subsidiary table or the entire SI tables.

[0564] In the present invention, when the mobile service data correspond
to audio data and video data, it is preferable that the mobile service
data included (or loaded) in a payload within a TS packet correspond to
PES type mobile service data. According to another embodiment of the
present invention, when the mobile service data correspond to the data
for the data service (or data service data), the mobile service data
included in the payload within the TS packet consist of a digital storage
media-command and control (DSM-CC) section format. However, the TS packet
including the data service data may correspond either to a packetized
elementary stream (PES) type or to a section type. More specifically,
either the PES type data service data configure the TS packet, or the
section type data service data configure the TS packet. The TS packet
configured of the section type data will be given as the example of the
present invention. At this point, the data service data are includes in
the digital storage media-command and control (DSM-CC) section. Herein,
the DSM-CC section is then configured of a 188-byte unit TS packet.

[0565] Furthermore, the packet identification of the TS packet configuring
the DSM-CC section is included in a data service table (DST). When
transmitting the DST, `0x95` is assigned as the value of a stream_type
field included in the service location descriptor of the PMT or the VCT.
More specifically, when the PMT or VCT stream_type field value is `0x95`,
the receiving system may acknowledge the reception of the data broadcast
program including mobile service data. At this point, the mobile service
data may be transmitted by a data/object carousel method. The data/object
carousel method corresponds to repeatedly transmitting identical data on
a regular basis.

[0566] At this point, according to the control of the SI and/or data
decoder 6010, the demultiplexer 6003 performs section filtering, thereby
discarding repetitive sections and outputting only the non-repetitive
sections to the SI and/or data decoder 6010. The demultiplexer 6003 may
also output only the sections configuring desired tables (e.g., VCT or
EIT) to the SI and/or data decoder 6010 by section filtering. Herein, the
VCT or EIT may include a specific descriptor for the mobile service data.
However, the present invention does not exclude the possibilities of the
mobile service data being included in other tables, such as the PMT. The
section filtering method may include a method of verifying the PID of a
table defined by the MGT, such as the VCT, prior to performing the
section filtering process. Alternatively, the section filtering method
may also include a method of directly performing the section filtering
process without verifying the MGT, when the VCT includes a fixed PID
(i.e., a base PID). At this point, the demultiplexer 6003 performs the
section filtering process by referring to a table_id field, a
version_number field, a section_number field, etc.

[0567] As described above, the method of defining the PID of the VCT
broadly includes two different methods. Herein, the PID of the VCT is a
packet identifier required for identifying the VCT from other tables. The
first method consists of setting the PID of the VCT so that it is
dependent to the MGT. In this case, the receiving system cannot directly
verify the VCT among the many PSI and/or PSIP tables. Instead, the
receiving system must check the PID defined in the MGT in order to read
the VCT. Herein, the MGT defines the PID, size, version number, and so
on, of diverse tables. The second method consists of setting the PID of
the VCT so that the PID is given a base PID value (or a fixed PID value),
thereby being independent from the MGT. In this case, unlike in the first
method, the VCT according to the present invention may be identified
without having to verify every single PID included in the MGT. Evidently,
an agreement on the base PID must be previously made between the
transmitting system and the receiving system.

[0568] Meanwhile, in the embodiment of the present invention, the
demultiplexer 6003 may output only an application information table (AIT)
to the SI and/or data decoder 6010 by section filtering. The AIT includes
information on an application being operated in the receiver for the data
service. The AIT may also be referred to as an XAIT, and an AMT.
Therefore, any table including application information may correspond to
the following description. When the AIT is transmitted, a value of `0x05`
may be assigned to a stream_type field of the PMT. The AIT may include
application information, such as application name, application version,
application priority, application ID, application status (i.e.,
auto-start, user-specific settings, kill, etc.), application type (i.e.,
Java or HTML), position (or location) of stream including application
class and data files, application platform directory, and location of
application icon.

[0569] In the method for detecting application information for the data
service by using the AIT, component_tag, original_network_id,
transport_stream_id, and service_id fields may be used for detecting the
application information. The component_tag field designates an elementary
stream carrying a DSI of a corresponding object carousel. The
original_network_id field indicates a DVB-SI original_network_id of the
TS providing transport connection. The transport_stream_id field
indicates the MPEG TS of the TS providing transport connection, and the
service_id field indicates the DVB-SI of the service providing transport
connection. Information on a specific channel may be obtained by using
the original_network_id field, the transport_stream_id field, and the
service_id field. The data service data, such as the application data,
detected by using the above-described method may be stored in the second
memory 6011 by the SI and/or data decoder 6010.

[0570] The SI and/or data decoder 6010 parses the DSM-CC section
configuring the demultiplexed mobile service data. Then, the mobile
service data corresponding to the parsed result are stored as a database
in the second memory 6011. The SI and/or data decoder 6010 groups a
plurality of sections having the same table identification (table_id) so
as to configure a table, which is then parsed. Thereafter, the parsed
result is stored as a database in the second memory 6011. At this point,
by parsing data and/or sections, the SI and/or data decoder 6010 reads
all of the remaining actual section data that are not section-filtered by
the demultiplexer 6003. Then, the SI and/or data decoder 6010 stores the
read data to the second memory 6011. The second memory 6011 corresponds
to a table and data/object carousel database storing system information
parsed from tables and mobile service data parsed from the DSM-CC
section. Herein, a table_id field, a section_number field, and a
last_section_number field included in the table may be used to indicate
whether the corresponding table is configured of a single section or a
plurality of sections. For example, TS packets having the PID of the VCT
are grouped to form a section, and sections having table identifiers
allocated to the VCT are grouped to form the VCT. When the VCT is parsed,
information on the virtual channel to which mobile service data are
transmitted may be obtained.

[0571] Also, according to the present invention, the SI and/or data
decoder 6010 parses the SLD of the VCT, thereby transmitting the stream
type information of the corresponding elementary stream to the audio
decoder 6004 or the video decoder 6005. In this case, the corresponding
audio decoder 6004 or video decoder 6005 uses the transmitted stream type
information so as to perform the audio or video decoding process.
Furthermore, according to the present invention, the SI and/or data
decoder 6010 parses an AC-3 audio descriptor, an MPEG 2 audio descriptor,
an MPEG 4 audio descriptor, an AAC descriptor, an AAC+ descriptor, an HE
AAC descriptor, an AAC SBR descriptor, an MPEG surround descriptor, a
BSAC descriptor, an MPEG 2 video descriptor, an MPEG 4 video descriptor,
an H.264 descriptor, an SVC descriptor, a VC-1 descriptor, and so on, of
the EIT, thereby transmitting the audio or video codec information of the
corresponding event to the audio decoder 6004 or video decoder 6005. In
this case, the corresponding audio decoder 6004 or video decoder 6005
uses the transmitted audio or video codec information in order to perform
an audio or video decoding process.

[0572] The obtained application identification information, service
component identification information, and service information
corresponding to the data service may either be stored in the second
memory 6011 or be outputted to the data broadcasting application manager
6013. In addition, reference may be made to the application
identification information, service component identification information,
and service information in order to decode the data service data.
Alternatively, such information may also prepare the operation of the
application program for the data service. Furthermore, the SI and/or data
decoder 6010 controls the demultiplexing of the system information table,
which corresponds to the information table associated with the channel
and events. Thereafter, an A/V PID list may be transmitted to the channel
manager 6007.

[0573] The channel manager 6007 may refer to the channel map 6008 in order
to transmit a request for receiving system-related information data to
the SI and/or data decoder 6010, thereby receiving the corresponding
result. In addition, the channel manager 6007 may also control the
channel tuning of the tuner 6001. Furthermore, the channel manager 6007
may directly control the demultiplexer 6003, so as to set up the A/V PID,
thereby controlling the audio decoder 6004 and the video decoder 6005.

[0574] The audio decoder 6004 and the video decoder 6005 may respectively
decode and output the audio data and video data demultiplexed from the
main service data packet. Alternatively, the audio decoder 6004 and the
video decoder 6005 may respectively decode and output the audio data and
video data demultiplexed from the mobile service data packet. Meanwhile,
when the mobile service data include data service data, and also audio
data and video data, it is apparent that the audio data and video data
demultiplexed by the demultiplexer 6003 are respectively decoded by the
audio decoder 6004 and the video decoder 6005. For example, an
audio-coding (AC)-3 decoding algorithm, an MPEG-2 audio decoding
algorithm, an MPEG-4 audio decoding algorithm, an AAC decoding algorithm,
an AAC+ decoding algorithm, an HE AAC decoding algorithm, an AAC SBR
decoding algorithm, an MPEG surround decoding algorithm, and a BSAC
decoding algorithm may be applied to the audio decoder 6004. Also, an
MPEG-2 video decoding algorithm, an MPEG-4 video decoding algorithm, an
H.264 decoding algorithm, an SVC decoding algorithm, and a VC-1 decoding
algorithm may be applied to the video decoder 6005. Accordingly, the
decoding process may be performed.

[0575] Meanwhile, the native TV application manager 6006 operates a native
application program stored in the first memory 6009, thereby performing
general functions such as channel change. The native application program
refers to software stored in the receiving system upon shipping of the
product. More specifically, when a user request (or command) is
transmitted to the receiving system through a user interface (UI), the
native TV application manger 6006 displays the user request on a screen
through a graphic user interface (GUI), thereby responding to the user's
request. The user interface receives the user request through an input
device, such as a remote controller, a key pad, a jog controller, an a
touch-screen provided on the screen, and then outputs the received user
request to the native TV application manager 6006 and the data
broadcasting application manager 6013. Furthermore, the native TV
application manager 6006 controls the channel manager 6007, thereby
controlling channel-associated operations, such as the management of the
channel map 6008, and controlling the SI and/or data decoder 6010. The
native TV application manager 6006 also controls the GUI of the overall
receiving system, thereby storing the user request and status of the
receiving system in the first memory 6009 and restoring the stored
information.

[0576] The channel manager 6007 controls the tuner 6001 and the SI and/or
data decoder 6010, so as to managing the channel map 6008 so that it can
respond to the channel request made by the user. More specifically,
channel manager 6007 sends a request to the SI and/or data decoder 6010
so that the tables associated with the channels that are to be tuned are
parsed. The results of the parsed tables are reported to the channel
manager 6007 by the SI and/or data decoder 6010. Thereafter, based on the
parsed results, the channel manager 6007 updates the channel map 6008 and
sets up a PID in the demultiplexer 6003 for demultiplexing the tables
associated with the data service data from the mobile service data.

[0577] The system manager 6012 controls the booting of the receiving
system by turning the power on or off. Then, the system manager 6012
stores ROM images (including downloaded software images) in the first
memory 6009. More specifically, the first memory 6009 stores management
programs such as operating system (OS) programs required for managing the
receiving system and also application program executing data service
functions. The application program is a program processing the data
service data stored in the second memory 6011 so as to provide the user
with the data service. If the data service data are stored in the second
memory 6011, the corresponding data service data are processed by the
above-described application program or by other application programs,
thereby being provided to the user. The management program and
application program stored in the first memory 6009 may be updated or
corrected to a newly downloaded program. Furthermore, the storage of the
stored management program and application program is maintained without
being deleted even if the power of the system is shut down. Therefore,
when the power is supplied, the programs may be executed without having
to be newly downloaded once again.

[0578] The application program for providing data service according to the
present invention may either be initially stored in the first memory 6009
upon the shipping of the receiving system, or be stored in the first
memory 6009 after being downloaded. The application program for the data
service (i.e., the data service providing application program) stored in
the first memory 6009 may also be deleted, updated, and corrected.
Furthermore, the data service providing application program may be
downloaded and executed along with the data service data each time the
data service data are being received.

[0579] When a data service request is transmitted through the user
interface, the data broadcasting application manager 6013 operates the
corresponding application program stored in the first memory 6009 so as
to process the requested data, thereby providing the user with the
requested data service. And, in order to provide such data service, the
data broadcasting application manager 6013 supports the graphic user
interface (GUI). Herein, the data service may be provided in the form of
text (or short message service (SMS)), voice message, still image, and
moving image. The data broadcasting application manager 6013 may be
provided with a platform for executing the application program stored in
the first memory 6009. The platform may be, for example, a Java virtual
machine for executing the Java program. Hereinafter, an example of the
data broadcasting application manager 6013 executing the data service
providing application program stored in the first memory 6009, so as to
process the data service data stored in the second memory 6011, thereby
providing the user with the corresponding data service will now be
described in detail.

[0580] Assuming that the data service corresponds to a traffic information
service, the data service according to the present invention is provided
to the user of a receiver that is not equipped with an electronic map
and/or a GPS system in the form of at least one of a text (or short
message service (SMS)), a voice message, a graphic message, a still
image, and a moving image. In this case, when a GPS module 6020 is
mounted on the receiving system, as shown in FIG. 66, the GPS module 6020
receives satellite signals transmitted from a plurality of low earth
orbit satellites and extracts the current position (or location)
information (e.g., longitude, latitude, altitude), thereby outputting the
extracted information to the data broadcasting application manager 6013.

[0581] At this point, it is assumed that the electronic map including
information on each link and nod and other diverse graphic information
are stored in one of the second memory 6011, the first memory 6009, and
another memory that is not shown. More specifically, according to the
request made by the data broadcasting application manager 6013, the data
service data stored in the second memory 6011 are read and inputted to
the data broadcasting application manager 6013. The data broadcasting
application manager 6013 translates (or deciphers) the data service data
read from the second memory 6011, thereby extracting the necessary
information according to the contents of the message and/or a control
signal. In other words, the data broadcasting application manager 6013
uses the current position information and the graphic information, so
that the current position information can be processed and provided to
the user in a graphic format.

[0582] FIG. 72 illustrates a block diagram showing the structure of a
digital broadcast (or television) receiving system according to another
embodiment of the present invention. Referring to FIG. 72, the digital
broadcast receiving system includes a tuner 7001, a demodulating unit
7002, a demultiplexer 7003, a first descrambler 7004, an audio decoder
7005, a video decoder 7006, a second descrambler 7007, an authentication
unit 7008, a native TV application manager 7009, a channel manager 7010,
a channel map 7011, a first memory 7012, a data decoder 7013, a second
memory 7014, a system manager 7015, a data broadcasting application
manager 7016, a storage controller 7017, a third memory 7018, a
telecommunication module 7019, and a GPS module 7020. Herein, the third
memory 7018 is a mass storage device, such as a hard disk drive (HDD) or
a memory chip. Also, during the description of the digital broadcast (or
television or DTV) receiving system shown in FIG. 72, the components that
are identical to those of the digital broadcast receiving system of FIG.
66 will be omitted for simplicity.

[0583] As described above, in order to provide services for preventing
illegal duplication (or copies) or illegal viewing of the enhanced data
and/or main data that are transmitted by using a broadcast network, and
to provide paid broadcast services, the transmitting system may generally
scramble and transmit the broadcast contents. Therefore, the receiving
system needs to descramble the scrambled broadcast contents in order to
provide the user with the proper broadcast contents. Furthermore, the
receiving system may generally be processed with an authentication
process with an authentication means before the descrambling process.
Hereinafter, the receiving system including an authentication means and a
descrambling means according to an embodiment of the present invention
will now be described in detail.

[0584] According to the present invention, the receiving system may be
provided with a descrambling means receiving scrambled broadcasting
contents and an authentication means authenticating (or verifying)
whether the receiving system is entitled to receive the descrambled
contents. Hereinafter, the descrambling means will be referred to as
first and second descramblers 7004 and 7007, and the authentication means
will be referred to as an authentication unit 7008. Such naming of the
corresponding components is merely exemplary and is not limited to the
terms suggested in the description of the present invention. For example,
the units may also be referred to as a decryptor. Although FIG. 72
illustrates an example of the descramblers 7004 and 7007 and the
authentication unit 7008 being provided inside the receiving system, each
of the descramblers 7004 and 7007 and the authentication unit 7008 may
also be separately provided in an internal or external module. Herein,
the module may include a slot type, such as a SD or CF memory, a memory
stick type, a USB type, and so on, and may be detachably fixed to the
receiving system.

[0585] As described above, when the authentication process is performed
successfully by the authentication unit 7008, the scrambled broadcasting
contents are descrambled by the descramblers 7004 and 7007, thereby being
provided to the user. At this point, a variety of the authentication
method and descrambling method may be used herein. However, an agreement
on each corresponding method should be made between the receiving system
and the transmitting system. Hereinafter, the authentication and
descrambling methods will now be described, and the description of
identical components or process steps will be omitted for simplicity.

[0586] The receiving system including the authentication unit 7008 and the
descramblers 7004 and 7007 will now be described in detail. The receiving
system receives the scrambled broadcasting contents through the tuner
7001 and the demodulating unit 7002. Then, the system manager 7015
decides whether the received broadcasting contents have been scrambled.
Herein, the demodulating unit 7002 may be included as a demodulating
means according to embodiment of the present invention as described in
FIG. 36 to FIG. 65. However, the present invention is not limited to the
examples given in the description set forth herein. If the system manager
7015 decides that the received broadcasting contents have been scrambled,
then the system manager 7015 controls the system to operate the
authentication unit 7008. As described above, the authentication unit
7008 performs an authentication process in order to decide whether the
receiving system according to the present invention corresponds to a
legitimate host entitled to receive the paid broadcasting service.
Herein, the authentication process may vary in accordance with the
authentication methods.

[0587] For example, the authentication unit 7008 may perform the
authentication process by comparing an IP address of an IP datagram
within the received broadcasting contents with a specific address of a
corresponding host. At this point, the specific address of the
corresponding receiving system (or host) may be a MAC address. More
specifically, the authentication unit 7008 may extract the IP address
from the decapsulated IP datagram, thereby obtaining the receiving system
information that is mapped with the IP address. At this point, the
receiving system should be provided, in advance, with information (e.g.,
a table format) that can map the IP address and the receiving system
information. Accordingly, the authentication unit 7008 performs the
authentication process by determining the conformity between the address
of the corresponding receiving system and the system information of the
receiving system that is mapped with the IP address. In other words, if
the authentication unit 7008 determines that the two types of information
conform to one another, then the authentication unit 7008 determines that
the receiving system is entitled to receive the corresponding
broadcasting contents.

[0588] In another example, standardized identification information is
defined in advance by the receiving system and the transmitting system.
Then, the identification information of the receiving system requesting
the paid broadcasting service is transmitted by the transmitting system.
Thereafter, the receiving system determines whether the received
identification information conforms with its own unique identification
number, so as to perform the authentication process. More specifically,
the transmitting system creates a database for storing the identification
information (or number) of the receiving system requesting the paid
broadcasting service. Then, if the corresponding broadcasting contents
are scrambled, the transmitting system includes the identification
information in the EMM, which is then transmitted to the receiving
system.

[0589] If the corresponding broadcasting contents are scrambled, messages
(e.g., entitlement control message (ECM), entitlement management message
(EMM)), such as the CAS information, mode information, message position
information, that are applied to the scrambling of the broadcasting
contents are transmitted through a corresponding data header or anther
data packet. The ECM may include a control word (CW) used for scrambling
the broadcasting contents. At this point, the control word may be encoded
with an authentication key. The EMM may include an authentication key and
entitlement information of the corresponding data. Herein, the
authentication key may be encoded with a receiving system-specific
distribution key. In other words, assuming that the enhanced data are
scrambled by using the control word, and that the authentication
information and the descrambling information are transmitted from the
transmitting system, the transmitting system encodes the CW with the
authentication key and, then, includes the encoded CW in the entitlement
control message (ECM), which is then transmitted to the receiving system.
Furthermore, the transmitting system includes the authentication key used
for encoding the CW and the entitlement to receive data (or services) of
the receiving system (i.e., a standardized serial number of the receiving
system that is entitled to receive the corresponding broadcasting service
or data) in the entitlement management message (EMM), which is then
transmitted to the receiving system.

[0590] Accordingly, the authentication unit 7008 of the receiving system
extracts the identification information of the receiving system and the
identification information included in the EMM of the broadcasting
service that is being received. Then, the authentication unit 7008
determines whether the identification information conform to each other,
so as to perform the authentication process. More specifically, if the
authentication unit 7008 determines that the information conform to each
other, then the authentication unit 7008 eventually determines that the
receiving system is entitled to receive the request broadcasting service.

[0591] In yet another example, the authentication unit 7008 of the
receiving system may be detachably fixed to an external module. In this
case, the receiving system is interfaced with the external module through
a common interface (CI). In other words, the external module may receive
the data scrambled by the receiving system through the common interface,
thereby performing the descrambling process of the received data.
Alternatively, the external module may also transmit only the information
required for the descrambling process to the receiving system. The common
interface is configured on a physical layer and at least one protocol
layer. Herein, in consideration of any possible expansion of the protocol
layer in a later process, the corresponding protocol layer may be
configured to have at least one layer that can each provide an
independent function.

[0592] The external module may either consist of a memory or card having
information on the key used for the scrambling process and other
authentication information but not including any descrambling function,
or consist of a card having the above-mentioned key information and
authentication information and including the descrambling function. Both
the receiving system and the external module should be authenticated in
order to provide the user with the paid broadcasting service provided (or
transmitted) from the transmitting system. Therefore, the transmitting
system can only provide the corresponding paid broadcasting service to
the authenticated pair of receiving system and external module.

[0593] Additionally, an authentication process should also be performed
between the receiving system and the external module through the common
interface. More specifically, the module may communicate with the system
manager 7015 included in the receiving system through the common
interface, thereby authenticating the receiving system. Alternatively,
the receiving system may authenticate the module through the common
interface. Furthermore, during the authentication process, the module may
extract the unique ID of the receiving system and its own unique ID and
transmit the extracted IDs to the transmitting system. Thus, the
transmitting system may use the transmitted ID values as information
determining whether to start the requested service or as payment
information. Whenever necessary, the system manager 7015 transmits the
payment information to the remote transmitting system through the
telecommunication module 7019.

[0594] The authentication unit 7008 authenticates the corresponding
receiving system and/or the external module. Then, if the authentication
process is successfully completed, the authentication unit 7008 certifies
the corresponding receiving system and/or the external module as a
legitimate system and/or module entitled to receive the requested paid
broadcasting service. In addition, the authentication unit 7008 may also
receive authentication-associated information from a mobile
telecommunications service provider to which the user of the receiving
system is subscribed, instead of the transmitting system providing the
requested broadcasting service. In this case, the
authentication-association information may either be scrambled by the
transmitting system providing the broadcasting service and, then,
transmitted to the user through the mobile telecommunications service
provider, or be directly scrambled and transmitted by the mobile
telecommunications service provider. Once the authentication process is
successfully completed by the authentication unit 7008, the receiving
system may descramble the scrambled broadcasting contents received from
the transmitting system. At this point, the descrambling process is
performed by the first and second descramblers 7004 and 7007. Herein, the
first and second descramblers 7004 and 7007 may be included in an
internal module or an external module of the receiving system.

[0595] The receiving system is also provided with a common interface for
communicating with the external module including the first and second
descramblers 7004 and 7007, so as to perform the descrambling process.
More specifically, the first and second descramblers 7004 and 7007 may be
included in the module or in the receiving system in the form of
hardware, middleware or software. Herein, the descramblers 7004 and 7007
may be included in any one of or both of the module and the receiving
system. If the first and second descramblers 7004 and 7007 are provided
inside the receiving system, it is advantageous to have the transmitting
system (i.e., at least any one of a service provider and a broadcast
station) scramble the corresponding data using the same scrambling
method.

[0596] Alternatively, if the first and second descramblers 7004 and 7007
are provided in the external module, it is advantageous to have each
transmitting system scramble the corresponding data using different
scrambling methods. In this case, the receiving system is not required to
be provided with the descrambling algorithm corresponding to each
transmitting system. Therefore, the structure and size of receiving
system may be simplified and more compact. Accordingly, in this case, the
external module itself may be able to provide CA functions, which are
uniquely and only provided by each transmitting systems, and functions
related to each service that is to be provided to the user. The common
interface enables the various external modules and the system manager
7015, which is included in the receiving system, to communicate with one
another by a single communication method. Furthermore, since the
receiving system may be operated by being connected with at least one or
more modules providing different services, the receiving system may be
connected to a plurality of modules and controllers.

[0597] In order to maintain successful communication between the receiving
system and the external module, the common interface protocol includes a
function of periodically checking the status of the opposite
correspondent. By using this function, the receiving system and the
external module is capable of managing the status of each opposite
correspondent. This function also reports the user or the transmitting
system of any malfunction that may occur in any one of the receiving
system and the external module and attempts the recovery of the
malfunction.

[0598] In yet another example, the authentication process may be performed
through software. More specifically, when a memory card having CAS
software downloaded, for example, and stored therein in advanced is
inserted in the receiving system, the receiving system receives and loads
the CAS software from the memory card so as to perform the authentication
process. In this example, the CAS software is read out from the memory
card and stored in the first memory 7012 of the receiving system.
Thereafter, the CAS software is operated in the receiving system as an
application program. According to an embodiment of the present invention,
the CAS software is mounted on (or stored) in a middleware platform and,
then executed. A Java middleware will be given as an example of the
middleware included in the present invention. Herein, the CAS software
should at least include information required for the authentication
process and also information required for the descrambling process.

[0599] Therefore, the authentication unit 7008 performs authentication
processes between the transmitting system and the receiving system and
also between the receiving system and the memory card. At this point, as
described above, the memory card should be entitled to receive the
corresponding data and should include information on a normal receiving
system that can be authenticated. For example, information on the
receiving system may include a unique number, such as a standardized
serial number of the corresponding receiving system. Accordingly, the
authentication unit 7008 compares the standardized serial number included
in the memory card with the unique information of the receiving system,
thereby performing the authentication process between the receiving
system and the memory card.

[0600] If the CAS software is first executed in the Java middleware base,
then the authentication between the receiving system and the memory card
is performed. For example, when the unique number of the receiving system
stored in the memory card conforms to the unique number of the receiving
system read from the system manager 7015, then the memory card is
verified and determined to be a normal memory card that may be used in
the receiving system. At this point, the CAS software may either be
installed in the first memory 7012 upon the shipping of the present
invention, or be downloaded to the first memory 7012 from the
transmitting system or the module or memory card, as described above.
Herein, the descrambling function may be operated by the data
broadcasting application manger 7016 as an application program.

[0601] Thereafter, the CAS software parses the EMM/ECM packets outputted
from the demultiplexer 7003, so as to verify whether the receiving system
is entitled to receive the corresponding data, thereby obtaining the
information required for descrambling (i.e., the CW) and providing the
obtained CW to the descramblers 7004 and 7007. More specifically, the CAS
software operating in the Java middleware platform first reads out the
unique (or serial) number of the receiving system from the corresponding
receiving system and compares it with the unique number of the receiving
system transmitted through the EMM, thereby verifying whether the
receiving system is entitled to receive the corresponding data. Once the
receiving entitlement of the receiving system is verified, the
corresponding broadcasting service information transmitted to the ECM and
the entitlement of receiving the corresponding broadcasting service are
used to verify whether the receiving system is entitled to receive the
corresponding broadcasting service. Once the receiving system is verified
to be entitled to receive the corresponding broadcasting service, the
authentication key transmitted to the EMM is used to decode (or decipher)
the encoded CW, which is transmitted to the ECM, thereby transmitting the
decoded CW to the descramblers 7004 and 7007. Each of the descramblers
7004 and 7007 uses the CW to descramble the broadcasting service.

[0602] Meanwhile, the CAS software stored in the memory card may be
expanded in accordance with the paid service which the broadcast station
is to provide. Additionally, the CAS software may also include other
additional information other than the information associated with the
authentication and descrambling. Furthermore, the receiving system may
download the CAS software from the transmitting system so as to upgrade
(or update) the CAS software originally stored in the memory card. As
described above, regardless of the type of broadcast receiving system, as
long as an external memory interface is provided, the present invention
may embody a CAS system that can meet the requirements of all types of
memory card that may be detachably fixed to the receiving system. Thus,
the present invention may realize maximum performance of the receiving
system with minimum fabrication cost, wherein the receiving system may
receive paid broadcasting contents such as broadcast programs, thereby
acknowledging and regarding the variety of the receiving system.
Moreover, since only the minimum application program interface is
required to be embodied in the embodiment of the present invention, the
fabrication cost may be minimized, thereby eliminating the manufacturer's
dependence on CAS manufacturers. Accordingly, fabrication costs of CAS
equipments and management systems may also be minimized.

[0603] Meanwhile, the descramblers 7004 and 7007 may be included in the
module either in the form of hardware or in the form of software. In this
case, the scrambled data that being received are descrambled by the
module and then demodulated. Also, if the scrambled data that are being
received are stored in the third memory 7018, the received data may be
descrambled and then stored, or stored in the memory at the point of
being received and then descrambled later on prior to being played (or
reproduced). Thereafter, in case scramble/descramble algorithms are
provided in the storage controller 7017, the storage controller 7017
scrambles the data that are being received once again and then stores the
re-scrambled data to the third memory 7018.

[0604] In yet another example, the descrambled broadcasting contents
(transmission of which being restricted) are transmitted through the
broadcasting network. Also, information associated with the
authentication and descrambling of data in order to disable the receiving
restrictions of the corresponding data are transmitted and/or received
through the telecommunications module 7019. Thus, the receiving system is
able to perform reciprocal (or two-way) communication. The receiving
system may either transmit data to the telecommunication module within
the transmitting system or be provided with the data from the
telecommunication module within the transmitting system. Herein, the data
correspond to broadcasting data that are desired to be transmitted to or
from the transmitting system, and also unique information (i.e.,
identification information) such as a serial number of the receiving
system or MAC address.

[0605] The telecommunication module 7019 included in the receiving system
provides a protocol required for performing reciprocal (or two-way)
communication between the receiving system, which does not support the
reciprocal communication function, and the telecommunication module
included in the transmitting system. Furthermore, the receiving system
configures a protocol data unit (PDU) using a tag-length-value (TLV)
coding method including the data that are to be transmitted and the
unique information (or ID information). Herein, the tag field includes
indexing of the corresponding PDU. The length field includes the length
of the value field. And, the value field includes the actual data that
are to be transmitted and the unique number (e.g., identification number)
of the receiving system.

[0606] The receiving system may configure a platform that is equipped with
the Java platform and that is operated after downloading the Java
application of the transmitting system to the receiving system through
the network. In this case, a structure of downloading the PDU including
the tag field arbitrarily defined by the transmitting system from a
storage means included in the receiving system and then transmitting the
downloaded PDU to the telecommunication module 7019 may also be
configured. Also, the PDU may be configured in the Java application of
the receiving system and then outputted to the telecommunication module
7019. The PDU may also be configured by transmitting the tag value, the
actual data that are to be transmitted, the unique information of the
corresponding receiving system from the Java application and by
performing the TLV coding process in the receiving system. This structure
is advantageous in that the firmware of the receiving system is not
required to be changed even if the data (or application) desired by the
transmitting system is added.

[0607] The telecommunication module within the transmitting system either
transmits the PDU received from the receiving system through a wireless
data network or configures the data received through the network into a
PDU which is transmitted to the host. At this point, when configuring the
PDU that is to be transmitted to the host, the telecommunication module
within the transmitting end may include unique information (e.g., IP
address) of the transmitting system which is located in a remote
location. Additionally, in receiving and transmitting data through the
wireless data network, the receiving system may be provided with a common
interface, and also provided with a WAP, CDMA 1x EV-DO, which can be
connected through a mobile telecommunication base station, such as CDMA
and GSM, and also provided with a wireless LAN, mobile internet, WiBro,
WiMax, which can be connected through an access point. The
above-described receiving system corresponds to the system that is not
equipped with a telecommunication function. However, a receiving system
equipped with telecommunication function does not require the
telecommunication module 7019.

[0608] The broadcasting data being transmitted and received through the
above-described wireless data network may include data required for
performing the function of limiting data reception. Meanwhile, the
demultiplexer 7003 receives either the real-time data outputted from the
demodulating unit 7002 or the data read from the third memory 7018,
thereby performing demultiplexing. In this embodiment of the present
invention, the demultiplexer 7003 performs demultiplexing on the enhanced
data packet. Similar process steps have already been described earlier in
the description of the present invention. Therefore, a detailed of the
process of demultiplexing the enhanced data will be omitted for
simplicity.

[0609] The first descrambler 7004 receives the demultiplexed signals from
the demultiplexer 7003 and then descrambles the received signals. At this
point, the first descrambler 7004 may receive the authentication result
received from the authentication unit 7008 and other data required for
the descrambling process, so as to perform the descrambling process. The
audio decoder 7005 and the video decoder 7006 receive the signals
descrambled by the first descrambler 7004, which are then decoded and
outputted. Alternatively, if the first descrambler 7004 did not perform
the descrambling process, then the audio decoder 7005 and the video
decoder 7006 directly decode and output the received signals. In this
case, the decoded signals are received and then descrambled by the second
descrambler 7007 and processed accordingly.

[0610] As described above, the digital broadcasting system and data
processing method according to the present invention have the following
advantages. More specifically, the digital broadcasting system and data
processing method according to the present invention is robust against
(or resistant to) any error that may occur when transmitting mobile
service data through a channel. And, the present invention is also highly
compatible to the conventional system. Moreover, the present invention
may also receive the mobile service data without any error even in
channels having severe ghost effect and noise.

[0611] By inserting known data in specific positions (or places) within a
data region, the present invention may enhance the receiving performance
of the receiving system in an environment undergoing frequent channel
changes. Additionally, when multiplexing the mobile service data with the
main service data, by multiplexing the data in a bus structure, the power
consumption level of the receiving system may be reduced. Moreover, by
using known data information in order to perform channel equalization,
the receiving system may perform channel equalization with more
stability.

[0612] Furthermore, by performing at least one of an error correction
encoding process, an error detection encoding process, and a row
permutation process in super frame units on the mobile service data and
transmitting the processed data, the present invention may provide
robustness to the mobile service data, thereby enabling the data to
effectively respond to the frequent change in channels. Finally, the
present invention is even more effective when applied to mobile and
portable receivers, which are also liable to a frequent change in channel
and which require protection (or resistance) against intense noise.

[0613] It will be apparent to those skilled in the art that various
modifications and variations can be made in the present invention without
departing from the spirit or scope of the inventions. Thus, it is
intended that the present invention covers the modifications and
variations of this invention provided they come within the scope of the
appended claims and their equivalents.