JP3629076B2 - Broadcast center - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a broadcast center with a request response function that sequentially broadcasts broadcast information according to a broadcast request made individually by a viewer using a telephone line in a predetermined order.
[0002]
[Prior art and problems to be solved by the invention]
Currently, a new form of TV broadcasting called interactive television is becoming widespread between local television broadcasting centers such as CATV systems and subscriber terminals. However, these are generally video-on-demand (VOD) viewers, which are different from a system that delivers videos as if they were watching a favorite video on their home video deck. It is not out of the "broadcast" frame to send out. In other words, this is a limited interactive television system in which broadcast requests individually made by viewers are accumulated, and broadcast information corresponding to the broadcast requests is sequentially broadcast in a predetermined order.
[0003]
The television broadcast center in such a system temporarily accumulates broadcast requests from viewers coming one after another, and broadcasts information for broadcasting so that the request time is earlier, Of course, in such a form, there occurs a situation in which the speed of the broadcast request from the viewer exceeds the speed of broadcasting / digesting the broadcast information according to the request. Then, the broadcast requests are accumulated, and the waiting time of the requested viewer is increased.
[0004]
By the way, even if it is such a form, if it is a program time frame (or a dedicated channel provided) that handles only broadcasting of karaoke music called a karaoke program, etc. The problem shrinks. In the case of karaoke, the time required for one song is about several minutes. If the number of requests is small, the waiting time will not be so long.
[0005]
However, even if it is a karaoke program in such a request response type broadcasting system, if the same song is requested continuously, if the same song is broadcast in the order received, the same song will continue. It will be broadcast. The request response type is viewed not only by the requester but also by others. Therefore, the performance of the same song continuously causes discomfort for all viewers of the karaoke program.
[0006]
Note that this is not limited to television broadcasting such as CATV, but the same problem can be considered for radio broadcasting or other broadcasting.
The present invention has been made to solve the above-described problems, and prevents the same broadcasting information from being continuously broadcast, eliminates viewer discomfort, and makes it possible to operate the broadcasting system appropriately. It aims to plan.
[0007]
[Means for Solving the Problems and Effects of the Invention]
The broadcasting center according to claim 1, which is made to achieve this object,
Reservation order storage means for storing a plurality of broadcast requests individually made by viewers so that the broadcast is basically transmitted earlier as the request time is earlier,
Broadcasting means for broadcasting broadcast information corresponding to the corresponding broadcast request in accordance with the reservation order stored in the reservation order storage means;
In a broadcast center with a request response function with
The broadcast request of the new reservation candidate from the viewer determines whether the already stored reservation order is the same as the last broadcast request, and if it is not the same broadcast request, it makes a new reservation in the normal order. In the case of the same broadcast request, replace the broadcast request with the last reservation order with the broadcast request with the earlier reservation order, or insert it before and make a new reservation, or make a new reservation. New reservation control means is provided for inserting a candidate broadcast request before a broadcast request whose reservation order is earlier than the last broadcast request and making a new reservation.
[0008]
According to the broadcast center of the present invention, the reservation order storage means stores broadcast requests made individually by viewers. Then, the broadcasting means broadcasts the broadcast information corresponding to the corresponding broadcast request sequentially according to the reservation order stored in the reservation order storage means. In this way, the basic broadcast processing is executed. Here, the following processing related to reservation is executed.
[0009]
That is, the new reservation control means determines whether or not the already stored reservation order is the same as the last broadcast request, and if it is not the same broadcast request, makes a new reservation in the normal order. On the other hand, if the broadcast requests are the same, one of the following (1) and (2) is performed.
[0010]
(1) The broadcast request with the last reservation order is replaced with the broadcast request with the earlier reservation order or inserted before it and a new reservation is made.
(2) A new reservation candidate broadcast request is inserted in front of a broadcast request whose reservation order is earlier than the last broadcast request.
[0011]
In other words, if the broadcast request to be newly reserved is the same as the last broadcast request at that time, if the new reservation is made as it is, the same broadcast request will continue. In order to avoid this, new reservation processing is performed by rearranging the reservation order.
[0012]
For example, when broadcast requests are reserved in the order of 1 → 2 → 3 → 4, if 5 is continuously reserved, the broadcast requests of 4 and 5 will be the same. In the case of (1) above, “4”, which is the last broadcast request in the reservation order, is moved. For example, it replaces with a broadcast request whose reservation order is earlier than that of “4” (that is, one of 1, 2, and 3) or inserts it before that, and newly reserves 5.
[0013]
(1) When replacing with “1”, the reservation order is 4 → 2 → 3 → 1 → 5.
(2) When replacing with “2”, the reservation order is 1 → 4 → 3 → 2 → 5.
(3) When replacing with “3”, the reservation order becomes 1 → 2 → 4 → 3 → 5.
{Circle around (4)} When inserting before “1”, the reservation order is 4 → 1 → 2 → 3 → 5.
[0014]
{Circle around (5)} When inserting before “2”, the reservation order is 1 → 4 → 2 → 3 → 5.
{Circle around (6)} When inserting before “3”, the reservation order is 1 → 2 → 4 → 3 → 5.
In any of the cases (1) to (6), the reservation order of “4” and “5” is not continuous.
On the other hand, in the case of (2) above, “5” which is a broadcast request for a new reservation candidate is a broadcast request whose reservation order is earlier than “4” which is the last broadcast request (that is, 1, 2). , 3) before the new reservation.
[0015]
{Circle around (1)} When inserting before “1”, the reservation order is 5 → 1 → 2 → 3 → 4.
{Circle around (2)} When inserting before “2”, the reservation order is 1 → 5 → 2 → 3 → 4.
{Circle around (3)} When inserting before “3”, the reservation order is 1 → 2 → 5 → 3 → 4.
In any of the cases (1) to (3), the reservation order of “4” and “5” is not continuous.
[0016]
In this way, the replacement or insertion target may be the previous one or two or more previous ones. Thereby, it is prohibited to continuously make new reservations for the same broadcast request, and the same broadcast information is prevented from being continuously broadcast. As a result, it is possible to eliminate the viewer's discomfort and to appropriately operate the broadcasting system.
[0017]
Regarding the replacement control by the new reservation control means, as shown in claim 2, even if the broadcast request of the new reservation candidate is the same as the last broadcast request in the reservation order, the broadcast request in the last reservation order Or, when the broadcast request of the new reservation candidate is the same as the broadcast request to be replaced, and when the reservation order when the replacement or insertion is performed is the same as one of the previous and subsequent broadcast requests, the replacement or insertion process is performed. It is preferable not to execute. This is because even in this case, the same broadcast request will be continued after all.
[0018]
In addition, as described above, the replacement or insertion target may be the previous one or two or more previous ones, but it is combined with the control that does not execute the replacement process when the replacement or insertion target broadcast request is the same. You may do as follows. In other words, it is first determined whether the previous broadcast request is to be replaced or inserted and whether the broadcast request is continuous. If so, the next previous broadcast request is to be replaced or inserted as a broadcast request. For example, it may be determined whether or not the broadcast request that can be replaced or inserted is sequentially changed or the insertion target is changed until the broadcast request that can be replaced or inserted is found.
[0019]
In addition, any broadcast request is not subject to replacement or insertion, but has a predetermined appropriate condition. That is, broadcasting by broadcasting means has not yet started. Therefore, as shown in claim 3, for a broadcast request corresponding to broadcast information that is being broadcast by the broadcast means or has been broadcast, the reservation order by the new reservation control means is replaced with the last broadcast request. It is preferable to exclude them. For example, the broadcast request itself may be deleted from the reservation order storage means, or an identification flag may be set so as not to be used for determination of replacement or insertion target.
[0020]
On the other hand, when receiving a broadcast request from a viewer, it can be considered to be performed via a telephone line, for example. At that time, as shown in claim 4, predetermined guidance voice information is transmitted to the viewer side via a telephone line, and viewer identification information, broadcast request content identification information, etc. are returned as a response to the guidance voice information. You may make it receive. For example, it has a voice response function that automatically receives a call from a viewer and provides guidance by electronic voice, and a code reception function that receives a transmission of a code using a dial tone by the telephone. It is convenient to input the karaoke song number or viewer identification number requested by the viewer as a broadcast request, for example, with a push button, and receive it as a code using a dial tone. .
[0021]
As information for broadcasting broadcast from the broadcasting center, for example, information for karaoke can be considered. In this case, as shown in claim 5, the broadcasting means is a television broadcasting means capable of transmitting audio information and video information, and the broadcasting information broadcast by the broadcasting means corresponds to the requested karaoke song. It is conceivable to include a karaoke performance sound and a video in which lyrics telop is synthesized with a background video.
[0022]
Of course, even if only the karaoke performance sound is broadcast as broadcast information, it will be established as a karaoke, but it is common sense that the current karaoke no longer displays a video in which lyrics telop is combined with the background video along with the karaoke performance. Therefore, it can be said that it is preferable to broadcast broadcasting information including a karaoke performance sound and a video in which a lyrics telop is synthesized with a background video. In this case, the broadcasting center and the subscriber terminal may be connected by wire as in the so-called CATV, or may remain wireless as in a normal broadcasting system. Furthermore, there may be cases where only video information is used.
[0023]
DETAILED DESCRIPTION OF THE INVENTION
An embodiment embodying a broadcasting center of the present invention will be described below with reference to the drawings.
FIG. 1 is a block diagram showing a schematic configuration of a broadcast center 10 of the present embodiment. As shown in FIG. 1, the broadcast center 10 includes a host computer 11 corresponding to “new reservation control means”, an external storage device 12, a display device 13, a karaoke playback device 14, and a broadcast as “broadcast means”. Means 16 and a voice response device 20 are provided. The broadcast center 10 is connected to a large number of subscriber telephones 50 through a public telephone line 40.
[0024]
Each component device will be described including the role in the broadcast center 10 and the relationship with the broadcast system.
First, the audio response device 20 is for receiving a broadcast request from a viewer and responding with information related to a broadcast start schedule of broadcast information corresponding to the broadcast request as audio information. The broadcast center 10 stores broadcast requests individually made by viewers, and sequentially broadcasts broadcast information corresponding to the broadcast requests (in this embodiment, information for karaoke). Although it has a response function, the viewer can watch the television receiver (not shown) connected to the broadcast center 10 by cable television at home, while using the subscriber telephone 50 on hand. A request for broadcasting of desired karaoke information is made through a general public telephone line 40. This broadcast request is made by a predetermined “request code”. This is synonymous with “song number” in a general karaoke apparatus only for providing karaoke viewing. Since the request is based on a numeric code, the viewer actually sends a tone to the request code by dialing the subscriber telephone 50 or pushing down a push phone. It is assumed that this request code is notified to the viewer in advance by a distributed material or the like.
[0025]
The call from the viewer is automatically accepted by the voice response device 20 at the broadcast center 10. The voice response device 20 sends a pre-registered message by a built-in synthesized voice means (not shown), and prompts the viewer to input a request code and provide guidance thereof, and is controlled by the host computer 11. From receiving the above call and sending a message to receiving a pulse code.
[0026]
The request code received by the voice response device 20 is determined by the host computer 11 by checking with the database on the external storage device 12 whether the code is valid, and is valid and satisfies a predetermined condition. If so, it is stored in the CPU memory 11b (see FIG. 2) in the host computer 11. The CPU memory 11b corresponds to “reservation order storage means”.
[0027]
The host computer 11 creates a request execution table (see FIG. 3) based on the accumulated request code and the database in the external storage device 12, and the request code accumulated in the order according to the request execution table is reproduced by karaoke. It is passed to the device 14 and karaoke performance is executed.
[0028]
The karaoke playback device 14 of this embodiment can play back a karaoke performance sound and a background video in which lyrics telops are synthesized. Therefore, the broadcasting means 16 is a television broadcasting means. In view of the gist of the invention, since there is no need for video, the karaoke playback device 14 plays back only the karaoke performance sound, and the broadcast means 16 may be so-called radio broadcast means.
[0029]
The broadcast content broadcast by the broadcast means 16 is received by a receiving facility such as a television receiver on the viewer side and can be viewed as a karaoke program. Note that the broadcasting center 10 and the receiving facility on the viewer side may be connected by wire as in the CATV system, or may be wireless as in the normal broadcasting system.
[0030]
The display device 13 is connected to the host computer 11 and can display these conditions. This is used for confirmation by the operator of the broadcast center 10.
Next, with reference to FIG. 2, a signal flow centered on the host computer 11 will be described.
[0031]
As shown in FIG. 2, the voice response device 20 is connected to the CPU 11a of the host computer 11 by a control signal. The CPU 11a performs control related to waiting for an incoming call on the public telephone line 40 (see FIG. 1) to the voice response device 20, and control related to voice message transmission within the same device 20 after the incoming call (selection among a plurality of messages). . The voice response device 20 returns the dial pulse received through the public telephone line 40 to the host computer 11 as numerical information. Thus, the viewer request is automatically received through the public telephone line 40. The numerical value returned from the voice response device 20 is stored in the CPU memory 11b.
[0032]
The external storage device 12 is an external storage of the host computer 11 in which a database regarding request codes is stored, and data is read and written between the devices. Thus, the CPU 11a performs request code search / collation and log storage.
[0033]
The karaoke playback device 14 is connected to the CPU 11a by a control signal. The CPU 11a transmits a request code (song number), causes the device 14 to play back the karaoke music, and controls the start and end of this playback. It can be carried out. Further, the karaoke playback device 14 returns the playback status (during playback, playback end, etc.) to the CPU 11a. Thereby, the CPU 11a can reproduce the karaoke music piece by the request code.
[0034]
Next, the operation of the broadcast center 10 of this embodiment will be described with reference to the drawings.
8 to 11 are flowcharts showing the processing procedure of the program executed by the CPU 11a, and FIGS. 3 to 7 are data structure diagrams handled by this program. Details of the processing flow will be described below. 8 to 10 are flowcharts of the automatic request reception / reservation process, and FIG. 11 is a flowchart of the request reproduction process. These processes are so-called multitask processes that operate independently at the same time.
[0035]
First, automatic request reception / reservation processing (FIGS. 8 to 10) will be described.
This process shows an automatic reception of a request from the subscriber side through the public telephone line 40 and a reservation procedure for the request to the CPU memory 11b. The subscriber does not simply mean that the broadcast from the broadcasting center 10 can be received, but means that the subscriber has the right to make a request. For example, in a CATV system, when a request right is automatically given when subscribing to the system, all of them become subscribers. When broadcasting in a normal wireless format, for example, it is conceivable to separately make a contract for collecting a predetermined fee instead of making a request. In that case, only the person who made the contract becomes the subscriber.
[0036]
First, in step S100 shown in FIG. 8, the voice response device 20 is controlled so as to be able to receive a call via the public telephone line 40. In the subsequent S110, the apparatus waits for a call from the subscriber telephone 50. . If there is an incoming call (S110: YES), the process proceeds to S120.
[0037]
In S120, the voice response device 20 sends a voice response message (for example, “please enter the subscriber number”) to prompt the user to enter the subscriber number to be received first. Thereafter, in S130, the transmission of the dial pulse from the subscriber telephone 50 is awaited. In S140, the input number is stored in the subscriber code area C3 of the request reception buffer (see FIG. 5) on the CPU memory 11b. This is repeated until all 5-digit subscriber numbers are input (S150).
[0038]
When the 5-digit subscriber number is input (S150: YES), the process proceeds to S160, where it is verified whether the subscriber number is valid. This is done by querying the subscriber database (FIG. 7) on the external storage device 12.
If it is determined that the number is not valid as a result of this collation (S170: NO), a voice message requesting re-entry (for example, “Please re-enter the subscriber number”) is reproduced (S180), and the process goes to S130. Return.
[0039]
If the subscriber number input first or the subscriber number input again is valid (S170: YES), the process proceeds to S190 (see FIG. 9).
In S190, a voice response message is transmitted to prompt the input of a request code. In subsequent steps S200 to S220, the transmission of the dial pulse is awaited, and the entered number is stored in the request code area C2 of the request reception buffer (FIG. 5) until all of the 5-digit request code is inputted. repeat.
[0040]
When a 5-digit request code is input (S220: YES), the request code is verified. This is executed by referring to the request database (FIG. 3) on the external storage device 12. In step S140, it is determined whether the number is valid. If it is determined that the number is not valid (S240: NO), the process proceeds to S245 to play a voice message requesting re-input (for example, "Please re-enter the request code"), and return to S200.
[0041]
If the request code input first is valid, or if the request code input again is valid (S240: YES), the process proceeds to S250.
In S250, a voice response message for notifying the viewer that the request is received and newly registered is sent, and in S260, the line is disconnected. Thereafter, the process proceeds to S270 in FIG. 10 to execute specific processing for a new reservation.
[0042]
Here, a request execution table for reserving accepted requests will be described. As shown in FIG. 4, the request execution table is composed of two items, a reproduction flag B1 and a request code B2. A new reservation is made by registering the contents of the request reception buffer (FIG. 5) in the request code area B2 indicated by the reception pointer B5 in the request execution table (FIG. 4). This new reservation is made by copying the request code C2 to the request code area B2 indicated by the reception pointer B5 and setting the reproduction flag B1 to “not yet”. In the initial state, it is assumed that the reproduction flag B1 is all “none” and the request code B2 is an indefinite value.
[0043]
Returning to FIG. 10, in S270, the received date and time is written as a time stamp in the reception time area C1 of the request reception buffer (FIG. 5). When the processing so far is completed, the request reception buffer shown in FIG. 5 has three elements of reception time C1, valid request code C2, and valid subscriber code C3, and the actual request can be accepted. .
[0044]
For this reason, first in S280 to S340, it is determined whether or not a new reservation can be made as it is. In S350, the contents of the request reception buffer (FIG. 5) are newly reserved in the request code area B2 indicated by the reception pointer B5 in the request execution table (FIG. 4). As described above, this new reservation is made by copying the request reception buffer (FIG. 5) request code C2 to the request code area B2 indicated by the reception pointer and setting the reproduction flag B1 to “not yet”.
[0045]
Then, the process of S280-S340 is demonstrated. In order to facilitate understanding of the processing contents here, as shown in FIG. 12A, a case where a request code “01826” is newly reserved at the position of the reception pointer B5 of the request execution table will be described as an example. To do.
[0046]
First, in S280, the request code immediately before the position of the reception pointer B5 is read, and in the subsequent S290, it is determined whether or not it is the same as the request code “01826” to be newly reserved. If they are not the same (S290: NO), the request codes will not be continuous, so the process proceeds to S350 and makes a new reservation.
[0047]
On the other hand, if the determination in S290 is affirmative, that is, if the request code is the same as the previous request code, if a new reservation is made as it is, a continuous request code is reserved. For example, in the case shown in FIG. 12A, the request code “01826” to be newly reserved is the same as the request code “01826” immediately before the position of the reception pointer B5 (indicated by (1) in the figure). Therefore, in this case, if a predetermined condition is satisfied, a new reservation is made by exchanging the previous request code indicated by (1) in the figure and the previous request code indicated by (2) in the figure. Even so, control is performed so that the request codes do not continue.
[0048]
That is, in S300, it is determined whether or not the reproduction flag B1 of the request code immediately before the position of the reception pointer B5 ((1) in the figure) is “middle”. If it is a flag indicating that playback is in progress (S300: YES), the request code cannot be moved. Therefore, the replacement process is also impossible, and in this case, the process proceeds to S350 as it is and a new reservation is executed.
[0049]
On the other hand, if it is not a flag indicating that playback is in progress, that is, in this case “not yet” (S300: NO), the request code can be moved, and the process proceeds to S310. In the case of FIG. 12A, since it is “not yet”, the conditions regarding the replacement destination are determined in the subsequent S310 to S330.
[0050]
First, in S310, the request code two times before (2 in the figure) and three (3 in the figure) before the position of the acceptance pointer B5 is read, and in the following S320, one request code before the position of the acceptance pointer B5 (see FIG. It is determined whether the middle (1) request code is the same as one of the two request codes.
[0051]
If none of them is the same (S320: NO), the process proceeds to S330, and it is determined whether the request code reproduction flag B1 is “medium” two times ((2) in the figure). If this is not being played back (S330: NO), the process proceeds to S340, and the request code immediately before the position of the acceptance pointer B5 (1 in the figure) and the request two times before (2 in the figure). Replace code.
[0052]
In the specific example shown in FIG. 12A, the two request codes read in S310 are “01301” and “03080”, which are one position before the position of the acceptance pointer B5 ((1) in the figure). This is different from the request code “01826”. Also in the determination at S330, the reproduction flag for the request code two before ((2) in the figure) is “not yet”. Therefore, at S340, one position before the position of the acceptance pointer B5 ((1) in the figure). The request code “01826” of (▼) is replaced with “01301” which is the request code of the previous two ((2) in the figure).
[0053]
FIG. 12B shows a request execution table when a new reservation is made after such replacement processing. The order of {circle around (1)} and {circle around (2)} are switched, and a request code “01826” is newly reserved.
Although FIG. 12B shows a table when the replacement process is executed, the replacement process may not be executed depending on the determination results of S320 and S330. This will be described.
[0054]
First, in S320, an affirmative determination is made, that is, the request code immediately before the position of the reception pointer B5 ((1) in the figure) is the same as any one of the request codes two or three before. In some cases, even if the replacement process is performed in S340, the request code is eventually continued. If the previous request code is different from the previous request code but is the same as the previous request code, if a replacement process is executed in S340, the newly reserved request code and its request code Although it is not continuous with the previous request code, this time, the two previous request codes and the three previous request codes will be continuous. In other words, in the request execution table, in order to avoid continuation of the request code when making a new reservation, the inconvenience of causing the request codes that have been reserved earlier to continue to occur is caused. The replacement process was not executed.
[0055]
On the other hand, if the reproduction flag B1 of the request code two previous ((2) in the figure) is “medium” in S330, the replacement process is not executed. This is the same reason as the determination in S300 described above. That is, if the reproduction flag B1 is “medium”, the request code cannot be moved. Therefore, the replacement process is also impossible, so that the process proceeds to S350 and a new reservation is executed. It should be noted that the reproduction flag B1 of the request code two times before ((2) in the figure) may be “medium”. This is because it is not an object to be moved.
[0056]
In this way, the replacement process in S340 is executed only when a condition that allows replacement is satisfied, and then a new reservation in S350 is executed. In other cases, a new reservation is made in S350 without performing the replacement process.
[0057]
After the completion of the new reservation process in S350, the process proceeds to S360, and the acceptance pointer B5 is advanced to the next area on the request execution table (FIG. 4). This operation is reflected in the operation of request reproduction processing (FIG. 11) described later. Further, in subsequent S370, in order to hold the received request as a log, the reception time area D1, the request code area D2, the subscriber code area D3 (FIG. 5) of the request log storage unit (FIG. 6) on the external storage device 12 are stored. Each element is copied to the request reception buffer. Thereafter, the process returns to the incoming call waiting state (S100 in FIG. 8) again, and the subsequent processing is repeated.
[0058]
Next, request reproduction processing (FIG. 11) will be described.
This process shows the procedure for reproducing the request code reserved in the request execution table (FIG. 4) on the CPU memory 11b.
First, in the first step S410, the reproduction flag B1 is extracted from the area indicated by the reproduction pointer B4 in the request execution table (FIG. 4). If the reproduction flag B1 is not “not yet” (S420: NO), all of the reservation contents in the request execution table (FIG. 4) have been reproduced, or the reservation contents are empty. The system waits for a new request reservation (FIG. 8 to FIG. 10) (S430).
[0059]
On the other hand, if the reproduction flag B1 is “not yet”, the process proceeds to S440, and the request code B2 is extracted. Then, in S450, the request code B2 is transferred to the karaoke playback device 14 and a playback instruction is issued. Further, the reproduction flag B1 is changed to “medium” in S460, and the reproduction state of the karaoke reproducing apparatus 14 is checked in S470.
[0060]
This is repeated until the end of playback is instructed by the karaoke playback device 14 (S480: NO). When the reproduction ends (S480: YES), the process proceeds to S490, the reproduction flag B1 is changed to “Done”, and the reproduction pointer B4 is moved to the next table in S500. Thereafter, the process returns to S410 again, and the reproduction of the next request is repeated.
[0061]
According to the broadcast center 10 of the present embodiment described above, when a request from a viewer is received, a new reservation is made at the position of the reception pointer B5 in the request code area B2 of the request execution table (FIG. 4). However, if the request code is the same as the previous request code, the request code is continuous. Therefore, when a predetermined replacement condition is satisfied, the previous request code and the previous request code are The request code does not continue by making a new reservation after replacing.
[0062]
One of the predetermined replacement conditions is determined by looking at the reproduction flag. That is, if one of the request codes to be exchanged is being reproduced, it cannot be moved, and therefore if the flag is being reproduced, the exchange process is not executed. The other is to judge by looking at the request code, that is, when the request code is replaced so that it does not continue considering mainly the request code to make a new reservation, the request code continues in another part by replacing it Since it is not preferable to do so, the replacement process is not executed in that case as well.
[0063]
Thereby, it is prohibited to continuously make new reservations for the same broadcast request, and the same broadcast information is prevented from being continuously broadcast. As a result, it is possible to eliminate the viewer's discomfort and to appropriately operate the broadcasting system.
The embodiments of the present invention have been described above according to the specific examples, but the present invention is not limited to such specific examples, and it goes without saying that various implementations can be made without departing from the gist of the invention.
[0064]
For example, in the above embodiment, as shown in FIGS. 12A and 12B, the request code one before the reception pointer B5 ((1) in the figure) is set two before (▲ 2 in the figure). Although the request code is replaced with the request code of ▼), the request code itself to be newly reserved may be moved.
[0065]
For example, as shown in FIG. 12C, the request code to be newly reserved is two times before the request code (2 in the figure) of the reception pointer B5 in the state of FIG. It may be inserted between the middle (3) request codes. Even in this case, it is possible to prevent a continuous request code. Since the request code for making a new reservation is the same as the request code of the previous one ((1) in the figure), the request code is one before the acceptance pointer B5 in the state of FIG. 12 (A) ((1) in the figure). Even if it is inserted between the previous request code and the request code of the previous two ((2) in the figure), the request code will be continuous, so it is meaningless. Therefore, it is necessary to insert the request code two times before (2 in the figure) or “before” the request code before it.
[0066]
In view of the above, the request code to be newly reserved and the previous request code can be considered as the object to be moved, and the method of moving is only insertion in the case of a request to be newly reserved, In the case of the previous request code, there are two possible cases: replacement and insertion. Therefore, a moving process based on each combination is conceivable.
[0067]
Then, when replacing or inserting, the object may be the closest in order, or may be further out of order. Also, first, determine whether replacement or insertion is possible for the closest one, and if it is not possible, determine whether replacement or insertion is possible for the one that is farther in order. You may do it. However, as also considered in the above-described embodiment, it is not preferable that the request code is continued in another part due to the replacement or insertion. In that case, it is better not to execute the replacement process.
[Brief description of the drawings]
FIG. 1 is a block diagram illustrating a schematic configuration of a broadcast center according to an embodiment.
FIG. 2 is an explanatory diagram showing a signal flow centered on a host computer.
FIG. 3 is a data structure diagram of a request database handled by a host computer.
FIG. 4 is a data structure diagram of a request execution table handled by a host computer.
FIG. 5 is a data structure diagram of a request reception buffer handled by a host computer.
FIG. 6 is a data structure diagram of a request log storage unit handled by a host computer.
FIG. 7 is a data structure diagram of a subscriber database handled by a host computer.
FIG. 8 is a flowchart showing a part of automatic request acceptance / reservation processing executed by a host computer.
FIG. 9 is a flowchart showing a part of an automatic request acceptance / reservation process executed by a host computer.
FIG. 10 is a flowchart showing a part of an automatic request acceptance / reservation process executed by a host computer.
FIG. 11 is a flowchart illustrating request reproduction processing executed by a host computer.
FIG. 12 is a data structure diagram of a request execution table showing a processing result when request code continuity is resolved.
[Explanation of symbols]
10 ... broadcast center 11 ... host computer
11a ... CPU 11b ... CPU memory
12 ... External storage device 13 ... Display device
14 ... Karaoke playback device 16 ... Broadcasting means
20 ... Voice response device 40 ... Public telephone line
50 ... Subscriber telephone

