CN1540966A - Method for handling conference telephone by programmable logic device - Google Patents
Method for handling conference telephone by programmable logic device Download PDFInfo
- Publication number
- CN1540966A CN1540966A CNA031284205A CN03128420A CN1540966A CN 1540966 A CN1540966 A CN 1540966A CN A031284205 A CNA031284205 A CN A031284205A CN 03128420 A CN03128420 A CN 03128420A CN 1540966 A CN1540966 A CN 1540966A
- Authority
- CN
- China
- Prior art keywords
- data
- mould
- counters
- time slot
- maximum
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Telephonic Communication Services (AREA)
Abstract
The method includes steps: at falling edge of clock signal, sending received input signal to receiving buffer area of programmable logic device, and carrying out serial-parallel conversion for input data and turning even bit over; reading in data from the said receiving buffer area, comparing time slot data in each frame in sequence, storing data of maximum and second largest value, signs and time slot the maximum located into programmable logic device; determining whether time slots in following frames is equal to time slot in the frame, which possesses maximum; if yes, sending data of maximum, signs the sending buffer of programmable logic device; if no. Sending second largest value, signs the sending buffer of programmable logic device; at rising edge of clock signal, carrying out serial-parallel conversion for data in sending buffer and turning even bit over, and sending out data.
Description
Technical field
The present invention relates to telephone communicating technology field, relate in particular to a kind of programmable logic device that utilizes and carry out the method that conference telephone is handled.
Background technology
Traditional conference model often is subject to the scheduling in space and cooperating of personnel, participant's conference participation of need going on business, compare with traditional meeting, conference telephone can make the user hold the meeting of many people concurrent connections in different places, use conference telephone to save fund, reduce the expenditure of travel charge, simultaneously as enterprise, that avoids that participant's dealing two places are produced is weariness from a tiring journey, and then has improved operating efficiency greatly.
Existing 64 tunnel conference telephone dedicated processes chip in the present switching system, can finish the processing of No. 64 conference telephones, because in actual the use, the participant of conference telephone is also few, as the official telephone etc. in the transmission, the actual like this disposal ability that there is no need to provide No. 64 conference telephones, and on veneer, use conference telephone dedicated processes chip to increase the veneer cost.
Summary of the invention
Technical problem to be solved by this invention is: overcome the high deficiency of cost that existing conference telephone need adopt special process chip to bring, provide a kind of and utilize the programmable logic device on the veneer to realize the method that conference telephone is handled, thereby reduce cost.
The present invention solves the problems of the technologies described above the technical scheme that is adopted to be:
This programmable logic device that utilizes carries out the method that conference telephone is handled, and it is characterized in that: it may further comprise the steps:
A, at the trailing edge of clock signal, successively input signal is received the receipts buffering area of programmable logic device, the input data are gone here and there and are changed, and carry out even bit flipping;
B, from described receipts buffering area, read in data, each time slot data in every frame are compared successively, data, the symbol of record maximum and second largest value in programmable logic device, and maximum place time slot, and when the subsequent frame time slot is identical with this maximum place time slot, described maximum value data, symbol are delivered to the buffering area of sending out of programmable logic device; When this subsequent frame time slot and this maximum place time slot are inequality, described second largest value data, symbol are delivered to send out a buffering area;
C, in rising edge of clock signal, the data of described buffering area carried out and go here and there conversion, export through behind the even bit flipping.
Among the described step B, there is not sign bit to participate in when each time slot data compares in every frame, a size than sound amplitude.
Described comparison step is as follows:
1) at first judges whether to be rising edge of clock signal, and judge whether frame head is effective, if frame head information is effective, then to mould 8 counters, mould 32 counter O resets;
2) judge whether mould 8 counters are 0, if 0, then from receive buffering area, to read in data, and highest order sign bit in this time slot is preserved separately, remaining 7 participate in relatively entering step 3); If be not 0, then directly enter step 3);
3) judge whether mould 8 counters are 1, if 1, then relatively these time slot data whether greater than current maximum, if then write down second largest value, peaked data, symbol and time slot thereof again, otherwise whether the value of judging this time slot is greater than current second largest value; If greater than current second largest value, then write down the data and the symbol thereof of second largest value again, otherwise enter step 4); If mould 8 counters are not 1, then directly enter step 4);
4) judge whether mould 32 counters are 31, and whether mould 8 counters are 2, if then carry out exchanges data when the 2nd bit of the 31st time slot, maximum, maximum timeslot number and the second largest value of present frame are delivered to the previous frame register, and with the register variable zero clearing of present frame; Otherwise, enter step 5);
5) judge whether mould 8 counters are 7,, judge then whether mould 32 counters equate with the time slot at former frame maximum place,, then the second largest value of previous frame is delivered to and sent out buffering area if equate if be 7; If unequal, then the maximum of previous frame delivered to and sent out buffering area; Then, mould 32 counters are added up, if accumulation result more than or equal to 32, then to mould 32 counter O resets, enters step 6); If mould 8 counters are not 7, then directly enter step 6);
6) mould 8 counters are added up, whether judge mould 8 counters more than or equal to 8, if, then zero clearing; Otherwise, enter step 1), compare again.
Among the described step C, carry out and to go here and there the step of conversion, even bit flipping as follows:
A, at first judge whether to be rising edge of clock signal, and if header signal effective, then with mould 8 counter O resets;
B, judge whether mould 8 counters are 0, if then the highest order symbol of Data transmission and dateout is in output signal; If not, then export all the other 7 bit data successively in output signal, and carry out even bit flipping;
C, mould 8 counters are added up, and whether judge mould 8 counters greater than 8, if greater than, step a is returned in then zero clearing.
Described programmable logic device is field programmable gate array (FPGA).
Beneficial effect of the present invention is: the present invention utilizes the programmable logic device on the veneer, directly realized the processing capacity of No. 32 conference telephones, because actual conference telephone participant is also few, 32 the road has been enough, therefore can satisfy general user's demand, like this, do not need to adopt special conference telephone process chip, reduced the veneer cost.And when each time slot data compared in every frame, sign bit did not participate in comparison, and the amplitude of sound has relatively only reduced the noise of phone.
Description of drawings
Fig. 1 is the sequential chart of the 0th time slot signal and 2M clock signal and header signal;
Fig. 2 is data-signal input process chart;
Fig. 3 is No. 32 conference telephone speech data comparison process flow charts;
Fig. 4 is data-signal output process chart.
Embodiment
With embodiment the present invention is described in further detail with reference to the accompanying drawings below:
On the general veneer field programmable gate array (FPGA) can be arranged all, the present invention adopts VHDL (hardware description language) to finish the logical process that No. 32 phones carry out conference telephone in FPGA inside.Like this, can utilize FPGA on the veneer directly to realize the processing of conference telephone, not need to adopt special process chip, can reduce cost.
During meeting view phone, always a sound maximum arranged in the group time big with a sound, the principle of conference telephone is exactly the sound that the people of enable voice maximum hears sound time adult, other people hears the adult's of sound sound.
The present invention utilizes FPGA to finish No. 32 conference telephone processing capacities, is illustrated in figure 1 as the sequential chart of the 0th time slot signal and 2M clock signal and header signal, wherein:
Clk2m: duty ratio is 50% 2M clock input signal;
The header signal of fs2m:2M data has 8000 frames 1 second;
The HWin:2M data input signal, corresponding 32 time slots in each frame, each time slot is 8, the data in the time slot satisfy the coding requirement of PCM (pulse code modulation); The pcm encoder data of No. 32 phones that 32 time slots are promptly corresponding;
The HWout:2M data output signal, the same HWin of the form of data, the data of output correspond to the content that 32 tunnel telephone subscribers should hear.
The same clock input signal clk2m of sending and receiving The data receives data and receives at the trailing edge of clock, send out data and send out at the rising edge of clock, when sending out data a high position preceding, low level after.
One, at first the input data is gone here and there and changed, and carry out even bit flipping;
As shown in Figure 2, when clock signal during at trailing edge, successively the data of input signal Hwin are received in the receipts buffering area of FPGA, because the coding rule of PCM is to adopt 0,101 0101 to represent 0,000 0000, be to overturn in the antithesis position, therefore, when receiving, the data in each time slot are carried out even bit flipping, the speech data through pcm encoder is recovered.Realized string and conversion during reception, 8 Bits Serial data in each time slot are converted to parallel data, so as next step to each frame in the data of each time slot compare.
Two, carry out 32 road speech datas relatively, and latch maximum, second largest value and peaked timeslot number;
32 road speech datas are compared, promptly the data of 32 time slots in each frame are carried out the comparison of unsigned number, because the size of speech is only relevant with the amplitude of data, and it is irrelevant with the symbol of data, therefore before relatively with each time slot in data preservation separately in FPGA of high sign bit, all the other 7 bit data are compared, when data are exported, again the symbol of data is handed on.The maximum that compares, second largest value and peaked timeslot number carry out record in the register of FPGA, maximum is sent to buffering area at the time slot identical with this maximum place timeslot number of next frame, second largest value is sent to buffering area at other time slot of next frame, mail in the output signal by sending out buffering area then, the people of sound maximum hears sound time adult's sound like this, other people hears the adult's of sound sound, has just realized 32 tunnel videoconferences.
As shown in Figure 3, it is as follows 32 road speech datas to be compared step:
1, at first judges whether rising edge of clock signal, and judge whether frame head is effective, if frame head information is effective, then to mould 8 counters, mould 32 counter O resets into 2M.
2, judge whether mould 8 counters are 0, if 0, then from receive buffering area, to read in data, and highest order sign bit in this time slot is preserved separately in FPGA, remaining 7 participate in relatively carrying out next step; If be not 0, then directly carry out next step.
3, judge whether mould 8 counters are 1, if 1, then relatively these time slot data whether greater than current maximum, if then write down second largest value, peaked data, symbol and time slot thereof again, otherwise whether the value of judging this time slot is greater than current second largest value; If greater than current second largest value, then write down the data and the symbol thereof of second largest value again, otherwise carry out next step; If mould 8 counters are not 1, then directly carry out next step.
4, judge whether mould 32 counters are 31, and whether mould 8 counters are 2, if then carry out exchanges data when the 2nd bit of the 31st time slot, maximum, maximum timeslot number and the second largest value of present frame are delivered to the previous frame register, and with the register variable zero clearing of present frame; Otherwise, carry out next step.
5, judge whether mould 8 counters are 7,, judge then whether mould 32 counters equate with the time slot at former frame maximum place,, then the second largest value of previous frame is delivered to and sent out buffering area if equate if be 7; If unequal, then the maximum of previous frame delivered to and sent out buffering area.Then, mould 32 counters are added up, if accumulation result more than or equal to 32, then to mould 32 counter O resets, carries out next step;
If mould 8 counters are not 7, then directly carry out next step.
6, mould 8 counters are added up, whether judge mould 8 counters more than or equal to 8, if, then zero clearing.Otherwise, carried out for the 1st step, compare again.
From above-mentioned flow process as can be seen, mould 8 counters begin to add up by 0, at mould 8 counters is 0 o'clock, from FPGA receipts buffering area, receive data, when mould 8 counters are 1, these data and current maximum and second largest value are compared respectively, and write down new maximum and second largest value, be added at 7 o'clock at mould 8 counters, judge, the maximum or the second largest value that send former frame arrive a buffering area, carry out voice output, and mould 32 counters are added up, data to 32 time slots compare successively, when mould 32 counters are added to 31, and mould 8 counters are 2 o'clock, the data of this frame receive and relatively finish, therefore, can carry out exchanges data later at the 2nd bit of the 31st time slot, maximum with present frame, information such as second largest value are delivered to the previous frame register, and to the zero clearing of present frame register variable, like this, just can be in the corresponding time slot of next frame maximum with the previous frame register, information such as second largest value send to buffering area, and prepare record next frame maximum in the present frame register, the information of second largest value.
Three, will send out the data that will export in the buffering area and carry out and go here and there conversion, and export through behind the even bit flipping, the data of output are the speech data that No. 32 phones should be heard;
As shown in Figure 3, when carrying out data output, step is as follows:
1, at first judge whether to be rising edge of clock signal, and if header signal effective, then mould 8 counter O resets.
2, judge whether mould 8 counters are 0, if then the highest order symbol of Data transmission and dateout is in output signal Hwout; If not, then export all the other 7 bit data successively in output signal Hwout, carry out even bit flipping simultaneously.
3, mould 8 counters are added up, and whether judge mould 8 counters greater than 8, if greater than, then zero clearing returned for the 1st step.
Data of the present invention realize even bit flipping when the realization string also, is also gone here and there conversion, directly realized the processing capacity of No. 32 conference telephones in FPGA inside.
Claims (5)
1, a kind of programmable logic device that utilizes carries out the method that conference telephone is handled, and it is characterized in that: it may further comprise the steps:
A, at the trailing edge of clock signal, successively input signal is received the receipts buffering area of programmable logic device, the input data are gone here and there and are changed, and carry out even bit flipping;
B, from described receipts buffering area, read in data, each time slot data in every frame are compared successively, data, the symbol of record maximum and second largest value in programmable logic device, and maximum place time slot, and when the subsequent frame time slot is identical with this maximum place time slot, described maximum value data, symbol are delivered to the buffering area of sending out of programmable logic device; When this subsequent frame time slot and this maximum place time slot are inequality, described second largest value data, symbol are delivered to send out a buffering area;
C, in rising edge of clock signal, the data of described buffering area carried out and go here and there conversion, export through behind the even bit flipping.
2, the programmable logic device that utilizes according to claim 1 carries out the method that conference telephone is handled, and it is characterized in that: among the described step B, do not have sign bit to participate in when each time slot data compares in every frame, a size than sound amplitude.
3, the programmable logic device that utilizes according to claim 1 and 2 carries out the method that conference telephone is handled, and it is characterized in that: described comparison step is as follows:
1) at first judges whether to be rising edge of clock signal, and judge whether frame head is effective, if frame head information is effective, then to mould 8 counters, mould 32 counter O resets;
2) judge whether mould 8 counters are 0, if 0, then from receive buffering area, to read in data, and highest order sign bit in this time slot is preserved separately, remaining 7 participate in relatively entering step 3); If be not 0, then directly enter step 3);
3) judge whether mould 8 counters are 1, if 1, then relatively these time slot data whether greater than current maximum, if then write down second largest value, peaked data, symbol and time slot thereof again, otherwise whether the value of judging this time slot is greater than current second largest value; If greater than current second largest value, then write down the data and the symbol thereof of second largest value again, otherwise enter step 4); If mould 8 counters are not 1, then directly enter step 4);
4) judge whether mould 32 counters are 31, and whether mould 8 counters are 2, if then carry out exchanges data when the 2nd bit of the 31st time slot, maximum, maximum timeslot number and the second largest value of present frame are delivered to the previous frame register, and with the register variable zero clearing of present frame; Otherwise, enter step 5);
5) judge whether mould 8 counters are 7,, judge then whether mould 32 counters equate with the time slot at former frame maximum place,, then the second largest value of previous frame is delivered to and sent out buffering area if equate if be 7; If unequal, then the maximum of previous frame delivered to and sent out buffering area; Then, mould 32 counters are added up, if accumulation result more than or equal to 32, then to mould 32 counter O resets, enters step 6); If mould 8 counters are not 7, then directly enter step 6);
6) mould 8 counters are added up, whether judge mould 8 counters more than or equal to 8, if, then zero clearing; Otherwise, enter step 1), compare again.
4, the programmable logic device that utilizes according to claim 1 carries out the method that conference telephone is handled, and it is characterized in that: among the described step C, carry out and to go here and there the step of conversion, even bit flipping as follows:
A, at first judge whether to be rising edge of clock signal, and if header signal effective, then with mould 8 counter O resets;
B, judge whether mould 8 counters are 0, if then the highest order symbol of Data transmission and dateout is in output signal; If not, then export all the other 7 bit data successively in output signal, and carry out even bit flipping;
C, mould 8 counters are added up, and whether judge mould 8 counters greater than 8, if greater than, step a is returned in then zero clearing.
5, the programmable logic device that utilizes according to claim 3 carries out the method that conference telephone is handled, and it is characterized in that: described programmable logic device is field programmable gate array (FPGA).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031284205A CN100420257C (en) | 2003-04-23 | 2003-04-23 | Method for handling conference telephone by programmable logic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031284205A CN100420257C (en) | 2003-04-23 | 2003-04-23 | Method for handling conference telephone by programmable logic device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1540966A true CN1540966A (en) | 2004-10-27 |
| CN100420257C CN100420257C (en) | 2008-09-17 |
Family
ID=34322155
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031284205A Expired - Fee Related CN100420257C (en) | 2003-04-23 | 2003-04-23 | Method for handling conference telephone by programmable logic device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100420257C (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827290A (en) * | 2010-03-15 | 2010-09-08 | 福建鑫诺通讯技术有限公司 | PCM time slot interchange method capable of directly carrying out voice interchange with voice codec |
| CN107070413A (en) * | 2017-01-15 | 2017-08-18 | 上海与德信息技术有限公司 | The method of adjustment and device of power amplifier input voltage |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10187269A (en) * | 1996-12-25 | 1998-07-14 | Oki Electric Ind Co Ltd | Telephone conference device |
| CN1120610C (en) * | 1999-04-26 | 2003-09-03 | 华为技术有限公司 | Control circuit and method for telephones of telephone meeting |
-
2003
- 2003-04-23 CN CNB031284205A patent/CN100420257C/en not_active Expired - Fee Related
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827290A (en) * | 2010-03-15 | 2010-09-08 | 福建鑫诺通讯技术有限公司 | PCM time slot interchange method capable of directly carrying out voice interchange with voice codec |
| CN101827290B (en) * | 2010-03-15 | 2013-05-01 | 福建鑫诺通讯技术有限公司 | PCM time slot interchange method capable of directly carrying out voice interchange with voice codec |
| CN107070413A (en) * | 2017-01-15 | 2017-08-18 | 上海与德信息技术有限公司 | The method of adjustment and device of power amplifier input voltage |
| CN107070413B (en) * | 2017-01-15 | 2020-12-18 | 武汉嘉瑞科技有限公司 | Method and device for adjusting input voltage of power amplifier |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100420257C (en) | 2008-09-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1099215C (en) | Minicell segmentation and reassembly | |
| CN1287718A (en) | Interleaving / deinterleaving device and method for communication system | |
| CN1279759C (en) | System for implementing cascade connection of line and its method | |
| CN1790968A (en) | Method and apparatus of two stage scaling and quantization for coded communication systems | |
| CN1120652C (en) | Zn X n multiplexing switch | |
| CN1540966A (en) | Method for handling conference telephone by programmable logic device | |
| CN1180576C (en) | Information-element-flow contro in exchanger of square-grid expanded asynchronous transmission mode | |
| CN103108185B (en) | Meet bit-plane coding hardware configuration and the method for CCSDS standard | |
| CN1094011C (en) | Circuit for converting frame data | |
| CN1120610C (en) | Control circuit and method for telephones of telephone meeting | |
| CN1665252A (en) | Telephone call recording device and telephone call recording system | |
| CN1204764C (en) | Processing method for implementing multiple voice services | |
| CN1549500A (en) | Apparatus and method for realizing channel queue equitable dispatching based on multi-channel port | |
| CN1255962C (en) | Optimum wave clipping method | |
| CN1298183C (en) | Method for realizing speech buffer storage in digital cluster system | |
| CN1464707A (en) | Multi-communication system of telephone internet | |
| CN1905425A (en) | Method of light plate-to-light plate time slot time division optimizing configaration of SDH system | |
| CN1518312A (en) | Method of multi-channel data processing | |
| CN100340094C (en) | Telephone conference boards | |
| CN1691568A (en) | Method and apparatus for data cross in synchronous data transmission network | |
| CN1668025A (en) | Data, voice and video merged multi-code rate coding-decoding and isochronous transmission method thereof | |
| CN2746677Y (en) | Telephone conference board | |
| CN2621378Y (en) | Multimedia coding-decoding transmission device | |
| CN1585332A (en) | Speech and data transmission in same frame | |
| CN1218535C (en) | Multifunctional resource management system of speech exchanger |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080917 Termination date: 20160423 |