Automatic transmission systems for television and radio broadcasting.

0001This invention relates to automatic transmission systems for television and radio broadcasting.

0002With the advent of television networking, and in particular broadcasting of a common core programme 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 the 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 advertisers wish to have their advertisement displayed within their own region, but not also displayed within any of the other regions in the network.

0003As a consequence, it is necessary for different advertisements to be displayed in each of the different regions in the network. Since the advertisements are not of 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.

0004Hitherto, 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.

0005However, such ATSs are relatively expensive pieces of equipment (A$ 250,000 to A$ 1,000,000) including as they do an elaborate cartridge storage and retrieval system, and at least two and typically four video tape recorders (VTRs) which play respective cassettes in the sequence of advertisements.

0006To reduce overall costs in the network, it would be desirable to have a multi-channel ATS which could 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 ATSs to service the number of regions.

0007According to the present invention there is provided a method 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.

0008The invention will now be described by way of example with reference to the accompanying drawings, throughout which like parts are referred to by like references, and in which: <ul id="ul0001" list-style="none"><li>Figure 1 is a schematic representation of a prior art arrangement where a single network studio services a number of regions;</li><li>Figure 2 is a representation similar to Figure 1 but for the arrangement of the preferred embodiment;</li><li>Figure 3 is a block diagram of the apparatus which enables multi-channel operation by an ATS;</li><li>Figure 4 is a flowchart showing the sequence of operations for the necessary scheduling; and</li><li>Figure 5 is a timing diagram.</li></ul>

0009In the prior art arrangement of Figure 1, a single network studio 100 services a number of regions each of which has its own local regional transmitter 101, 102, 103, and so on. The programme for each of the regional transmitters 101 to 103 is determined by a corresponding single channel ATS 111, 112, 113 and so on. As each ATS costs A$ 250,000 to A$ 1,000,000, the capital costs associated with the central network studio 100 have hitherto been very high.

0010The corresponding arrangement in accordance with the preferred embodiment is illustrated in Figure 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 programme for each of the regional transmitters 101 to 103 simultaneously.

0011Referring now to Figure 3, the 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 generally of known form and comprises 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 VTRs, VTRa-VTRj in order to enable the VTR to play the contents of the cartridge. At the end of the cartridge playing time, the cartridge is removed from the VTR and returned to its storage location by the transport mechanism.

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

0013Since the ATS 1 is intended for multi-channel operation there are further VTRs required to provided uninterrupted transmission assuming the same minimum advertisement duration. These VTRs are indicated as VTRa to VTRi. The CAR device 2 and VTRs are under the control of an ATS controller 3.

0014To 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. The TCG 7 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 controller 3. In addition, the control computer 6 is able to receive inputs from any one or more of a host computer 8, a floppy disc 9 and a keyboard 10.

0015A push button panel 13 is also provided for manual control of multi-channel transmission. This is achieved by the connection of 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 15 would not be required.

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

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

0018The 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 disc transfer of data. These data in both instances relate to the playlist for each commercial break for each of the channels or stations of the network. The entry via the keyboard 10 allows the incremental checking on an event by event basis as the playlist data are entered. It is necessary to determine that the sum of the play duration 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 and one 90 second commercial since the commercial break on channel B would then be of a different duration from the commercial break on channel A.

0019Most importantly, since the CAR device 2 of Figure 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 times(s) of each play item is less than the duration of the preceding play items in the sequence so as not to prevent uninterrupted transmission of the sequence of advertisements for each channel.

0020To understand this further requirement which must also be met, reference is made to Figure 5 which is a timing diagram which sets out the VTR activity during a commercial break, and also that of the transport mechanism of the CAR device 2.

0021In Figure 5, unemphasized horizontal line segments represent commercial playback, dotted small segments (R) 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 (C) represent the sum of thread time + cue time + pre-roll time.

