AU644220B2 - Automatic transmission system multi-channel scheduling - Google Patents

Description

644 22 0

AUSTRALIA

PATENTS ACT 1990 COMPLETE SPECIFICATION FOR A STANDARD PATENT

ORIGINAL

S F Ref: 190929 oo •o ease* .0o.

0000 .0o, Name and Address of Applicant: Actual Inventor(s): AddresR for Service: Invention Title: Sony (Australia) Pty Limited 33-39 Talavera Road North Ryde New South Wales 2113

AUSTRALIA

Neil Witheridge and Tapas Kumar Debray Spruson Ferguson, Patent Attorneys Level 33 St Martins Tower, 31 Market Street Sydney, New South Wales, 2000, Australia Automatic Transmission System Multi-Channel Scheduling o• 0 ASSOCIATED PROVISIONAL APPLICATION DETAILS [31] Application No(s) [33] Country [32] Application Date PK2987 AU 23 October 1990 The following statement is a full description of this invention, including the best method of performing it known to me/us:- The present invention relates to automatic transmission systems and, in particular, to multi-channel transmission of audio/video material from a single automatic transmission system.

Although the present invention will be described in relation to television, the invention is not limited thereto and can also find application in radio broadcasting.

BACKGROUND ART With the advent of television networking, and in particular broadcasting of a common core program from a network studio to several regions or regional transmitters, a need has arisen for the transmission from a single studio of different sequences of play items simultaneously. This need arises in tk following way. The network transmits a core programme of entertainment to transmitters servicing each region of the network simultaneously. However, each region of the network is based around a major population centre and its hinterland. As a result, the viewers of each region constitute separate markets for some types of advertisements. Thus during commercial breaks, local age advertisers wish to have their advertisement displayed within their own region, but not also displayed within any of the other regions in the network.

As a consequence of this need, it is necessary for different advertisements to be displayed in each of the different regions in the network. Since each advertisement is rot of an identical duration, it is necessary for the advertisements to be carefully scheduled in order that the commercial break at each station be of Identical duration so that all commercial breaks can commence and finish simultaneously.

Hitherto, this requirement for simultaneous, but different, commercial breaks has been met by the network studio having a single channel automatic transmission system (ATS) for each region which arranges for the sequential transmission of each of the advertisements which is to be displayed during the commercial break.

However, such automatic transmission systems are relatively expensive pieces of equipment (A$250,000 A$1,O00,000) including as they do an elaborate cartridge storage and retrieval system, and at least two and typically four VCR's which play respective cassettes in the sequence of advertisements.

In order to reduce overall costs in the network, it would be desirable to have a multi-channel automatic transmission system which HRF/0400o -3could simultaneously broadcast different sequences of advertisements for each of the regions in the network during a network wide commercial break. Thus the central network studio need posses fewer ATS's to service the number of regions.

OBJECT OF THE INVENTION It is an object of the present invention to reduce the abovementioned network costs by the provision of a method of scheduling a multi-channel play list for a multi-channel automatic transmission system.

SUMMARY OF THE INVENTION In accordance with the present invention there is disclosed a method of determining the feasibility of merging a plurality of playlists each for a single channel and of equal length into a single playlist for simultaneous multi-channel transmission, said method comprising the steps of determining the maximum number of cassette changes able to be performed during the playlist length and checking that the required number of cassette changes is less than or equal to said maximum number, and, if so, checking that for each event for each channel other than the first event, the sum of the cumulative thread, cue and pre-roll times, and the elevator movement times is less than or equal to the sum of the total event durations including the event being checked less the total of the previous event durations for that channel, and, if so, merging is feasible.

f e: eBRIEF DESCRIPTION OF THE DRAWINGS o.

An embodiment of the present invention will now be described with reference to the drawings in which: i* Fig. 1 is a schematic representation of the prior art arrangement where a single network studio services a number of regions, Fig. 2 is a representation similar to Fig. 1 but for the arrangement of the preferred embodiment, Fig. 3 is a block diagram of the apparatus which enables multichannel operation by an automatic transmission system (ATS), Fig. 4 is a flowchart showing the sequence of operations for the necessary scheduling, and Fig. 5 is a timing diagram.

DETAILED DESCRIPTION Fig. 1 illustrates the prior art arrangement in which a single network studio 100 services a number of regions each of which has its own 1 local regional transmitter 101, 102, 103, and so on. The programme for each of the regional transmitters 101-103 is determined by a HRF/0400o 0 -wts^ corresponding single channel automatic transmission system (ATS) 111, 112, 113 and so on. As each ATS costs A$250,000 A$1,000,000, the capital costs associated with the central network studio 100 have hitherto been very high.

The corresponding arrangement in accordance with the preferred embodiment is illustrated in Fig. 2. Here it will be seen that the central network studio 100 utilizes only a single multi-channel ATS 1 which is able to determine the pg,'gmnime for each of the regional transmitters 101-103 simultaneously.

