JPS63253757A - Talkie write/readout control method - Google Patents

Abstract

PURPOSE:To eliminate need for the control of read address depending on the length of talkie by writing consecutively for N-time from the 0 address of a memory a unit pattern having an address number of 1/N (N is a natural number) of all address numbers of the memory, reading all addresses from the 0 address of the memory till the final address and sending the result as the address repetitively. CONSTITUTION:Unit patterns 20, 30 comprising non-talking patterns 22, 32 within the maximum allowable silent time and talkie contents 21, 31 of the digital pattern and having 1/N (N is a natural number) of all address numbers of the memory are written consecutively by N times. The readout address corresponding to all addresses from the 0 address till the final address is sent in the memory and the talkie content of the digital pattern and the non-talking pattern within the maximum allowable silent time are read repetitively from the memory. Thus, the control of readout address is not required regardless of the talkie content.

Description

DETAILED DESCRIPTION OF THE INVENTION (Industrial Application Field) The present invention relates to a method for storing digitally patterned talkie contents in a memory 81 and reading out the talkie contents from the memory according to a predetermined readout address.

(Prior Art) Conventionally, in digital exchange systems, talkies for notifications and guidance are converted into digital patterns, written (stored) in a memory, read out the contents of the memory by giving a predetermined read address, and then converted into digital patterns. is sent to a digital-to-analog conversion circuit, a PCM line, etc. (hereinafter referred to as the line side).

In general, the contents of a digital pattern are sequentially written to consecutive addresses in memory, and address values in memory are usually represented by n-bit binary codes.
The count value of an n-bit binary counter that counts a predetermined clock is often used as the address value.

(Problem to be Solved by the Invention) By the way, since the time length differs depending on the type of talkie, the number of digital patterns is not necessarily equal to the total number of addresses in the memory whose address value is represented by an n-bit binary code, that is, 2 , and a so-called empty portion may be created in which no digital pattern is written in the memory.

If the empty part is sufficiently small that it will not be unnatural to convert it into a silent state and play it back (hereinafter referred to as the maximum allowable silent time), for example, 2 seconds or less, there is a well-known problem. By writing a call pattern, it is possible to treat the memory in the same way as a memory in which the talk contents of the digital pattern are written to all addresses in the memory, but if there is a large empty area, even if a no-call pattern is written, This is also undesirable because an unnaturally long period of silence will occur in the reproduced talkie.

Therefore, it is possible to identify that the output value of the counter has reached the end address of the talkie contents in the memory determined at the time of writing or the final address of the memory, and to not output the address value corresponding to the empty part. There is a problem in that control must be performed to reset the counter or set an initial value corresponding to the start address of the talkie contents in the memory determined at the time of writing.

One object of the present invention is to provide a talkie write/read control method that eliminates the above-mentioned problems and makes it unnecessary to control read addresses regardless of the length of talkie contents.

(Means for Solving the Problems) In order to solve the above-mentioned problems, the present invention provides a talkie write/read control method in which digital patterned talkie contents are written in a memory and the talkie contents are read out according to a predetermined read address. , a unit pattern consisting of the talk content of the digital pattern and a no-call pattern within the maximum allowable silent time, and having the number of addresses that is 1/N (N is a natural number) of the total number of addresses in the memory, is consecutively started from the O address in the memory. All addresses from the O address to the final address of the memory are read out N times and sent out repeatedly as read addresses.

(Function) According to the present invention, read addresses corresponding to all addresses from the O address to the final address of the memory are repeatedly sent to the memory, and the talk content of the digital pattern and the no-call pattern within the maximum allowable silent time are sent to the memory repeatedly. is repeatedly read out from the memory.

(Embodiment) FIG. 1 shows an embodiment of a talkie circuit to which the talkie write/read control method of the present invention is applied.
1-2. ...1- is a memory, 2.3 is a counter, 4 is a selector, and 5 is a register.

The memories 1-1 to 1- each have a capacity .omega. of 2 words and 1 bit, and the talk contents of the digital pattern are written in the manner described below.

FIG. 2 shows how the talkie contents are allocated in the memories 1-1 to 1-k.

First, as shown in FIG. 2(a), the entire memory is divided into an area of 2 addresses (m<n) corresponding to the maximum allowable silent time or the longest time below (hereinafter, this will be referred to as a unit area). ) Virtually divided into 10. At this time, the entire memory is divided into two unit areas 10.

−Represents the talk content! If the total number p1 of digital patterns of bits is 2 or less, that is, if the contents of the - talk fit within the unit area 10, the pattern shown in FIG. 2(b)
As shown in the figure, the talk content 21 (the shaded part in the figure) and the no-call pattern 2 with the number of patterns (2”-pl)
2 to pattern (hereinafter referred to as unit pattern)
20, and write the unit pattern 20 in the memory from address O to the final address.