0022The following assumptions are made: <ul id="ul0002" list-style="none"><li>1) The time slot (T) is an amount of time into which the whole commercial break is hypothetically set. That is, the minimum possible duration of a single advertisement.</li><li>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 advertisements durations of channel A and channel B belonging to the same group of time slots are arranged to be of equal duration.</li><li>3) VTR1, VTR2 and VTR3 are used for channel A, VTR4, VTR5 and VTR6 are used for channel B.</li><li>4) If two channels are supported by the known ATS machine maintaining assumption (2) and (3), channel B is very likely to be delayed due to belated service by the elevator (or transport mechanism).</li><li>5) Variation of elevator service time (ET) around average elevator service time is negligible.</li><li>6) In mathematical expressions, CM_n represents the duration of the advertisement or commercial unit. An odd subscript means it is an event for channel A. An even subscript means it is an even for channel B.</li></ul>

0023If 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.

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

0025The 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.

0026Figure 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 (T).

0027To start a CM unit at the correct time, its preparation time must be less than or equal to the available time gap.

0028Considering the worst case, in order to guarantee correct commencement of the 4th CM unit, the following inequality must be observed: <maths id="math0001" num=""><math display="inline"><mrow><msub><mrow><mtext>R + 2 ET</mtext></mrow><mrow><mtext>max</mtext></mrow></msub><mtext> + C₁ ≦ 2 T   (1)</mtext></mrow></math><img file="EP0482802A2_D0001.tif" /></maths>

0029Similarly for the 5th CM unit <maths id="math0002" num=""><math display="inline"><mrow><msub><mrow><mtext>R + 4 ET</mtext></mrow><mrow><mtext>max</mtext></mrow></msub><mtext> + C₂ ≦ 3 T   (2)</mtext></mrow></math><img file="EP0482802A2_D0002.tif" /></maths>    and for the 6th CM unit <maths id="math0003" num=""><math display="inline"><mrow><msub><mrow><mtext>R + 6 ET</mtext></mrow><mrow><mtext>max</mtext></mrow></msub><mtext> + C₃ ≦ 4 T   (3)</mtext></mrow></math><img file="EP0482802A2_D0003.tif" /></maths>

0030In general therefore, in order to guarantee correct commencement of the i=1)th CM unit, the following inequality must hold true for (3 ≦ i ≦ N). <maths id="math0004" num=""><math display="inline"><mrow><msub><mrow><mtext>R + 2 (i - 2) ET</mtext></mrow><mrow><mtext>max</mtext></mrow></msub><msub><mrow><mtext> + C</mtext></mrow><mrow><mtext>i-2</mtext></mrow></msub><mtext> ≦ (i - 1) T   (4)</mtext></mrow></math><img file="EP0482802A2_D0004.tif" /></maths><maths id="math0005" num=""><img file="EP0482802A2_D0005.tif" /></maths>

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

0032If a commercial break is calibrated in terms of N time slots (T) then the maximum No of cassette changes (n), which can be achieved in (N-1) timeslots is given by:<maths id="math0006" num=""><img file="EP0482802A2_D0006.tif" /></maths>

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

0034For all dual channel commercial breaks, the following inequality must be maintained: Required number of cassette changes ≦ Maximum allowable number of cassette changes.

0035Inequality (4) 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 inequalities provide the same property as that of inequality (4) for such a case.

0036For channel A, in order to start (i + 1)th commercial unit correctly (i ≧ 3), if n(i) is the total number of cassette changes which must be done to support both channels within the time gap then:<maths id="math0007" num=""><img file="EP0482802A2_D0007.tif" /></maths>

0037Similarly, for channel B, in order to start (i + 1)th commercial unit correctly (i ≧ 3), if n(i) is the total number of cassette changes which must be done to support both channels within the time gap then;<maths id="math0008" num=""><img file="EP0482802A2_D0008.tif" /></maths>