Referring now to Fig. 3, the automatic transmission system (ATS) 1 of the preferred embodiment is illustrated schematically. Included within the ATS 1 is a cartridge access and retrieval (CAR) device 2 which is essentially conventional and consists of an array of n rows and m columns of cartridge storage locations and a transport mechanism (not illustrated). The transport mechanism is able to retrieve a cartridge from a nominated storage position and enter it into one of a number of VCRs, VCRa-VCRJ in order to enable the VCR to play the contents of the •e cartridge. At the end of the cartridge playing time, the cartridge is S.e, able to be removed from the VCR and returned to its storage location by the transport mechanism.

A conventional ATS has only a small number of VCRs (typically at least two such as VCRa and VCRb). Normally four VCR's would be used but the minimum number of VCR's which must be present is that which will guarantee uninterrupted transmission of advertisements of a fixed minimum duration. These VCR's play consecutive cartridges in a sequence of advertisements.

Since the ATS 1 of the preferred embodiment is intended for multi-channel operation there are further VCR's required to provide uninterrupted transmission assuming the same minimum advertisement duration. These VCRs are indicated as VCRa to VCRi. The CAR device 2 and VCR's are under the control of an ATS controller 3.

In order to arrange for the necessary control and sequencing of the ATS 1, a control computer 6 (which preferably takes the form of a small personal computer), and a time and control code generator (TCG) 7 are provided. This time code generator is accurate to at least the time of one frame of a television signal and provides a synchronizing signal to both the control computer 6 and the ATS 3. In addition, the control computer 6 is able to receive inputs from any one or more of a host HRF/0400o computer 8, a floppy disc 9 and a keyboard A push button panel 13 is also provided for manual control of multi-channel transmission. This is achieved by the connection of the both the push button panel 13 and the computer 6 to respective inputs of a switch 14. The output of the switch 14 is connected to the ATS controller 3 via an interface 15 which converts the parallel output of the switch 14 into a serial input for the ATS controller 3. Should the ATS controller 3 include a parallel Input/output port, the interface would not be required.

In addition, the interface 15 receives data from the ATS controller 3 and sends it to both the control computer 6 and push button panel 13 for the purpose of logging and display of the current state of the ATS 1 on the push button panel 13, for example by tally signals.

Turning now to Fig. 4, a flowchart of the scheduling arrangements is illustrated. The flowchart is of generally Y-shaped configuration.

The top righthand arm of the Y deals with the keyboard entry of data, and the upper lefthand arm of the Y of the flowchart deals with the host computer or floppy disk transfer of data. This data in both instances relates to the playlist for each commercial break for each of the channels or stations of the network. The entry via the keyboard allows the incremental checking on an event by event basis as the playlist data is entered. It is necessary to determine that the sum of the play durations of each play item of the sequence of each channel, is identical to the total duration of the playlist. That is to say it is not possible for channel A to play two commercials each of 90 seconds duration"whilst channel B, for example, plays two 60 second commercials I and one 90 second c m since the commercial break on channel B would then be of a different duration from the commercial break on channel A.

Most importantly, since the CAR device 2 of Fig. 3 has a finite access time for the removal and retrieval of cartridges, it is also necessary to ensure that the sum of the access time and cassette movement time(s) of each play item is less than the duration of the preceeding play items in the sequence so as not prevent uninterruped transmission of the sequence of advertisements for each channel.

In order to understand this further requirement which must also be met, reference is made to Fig. 5 which is a timing diagram which sets out the VCR activity during a commercial break and also that of the transport HRF/0400o of the CAR device 2.

In Fig. 5, unemphasized horizontal line segments represent commercial playback, dotted small segments represent the sum of post-roll time rewind time eject time, bold line segments (ET) represent elevator cassette movement time for changing the cassette, and bold broken line segments represent the sum of thread time cue time pre-roll time.

The following assumptions are made: 1) The time slot is an amount of time into which the whole commercial break is hypothetically graduated. That is, the minimum possible duration of a single advertisement.

2) The commercial break is hypothetically calibrated in terms of N time slots of T such that CM Break N.T seconds. The commercial units or advertisement durations of channel A and channel B

S

15 belonging to the same group of time slots are arranged to be of equal duration.

0400 3) VCRI, VCR2 and VCR3 are used for channel A, VCR4, VCR5 and VCR6 are used for channel B.

4) If two channels are supported by the prior art ATS machine maintaining assumption and channel B is very likely to be delayed due to belated service by the elevator (or transport mechanism).

5) Variation of Elevator Service Time (ET) around average elevator service time is negligible.

6) In mathematical expressions, CMn represents the duration of the advertisement or commercial &*goo uni-t An odd subscript means it is an event for channel A.