Claims (5)

Reservation order storage means for storing a plurality of broadcast requests individually made by viewers so that the broadcast is basically transmitted earlier as the request time is earlier,
In a broadcasting center with a request response function comprising broadcasting means for broadcasting information for broadcasting corresponding to corresponding broadcasting requests in accordance with the reservation order stored in the reservation order storage means,
The broadcast request of the new reservation candidate from the viewer determines whether the already stored reservation order is the same as the last broadcast request, and if it is not the same broadcast request, it makes a new reservation in the normal order. In the case of the same broadcast request, the broadcast request with the last reservation order is replaced with the broadcast request with the earlier reservation order or inserted before the new request, or the new reservation is made. A broadcast center, comprising: a new reservation control means for inserting a candidate broadcast request before a broadcast request whose reservation order is earlier than the last broadcast request and making a new reservation. The new reservation control means replaces the broadcast request for the new reservation candidate with the broadcast request for the last reservation order or the broadcast request for the new reservation candidate even if the broadcast request for the new reservation candidate is the same as the last broadcast request in the reservation order. When it is the same as the target broadcast request and when the reservation order at the time of replacement or insertion is the same as one of the preceding and subsequent broadcast requests, the replacement or insertion process is not executed. The broadcasting center according to claim 1. The broadcast request corresponding to the broadcast information during or after the broadcast by the broadcast means is reserved for the new reservation control means to be replaced with the last broadcast request or excluded from insertion targets. The broadcasting center according to claim 1 or 2. The broadcast request from the viewer is received by transmitting predetermined guidance voice information to the viewer via the telephone line and receiving the viewer identification information, broadcast request identification information, etc. as a response to the guidance voice information. The broadcast center according to any one of claims 1 to 3, wherein the broadcast center is configured. The broadcast request from the viewer is a request specifying a karaoke song, and the broadcast means is a television broadcast means capable of transmitting audio information and video information, and broadcast information broadcast by the broadcast means is The broadcast center according to claim 1, wherein the broadcast center includes a karaoke performance sound corresponding to the requested karaoke song and a video in which a lyrics telop is synthesized with a background video.

Images