0038In a dual channel playlist, indexing to i, the different required n(i) values for every commercial event can be found. By applying inequalities (6A) and (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.

0039Equation (5) and inequalities (6A) and (6B) provide a mathematical basis for the development of a two-pass check to determine the feasibility of a dual channel playlist.

0040This theory can be demonstrated with the help of three simple playlists. <tables id="tabl0001" num="0001"><table frame="all"><tgroup cols="3" colsep="1" rowsep="0"><colspec colnum="1" colname="col1" colwidth="52.50mm" /><colspec colnum="2" colname="col2" colwidth="52.50mm" /><colspec colnum="3" colname="col3" colwidth="52.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col3" align="center">PLAYLIST 1</entry></row><row><entry namest="col1" nameend="col1" align="center">EVENT</entry><entry namest="col2" nameend="col2" align="center">CHANNEL</entry><entry namest="col3" nameend="col3" align="center">DURATION</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left">CM01</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM02</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM03</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row><entry namest="col1" nameend="col1" align="left">CM04</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row><entry namest="col1" nameend="col1" align="left">CM05</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">10</entry></row><row><entry namest="col1" nameend="col1" align="left">CM06</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">10</entry></row><row><entry namest="col1" nameend="col1" align="left">CM07</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">10</entry></row><row><entry namest="col1" nameend="col1" align="left">CM08</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">10</entry></row><row><entry namest="col1" nameend="col1" align="left">CM09</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM10</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM11</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">10</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">CM12</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">10</entry></row></tbody></tgroup></table></tables>

0041The duration of playlist 1 is 90 sec.

0042First check to see if the required number of cassette changes for this 90 sec. commercial break is within its maximum allowable limit.

0043If the maximum value of ET is taken as 10 sec, and the minimum value of (R+C) is taken as 20 sec (which are quite realistic values), the maximum number of allowable cassette changes for this commercial break is found to be equal to three using equation (5)[((90 - 20) / 10) - 4 = 3].

0044Playlist 1 requires six cassette changes during the commercial break which is greater than the maximum allowable limit of three. Hence the first pass of the check rejects playlist 1 as not being a feasible playlist. <tables id="tabl0002" num="0002"><table frame="all"><tgroup cols="3" colsep="1" rowsep="0"><colspec colnum="1" colname="col1" colwidth="52.50mm" /><colspec colnum="2" colname="col2" colwidth="52.50mm" /><colspec colnum="3" colname="col3" colwidth="52.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col3" align="center">PLAYLIST 2</entry></row><row><entry namest="col1" nameend="col1" align="center">EVENT</entry><entry namest="col2" nameend="col2" align="center">CHANNEL</entry><entry namest="col3" nameend="col3" align="center">DURATION</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left">CM01</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row><entry namest="col1" nameend="col1" align="left">CM02</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row><entry namest="col1" nameend="col1" align="left">CM03</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM04</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM05</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM06</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM07</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">CM08</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">30</entry></row></tbody></tgroup></table></tables>

0045Playlist 2 requires two 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, inequality (6A) fails to satisfy for i = 3. Similarly, inequality (6B) fails for i = 3. Hence the second pass rejects playlist 2 as not being a feasible playlist. <tables id="tabl0003" num="0003"><table frame="all"><tgroup cols="3" colsep="1" rowsep="0"><colspec colnum="1" colname="col1" colwidth="52.50mm" /><colspec colnum="2" colname="col2" colwidth="52.50mm" /><colspec colnum="3" colname="col3" colwidth="52.50mm" /><thead valign="top"><row><entry namest="col1" nameend="col3" align="center">PLAYLIST 3</entry></row><row><entry namest="col1" nameend="col1" align="center">EVENT</entry><entry namest="col2" nameend="col2" align="center">CHANNEL</entry><entry namest="col3" nameend="col3" align="center">DURATION</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left">CM01</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM02</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="left">CM03</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row><entry namest="col1" nameend="col1" align="left">CM04</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row><entry namest="col1" nameend="col1" align="left">CM05</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row><entry namest="col1" nameend="col1" align="left">CM06</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">30</entry></row><row><entry namest="col1" nameend="col1" align="left">CM07</entry><entry namest="col2" nameend="col2" align="left">A</entry><entry namest="col3" nameend="col3" align="right">15</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">CM08</entry><entry namest="col2" nameend="col2" align="left">B</entry><entry namest="col3" nameend="col3" align="right">15</entry></row></tbody></tgroup></table></tables>

0046Playlist 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) and (6B) holds true for i = 3 (taking the maximum realistic value of (R+C) as 40 sec.). As the (1+1)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.

0047When 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 control computer 6. The time code generator 7 provides the timing information necessary to enable the control computer 6 to determine that the commercial 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 of each channel stored in the control computer 6 then takes place with synchronization being provided by the TCG 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.

0048In 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 channel identification image. This may be necessary because of a defect in a cartridge which only becomes apparent when the cartridge actually malfunctions, or because of last minute withdrawal of a previously scheduled advertisement.

0049The invention is also applicable to radio broadcasting.