The number of addresses of the unit pattern 20 is the same as the number of addresses 2 of the unit area 10, which is 1/2 of the number of addresses of the entire memory, and two unit patterns 20 are written in the entire memory. In addition, 2
When and Pl are equal, the no-call pattern 22 within the unit pattern 20 disappears.

On the other hand, if the total number p2 of 1-bit digital patterns representing the talk content of - is larger than 2, that is, if the talk content of - does not fit within the unit area 10 of -,
As shown in FIG. 2(C), the talk content 31 (hatched area in the figure) written across X (four in the illustrated example) unit areas 10, and the X unit areas The number of patterns (2-(p2- (x-1)
・2)] pattern from no-call pattern 32 (hereinafter referred to as
This is called a unit pattern. ) 30 and writes the unit pattern 30 from the O address to the final address in the memory.

Here, the unit area 1 constituting the unit pattern 30 is
The number of 0's
In this case, 2n-(I'l+r) unit patterns 30 are written in the entire memory.

Note that the length of the talk content 31 is 2r unit areas 10.
If the length is not just right, you can adjust the speed of the talkie voice a little faster or slower. Also, 2111 and (o2- (x-1)・2
”), the no-call pattern 32 within the unit pattern 30 disappears.

In this way, each memory 1-1 to 1-k is composed of digital pattern talk content and a no-call pattern within the maximum allowable silent time, and is 1/N of the total number of addresses in the memory (however, as shown in FIG. In the example, N is 2 or 2°−(
mar) and a natural number -m. ) A unit pattern having the number of addresses N@ is written.

The counter 2 is a well-known n-bit binary counter that counts clocks of a predetermined period, for example, 125 μsec, supplied from a clock generator (not shown), and
The address values corresponding to all addresses from the 0 address to the final address (2) in ~1- are stored in each memory 1-1 to 1-1.
−k repeatedly. The counter 3 is a binary counter, and is synchronized with the clock for the counter 2 and counts a clock having a frequency twice that of the clock, that is, when the counter 2 is 1
While stepping, it advances and its count value is repeatedly sent to the selector 4.

Selector 4 receives output values from memories 1-1 to 1-,
According to the output value of the counter 3, the output values of the memories 1-1 to 1- are switched to the register 5 and sent. register 5
temporarily holds the output value of selector 4 and sends it to the line side.

According to the above configuration, from the O address to the final address in each memory 1-1 to 1-, the talk content of the digital pattern or the no-call pattern within the maximum allowable silent time,
All memory addresses 1-1 to 1 are written, and each memory 1-1 to 1 is always written according to the value of the memory address supplied from counter 2.
A digital pattern or a no-call pattern is read out by -, and these are sequentially selected and output by the selector 4 according to the value output from the counter 3, and are outputted to the register.

5, and is time-division multiplexed and sent to the line side.

(Effects of the Invention) As explained above, according to the present invention, the unit is composed of the talk content of the digital pattern and the no-call pattern within the maximum allowable silent time, and has the number of addresses that is 1/N of the total number of addresses in the memory. The pattern is written N times consecutively starting from the O address of the memory, and all addresses from the O address to the final address of the memory are read out and sent repeatedly as read addresses. By simply sending out the readout address corresponding to the address repeatedly, the talk content of the digital pattern and the no-call pattern within the maximum allowable silent time are read out repeatedly.Therefore, there is no need to control the readout address depending on the length of the talk, and there is no need to control the readout address by the length of the talk. There are advantages such as being able to read different kinds of talkies using the read address output from the same counter or the like.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an embodiment of a talkie circuit to which talkie write/read control of the present invention is applied, and FIG. 2 is an explanatory diagram showing how talkie contents are allocated to memory. 1-1 to 1-k...memory, 2,3...counter,
4...Selector, 5...Register, 20.30...
・Unit pattern, 21.31... Talking content, 22.
32... No call pattern. Patent applicant Oki Electric Industry Co., Ltd. Nippon Telegraph and Telephone Corporation

Claims (1)

[Scope of Claims] In a talk writing/reading control method in which digital patterned talk content is written in a memory and the talk content is read out according to a predetermined read address, A unit pattern consisting of a no-call pattern and having the number of addresses that is 1/N (N is a natural number) of the total number of addresses in the memory is written N times consecutively from the 0 address in the memory, and from the 0 address in the memory to the final address. A talkie write/read control method characterized in that all addresses are repeatedly sent as read addresses.