GB2392575A - Reproduced signal processor for arbitrary reproducing speed - Google Patents
Reproduced signal processor for arbitrary reproducing speed Download PDFInfo
- Publication number
- GB2392575A GB2392575A GB0329821A GB0329821A GB2392575A GB 2392575 A GB2392575 A GB 2392575A GB 0329821 A GB0329821 A GB 0329821A GB 0329821 A GB0329821 A GB 0329821A GB 2392575 A GB2392575 A GB 2392575A
- Authority
- GB
- United Kingdom
- Prior art keywords
- data
- information
- frame
- memory
- reproduced
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000015654 memory Effects 0.000 claims abstract description 87
- 230000003111 delayed effect Effects 0.000 claims abstract description 11
- 230000005540 biological transmission Effects 0.000 description 15
- 238000010586 diagram Methods 0.000 description 10
- 238000000034 method Methods 0.000 description 9
- 238000009825 accumulation Methods 0.000 description 6
- 101100425597 Solanum lycopersicum Tm-1 gene Proteins 0.000 description 3
- 230000008929 regeneration Effects 0.000 description 2
- 238000011069 regeneration method Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs
- H04N21/4402—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display
- H04N21/440227—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display by decomposing into layers, e.g. base layer and one or more enhancement layers
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/10527—Audio or video recording; Data buffering arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs
- H04N21/4402—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display
- H04N21/440281—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display by altering the temporal resolution, e.g. by frame skipping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N5/00—Details of television systems
- H04N5/76—Television signal recording
- H04N5/78—Television signal recording using magnetic recording
- H04N5/782—Television signal recording using magnetic recording on tape
- H04N5/783—Adaptations for reproducing at a rate different from the recording rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N5/00—Details of television systems
- H04N5/76—Television signal recording
- H04N5/91—Television signal processing therefor
- H04N5/92—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback
- H04N5/926—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback by pulse code modulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N5/00—Details of television systems
- H04N5/76—Television signal recording
- H04N5/91—Television signal processing therefor
- H04N5/93—Regeneration of the television signal or of selected parts thereof
- H04N5/937—Regeneration of the television signal or of selected parts thereof by assembling picture element blocks in an intermediate store
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Television Signal Processing For Recording (AREA)
Abstract
Apparatus, for processing data reproduced from a recording medium in which data is recorded in sync block units together with the identification information of sync block, at a speed of Ò a times ( a being a real number) of usual reproducing speed, includes data information generating means for generating data information composed of track information, field information and frame information from the identification information, means for delaying frame data by one or two fields or frames and reproduction control means for selecting and issuing delayed data on the basis of the data information. Also disclosed is the restructing of data read from memory 109 into main- and sub-data.
Description
GB 2392575 A continuation (74) Agent and/or Address for Service: A A
Thornton & Co 235 High Holborn, LONDON, WC1V 7LE, United Kingdom
DES CRIPTION
Reproduced signal processor 5 TECHNICAL FIELD
The present invention relates to a reproduced signal processing apparatus for processing data reproduced at an arbitrary speed from a recording medium in which data is recorded in sync block units together with identification lo information of sync blocks.
BACKGROUND ART
In a helical scanning VCR, a prior art about double
speed reproduction and shuttle reproduction by so-called 1'S non-tracking method is disclosed, for example, in Japanese Laid-open Patent No. 9139019.
This prior art discloses the following.
(1) In 2-speed or 4-speed reproduction, reproduced data of two frames or four frames are issued by decimating one 20 frame. (2) In up to l-speed drive, data of one frame is transmitted, in 2-speed drive, two frames are transmitted, anct in 4-speed drive, four frames are transmitted. (composition of' data in transmission is arranged in the recording order, and 2'r, quantity of data corresponding to the speed is transmitted.
In this prior art, however, the following problems are
known. (1) Since transmission data does not include all of reproduced data, a reproduced image of smooth motion cannot 30 be obtained from transmission data at an arbitrary speed.
(2) It is hard to arrange the data in the recording order at an arbitrary reproduction speed. That is, it is hard to transmit data reproduced at an arbitrary reproduction
speed. SUMMARY OF THE INVENTION
To solve these problems, a reproduced signal processing 5 apparatus of the invention comprises sync block detecting means for detecting identification information of reproduced data, data information generating means for generating data information composed of track information, field information
and frame information from the identification information, 10 first memory means for storing plural frames of reproduced data, memory writing means for writing reproduced data in the first memory means on the basis of the identification information, memory reading means for reading out parallel the data of n frames (n being an integer of 2 or more satisfying 15 the relation of a C n) accumulated in the first memory means, and transmitting means for transmitting n pieces of transmission data by restructuring or without restructuring n pieces of frame data being read out by the memory reading means on the basis of the data information.
20 A reproduced signal processing apparatus in other example of the invention comprises sync block detecting means for detecting identification information of reproduced data, data information generating means for generating data information composed of track information, field information
25 and frame information from the identification information, first memory means for storing plural frames of reproduced data, memory writing means for writing reproduced data in the first memory means on the basis of the identification information, memory reading means for reading out parallel 30 the data of n frames (n being an integer of 2 or more satisfying the relation of a < n) accumulated in the first memory means, and reproduction output control means.
It further comprises (1) delay means for issuing data of
n frames being read out by the memory reading means by delaying by one field and two fields each, and also issuing data
of n-th frame by delaying by three fields, and reproduction
output control means for selecting and issuing outputs of the delay means and memory reading means in field units on the
basis of the data information. Or it also comprises (2) second memory means for accumulating data of n frames being read out by the memory reading means for the portion of three frames each, and reproduction output control means for 10 selecting and issuing field data on the basis of the data
information, from the data delayed by one frame and two frames by controlling the second memory means.
BRIEF DESCRIPTION OF THE DRAWINGS
16 Fig. 1 is a block diagram showing a configuration of a reproduced signal processing apparatus in embodiment 1 of the invention.
Fig. 2 is a flowchart showing a generation algorithm of track information in embodiment 1.
20 Fig. 3 is a flowchart showing a generation algorithm of field information in embodiment 1.
Fig. 4 is a flowchart showing a generation algorithm of frame information in embodiment 1.
Fig. 5 is a timing chart for generating data information 25 in the case of a = 0.9 in embodiment 1.
Fig. 6 is a timing chart of data information and frame data being read out by a memory reading circuit in embodiment 1.
Fig. 7 is a timing chart for restructuring data in the 30 case of a = 0.9 in embodiment 1.
Fig. 8 is a timing chart for restructuring data in the case of a = 1.5 in embodiment 1.
Fig. 9 is a block diagram showing a configuration of a
reproduced signal processing apparatus in embodiment 2 of the invention.
Fig. 10 is an operation explanatory diagram of output control in embodiment 2.
5 Fig. 11 is a timing chart of field regeneration in
embodiment 2.
Fig. 12 is a block diagram showing a configuration of a reproduced signal processing apparatus in embodiment 3 of the invention.
10 Fig. 13 is an operation explanatory diagram of output control in embodiment 3.
Fig. 14 is a timing chart of field regeneration in the case
of a= 1.5 in embodiment 3.
Fig. 15 is a block diagram showing a configuration of a 15 reproduced signal processing apparatus in embodiment 4 of the invention.
Fig. 16 is a timing chart for restructuring data in the case of a = 3.0 in embodiment 4.
20 BEST MODE FOR CARRYING OUT THE INVENTION
Referring now to the drawings, preferred embodiments of the invention are described below.
(Embodiment 1) Fig. 1 is a block diagram showing a configuration of a 25 reproduced signal processing apparatus in embodiment 1 of the invention. This embodiment is designed to transmit data reproduced at an arbitrary x-times speed (an integer satisfying the relation of a < n) in a range of standard reproducing speed + 2 times (n = 2).
30 In Fig. 1, reproduced data 100 is data reproduced at arbitrary a-times speed within + 2 times speed by so-called non-tracking method. Or the reproduced data 100 may be once recorded in a disk device and reproduced from the disk
device. The reproduced data 100 is provided with identification information of sync block in sync block units of specified length.
A sync block detecting circuit 101 detects a sync signal 6 of reproduced data 100, and detects and issues identification information 102. The identification information 102 is composed of sync block number and track number. The track number is also a unit in encoding time of outer correction code.
After the sync signal is detected, the data is put into an 10 inner correction circuit 103 to undergo inner error correction.
A memory writing circuit 104 determines the data writing address by using the identification data 102, and accumulates the data corrected of inner error into a first memory 105.
A data information generating circuit 106 issues data 15 information 108 showing the status of accumulation in the memory 105 from the identification information 102. The data information 108 is composed of track information, field
information, and frame information.
<Generation of track information> 20 Generation of track information is determined on the basis of the track number. however, the reproduced data 100 is not always the tracked data, and different track numbers may be reproduced consecutively. Therefore, when the track number of the identification information 102 is used directly 25 as the track information, it cannot be judged accurately which track number the data accumulated in the memory 105 has.
Accordingly, the track number detected finally in the time required to reproduce one track number in 1-speed reproduction (hereinafter called head switch time) is compared 30 with the track information of one head switch time before.
In the case there are two kinds of track numbers to be reproduced continuously in non-tracking state, and in the case of forward direction reproduction (+ reproduction), the track
information is the value of subtracting the correction value 2 from the last track number detected in the head switch time.
The reason why the correction value is 2 is, in the case of reproduction of two kinds of track numbers in one head 5 switch time, that the data having these track numbers is not completely accumulated yet, and that the data of the track having the number two places away from the present track number is completely accumulated.
Accordingly, the track information of one head switch 10 time before, and the value subtracting correction value 2 from the last track number detected in the head switch time are compared, and the larger value is updated as new track information. In the case of backward direction reproduction 15 (- reproduction), the track information of one head switch time before, and the value adding correction value 2 to the last track number detected in the head switch time are compared, and the smaller value is updated as new track information Referring now to Fig. 2, an algorithm of generating 20 track information by the data information generating circuit 106 is explained.
At step 200, the identification information 102 detected by the sync block detecting circuit 101 is latched in the last place of head switch time. That is, a track number (TN) is 25 latched. At step 201, depending on the data reproducing direction, the latched track number is corrected as follows, and a corrected track number (CTN) is generated.
(1) In the case of positive direction reproduction 30 Corrected track number = track number - 2 (correction value) However, when track number is 1, correction track number is 9, and when track number is 2, correction track
number is 10.
(2) In the case of negative direction reproduction Corrected track number = track number + 2 (correction value) 5 However, when track number is 9, correction track number is 1, and when track number is 10, correction track number is 2.
At step 202, the corrected track number and the track information of data information 103 of one head switch time 10 before are compared as follows.
(1) In the case of positive direction reproduction When corrected track number is 1 or 2, (corrected track number + 10) > track information of one frame before 15 Or when corrected track number is 2 to 10, corrected track number > track information of one frame before When this condition is established, the process goes to step 203, and the corrected track number is updated as track 20 information. If not established, the process goes to step 200 without updating the track information.
(2) In the case of negative direction reproduction When corrected track number is 1 to 8, 25 corrected track number < track information of one frame before C)r when corrected track number is 9 or lo, corrected track number < (track information of one frame before + 10) 30 When this condition is established, the process goes to step 203, and the corrected track number is updated as track information. If not established. the process goes to step 200 without
updating the track information.
<Generation of field information>
Field information is generated from the track
information according to the algorithm in Fig. 3. When data 5 of one frame is recorded in 10 tracks (track numbers l to 10), in positive direction reproduction, in track information from 1 to 5, data in the first half field of one frame is being
accumulated. In track information from 6 to 10, data in latter half field is being accumulated. The field
10 information is supposed to be at low level while accumulating data in first half field, and at high level while accumulating
data in latter half field.
Referring to Fig. 3, an algorithm of generating field
information of data information 108 by the data information 15 generating circuit 106 is explained.
At step 300, track information of data information 108 is monitored.
At step 301, it is judged whether the monitored track information is a value of I to 5, or a value of 6 to 10.
20 ( 1) In positive direction reproduction, when the track information is 1 to 5, or in negative direction reproduction, when the track information is 6 to 10, the process goes to step 302, and the field information is set to low level.
(2) In positive direction reproduction, when the track 25 information is 6 to 10, or in negative direction reproduction, when the track information is 1 to 5, the process goes to step 303, and the field information is set to high level.
In this algorithm, data of one frame is recorded in 10 tracks, but it can be processed similarly in the case of 12, 20 or 30 other tracks.
<Generation of frame information> Frame information is generated according to an algorithm shown in Fig. 4, by judging whether data of n frames
is accumulated or not in the memory 106, from the field
information. Referring to Fig. 4, the algorithm of generating frame information by the data information generating circuit 106 is 5 explained. At step 400, field information of data information 108 is
monitored. It is monitored whether the field information is
promoted by one period or not, that is, changed from high to low. 10 At step 401, when it is judged that the field information
is promoted by one period, the frame information is counted up at step 402. When this count value is n, it is reset to 0.
As a result, the frame information shows a value of O to n-l. 15 If it is not judged that the field information is promoted
by one period, back to step 400, monitoring of field information
is continued.
Fig. 6 is a timing chart for generating data information in the case of a = 0.9 in embodiment 1.
20 In Fig. 5, (a) is a signal showing head switching time (Tsw), (b) denotes a track number of identification information 102, (c) denotes track information of data information 108, (d) denotes field information of data information 108, and (e)
denotes frame information of data information 108.
25 Alphanumeric symbols in Fig. 5 (b), (c) indicate track numbers, and "a" means that the track number is 10. In Fig. 5 (e), the numeral refers to the value of frame information.
The track number is detected, for example, in every sync block, and it may change from an intermediate point in 30 relation to head scanning to the tracks.
In the case of a = 0.9, while reproducing data of one frame, at least one track number may be reproduced in different head switch times. In Fig. 5 (b), track numbers 8
and 9 are issued in different head switch times. As a result, the track information, field information, and frame
information are changed.
Consequently, the data accumulated in the memory 105 5 is corrected in the outer correction circuit 107. The data to be corrected is determined by the track information. Later, when outer corrected data are accumulated in the memory 105 for two frames, the memory reading circuit lO9 can read out data of two new frames.
10 Whether data of two frames is accumulated or not is judged on the basis of the change of frame information of data information 108. The data to be read out is changed over in synchronism with a next frame signal when the frame information in data information 108 shows that data for two 16 frames is accumulated. Of the data being read out in two frames, the reproduction time is earlier in data 110, and later in data 111.
Fig. 6 is a timing chart of data information and frame data being read out by the memory reading circuit in 20 embodiment 1.
In Fig. 6, (a) is a reproduction reference frame signal, (b) is reproduced data 100 to be entered in the sync block detecting circuit 102, (c) is frame information of data information 108, (d) is frame data] 10 being read out by the 25 memory reading circuit 109, and (e) is frame data 111 being read out by the memory reading circuit 109.
Alphabetic letters in Fig. 6 (b), (d), (e) are symbols attached to frames, and the alphabetic order is the sequence being recorded in the VCR.
30 The data of two frames 110, 110 thus being read out are restructured into main data and sub data on the basis of the field information and frame information of the data
information 108 in a transmitting circuit 112. The main data
is sent out to a transmission output terminal 113, and sub data is sent out to a terminal 114, and transmitted. The transmitting circuit 112 restructures, if only main data is transmitted, so that much of frame data in the data 5 reproduced at a-times may be transmitted.
When a is less than 1.0, it is restructured so that frame data 110 or 1]1 may be transmitted as main data. Data is restructured, in one frame period of reproduction reference frame signal, on the basis of two-bit value composed of field
10 information of the data information 108 as LSB and frame information as MSB, and its change.
When the two-bit value changes as follows, the frame data 110 is issued as both main and sub data. At this time, the sub data is same as the main data, and is hence provided 15 with a flag showing invalid data.
(1) When not changed as 0 or 1 (2) When changed from 3 to 0 (3) When changed from 0 to 1 (4) When changed from 2 to 3, and to 0 20 (5) When changed from 3 to 0, and to 1 Or when changed follows, the frame data 111 is issued as both main and sub data. At this time, the sub data is same as the main data, and is hence provided with a flag showing invalid data.
25 (6) When not changed as 2 or 3 (7) When changed from 1 to 2 (8) When changed from 2 to 3 (9) When changed from 0 to l, and to 2 (10) When changed from 1 to 2, and to 3 30 Fig. 7 is a timing chart showing data restructuring in the case of = 0.9 in embodiment 1.
In Fig. 7, (a) is a reproduction reference frame signal, (b) is field information of data information, (c) is frame
information of data information, (d) is frame data 110, (e) is frame data 111, (f) is output data from a main data output terminal 113, and (g) is output data from a sub data output terminal 114.
5 In addition to data structuring when a = 0.9, Fig. shows a timing chart showing data restructuring in the case of a = 1.5 in embodiment 1. When a is larger than 1.0, aside from the case of a < 1.0 mentioned above, the two-bit value changes as follows.
10 (11) When changed sequentially from 0 to 1, 2, and 3, the frame data 11 l is issued as both main data and sub data.
In this case, too, the sub data is same as the main data, and is hence provided with a flag showing invalid data.
(12) When changed sequentially from 1 to 2, 3, and 0, 15 the frame data 110 is issued as both main data and sub data.
In this case, too, the sub data is same as the main data, and is hence provided with a flag showing invalid data.
(13) When changed sequentially from 2 to 3, 0, and 1; or 20 (14) When changed sequentially from 3 to 0, 1, and 2 The frame data 110 is issued to the main data transmission terminal 113, and the frame data].11 to the sub data transmission terminal 114. Herein, the main data and sub data are different, and are both provided with a flag 25 showing valid data.
In this manner, all of the data reproduced at an ordinary speed a within + 2 times can be transmitted without changing the transmission rate. Or by transmitting the main data only, much of reproduced data can be transmitted.
30 That is, from the state of change of field information
(one bit) and frame information (n types, for example, one bit if n = 2), the data accumulation status can be judged, and the accumulation can be predicted. In synchronism with the
reproduction reference frame signal, the frame data to be issued (that can be issued) is judged. Hence, data can be restructured so as to transmit all data at cr-times speed.
In embodiment 1, the case of n = 2 is explained, but if n 5 = 4, 8 or other integer larger than 2, the transmission data can be restructured by extending the same concept.
(Embodiment 2) Fig. 9 is a block diagram showing a configuration of a reproduced signal processing apparatus in embodiment 2 of 10 the invention. In this embodiment, n is 2, and the same reference numerals as in Fig. 1 are not explained herein.
The reproduction operation of the reproduced signal processing apparatus of the embodiment is explained. It is same as in embodiment 1 from input of reproduced data 100 15 until the memory reading circuit 109 reads out data of two frames. Of the data of two frames being read out by the memory reading circuit 109, earlier data 110 and later data 111 of reproduction time being read out are fed into a delay circuit 20 900.
The delay circuit 900 is composed of FIFO 901, 902, 903, 904, and 905 for delaying data by one frame. The data 110 is fed into the FIFO 901, and the output of the FIFO 901 is fed into the FIFO 902. The data 111 is fed into the FIFO 903, and 25 its output is fed into the FIFO 904. The output of the FIFO 904 is fed into the FIFO 9()5.
A reproduction output control circuit 913 has input terminals S1, S2, S3, S4, S5, S6, and S7. The data llO issued from the memory reading circuit is fed into the terminal S3.
30 The output data from the FIFO 901 and FIFO 902 are fed into the terminals S2 and S1, respectively. The data 111 issued from the memory reading circuit is fed into the terminal S7.
The output data from the FIFO 903, FIFO 904, and FIFO 905
are fed into the terminals S6, S5, and S4, respectively.
The reproduction output control circuit 913 selects the data entered in the terminals S 1 to S7 by using the field
information and frame information of the data information 108, 5 and issues to an output terminal 914.
The reproduction output control circuit 913 selects the data to be issued on the basis of data information (DIm- l) in the closest reproduction reference frame period (Tm- 1) and data information (Dlm-2) in frame period (Tm-2) of one frame 10 earlier. More specifically, on the basis of the two-bit value composed of field information of data information as LSB and
frame information as MSB, the data to be issued is selected according to (l) the initial two-bit value (initial value) in the reproduction reference frame period, and (2) the number of 15 times of changes of twobit value in this period or in the first half and second half of the period.
That is, the data is selected as shown in Fig. 10. For example, (1) if the number of times of changes of two-bit value in Tm-1 is 1, the change position is in the first half field, and
20 the initial value is 0, and (2) if the number of times of change in Tm2 is 0 and the initial value is 0, the data fed in the terminal S1 is selected in the first half field, and the data fed
in the terminal S3 in the second half.
For example, the timing chart when reproduced at a = 25 1.5 according to Fig. 10 is shown in Fig. 11. Fig. 11 is a timing chart of field reproduction in embodiment 2.
In Fig. 11, (a) is a reproduction reference frame signal, (b) is field information of data information 108, (c) is frame
information of data information 108, (d) is result of change of 30 data information 108 in the closest frame period (Tm-1), (e) is result of change of data information 108 in the period (Tm-2) of one frame earlier, (f) is frame data 110, and (g) is frame data ill. Further, (h) denotes an input terminal of the
reproduction output control circuit 913 for selecting according to Fig. 10 on the basis of (d) and (e), and (i) is video data issued from a video output terminal 914.
In Fig. 11 (d) and (e), for example, "0-3" indicates that 5 the state of field information and frame information of data
information starts from 0 (initial value) at the beginning of one frame, and shows the number of times of change in one frame is 3. Further, in (i) , for example, "c-] " indicates the first field (first half of the field) of frame data c, and if "1" is
10 replaced by "2", it means the second field (second half of the
field).
In this way, by restructuring the data reproduced at an arbitrary speed a within + 2 times, field slow reproduction
and field double speed reproduction of smooth motion are
15 realized. In embodiment 2, the case of n = 2 is explained, but if n = 4, 8 or other integer larger than 2, smooth field
reproduction is possible by extending the same concept. Or the field output may be also selected in a different manner
20 from the case of Fig. lo.
(Embodiment 3) Fig. 12 is a block diagram showing a configuration of a reproduced signal processing apparatus in embodiment 3 of the invention. In this embodiment, n is 2, and the same 25 reference numerals as in Fig. 1 are not explained herein.
The reproduction operation of the reproduced signal processing apparatus of the embodiment is explained. It is same as in embodiment 1 from input of reproduced data 100 until the memory reading circuit 109 reads out data of two 30 frames. Of the data of two frames being read out by the memory reading circuit 109, data ll0 being read out earlier in reproduction time is written into a memory 1101, and data l l1
being read out later is written into a memory 1102. The memories 1101 and 1102 compose a second memory 1100. The memories 1101 and 1102 have a capacity of storing data of at least three frames. They are mapped so as to be written into 5 an independent region in each frame. Writing into the memories 1101, 1102 is controlled by an upper bit address signal 110A in each frame of reproduction reference frame in the region of the memory map, and the entered frame data is delayed by two frames. For example, when the memories 1101, 10 1102 have a capacity of storing data of three frames, they are mapped so that the upper two bits of the memory address may indicate three regions of the memory.
A reproduction output control circuit 1103 controls to issue data from which field by using the field information and
15 frame information of data information 108, and reads out data from the memory 1100, and issues to a video output terminal 1106 in the field unit.
The reproduction output control circuit 1103, same as the control circuit 913 explained in embodiment 2, controls 20 data reading from the memory 1100 on the basis of the data information. That is, the reproduction output control circuit 1103 selects the data to be issued on the basis of data information (DIm-2) in frame period (Tm-2) of one frame earlier than the closest reproduction reference frame period 25 (Tm-1) and data information (DIm-3) in frame period (Tm-3) of one more frame earlier.
More specifically, on the basis of the two-bit value composed of field information of data information as LSB and
frame information as MSB, data reading from the memory llOO 30 is controlled according to (1) the initial two-bit value (initial value) in the reproduction reference frame period, and (2) the number of times of changes of two-bit value in this period or in the first half and second half of the period. The reason of
using the data information of one frame earlier and two frames earlier is that it takes one frame time to write data into the memory 1100. Specific control of data reading from the memory 1100 is conducted as shown in Fig. 13.
5 For example, in "F1-1, S2-l" in Fig. 13, "F1-1" indicates the field data to be read out from the memory 1100 in the first
half field time of the reproduction reference frame, and "S2-1"
denotes the field data to be read out in the second half field
time. Further, "F" shows the output from the memory 1101, 10 and "S" isthe output from the memory 1102. Numerals 1 and 2 following F and S indicate data delayed by one frame and two frames, respectively. Numerals 1 and 2 following the hyphen (-) indicate the first half field and second half field,
respectively. 15 For example, in embodiment 3 in Fig. 13, the timing chart of field reproduction at a = 1.5 is shown in Fig. 1a.
In Fig. 14, (a) is a reproduction reference frame signal, (b) is field information of data information 108, (c) is frame
information of data information 108, (d) is result of change of 20 data information 108 of one frame earlier, (e) is result of change of data information 108 of two frames earlier, (I) is frame data 110, and (g) is frame data 111, (h) is one-frame delay data of the memory 1101, (i) is two-frame delay data of the memory 1101, (I) is one-frame delay data of the memory 25 1102, and (k) is two-frame delay data of the memory 1102.
Further, (l) is delay data to be read out by the reproduction output control circuit 1103 according to Fig. 13 on the basis of (d) and (e), and (m) is video data issued from a video output terminal 1106.
30 In Fig. 14 (d) and (e), for example, " 1-3" indicates that the number of times of change is 1 and the initial value is 3.
In this way, by restructuring the data reproduced at an arbitrary speed ct within + 2 times, field slow reproduction
and field double speed reproduction of smooth motion are
realized. In embodiment 3, the case of n = 2 is explained, but if n = 4, 8 or other integer larger than 2, smooth field
5 reproduction is possible by extending the same concept. Or the manner of reading out from the reproduction output control circuit 1103 is not limited to the method shown in Fig. 13. (Embodiment '1) 10 Fig. 15 is a block diagram showing a configuration of a reproduced signal processing apparatus in embodiment 4 of the invention. In this embodiment, n is 4, and the same reference numerals as in Fig. 1 and Fig. 12 are not explained herein. 15 The reproduction operation of the reproduced signal processing apparatus of the embodiment is explained. It is same as in embodiment 3 from input of reproduced data 100 until the memory reading circuit 109 reads out data of four frames, and stores in the memory 1100.
20 The memory 1100 is composed of four memories 1107, 1108, 1109, and 1110. When data of four frames are accumulated in the memory 105, the memory reading circuit 109 in the embodiment issues the oldest frame data 1600 in reproduction time, second oldest frame data 1501, third oldest 25 frame data 1502, and the latest frame data 1503 in reproduction time.
Four frame data 1500, 1501, 1502, and 1503 being read out from the memory reading circuit l 09 are delayed by one frame and two frames in the memories 1107, 1108, 1109, and 30 1110.
A transmission circuit 1504 reads out one or two frame data from eight pieces of delayed data on the basis of the field
information and frame information of the data information 108.
In this embodiment, two frame data 1505 and 1506 are read out, and restructured, and transmitted from two transmission output terminals 1507 and 1508.
Restructuring is conducted by extending the concept of 5 embodiment 3, on the basis of change of three bits, using two bits composed of field information of the data information
108 at LSB and frame information at MSB side. In embodiment 3, the field to be reproduced and issued is
determined on the basis of the change of the data information to 108, whereas the frame data including the field to be issued is
read out in this embodiment.
Fig. 16 shows a timing chart of restructuring by the transmitting circuit 1504 at a = 3.
In Fig. 16, (a) is a reproduction reference frame signal, 15 (b) is threebit data information (frame information: 2 bits, field information: 1 bit) , (c) is result of observation of change
of data information 108 of one frame earlier (Tm- 1), (d) is result of observation of change of data information 108 of two frames earlier (Tm-2) , (e) is frame data 1500, (f) is frame data 20 1501, (g) is frame data 1502, and (h) is frame data 1503.
Further, (i) and (I) are delayed frame data 1505 and 1506 to be read out from the memory 1100 on the basis of (c) and (d) by the transmission circuit 1504, (k) is field data to be read out
from the memory 1100 in the case of field reproduction output,
25 (l) is actual field data in the case of field reproduction output,
(m) is output data from a main data transmission output terminal 1507, and (n) is output data from a sub data transmission output terminal 1508.
In Fig. 16 (i), (I), (k), A is the data delayed by memory 30 1107, by memory 1108, C by memory 11()9, and D by memory 1110. For example, "1" of "Al" means data delayed by one frame, or "2" is data delayed by two frames. In (k), " 1" following the hyphen (-) indicates the first field (first half
field) and "2" is the second field (second half field). In Fig. 16
(c) and (d), "3" of "3-6" means that the state of field
information and frame information of data information starts from 3 (initial value) at the beginning of one frame, and "6" 5 means it is changed six times in one frame (number of changes). In this way, by restructuring the data reproduced at an arbitrary speed a within +4 times into data of two frames and transmitting, the transmission rate is small, and field slow
10 reproduction and field double speed reproduction of smooth
motion at the reception side are realized. Or if other than n = 4, by restructuring into data of two frames and transmitting, similarly, field slow reproduction and field double speed
reproduction of smooth motion at the reception side are 15 re all ze d.
INDUSTRIAL APPLICABILITY
According to the reproduced signal processing apparatus of the invention, by restructuring the data 20 reproduced at an arbitrary speed a within + n times depending on the accumulation status (reproduction status) in the memory, all reproduced data can be transmitted. Further, by adequately changing over and controlling the reproduced data at an arbitrary speed a within + n times depending on 26 the accumulation status (reproduction status), field slow
reproduction and field double speed reproduction of smooth
motion are realized. Moreover, by restructuring the data reproduced at an arbitrary speed a within + n times depending on the accumulation status (reproduction status), 30 without transmitting all the reproduced data, field slow
reproduction and field double speed reproduction of smooth
motion at the reception side are realized.
Claims (2)
1. A reproduced signal processing apparatus, being an apparatus for processing data reproduced from a recording medium in which data is recorded in 5 sync block units together with the identification information of sync block, at a speed of + a times (a being a real number) of usual reproducing speed, comprising: sync block detecting means for detecting the identification information of the reproduced data, 10 data information generating means for generating data information composed of track information, field information and frame information from the
identification information, first memory means for storing plural frames of the reproduced data, memory writing means for writing the reproduced data in said first memory 15 means on the basis of the identification information, memory reading means for reading out parallel the data of n frames (n being an integer of 2 or more satisfying the relation of a_ n) accumulated in said first memory means, delay means for issuing n pieces of frame data being read out by said 20 memory reading means by delaying by one field and two fields each, and also
issuing data of n-th frame by delaying three fields, and
reproduction output control means for selecting and issuing outputs of said delay means and memory reading means in field units on the basis of the data
information.
2. A reproduced signal processing apparatus, being an apparatus for processing data reproduced from a recording medium in which data is recorded in sync block units together with the identification information of sync block, at a speed of + a times (a being a real number) of usual reproducing speed, 5 comprising: sync block detecting means for detecting the identification information of the reproduced data, data information generating means for generating data information composed of track information, field information and frame information from the
10 identification information, first memory means for storing plural frames of the reproduced data, memory writing means for writing the reproduced data in said first memory means on the basis of the identification information, memory reading means for reading out parallel the data of n frames (n 15 being an integer of 2 or more satisfying the relation of a < n) accumulated in said first memory means, second memory means for accumulating n pieces of frame data being read out by said memory reading means for the portion of three frames each, and reproduction output control means for selecting and issuing field data on
20 the basis of the data information, from the data delayed by one frame and two frames by controlling said second memory means.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP19276499 | 1999-07-07 | ||
GB0104308A GB2356519B (en) | 1999-07-07 | 2000-07-06 | Reproduced signal processor |
Publications (3)
Publication Number | Publication Date |
---|---|
GB0329821D0 GB0329821D0 (en) | 2004-01-28 |
GB2392575A true GB2392575A (en) | 2004-03-03 |
GB2392575B GB2392575B (en) | 2004-10-06 |
Family
ID=31497245
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB0329821A Expired - Fee Related GB2392575B (en) | 1999-07-07 | 2000-07-06 | Reproduced signal processor for arbitrary reproducing speed |
Country Status (1)
Country | Link |
---|---|
GB (1) | GB2392575B (en) |
-
2000
- 2000-07-06 GB GB0329821A patent/GB2392575B/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
GB0329821D0 (en) | 2004-01-28 |
GB2392575B (en) | 2004-10-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5142537A (en) | Video signal processing circuit | |
US5023710A (en) | Highly efficient coding apparatus | |
EP0415853B1 (en) | Digital data transmission system having error detecting and correcting function | |
US5886654A (en) | Apparatus and method for decoding data using flags to indicate decoding errors in data rows and columns | |
JPH0442874B2 (en) | ||
JPH0523113B2 (en) | ||
JPS6133417B2 (en) | ||
EP0390576A1 (en) | Recording/reproducing apparatus | |
CA1310108C (en) | Apparatus for processing digital data | |
CA1171930A (en) | Pcm signal processing apparatus | |
GB2392575A (en) | Reproduced signal processor for arbitrary reproducing speed | |
US6990286B1 (en) | Reproduced signal processor | |
EP0398651B1 (en) | Device for processing transmitted digital video signal | |
US5519504A (en) | Method of storing or reproducing data packets | |
JPS62155684A (en) | Method and apparatus for reproducing video signal recorded on magnetic tape with speed different from tape speed at thetime of recording | |
US5479265A (en) | Video data recording apparatus for digital video cassette recorder | |
US6564001B2 (en) | Code multiplexing/reading apparatus for preventing outputting an erroneous code | |
US6483985B1 (en) | Apparatus reproducing signals on slow reproduction | |
EP0500358B1 (en) | Signal processing method of digital VTR | |
KR100799010B1 (en) | Data packet processing method and video recording apparatus | |
JP3118910B2 (en) | Image processing device | |
JP3775525B2 (en) | Decoding device and decoding method | |
JP3301695B2 (en) | Encoded signal decoding device | |
JPH0463579B2 (en) | ||
JPH09330569A (en) | Method and apparatus for reproducing digital signal |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
746 | Register noted 'licences of right' (sect. 46/1977) |
Effective date: 20130617 |
|
PCNP | Patent ceased through non-payment of renewal fee |
Effective date: 20140706 |