An even subscript means it is an event for channel B.

If under some conditions, it can be guaranteed that B channel is not delayed, it can be practically guaranteed that under those conditions, dual channel operation can be achieved.

In order to derive the constraints which will guarantee that all channel B events commence at the correct time, the worst case should be analysed to guarantee that the worst case is still feasible.

The worst case situation occurs when all commercial units are of a duration of one time slot. That is, all the advertisements are of the minimum possible duration. Under these conditions the transport mechanism elevator is under maximum load.

HRF/0400o Fig. 5 depicts this worst case situation as the commercial units are each equal to the length of the time slot. A more relaxed playlist would contain some corresponding commercial units of channel A and channel B as multiples of the time slot In order to start a CM unit at the correct time, its preparation time must be less than or equal to the available time gap.

Considering the worst case, in order to guarantee correct commencement of the 4th CM unit, the following inequality must be observed.

R 2 ETmax+ C 2 T (1) Similarly for the 5th CM unit 15 R 4 ETmax C 2 3 T (2) and for the 6th CM unit *R 6 ETma C 3 4 T (3) *.max 3 In general therefore, in order to guarantee correct commencement of the (i+l)th CM unit, the following Inequality must hold true for 3 i N).

R 2 (1 2) ETmax C 1 2 s (i 1) T (4) (i 1) T (R Ci 2 i.e. ETm x max So, lim ETmax lim i->oo i->oo Hence 2 (i 2) (i 1) T (R C1- 2 2 (i-2) Emax

T

2 HRF/0400o Therefore, in order to support the worst case, the minimum commercial unit duration should be greater than or equal to the twice maximum elevator service time. If the maximum elevator service time is sec, then a worst case with all commercial units of 30 sec. duration can be guaranteed for dual channel transmission.

If a commercial break is calibrated in terms of N time slots (T) then the maximum No of cassette changes which can be achieved in timeslots is given by R n ETmax CN- 3 (N 2) T i.e. n ETmax (N 2) T (R+CN 3 T-(R+C 3 n-3 15 i.e. n

ET

ETmax CMBreak (R+CN 3 2 T so n ETmax ETmax CMBreak-(R+CN_ 3 i.e. n 4 by using T 2 ETmax s eETmax

C

.max CMBreak-(Rmin+Cmin) Hence n 4 max ETmax

*S*

For a dual channel playlist, the maximum no. of allowable cassette changes for a given commercial break can be computed using equation above. From the dual channel playlist the required no. of cassette changes for the same commercial break can also be determined.

For all dual channel commercial breaks, the following inequality must be maintained.

Required No. of cassette changes Maximum Allowable No. of Cassette changes.

HRF/0400o Inequation is actually valid under the assumptions made in the beginning of this analysis. In a real case, commercial units for both channels can be of different length. The following inequations provide the same property as that of inequation for such a case.

For channel A, in order to start (i+l)th commercial unit correctly (1 2 if n(1) is the total No. of cassette changes which must be done to support both channels within the time gap then, j=1 j=i-2 Rmax n(i) ETmax Cmax CM 2 j- 1 CM2j-_l (6A) j=1 j=1 Similarly. For channel B, in order to start (i+1)th commercial unit correctly (1 2 if n(i) is the total No. of cassette changes which must be done to support both channels within the time gap then, 00 j=i j=i-2 Rm ETma x Cxmax 1 CM 2 CMj (6B) 3j=l j=l In a dual channel playlist, indexing through 1, of the different required n(i) values for every commercial event can be found. By applying inequalities (6A) (6B) for every commercial event on a per channel basis, whether the constraint is maintained, and thus whether it is feasible to start the event correctly, can be determined.

Equation and inequations (6A) (6B) provides a mathematical basis for the development of a two pass check to determine the feasibility of a dual channel playlist.

This theory can be demonstrated with the help of three simple playlists.

HRF/0400o

EVENT

CMO1 CM02 CM03 CM04 CM06 CM07 CMO7 CMO8 CM09 CM11 CM12 PLAYLIST 1

CHANNEL

A

B

DURATION

S

S. S 0* So

S

0 4

S

S.

C

a.

S

o S The duration of playlist 1 is 90 sec.

First check to see if the required no. of cassette change for this sec. commercial break is within its maximum allowable limit.

If the max. value of ET is taken as 10 sec, and the minimum value 25 of is taken as 20 sec (which are quite realistic values), the maximum no. of allowable cassette changes for this commercial break is found to be equal to 3 using equation 20) 10) 4 33.

Playlist 1 requires 6 cassette changes during the commercial break which is greater than the maximum allowable limit of 3. Hence the first pass of the check rejects playlist 1 as not being a feasible playlist.

HRF/04000

EVENT

CM01 CM02 CM03 CM04 CM06 CM07 CMO8 -11- PLAYLIST 2

CHANNEL

A

B

DURATION

0@8e@4 8 4.A 0 sees 4,S as 91 *09 S0 0 9 *c c6 6 @5@6 Sc I I

S

15 Playlist 2 requires 2 cassette changes which is lower than the maximum allowable limit for the same commercial break. Hence the first pass of the check will accept playlist 2. However, in the second pass of the check, inequation (6A) fails to satisfy for I 3. Similarly, inequation (6B) fails for 1 3. Hence the second pass rejects playlist 20 2 as not being a feasible playlist.

PLAYLIST 3 EVENT CHANNEL DURATION CM01 A CM02 B CM03 CM04 CM06 CM07 CMO8 Playlist 3 requires two cassette changes which is lower than the maximum allowable limit for the same commercial break. Hence the first pass of the check accepts this playlist as a valid one. In the second pass, both inequality (6A) (6B) holds true for 1 3 (taking the HRF/0400o -12maximum realistic value of as 40 sec.). As the (i+l)th CM unit is the last CM unit for both channels in the playlist for 1=3, the second pass of the check terminates by accepting playlist 3 as a valid or feasible playlist.

When the above-described procedures have been carried out, a complete schedule of the intended sequence of advertisements is then available and is stored in the ccotrol computer 6. The time code generator 7 provides the timing information necessary to enable the control computer 6 to determine that the commerical break start time has occurred. When this happens, the control computer 6 via the switch 14 and interface 15 triggers the ATS controller 3 thereby commencing the programme simultaneously on each channel. The sequence of events for each channel stored in the control computer 6 then takes place with synchronization being provided by the time code generator 7. As a consequence, the core programme is transmitted to all the channels or stations in the network and at each commercial break, which occurs simultaneously on all channels, a different sequence of advertisements is broadcast for each channel.

In order to cater for various day-to-day operational situations which arise in broadcasting, it is desirable to enable manual instructions to be inserted via the push button panel 13 which can, for example, freeze an image, or result in transmission of a stand-by ',_nnel idencification image. This may be necessary because of a defect in a cartridge which only becomes apparent when thie cartridge actually malfunctions, or because of last minute withdrawal of a previously *el^ scheduled advertisement.

,he foregoing describes only one embodiment of the present invention and modifications, obvious to those skilled in the art, can be made thereto without departing from the scope of the present invention.

HRF/04000

Claims (5)

1. A method of determining the feasiLility of merging a plurality of playlists each for a single channel and of equal length into a single playlist for simultaneous multi-channel transr ion, said method comprising the steps of determining the maximum number of cassette changes able to be performed during the playlist length and checking that the required number of cassette chang'.s is less than or equal to said maximum number, and, if so, checking that for each event for each channel other than the first event, the sum of the cumulative thread, cue and pre-roll times, and the elevator movement times is less than or equal to the sum of the total event durations including C'e event being checked less the total of the previous event durations for that channel, and, if so, merging is feasible.

2. A method as claimed in claim 1 wherein the maximum number of cassette changes able to be performed during the playlist length is determined by adding the sum of the minimum post-roll time, rewind time and eject time to the sum of the minimum thread time, cue time and pre-roll time; subtracting the result thereby obtained from the duration of the commercial break; dividing the result thereby obtained by the maximum elevator service time, and subtracting 4 therefrom. "i

3. A method as claimed in claim 2 wherein numerical values of the thread time, cue time, pre-roll time, post-roll time, rewind time, eject time and elevator service time are selected in accordance with the measured performance of the cartridge access and retrieval device intended to be used for said simultaneous multi-channel transmission.

4. A method as claimed in n'y of claims 1 to 3 wherein said playlists are merged prior to or-: tiun of a multi-channel automatic transmission system.

5. A method of merging a plurality of playlists each for a single channel and of equal length into a single playlist, said method being substantially as described with reference to the drawings. DATED this THIRTIETH day of SEPTEMBER 1993 Sony (Australia) Pty Limited Patent Attorneys for the Applicant SPRUSON FERGUSON H'RF/04000 ABSTRACT The present invention discloses a method of merging playlists each for a single channel for simultaneous transmission over a network by a multi-channel automatic transmission system which replaces the functions previously performed in a network studio (100) by a number of single channel automatic transmission systems (111, 112, 113 corresponding to a number of regional transmitters (101, 102, 103 Any proposed merging is checked before the merged playlist is completed. The checking takes the form of two sequentially applied tests. The first test is that the required number of cassette changes be less than or equal to a calculatable maximum number. The second test is that for each channel, for each event other than the first event on the playlist, the sum of the cummulative thread, cue and pre-roll times and the elevator movement times be less than or equal to the sum of the total event 15 durations including the event being checked less the total of the S previous event durations for that channel. 0 Fig. a O4 9 a HRF/04000